LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f480_0_main_InvokeMethod f480_0_main_InvokeMethod f480_0_main_InvokeMethod: x1 = x1x2 = x2x3 = x3x4 = x4
f177_0_appendNewList_Return f177_0_appendNewList_Return f177_0_appendNewList_Return: x1 = x1x2 = x2x3 = x3x4 = x4
f415_0_main_InvokeMethod f415_0_main_InvokeMethod f415_0_main_InvokeMethod: x1 = x1x2 = x2x3 = x3x4 = x4
f1_0_main_Load f1_0_main_Load f1_0_main_Load: x1 = x1x2 = x2x3 = x3x4 = x4
f519_0_length_NONNULL f519_0_length_NONNULL f519_0_length_NONNULL: x1 = x1x2 = x2x3 = x3x4 = x4
__init __init __init: x1 = x1x2 = x2x3 = x3x4 = x4
f343_0_appendNewList_GT f343_0_appendNewList_GT f343_0_appendNewList_GT: x1 = x1x2 = x2x3 = x3x4 = x4
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 { f343_0_appendNewList_GT }.

2.1.1 Transition Removal

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

f343_0_appendNewList_GT: x1

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 { f519_0_length_NONNULL }.

2.2.1 Transition Removal

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

f519_0_length_NONNULL: x2 + 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