LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f2651_0_buildExpression_GT f2651_0_buildExpression_GT f2651_0_buildExpression_GT: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10
f2554_0_buildExpression_GE f2554_0_buildExpression_GE f2554_0_buildExpression_GE: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10
f1944_0_buildExpression_GT f1944_0_buildExpression_GT f1944_0_buildExpression_GT: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10
f2578_0_toPostfix_NULL f2578_0_toPostfix_NULL f2578_0_toPostfix_NULL: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10
f1999_0_toPostfix_NULL f1999_0_toPostfix_NULL f1999_0_toPostfix_NULL: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10
f1_0_main_Load f1_0_main_Load f1_0_main_Load: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10
__init __init __init: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10
and for every transition t, a duplicate t is considered.

2 SCC Decomposition

We consider subproblems for each of the 4 SCC(s) of the program graph.

2.1 SCC Subproblem 1/4

Here we consider the SCC { f2651_0_buildExpression_GT, f1944_0_buildExpression_GT }.

2.1.1 Transition Removal

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

f1944_0_buildExpression_GT: 2⋅x4 − 2⋅x3
f2651_0_buildExpression_GT: −2⋅x3 + 2⋅x5 − 1

2.1.2 Transition Removal

We remove transitions 5, 7 using the following ranking functions, which are bounded by 0.

f2651_0_buildExpression_GT: 0
f1944_0_buildExpression_GT: −1

2.1.3 Trivial Cooperation Program

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

2.2 SCC Subproblem 2/4

Here we consider the SCC { f2554_0_buildExpression_GE }.

2.2.1 Transition Removal

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

f2554_0_buildExpression_GE: x3 + x4

2.2.2 Trivial Cooperation Program

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

2.3 SCC Subproblem 3/4

Here we consider the SCC { f1999_0_toPostfix_NULL }.

2.3.1 Transition Removal

We remove transitions 9, 11, 12, 13, 14, 15, 16, 17, 18, 19 using the following ranking functions, which are bounded by 0.

f1999_0_toPostfix_NULL: x4

2.3.2 Trivial Cooperation Program

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

2.4 SCC Subproblem 4/4

Here we consider the SCC { f2578_0_toPostfix_NULL }.

2.4.1 Transition Removal

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

f2578_0_toPostfix_NULL: x1

2.4.2 Trivial Cooperation Program

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

Tool configuration

AProVE