LTS Termination Proof

by T2Cert

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

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

2 Transition Removal

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

5: 0
4: 0
3: 0
2: 0
0: 0
1: 0
5: −7
4: −8
3: −9
2: −10
0: −11
1: −12

3 SCC Decomposition

There exist no SCC in the program graph.

Tool configuration

T2Cert