LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
l5 l5 l5: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l7 l7 l7: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l11 l11 l11: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l1 l1 l1: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l3 l3 l3: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l2 l2 l2: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l9 l9 l9: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l14 l14 l14: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l4 l4 l4: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l10 l10 l10: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l6 l6 l6: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l8 l8 l8: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l15 l15 l15: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l0 l0 l0: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
l12 l12 l12: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12
and for every transition t, a duplicate t is considered.

2 SCC Decomposition

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

2.1 SCC Subproblem 1/3

Here we consider the SCC { l10, l11 }.

2.1.1 Transition Removal

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

l10: 3⋅x9 − 3⋅x10 + 1
l11: 3⋅x9 − 3⋅x10 + 2

2.1.2 Transition Removal

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

l10: 0
l11: −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/3

Here we consider the SCC { l4, l8, l1, l3, l0, l2, l9 }.

2.2.1 Transition Removal

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

l0: 6⋅x9 − 6⋅x11 + 1
l1: 6⋅x9 − 6⋅x11 + 1
l3: 6⋅x9 − 6⋅x11 + 1
l8: 6⋅x9 − 6⋅x11 + 2
l9: 6⋅x9 − 6⋅x11 + 3
l4: 6⋅x9 − 6⋅x11
l2: 6⋅x9 − 6⋅x11 + 1

2.2.2 Transition Removal

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

l0: −1 + x11x12
l1: −2 + x11x12
l3: −1 + x11x12
l8: 0
l4: −1 + x11x12
l9: 2⋅x3x4x11
l2: −1 + x11x12

2.2.3 Transition Removal

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

l0: 1
l1: 1
l3: 1
l4: 0
l9: x3x11
l2: 1

2.2.4 Transition Removal

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

l0: 4⋅x9 − 4⋅x12 − 1
l1: 4⋅x9 − 4⋅x12 − 3
l3: 4⋅x9 − 4⋅x12
l2: 4⋅x9 − 4⋅x12 − 2

2.2.5 Transition Removal

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

l0: 2
l1: 0
l3: x4x12
l2: 1

2.2.6 Trivial Cooperation Program

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

2.3 SCC Subproblem 3/3

Here we consider the SCC { l5, l7 }.

2.3.1 Transition Removal

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

l5: 3⋅x9 − 3⋅x12
l7: 3⋅x9 − 3⋅x12 − 1

2.3.2 Transition Removal

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

l7: 0
l5: −1

2.3.3 Trivial Cooperation Program

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

Tool configuration

AProVE