LTS Termination Proof

by AProVE


Integer Transition System


1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f157_0_log_LE' f157_0_log_LE' f157_0_log_LE': x1 = x1x2 = x2
f1_0_main_Load f1_0_main_Load f1_0_main_Load: x1 = x1x2 = x2
f157_0_log_LE f157_0_log_LE f157_0_log_LE: x1 = x1x2 = x2
__init __init __init: x1 = x1x2 = x2
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 { f157_0_log_LE', f157_0_log_LE }.

2.1.1 Transition Removal

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

f157_0_log_LE: 2⋅x1
f157_0_log_LE': x1 + 1

2.1.2 Trivial Cooperation Program

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

Tool configuration