LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f227_0_isCyclic_NONNULL f227_0_isCyclic_NONNULL f227_0_isCyclic_NONNULL: x1 = x1x2 = x2
f161_0_createList_Return f161_0_createList_Return f161_0_createList_Return: x1 = x1x2 = x2
f1_0_main_Load f1_0_main_Load f1_0_main_Load: x1 = x1x2 = x2
f331_0_isCyclic_NULL f331_0_isCyclic_NULL f331_0_isCyclic_NULL: x1 = x1x2 = x2
__init __init __init: x1 = x1x2 = x2
f201_0_createList_LE f201_0_createList_LE f201_0_createList_LE: x1 = x1x2 = x2
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 { f201_0_createList_LE }.

2.1.1 Transition Removal

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

f201_0_createList_LE: 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 { f331_0_isCyclic_NULL }.

2.2.1 Transition Removal

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

f331_0_isCyclic_NULL: 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