LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f169_0_main_GE f169_0_main_GE f169_0_main_GE: x1 = x1x2 = x2
f139_0_main_GE f139_0_main_GE f139_0_main_GE: x1 = x1x2 = x2
f1_0_main_ConstantStackPush f1_0_main_ConstantStackPush f1_0_main_ConstantStackPush: 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 { f169_0_main_GE, f139_0_main_GE }.

2.1.1 Transition Removal

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

f139_0_main_GE: 9 − x1
f169_0_main_GE: 8 − x1

2.1.2 Transition Removal

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

f169_0_main_GE: 0
f139_0_main_GE: −1

2.1.3 Transition Removal

We remove transition 4 using the following ranking functions, which are bounded by 0.

f169_0_main_GE: 11 − x2

2.1.4 Trivial Cooperation Program

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

Tool configuration

AProVE