LTS Termination Proof

by AProVE


Integer Transition System


1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
l0 l0 l0: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5
l2 l2 l2: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5
and for every transition t, a duplicate t is considered.

2 SCC Decomposition

There exist no SCC in the program graph.

Tool configuration