LTS Termination Proof

by T2Cert

Input

Integer Transition System

Initial Location: 5

Transitions: (pre-variables and post-variables)

0	0	1:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ − x4 ≤ 0 ∧ 2 − arg2 ≤ 0 ∧ − arg1P ≤ 0 ∧ 1 + arg2P − x5 ≤ 0 ∧ − x5 ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − arg6P + arg6 ≤ 0 ∧ arg6P − arg6 ≤ 0 ∧ − arg7P + arg7 ≤ 0 ∧ arg7P − arg7 ≤ 0 ∧ − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0
0	1	1:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ − x10 ≤ 0 ∧ 2 − arg2 ≤ 0 ∧ arg2P ≤ 0 ∧ − arg1P ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − arg6P + arg6 ≤ 0 ∧ arg6P − arg6 ≤ 0 ∧ − arg7P + arg7 ≤ 0 ∧ arg7P − arg7 ≤ 0 ∧ − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0
1	2	2:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 − arg2 ≤ 0 ∧ − arg2P ≤ 0 ∧ arg2P ≤ 0 ∧ arg2 − arg3P ≤ 0 ∧ − arg2 + arg3P ≤ 0 ∧ arg2 − arg4P ≤ 0 ∧ − arg2 + arg4P ≤ 0 ∧ − arg5P ≤ 0 ∧ arg5P ≤ 0 ∧ arg2 − arg6P ≤ 0 ∧ − arg2 + arg6P ≤ 0 ∧ arg2 − arg7P ≤ 0 ∧ − arg2 + arg7P ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − arg6P + arg6 ≤ 0 ∧ arg6P − arg6 ≤ 0 ∧ − arg7P + arg7 ≤ 0 ∧ arg7P − arg7 ≤ 0 ∧ − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0
2	3	3:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 − x48 ≤ 0 ∧ 1 − arg4 ≤ 0 ∧ 1 − arg5 ≤ 0 ∧ − arg6 ≤ 0 ∧ 1 − arg2 + arg6 ≤ 0 ∧ 1 + arg6 − x49 ≤ 0 ∧ 1 − arg3 + arg6 ≤ 0 ∧ 1 + arg7 − x48 ≤ 0 ∧ − arg7 ≤ 0 ∧ 1 − arg5 + arg7 ≤ 0 ∧ 1 − arg4 + x50 ≤ 0 ∧ 1 − arg4 + arg7 ≤ 0 ∧ arg1 − 2⋅x51 ≤ 0 ∧ − arg1 + 2⋅x51 ≤ 0 ∧ 1 − x48 + x52 ≤ 0 ∧ 1 − x49 ≤ 0 ∧ 1 − arg2 ≤ 0 ∧ − arg1 + x53 ≤ 0 ∧ 1 − arg5 + x54 ≤ 0 ∧ − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0 ∧ − arg7P + arg7P ≤ 0 ∧ arg7P − arg7P ≤ 0 ∧ − arg7 + arg7 ≤ 0 ∧ arg7 − arg7 ≤ 0 ∧ − arg6P + arg6P ≤ 0 ∧ arg6P − arg6P ≤ 0 ∧ − arg6 + arg6 ≤ 0 ∧ arg6 − arg6 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0
3	4	2:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 − x67 ≤ 0 ∧ 1 − arg4 ≤ 0 ∧ 1 − arg5 ≤ 0 ∧ − arg6 ≤ 0 ∧ 1 − arg2 + arg6 ≤ 0 ∧ 1 + arg6 − x68 ≤ 0 ∧ 1 − arg3 + arg6 ≤ 0 ∧ 1 + arg7 − x67 ≤ 0 ∧ − arg7 ≤ 0 ∧ 1 − arg5 + arg7 ≤ 0 ∧ 1 + arg4P − arg4 ≤ 0 ∧ 1 − arg4 + arg7 ≤ 0 ∧ arg1 − 2⋅x69 ≤ 0 ∧ − arg1 + 2⋅x69 ≤ 0 ∧ 1 + arg7P − x67 ≤ 0 ∧ 1 − x68 ≤ 0 ∧ 1 − arg2 ≤ 0 ∧ 1 + arg5P − arg5 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg1 + 2⋅x69 ≤ 0 ∧ −1 + arg1 − 2⋅x69 ≤ 0 ∧ −1 − 2⋅arg1P + arg1 ≤ 0 ∧ 2⋅arg1P − arg1 ≤ 0 ∧ arg2 − arg6P ≤ 0 ∧ − arg2 + arg6P ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − arg6P + arg6 ≤ 0 ∧ arg6P − arg6 ≤ 0 ∧ − arg7P + arg7 ≤ 0 ∧ arg7P − arg7 ≤ 0 ∧ − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0
2	5	3:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ − arg6 ≤ 0 ∧ 1 − arg3 ≤ 0 ∧ 1 − arg2 + arg6 ≤ 0 ∧ 1 + arg6 − x77 ≤ 0 ∧ 1 − arg3 + arg6 ≤ 0 ∧ 1 + arg7 − x77 ≤ 0 ∧ − arg7 ≤ 0 ∧ 1 − arg5 + arg7 ≤ 0 ∧ 1 − arg3 + arg7 ≤ 0 ∧ arg1 − 2⋅x78 ≤ 0 ∧ − arg1 + 2⋅x78 ≤ 0 ∧ 1 − arg3 + x79 ≤ 0 ∧ 1 − x77 + x80 ≤ 0 ∧ − x77 ≤ 0 ∧ − arg1 + x81 ≤ 0 ∧ arg3 − arg4 ≤ 0 ∧ − arg3 + arg4 ≤ 0 ∧ arg3 − arg4P ≤ 0 ∧ − arg3 + arg4P ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0 ∧ − arg7P + arg7P ≤ 0 ∧ arg7P − arg7P ≤ 0 ∧ − arg7 + arg7 ≤ 0 ∧ arg7 − arg7 ≤ 0 ∧ − arg6P + arg6P ≤ 0 ∧ arg6P − arg6P ≤ 0 ∧ − arg6 + arg6 ≤ 0 ∧ arg6 − arg6 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0
3	6	2:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ − arg6 ≤ 0 ∧ 1 − arg3 ≤ 0 ∧ 1 − arg2 + arg6 ≤ 0 ∧ 1 + arg6 − x93 ≤ 0 ∧ 1 − arg3 + arg6 ≤ 0 ∧ 1 + arg7 − x93 ≤ 0 ∧ − arg7 ≤ 0 ∧ 1 − arg5 + arg7 ≤ 0 ∧ 1 − arg3 + arg7 ≤ 0 ∧ arg1 − 2⋅x94 ≤ 0 ∧ − arg1 + 2⋅x94 ≤ 0 ∧ 1 − arg3 + arg4P ≤ 0 ∧ 1 + arg5P − x93 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − x93 ≤ 0 ∧ − arg1 + 2⋅x94 ≤ 0 ∧ −1 + arg1 − 2⋅x94 ≤ 0 ∧ −1 − 2⋅arg1P + arg1 ≤ 0 ∧ 2⋅arg1P − arg1 ≤ 0 ∧ arg3 − arg4 ≤ 0 ∧ − arg3 + arg4 ≤ 0 ∧ 1 − arg2P ≤ 0 ∧ −1 + arg2P ≤ 0 ∧ − arg6P ≤ 0 ∧ arg6P ≤ 0 ∧ arg5P − arg7P ≤ 0 ∧ − arg5P + arg7P ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − arg6P + arg6 ≤ 0 ∧ arg6P − arg6 ≤ 0 ∧ − arg7P + arg7 ≤ 0 ∧ arg7P − arg7 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0
0	7	4:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ − x41 ≤ 0 ∧ 2 − arg2 ≤ 0 ∧ − x40 ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ −1 − arg1P + x40 ≤ 0 ∧ 1 + arg1P − x40 ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − arg6P + arg6 ≤ 0 ∧ arg6P − arg6 ≤ 0 ∧ − arg7P + arg7 ≤ 0 ∧ arg7P − arg7 ≤ 0 ∧ − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0
4	8	4:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ −1 − arg1P + arg1 ≤ 0 ∧ 1 + arg1P − arg1 ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − arg6P + arg6 ≤ 0 ∧ arg6P − arg6 ≤ 0 ∧ − arg7P + arg7 ≤ 0 ∧ arg7P − arg7 ≤ 0 ∧ − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0
5	9	0:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − arg6P + arg6 ≤ 0 ∧ arg6P − arg6 ≤ 0 ∧ − arg7P + arg7 ≤ 0 ∧ arg7P − arg7 ≤ 0 ∧ − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0

