LTS Termination Proof

by T2Cert

Input

Integer Transition System

Transitions: (pre-variables and post-variables)

0	0	1:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ tmp3_0 − tmp3_post ≤ 0 ∧ − tmp3_0 + tmp3_post ≤ 0 ∧ tmp___04_0 − tmp___04_post ≤ 0 ∧ − tmp___04_0 + tmp___04_post ≤ 0
2	1	0:		− tmp___04_post + tmp___04_post ≤ 0 ∧ tmp___04_post − tmp___04_post ≤ 0 ∧ − tmp___04_0 + tmp___04_0 ≤ 0 ∧ tmp___04_0 − tmp___04_0 ≤ 0 ∧ − tmp3_post + tmp3_post ≤ 0 ∧ tmp3_post − tmp3_post ≤ 0 ∧ − tmp3_0 + tmp3_0 ≤ 0 ∧ tmp3_0 − tmp3_0 ≤ 0

We consider the following cutpoint-transitions:

and for every transition t, a duplicate t is considered.

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

Hints:

0	lexStrict[ [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] ]

There exist no SCC in the program graph.

T2Cert