by AProVE
f1_0_main_ConstantStackPush | 1 | f55_0_main_GE: | x1 = _arg1 ∧ x1 = _arg1P ∧ 0 = _arg1P | |
f55_0_main_GE | 2 | f55_0_main_GE: | x1 = _x ∧ x1 = _x1 ∧ _x + 1 = _x1 ∧ _x ≤ 19 ∧ 9 ≤ _x − 1 | |
f55_0_main_GE | 3 | f55_0_main_GE: | x1 = _x2 ∧ x1 = _x3 ∧ _x2 + 1 = _x3 ∧ _x2 ≤ 19 ∧ _x2 ≤ 9 | |
__init | 4 | f1_0_main_ConstantStackPush: | x1 = _x4 ∧ x1 = _x5 ∧ 0 ≤ 0 |
f55_0_main_GE | f55_0_main_GE | : | 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 transitions
, using the following ranking functions, which are bounded by 0.: | 19 − x1 |
There are no more "sharp" transitions in the cooperation program. Hence the cooperation termination is proved.