LTS Termination Proof

Input

Integer Transition System

Transitions: (pre-variables and post-variables)

l0	1	l1:	x1 = _tmpHAT0 ∧ x1 = _tmpHATpost ∧ _tmpHAT0 = _tmpHATpost
l2	2	l0:	x1 = _x ∧ x1 = _x1 ∧ _x = _x1
l3	3	l2:	x1 = _x2 ∧ x1 = _x3 ∧ _x2 = _x3
l3	4	l0:	x1 = _x4 ∧ x1 = _x5 ∧ _x5 = _x5
l4	5	l3:	x1 = _x6 ∧ x1 = _x7 ∧ _x6 = _x7

We consider the following cutpoint-transitions:

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

There exist no SCC in the program graph.

version: AProVE Commit ID: unknown
strategy: Statistics for single proof: 100.00 % (2 real / 0 unknown / 0 assumptions / 2 total proof steps)