LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f193_0__init__LE f193_0__init__LE f193_0__init__LE: x1 = x1x2 = x2x3 = x3
f518_0__init__InvokeMethod f518_0__init__InvokeMethod f518_0__init__InvokeMethod: x1 = x1x2 = x2x3 = x3
f480_0_main_InvokeMethod f480_0_main_InvokeMethod f480_0_main_InvokeMethod: x1 = x1x2 = x2x3 = x3
f481_0_main_InvokeMethod f481_0_main_InvokeMethod f481_0_main_InvokeMethod: x1 = x1x2 = x2x3 = x3
f482_0_main_InvokeMethod f482_0_main_InvokeMethod f482_0_main_InvokeMethod: x1 = x1x2 = x2x3 = x3
f388_0_height_NONNULL f388_0_height_NONNULL f388_0_height_NONNULL: 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 2 SCC(s) of the program graph.

2.1 SCC Subproblem 1/2

Here we consider the SCC { f193_0__init__LE, f518_0__init__InvokeMethod }.

2.1.1 Transition Removal

We remove transitions 10, 13, 12, 11 using the following ranking functions, which are bounded by 0.

f193_0__init__LE: 2⋅x1
f518_0__init__InvokeMethod: 1 + 2⋅x2

2.1.2 Trivial Cooperation Program

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

2.2 SCC Subproblem 2/2

Here we consider the SCC { f388_0_height_NONNULL }.

2.2.1 Transition Removal

We remove transitions 17, 18 using the following ranking functions, which are bounded by 0.

f388_0_height_NONNULL: x1

2.2.2 Trivial Cooperation Program

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

Tool configuration

AProVE