LTS Termination Proof

by AProVE


Integer Transition System


1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f239_0_main_LE f239_0_main_LE f239_0_main_LE: x1 = x1x2 = x2x3 = x3
f203_0_main_NE f203_0_main_NE f203_0_main_NE: x1 = x1x2 = x2x3 = x3
f1_0_main_Load f1_0_main_Load f1_0_main_Load: x1 = x1x2 = x2x3 = x3
__init __init __init: x1 = x1x2 = x2x3 = x3
and for every transition t, a duplicate t is considered.

2 SCC Decomposition

We consider subproblems for each of the 1 SCC(s) of the program graph.

2.1 SCC Subproblem 1/1

Here we consider the SCC { f239_0_main_LE, f203_0_main_NE }.

2.1.1 Transition Removal

We remove transitions 2, 3, 4 using the following ranking functions, which are bounded by 0.

f203_0_main_NE: −1 + 3⋅x2
f239_0_main_LE: x3

2.1.2 Trivial Cooperation Program

There are no more "sharp" transitions in the cooperation program. Hence the cooperation termination is proved.

Tool configuration