Proof

1 Invariant Updates

The following invariants are asserted.

0:	TRUE
1:	− arg1P ≤ 0 ∧ − arg1 ≤ 0
2:	TRUE
3:	− arg6 ≤ 0 ∧ − arg7 ≤ 0
4:	− x41 ≤ 0 ∧ − x40 ≤ 0
5:	TRUE

The invariants are proved as follows.

IMPACT Invariant Proof

nodes (location) invariant:

0	(0)	TRUE
1	(1)	− arg1P ≤ 0 ∧ − arg1 ≤ 0
2	(2)	TRUE
3	(3)	− arg6 ≤ 0 ∧ − arg7 ≤ 0
4	(4)	− x41 ≤ 0 ∧ − x40 ≤ 0
5	(5)	TRUE

initial node: 5
cover edges:
transition edges:

0 0 1

0 1 1

0 7 4

1 2 2

2 3 3

2 5 3

3 4 2

3 6 2

4 8 4

5 9 0

2 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:

2	10	2:	− x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0 ∧ − arg7P + arg7P ≤ 0 ∧ arg7P − arg7P ≤ 0 ∧ − arg7 + arg7 ≤ 0 ∧ arg7 − arg7 ≤ 0 ∧ − arg6P + arg6P ≤ 0 ∧ arg6P − arg6P ≤ 0 ∧ − arg6 + arg6 ≤ 0 ∧ arg6 − arg6 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0
4	17	4:	− x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0 ∧ − arg7P + arg7P ≤ 0 ∧ arg7P − arg7P ≤ 0 ∧ − arg7 + arg7 ≤ 0 ∧ arg7 − arg7 ≤ 0 ∧ − arg6P + arg6P ≤ 0 ∧ arg6P − arg6P ≤ 0 ∧ − arg6 + arg6 ≤ 0 ∧ arg6 − arg6 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

