LTS Termination Proof

Input

Integer Transition System

Initial Location: l0, l2

Transitions: (pre-variables and post-variables)

l0	1	l1:		x1 = _rt_11HAT0 ∧ x2 = _st_14HAT0 ∧ x3 = _x_13HAT0 ∧ x1 = _rt_11HATpost ∧ x2 = _st_14HATpost ∧ x3 = _x_13HATpost ∧ _st_14HAT0 = _st_14HATpost ∧ _rt_11HATpost = _st_14HAT0 ∧ _x_13HATpost = −1 + _x_13HAT0 ∧ 0 ≤ _x_13HAT0
l0	2	l1:		x1 = _x ∧ x2 = _x1 ∧ x3 = _x2 ∧ x1 = _x3 ∧ x2 = _x4 ∧ x3 = _x5 ∧ _x2 = _x5 ∧ _x1 = _x4 ∧ _x3 = _x1 ∧ 1 + _x2 ≤ 0
l2	3	l0:		x1 = _x6 ∧ x2 = _x7 ∧ x3 = _x8 ∧ x1 = _x9 ∧ x2 = _x10 ∧ x3 = _x11 ∧ _x8 = _x11 ∧ _x7 = _x10 ∧ _x6 = _x9

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:

l0	l0	l0:	x1 = x1 ∧ x2 = x2 ∧ x3 = x3
l2	l2	l2:	x1 = x1 ∧ x2 = x2 ∧ x3 = x3

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

2 SCC Decomposition

There exist no SCC in the program graph.

Tool configuration

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