NO Initial ITS Start location: [1] Program variables: i 0: [1] -> [2] : i'=0, T, cost: 1 1: [2] -> [3] : -100+i < 0, cost: 1 4: [2] -> [5] : -100+i >= 0, cost: 1 2: [3] -> [4] : i'=i, T, cost: 1 3: [4] -> [2] : T, cost: 1 Chained Linear Paths Start location: [1] Program variables: i 0: [1] -> [2] : i'=0, T, cost: 1 4: [2] -> [5] : -100+i >= 0, cost: 1 6: [2] -> [2] : i'=i, -100+i < 0, cost: 1 Eliminating location [3] by chaining: Applied chaining First rule: [2] -> [3] : -100+i < 0, cost: 1 Second rule: [3] -> [4] : i'=i, T, cost: 1 New rule: [2] -> [4] : i'=i, -100+i < 0, cost: 1 Applied deletion Removed the following rules: 1 2 Eliminating location [4] by chaining: Applied chaining First rule: [2] -> [4] : i'=i, -100+i < 0, cost: 1 Second rule: [4] -> [2] : T, cost: 1 New rule: [2] -> [2] : i'=i, -100+i < 0, cost: 1 Applied deletion Removed the following rules: 3 5 Simplified Transitions Start location: [1] Program variables: i 0: [1] -> [2] : i'=0, T, cost: 1 4: [2] -> [5] : -100+i >= 0, cost: 1 7: [2] -> [2] : -100+i < 0, cost: 1 Removed Trivial Updates Original rule: [2] -> [2] : i'=i, -100+i < 0, cost: 1 New rule: [2] -> [2] : -100+i < 0, cost: 1 Step with 0 Trace 0[T] Blocked [{}, {}] Step with 7 Trace 0[T], 7[(-100+i < 0)] Blocked [{}, {4[T]}, {}] Nonterm Start location: [1] Program variables: i 0: [1] -> [2] : i'=0, T, cost: 1 4: [2] -> [5] : -100+i >= 0, cost: 1 7: [2] -> [2] : -100+i < 0, cost: 1 8: [2] -> LoAT_sink : (100-i > 0 /\ -1+n >= 0), cost: NONTERM Certificate of Non-Termination Original rule: [2] -> [2] : (-100+i < 0), cost: 1 New rule: [2] -> LoAT_sink : (100-i > 0 /\ -1+n >= 0), cost: NONTERM 100-i > 0 [0]: monotonic increase yields 100-i > 0 Replacement map: {100-i > 0 -> 100-i > 0} Step with 8 Trace 0[T], 8[(100-i > 0 /\ -1+n >= 0)] Blocked [{}, {4[T]}, {8[T]}] Refute Counterexample [ i=0 ] 0 [ i=i ] 8 NO Build SHA: a05f16bf13df659c382799650051f91bf6828c7b