and for every transition t, a duplicate t is considered.

3 Transition Removal

We remove transitions 0, 1, 2, 7, 9 using the following ranking functions, which are bounded by −17.

5:	0
0:	0
1:	0
2:	0
3:	0
4:	0
5:	−6
0:	−7
1:	−8
2:	−9
3:	−9
2_var_snapshot:	−9
2*:	−9
4:	−12
4_var_snapshot:	−12
4*:	−12

Hints:

11	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
18	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
3	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
4	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
5	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
6	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
8	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
0	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
1	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
2	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
7	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
9	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]

4 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

2* 13 2: − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0 ∧ − arg7P + arg7P ≤ 0 ∧ arg7P − arg7P ≤ 0 ∧ − arg7 + arg7 ≤ 0 ∧ arg7 − arg7 ≤ 0 ∧ − arg6P + arg6P ≤ 0 ∧ arg6P − arg6P ≤ 0 ∧ − arg6 + arg6 ≤ 0 ∧ arg6 − arg6 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

5 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

2 11 2_var_snapshot: − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0 ∧ − arg7P + arg7P ≤ 0 ∧ arg7P − arg7P ≤ 0 ∧ − arg7 + arg7 ≤ 0 ∧ arg7 − arg7 ≤ 0 ∧ − arg6P + arg6P ≤ 0 ∧ arg6P − arg6P ≤ 0 ∧ − arg6 + arg6 ≤ 0 ∧ arg6 − arg6 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

6 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

4* 20 4: − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0 ∧ − arg7P + arg7P ≤ 0 ∧ arg7P − arg7P ≤ 0 ∧ − arg7 + arg7 ≤ 0 ∧ arg7 − arg7 ≤ 0 ∧ − arg6P + arg6P ≤ 0 ∧ arg6P − arg6P ≤ 0 ∧ − arg6 + arg6 ≤ 0 ∧ arg6 − arg6 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

7 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

