LTS Termination Proof

by T2Cert

Input

Integer Transition System

Proof

1 Invariant Updates

The following invariants are asserted.

0: TRUE
1: TRUE
2: x_5_0 ≤ 0
3: TRUE
4: TRUE
5: TRUE

The invariants are proved as follows.

IMPACT Invariant Proof

2 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
0 7 0: x_5_post + x_5_post ≤ 0x_5_postx_5_post ≤ 0x_5_0 + x_5_0 ≤ 0x_5_0x_5_0 ≤ 0Result_4_post + Result_4_post ≤ 0Result_4_postResult_4_post ≤ 0Result_4_1 + Result_4_1 ≤ 0Result_4_1Result_4_1 ≤ 0Result_4_0 + Result_4_0 ≤ 0Result_4_0Result_4_0 ≤ 0
and for every transition t, a duplicate t is considered.

3 Transition Removal

We remove transitions 2, 3, 4, 5, 6 using the following ranking functions, which are bounded by −15.

5: 0
4: 0
3: 0
0: 0
1: 0
2: 0
5: −6
4: −7
3: −8
0: −9
1: −9
0_var_snapshot: −9
0*: −9
2: −13
Hints:
8 lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
0 lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
1 lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
2 lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
3 lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
4 lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
5 lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
6 lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]

4 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

0* 10 0: x_5_post + x_5_post ≤ 0x_5_postx_5_post ≤ 0x_5_0 + x_5_0 ≤ 0x_5_0x_5_0 ≤ 0Result_4_post + Result_4_post ≤ 0Result_4_postResult_4_post ≤ 0Result_4_1 + Result_4_1 ≤ 0Result_4_1Result_4_1 ≤ 0Result_4_0 + Result_4_0 ≤ 0Result_4_0Result_4_0 ≤ 0

5 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

0 8 0_var_snapshot: x_5_post + x_5_post ≤ 0x_5_postx_5_post ≤ 0x_5_0 + x_5_0 ≤ 0x_5_0x_5_0 ≤ 0Result_4_post + Result_4_post ≤ 0Result_4_postResult_4_post ≤ 0Result_4_1 + Result_4_1 ≤ 0Result_4_1Result_4_1 ≤ 0Result_4_0 + Result_4_0 ≤ 0Result_4_0Result_4_0 ≤ 0

6 SCC Decomposition

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

6.1 SCC Subproblem 1/1

Here we consider the SCC { 0, 1, 0_var_snapshot, 0* }.

6.1.1 Transition Removal

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

0: −1 + 4⋅x_5_0
1: 1 + 4⋅x_5_0
0_var_snapshot: −2 + 4⋅x_5_0
0*: 4⋅x_5_0
Hints:
8 lexWeak[ [0, 0, 4, 0, 0, 0, 0, 0, 0, 0] ]
10 lexWeak[ [0, 0, 4, 0, 0, 0, 0, 0, 0, 0] ]
0 lexStrict[ [0, 0, 0, 4, 0, 4, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
1 lexWeak[ [0, 0, 4, 0, 0, 0, 0, 0, 0, 0] ]

6.1.2 Transition Removal

We remove transitions 8, 10, 1 using the following ranking functions, which are bounded by −1.

0: 0
1: 2
0_var_snapshot: −1
0*: 1
Hints:
8 lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
10 lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
1 lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]

6.1.3 Splitting Cut-Point Transitions

We consider 1 subproblems corresponding to sets of cut-point transitions as follows.

6.1.3.1 Cut-Point Subproblem 1/1

Here we consider cut-point transition 7.

6.1.3.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

Tool configuration

T2Cert