by AProVE
f1_0_main_ConstantStackPush | 1 | f51_0_test_LE: | x1 = _arg1 ∧ x1 = _arg1P ∧ 9 = _arg1P | |
f51_0_test_LE | 2 | f51_0_test_LE: | x1 = _x ∧ x1 = _x1 ∧ _x − 1 = _x1 ∧ 0 ≤ _x − 1 | |
__init | 3 | f1_0_main_ConstantStackPush: | x1 = _x2 ∧ x1 = _x3 ∧ 0 ≤ 0 |
f51_0_test_LE | f51_0_test_LE | : | x1 = x1 |
f1_0_main_ConstantStackPush | f1_0_main_ConstantStackPush | : | x1 = x1 |
__init | __init | : | x1 = x1 |
We consider subproblems for each of the 1 SCC(s) of the program graph.
Here we consider the SCC {
}.We remove transition
using the following ranking functions, which are bounded by 0.: | x1 |
There are no more "sharp" transitions in the cooperation program. Hence the cooperation termination is proved.