by AProVE
l0 | 1 | l1: | x1 = _Result_4HAT0 ∧ x2 = ____cil_tmp4_8HAT0 ∧ x3 = ____retres3_7HAT0 ∧ x4 = _i_5HAT0 ∧ x5 = _x_6HAT0 ∧ x1 = _Result_4HATpost ∧ x2 = ____cil_tmp4_8HATpost ∧ x3 = ____retres3_7HATpost ∧ x4 = _i_5HATpost ∧ x5 = _x_6HATpost ∧ _x_6HAT0 = _x_6HATpost ∧ _i_5HAT0 = _i_5HATpost ∧ _Result_4HATpost = ____cil_tmp4_8HATpost ∧ ____cil_tmp4_8HATpost = ____retres3_7HATpost ∧ ____retres3_7HATpost = 0 ∧ 101 − _i_5HAT0 ≤ 0 | |
l0 | 2 | l2: | x1 = _x ∧ x2 = _x1 ∧ x3 = _x2 ∧ x4 = _x3 ∧ x5 = _x4 ∧ x1 = _x5 ∧ x2 = _x6 ∧ x3 = _x7 ∧ x4 = _x8 ∧ x5 = _x9 ∧ _x4 = _x9 ∧ _x2 = _x7 ∧ _x1 = _x6 ∧ _x = _x5 ∧ _x8 = 1 + _x3 ∧ 0 ≤ −1 + _x4 ∧ 0 ≤ 100 − _x3 | |
l2 | 3 | l0: | x1 = _x10 ∧ x2 = _x11 ∧ x3 = _x12 ∧ x4 = _x13 ∧ x5 = _x14 ∧ x1 = _x15 ∧ x2 = _x16 ∧ x3 = _x17 ∧ x4 = _x18 ∧ x5 = _x19 ∧ _x14 = _x19 ∧ _x13 = _x18 ∧ _x12 = _x17 ∧ _x11 = _x16 ∧ _x10 = _x15 | |
l3 | 4 | l4: | x1 = _x20 ∧ x2 = _x21 ∧ x3 = _x22 ∧ x4 = _x23 ∧ x5 = _x24 ∧ x1 = _x25 ∧ x2 = _x26 ∧ x3 = _x27 ∧ x4 = _x28 ∧ x5 = _x29 ∧ _x24 = _x29 ∧ _x22 = _x27 ∧ _x21 = _x26 ∧ _x20 = _x25 ∧ _x28 = 0 | |
l4 | 5 | l1: | x1 = _x30 ∧ x2 = _x31 ∧ x3 = _x32 ∧ x4 = _x33 ∧ x5 = _x34 ∧ x1 = _x35 ∧ x2 = _x36 ∧ x3 = _x37 ∧ x4 = _x38 ∧ x5 = _x39 ∧ _x34 = _x39 ∧ _x33 = _x38 ∧ _x35 = _x36 ∧ _x36 = _x37 ∧ _x37 = 0 ∧ _x34 ≤ 0 ∧ 0 ≤ 100 − _x33 | |
l4 | 6 | l0: | x1 = _x40 ∧ x2 = _x41 ∧ x3 = _x42 ∧ x4 = _x43 ∧ x5 = _x44 ∧ x1 = _x45 ∧ x2 = _x46 ∧ x3 = _x47 ∧ x4 = _x48 ∧ x5 = _x49 ∧ _x44 = _x49 ∧ _x42 = _x47 ∧ _x41 = _x46 ∧ _x40 = _x45 ∧ _x48 = 1 + _x43 ∧ 0 ≤ −1 + _x44 ∧ 0 ≤ 100 − _x43 | |
l5 | 7 | l3: | x1 = _x50 ∧ x2 = _x51 ∧ x3 = _x52 ∧ x4 = _x53 ∧ x5 = _x54 ∧ x1 = _x55 ∧ x2 = _x56 ∧ x3 = _x57 ∧ x4 = _x58 ∧ x5 = _x59 ∧ _x54 = _x59 ∧ _x53 = _x58 ∧ _x52 = _x57 ∧ _x51 = _x56 ∧ _x50 = _x55 |
l5 | l5 | : | x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 |
l4 | l4 | : | x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 |
l3 | l3 | : | x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 |
l0 | l0 | : | x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 |
l2 | l2 | : | x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 |
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 − x4 + 101⋅x5 |
: | −1 − x4 + 101⋅x5 |
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.