LTS Termination Proof

by T2Cert

Input

Integer Transition System

Proof

1 Invariant Updates

The following invariants are asserted.

0: TRUE
1: TRUE
2: TRUE
3: TRUE
4: TRUE
5: TRUE
6: TRUE
7: Result_4_post ≤ 0Result_4_0 ≤ 0____cil_tmp6_20_post ≤ 0____retres5_19_post ≤ 0____retres5_19_post ≤ 0____cil_tmp6_20_0 ≤ 0____retres5_19_0 ≤ 0____retres5_19_0 ≤ 0
8: TRUE

The invariants are proved as follows.

IMPACT Invariant Proof

2 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
and for every transition t, a duplicate t is considered.

3 Transition Removal

We remove transitions 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 using the following ranking functions, which are bounded by −20.

8: 0
0: 0
1: 0
2: 0
3: 0
4: 0
5: 0
6: 0
7: 0
8: −10
0: −11
1: −12
2: −13
3: −14
4: −15
5: −16
6: −17
7: −18

4 SCC Decomposition

There exist no SCC in the program graph.

Tool configuration

T2Cert