LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
l0 l0 l0: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39x40 = x40x41 = x41x42 = x42x43 = x43x44 = x44x45 = x45x46 = x46x47 = x47x48 = x48
l2 l2 l2: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39x40 = x40x41 = x41x42 = x42x43 = x43x44 = x44x45 = x45x46 = x46x47 = x47x48 = x48
and for every transition t, a duplicate t is considered.

2 SCC Decomposition

There exist no SCC in the program graph.

Tool configuration

AProVE