NO

Initial ITS

Start location: l5
Program variables: x^0
   0: l0 -> l1 : x^0'=x^post1, (0 <= 0 /\ -x^post1+x^0 == 0), cost: 1
   1: l1 -> l0 : x^0'=x^post2, x^0-x^post2 == 0, cost: 1
   2: l2 -> l3 : x^0'=x^post3, -x^post3+x^0 == 0, cost: 1
   3: l3 -> l2 : x^0'=x^post4, -x^post4+x^0 == 0, cost: 1
   4: l4 -> l0 : x^0'=x^post5, x^0-x^post5 == 0, cost: 1
   5: l5 -> l4 : x^0'=x^post6, -x^post6+x^0 == 0, cost: 1

Chained Linear Paths

Start location: l5
Program variables: x^0
   7: l0 -> l0 : x^0'=x^post2, (0 <= 0 /\ -x^post1+x^0 == 0 /\ x^post1-x^post2 == 0), cost: 1
   2: l2 -> l3 : x^0'=x^post3, -x^post3+x^0 == 0, cost: 1
   3: l3 -> l2 : x^0'=x^post4, -x^post4+x^0 == 0, cost: 1
   6: l5 -> l0 : x^0'=x^post5, (x^post6-x^post5 == 0 /\ -x^post6+x^0 == 0), cost: 1

	Eliminating location l4 by chaining:

	Applied chaining

	First rule:
	l5 -> l4 : x^0'=x^post6, -x^post6+x^0 == 0, cost: 1
	Second rule:
	l4 -> l0 : x^0'=x^post5, x^0-x^post5 == 0, cost: 1
	New rule:
	l5 -> l0 : x^0'=x^post5, (x^post6-x^post5 == 0 /\ -x^post6+x^0 == 0), cost: 1
	
	Applied deletion

	Removed the following rules: 4 5
	
	Eliminating location l1 by chaining:

	Applied chaining

	First rule:
	l0 -> l1 : x^0'=x^post1, (0 <= 0 /\ -x^post1+x^0 == 0), cost: 1
	Second rule:
	l1 -> l0 : x^0'=x^post2, x^0-x^post2 == 0, cost: 1
	New rule:
	l0 -> l0 : x^0'=x^post2, (0 <= 0 /\ -x^post1+x^0 == 0 /\ x^post1-x^post2 == 0), cost: 1
	
	Applied deletion

	Removed the following rules: 0 1

Simplified Transitions

Start location: l5
Program variables:
  11: l0 -> l0 : T, cost: 1
   8: l2 -> l3 : T, cost: 1
   9: l3 -> l2 : T, cost: 1
  10: l5 -> l0 : T, cost: 1

	Propagated Equalities

	Original rule:
	l2 -> l3 : x^0'=x^post3, -x^post3+x^0 == 0, cost: 1
	New rule:
	l2 -> l3 : x^0'=x^0, 0 == 0, cost: 1
	
		propagated equality x^post3 = x^0
		
	Simplified Guard

	Original rule:
	l2 -> l3 : x^0'=x^0, 0 == 0, cost: 1
	New rule:
	l2 -> l3 : x^0'=x^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l2 -> l3 : x^0'=x^0, T, cost: 1
	New rule:
	l2 -> l3 : T, cost: 1
	
	Propagated Equalities

	Original rule:
	l3 -> l2 : x^0'=x^post4, -x^post4+x^0 == 0, cost: 1
	New rule:
	l3 -> l2 : x^0'=x^0, 0 == 0, cost: 1
	
		propagated equality x^post4 = x^0
		
	Simplified Guard

	Original rule:
	l3 -> l2 : x^0'=x^0, 0 == 0, cost: 1
	New rule:
	l3 -> l2 : x^0'=x^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l3 -> l2 : x^0'=x^0, T, cost: 1
	New rule:
	l3 -> l2 : T, cost: 1
	
	Propagated Equalities

	Original rule:
	l5 -> l0 : x^0'=x^post5, (x^post6-x^post5 == 0 /\ -x^post6+x^0 == 0), cost: 1
	New rule:
	l5 -> l0 : x^0'=x^post6, (0 == 0 /\ -x^post6+x^0 == 0), cost: 1
	
		propagated equality x^post5 = x^post6
		
	Propagated Equalities

	Original rule:
	l5 -> l0 : x^0'=x^post6, (0 == 0 /\ -x^post6+x^0 == 0), cost: 1
	New rule:
	l5 -> l0 : x^0'=x^0, 0 == 0, cost: 1
	
		propagated equality x^post6 = x^0
		
	Simplified Guard

	Original rule:
	l5 -> l0 : x^0'=x^0, 0 == 0, cost: 1
	New rule:
	l5 -> l0 : x^0'=x^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l5 -> l0 : x^0'=x^0, T, cost: 1
	New rule:
	l5 -> l0 : T, cost: 1
	
	Propagated Equalities

	Original rule:
	l0 -> l0 : x^0'=x^post2, (0 <= 0 /\ -x^post1+x^0 == 0 /\ x^post1-x^post2 == 0), cost: 1
	New rule:
	l0 -> l0 : x^0'=x^post1, (0 <= 0 /\ 0 == 0 /\ -x^post1+x^0 == 0), cost: 1
	
		propagated equality x^post2 = x^post1
		
	Propagated Equalities

	Original rule:
	l0 -> l0 : x^0'=x^post1, (0 <= 0 /\ 0 == 0 /\ -x^post1+x^0 == 0), cost: 1
	New rule:
	l0 -> l0 : x^0'=x^0, (0 <= 0 /\ 0 == 0), cost: 1
	
		propagated equality x^post1 = x^0
		
	Simplified Guard

	Original rule:
	l0 -> l0 : x^0'=x^0, (0 <= 0 /\ 0 == 0), cost: 1
	New rule:
	l0 -> l0 : x^0'=x^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l0 -> l0 : x^0'=x^0, T, cost: 1
	New rule:
	l0 -> l0 : T, cost: 1

Step with 10

	Trace

	10[T]
	
	Blocked

	[{}, {}]

Step with 11

	Trace

	10[T], 11[T]
	
	Blocked

	[{}, {}, {}]

Nonterm

Start location: l5
Program variables:
  11: l0 -> l0 : T, cost: 1
  12: l0 -> LoAT_sink : -1+n >= 0, cost: NONTERM
   8: l2 -> l3 : T, cost: 1
   9: l3 -> l2 : T, cost: 1
  10: l5 -> 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 12

	Trace

	10[T], 12[-1+n >= 0]
	
	Blocked

	[{}, {}, {12[T]}]

Refute

	Counterexample

	[ ] 10 [ ] 12
	
NO

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b