4 18 4_var_snapshot: − x94 + x94 ≤ 0 ∧ x94 − x94 ≤ 0 ∧ − x93 + x93 ≤ 0 ∧ x93 − x93 ≤ 0 ∧ − x81 + x81 ≤ 0 ∧ x81 − x81 ≤ 0 ∧ − x80 + x80 ≤ 0 ∧ x80 − x80 ≤ 0 ∧ − x79 + x79 ≤ 0 ∧ x79 − x79 ≤ 0 ∧ − x78 + x78 ≤ 0 ∧ x78 − x78 ≤ 0 ∧ − x77 + x77 ≤ 0 ∧ x77 − x77 ≤ 0 ∧ − x69 + x69 ≤ 0 ∧ x69 − x69 ≤ 0 ∧ − x68 + x68 ≤ 0 ∧ x68 − x68 ≤ 0 ∧ − x67 + x67 ≤ 0 ∧ x67 − x67 ≤ 0 ∧ − x54 + x54 ≤ 0 ∧ x54 − x54 ≤ 0 ∧ − x53 + x53 ≤ 0 ∧ x53 − x53 ≤ 0 ∧ − x52 + x52 ≤ 0 ∧ x52 − x52 ≤ 0 ∧ − x51 + x51 ≤ 0 ∧ x51 − x51 ≤ 0 ∧ − x50 + x50 ≤ 0 ∧ x50 − x50 ≤ 0 ∧ − x5 + x5 ≤ 0 ∧ x5 − x5 ≤ 0 ∧ − x49 + x49 ≤ 0 ∧ x49 − x49 ≤ 0 ∧ − x48 + x48 ≤ 0 ∧ x48 − x48 ≤ 0 ∧ − x41 + x41 ≤ 0 ∧ x41 − x41 ≤ 0 ∧ − x40 + x40 ≤ 0 ∧ x40 − x40 ≤ 0 ∧ − x4 + x4 ≤ 0 ∧ x4 − x4 ≤ 0 ∧ − x10 + x10 ≤ 0 ∧ x10 − x10 ≤ 0 ∧ − arg7P + arg7P ≤ 0 ∧ arg7P − arg7P ≤ 0 ∧ − arg7 + arg7 ≤ 0 ∧ arg7 − arg7 ≤ 0 ∧ − arg6P + arg6P ≤ 0 ∧ arg6P − arg6P ≤ 0 ∧ − arg6 + arg6 ≤ 0 ∧ arg6 − arg6 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

8 SCC Decomposition

We consider subproblems for each of the 2 SCC(s) of the program graph.

8.1 SCC Subproblem 1/2

Here we consider the SCC { 2, 3, 2_var_snapshot, 2* }.

8.1.1 Transition Removal

We remove transitions 3, 4, 6 using the following ranking functions, which are bounded by 3.

2:	2 + 4⋅arg4
3:	4⋅arg4
2_var_snapshot:	1 + 4⋅arg4
2*:	3 + 4⋅arg4

Hints:

11	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
13	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
3	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
4	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
5	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
6	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]

8.1.2 Transition Removal

We remove transitions 11, 13, 5 using the following ranking functions, which are bounded by −3.

2:	−1
3:	−3
2_var_snapshot:	−2
2*:	0

Hints:

11	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
13	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
5	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]

8.1.3 Splitting Cut-Point Transitions

We consider 1 subproblems corresponding to sets of cut-point transitions as follows.

8.1.3.1 Cut-Point Subproblem 1/1

Here we consider cut-point transition 10.

8.1.3.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

8.2 SCC Subproblem 2/2

Here we consider the SCC { 4, 4_var_snapshot, 4* }.

8.2.1 Transition Removal

We remove transition 8 using the following ranking functions, which are bounded by 2.

4:	1 + 3⋅arg1
4_var_snapshot:	3⋅arg1
4*:	2 + 3⋅arg1

Hints:

18	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0] ]
20	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0] ]
8	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]

8.2.2 Transition Removal

We remove transitions 18, 20 using the following ranking functions, which are bounded by −2.

4:	−1
4_var_snapshot:	−2
4*:	0

Hints:

lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]

8.2.3 Splitting Cut-Point Transitions

We consider 1 subproblems corresponding to sets of cut-point transitions as follows.

8.2.3.1 Cut-Point Subproblem 1/1

Here we consider cut-point transition 17.

8.2.3.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

Tool configuration

T2Cert

version: 1.0