by AProVE
| f161_0_createList_Return | 1 | f227_0_isCyclic_NONNULL: | x1 = _arg1 ∧ x2 = _arg2 ∧ x1 = _arg1P ∧ x2 = _arg2P ∧ −1 ≤ _arg1P − 1 ∧ −1 ≤ _arg1 − 1 ∧ _arg1P ≤ _arg1 | |
| f1_0_main_Load | 2 | f227_0_isCyclic_NONNULL: | x1 = _x ∧ x2 = _x1 ∧ x1 = _x2 ∧ x2 = _x3 ∧ −1 ≤ _x2 − 1 ∧ 0 ≤ _x − 1 | |
| f227_0_isCyclic_NONNULL | 3 | f331_0_isCyclic_NULL: | x1 = _x4 ∧ x2 = _x5 ∧ x1 = _x6 ∧ x2 = _x7 ∧ −1 ≤ _x7 − 1 ∧ 0 ≤ _x6 − 1 ∧ 0 ≤ _x4 − 1 ∧ _x7 + 1 ≤ _x4 ∧ _x6 ≤ _x4 | |
| f331_0_isCyclic_NULL | 4 | f331_0_isCyclic_NULL: | x1 = _x8 ∧ x2 = _x9 ∧ x1 = _x10 ∧ x2 = _x11 ∧ −1 ≤ _x11 − 1 ∧ −1 ≤ _x10 − 1 ∧ 2 ≤ _x9 − 1 ∧ 0 ≤ _x8 − 1 ∧ _x11 + 3 ≤ _x9 ∧ _x10 + 1 ≤ _x8 | |
| f1_0_main_Load | 5 | f201_0_createList_LE: | x1 = _x12 ∧ x2 = _x13 ∧ x1 = _x14 ∧ x2 = _x15 ∧ 0 ≤ _x12 − 1 ∧ −1 ≤ _x14 − 1 ∧ −1 ≤ _x13 − 1 | |
| f201_0_createList_LE | 6 | f201_0_createList_LE: | x1 = _x16 ∧ x2 = _x17 ∧ x1 = _x18 ∧ x2 = _x19 ∧ _x16 − 1 = _x18 ∧ 0 ≤ _x16 − 1 | |
| __init | 7 | f1_0_main_Load: | x1 = _x20 ∧ x2 = _x21 ∧ x1 = _x22 ∧ x2 = _x23 ∧ 0 ≤ 0 |
| f227_0_isCyclic_NONNULL | f227_0_isCyclic_NONNULL | : | x1 = x1 ∧ x2 = x2 |
| f161_0_createList_Return | f161_0_createList_Return | : | x1 = x1 ∧ x2 = x2 |
| f1_0_main_Load | f1_0_main_Load | : | x1 = x1 ∧ x2 = x2 |
| f331_0_isCyclic_NULL | f331_0_isCyclic_NULL | : | x1 = x1 ∧ x2 = x2 |
| __init | __init | : | x1 = x1 ∧ x2 = x2 |
| f201_0_createList_LE | f201_0_createList_LE | : | x1 = x1 ∧ x2 = x2 |
We consider subproblems for each of the 2 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.
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.