by AProVE
l0 | 1 | l1: | x1 = ___const_50HAT0 ∧ x2 = _iHAT0 ∧ x3 = _tmpHAT0 ∧ x1 = ___const_50HATpost ∧ x2 = _iHATpost ∧ x3 = _tmpHATpost ∧ _tmpHAT0 = _tmpHATpost ∧ _iHAT0 = _iHATpost ∧ ___const_50HAT0 = ___const_50HATpost ∧ ___const_50HAT0 ≤ _iHAT0 | |
l0 | 2 | l2: | x1 = _x ∧ x2 = _x1 ∧ x3 = _x2 ∧ x1 = _x3 ∧ x2 = _x4 ∧ x3 = _x5 ∧ _x2 = _x5 ∧ _x = _x3 ∧ _x4 = 1 + _x1 ∧ 1 + _x1 ≤ _x | |
l2 | 3 | l0: | x1 = _x6 ∧ x2 = _x7 ∧ x3 = _x8 ∧ x1 = _x9 ∧ x2 = _x10 ∧ x3 = _x11 ∧ _x8 = _x11 ∧ _x7 = _x10 ∧ _x6 = _x9 | |
l3 | 4 | l2: | x1 = _x12 ∧ x2 = _x13 ∧ x3 = _x14 ∧ x1 = _x15 ∧ x2 = _x16 ∧ x3 = _x17 ∧ _x18 = 0 ∧ _x17 = _x17 ∧ _x16 = 0 ∧ _x12 = _x15 | |
l4 | 5 | l3: | x1 = _x19 ∧ x2 = _x20 ∧ x3 = _x21 ∧ x1 = _x22 ∧ x2 = _x23 ∧ x3 = _x24 ∧ _x21 = _x24 ∧ _x20 = _x23 ∧ _x19 = _x22 |
l4 | l4 | : | x1 = x1 ∧ x2 = x2 ∧ x3 = x3 |
l3 | l3 | : | x1 = x1 ∧ x2 = x2 ∧ x3 = x3 |
l0 | l0 | : | x1 = x1 ∧ x2 = x2 ∧ x3 = x3 |
l2 | l2 | : | x1 = x1 ∧ x2 = x2 ∧ x3 = x3 |
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.: | −1 + x1 − x2 |
: | −1 + x1 − x2 |
We remove transition
using the following ranking functions, which are bounded by 0.: | 0 |
: | −1 |
There are no more "sharp" transitions in the cooperation program. Hence the cooperation termination is proved.