NO

Initial ITS

Start location: l3
Program variables:
   0: l0 -> l1 : 0 <= 0, cost: 1
   1: l1 -> l0 : 0 <= 0, cost: 1
   2: l2 -> l0 : 0 <= 0, cost: 1
   3: l3 -> l2 : 0 <= 0, cost: 1

Chained Linear Paths

Start location: l3
Program variables:
   5: l0 -> l0 : 0 <= 0, cost: 1
   4: l3 -> l0 : 0 <= 0, cost: 1

	Eliminating location l2 by chaining:

	Applied chaining

	First rule:
	l3 -> l2 : 0 <= 0, cost: 1
	Second rule:
	l2 -> l0 : 0 <= 0, cost: 1
	New rule:
	l3 -> l0 : 0 <= 0, cost: 1
	
	Applied deletion

	Removed the following rules: 2 3
	
	Eliminating location l1 by chaining:

	Applied chaining

	First rule:
	l0 -> l1 : 0 <= 0, cost: 1
	Second rule:
	l1 -> l0 : 0 <= 0, cost: 1
	New rule:
	l0 -> l0 : 0 <= 0, cost: 1
	
	Applied deletion

	Removed the following rules: 0 1

Simplified Transitions

Start location: l3
Program variables:
   7: l0 -> l0 : T, cost: 1
   6: l3 -> l0 : T, cost: 1

	Simplified Guard

	Original rule:
	l3 -> l0 : 0 <= 0, cost: 1
	New rule:
	l3 -> l0 : T, cost: 1
	
	Simplified Guard

	Original rule:
	l0 -> l0 : 0 <= 0, cost: 1
	New rule:
	l0 -> l0 : T, cost: 1

Step with 6

	Trace

	6[T]
	
	Blocked

	[{}, {}]

Step with 7

	Trace

	6[T], 7[T]
	
	Blocked

	[{}, {}, {}]

Nonterm

Start location: l3
Program variables:
   7: l0 -> l0 : T, cost: 1
   8: l0 -> LoAT_sink : -1+n >= 0, cost: NONTERM
   6: l3 -> l0 : T, cost: 1

	Certificate of Non-Termination

	Original rule:
	l0 -> l0 : T, cost: 1
	New rule:
	l0 -> LoAT_sink : -1+n >= 0, cost: NONTERM

		Replacement map: {}

Step with 8

	Trace

	6[T], 8[-1+n >= 0]
	
	Blocked

	[{}, {}, {8[T]}]

Refute

	Counterexample

	[ ] 6 [ ] 8
	
NO

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b