unknown

Initial ITS

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

Chained Linear Paths

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

	Eliminating location l5 by chaining:

	Applied chaining

	First rule:
	l6 -> l5 : c^0'=c^post9, ox^0'=ox^post9, x^0'=x^post9, (x^0-x^post9 == 0 /\ -c^post9+c^0 == 0 /\ -ox^post9+ox^0 == 0), cost: 1
	Second rule:
	l5 -> l1 : c^0'=c^post8, ox^0'=ox^post8, x^0'=x^post8, (x^0-x^post8 == 0 /\ c^0 <= 0 /\ -ox^post8+ox^0 == 0 /\ c^0-c^post8 == 0), cost: 1
	New rule:
	l6 -> l1 : c^0'=c^post8, ox^0'=ox^post8, x^0'=x^post8, (ox^post9-ox^post8 == 0 /\ c^post9 <= 0 /\ x^0-x^post9 == 0 /\ -c^post9+c^0 == 0 /\ c^post9-c^post8 == 0 /\ -ox^post9+ox^0 == 0 /\ x^post9-x^post8 == 0), cost: 1
	
	Applied deletion

	Removed the following rules: 7 8

Simplified Transitions

Start location: l6
Program variables: c^0 ox^0 x^0
  10: l0 -> l1 : 1+x^0-ox^0 <= 0, cost: 1
  11: l0 -> l2 : -x^0+ox^0 <= 0, cost: 1
  16: l1 -> l4 : x^0'=-1+x^0, 1-x^0 <= 0, cost: 1
  12: l3 -> l1 : c^0 <= 0, cost: 1
  13: l3 -> l1 : c^0'=1, ox^0'=x^0, T, cost: 1
  14: l4 -> l3 : c^0 <= 0, cost: 1
  15: l4 -> l0 : 1-c^0 <= 0, cost: 1
  17: l6 -> l1 : c^0 <= 0, cost: 1

	Propagated Equalities

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

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

	Original rule:
	l0 -> l1 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, 1+x^0-ox^0 <= 0, cost: 1
	New rule:
	l0 -> l1 : 1+x^0-ox^0 <= 0, cost: 1
	
	Propagated Equalities

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

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

	Original rule:
	l0 -> l2 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, -x^0+ox^0 <= 0, cost: 1
	New rule:
	l0 -> l2 : -x^0+ox^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l3 -> l1 : c^0'=c^post3, ox^0'=ox^post3, x^0'=x^post3, (c^0 <= 0 /\ -ox^post3+ox^0 == 0 /\ c^0-c^post3 == 0 /\ -x^post3+x^0 == 0), cost: 1
	New rule:
	l3 -> l1 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, (0 == 0 /\ c^0 <= 0), cost: 1
	
		propagated equality ox^post3 = ox^0
		
		propagated equality c^post3 = c^0
		
		propagated equality x^post3 = x^0
		
	Simplified Guard

	Original rule:
	l3 -> l1 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, (0 == 0 /\ c^0 <= 0), cost: 1
	New rule:
	l3 -> l1 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, c^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l3 -> l1 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, c^0 <= 0, cost: 1
	New rule:
	l3 -> l1 : c^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l3 -> l1 : c^0'=c^post4, ox^0'=ox^post4, x^0'=x^post4, (-x^post4+x^0 == 0 /\ ox^post4-x^0 == 0 /\ -1+c^post4 == 0), cost: 1
	New rule:
	l3 -> l1 : c^0'=1, ox^0'=x^0, x^0'=x^0, 0 == 0, cost: 1
	
		propagated equality x^post4 = x^0
		
		propagated equality ox^post4 = x^0
		
		propagated equality c^post4 = 1
		
	Simplified Guard

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

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

	Original rule:
	l4 -> l3 : c^0'=c^post5, ox^0'=ox^post5, x^0'=x^post5, (c^0-c^post5 == 0 /\ -ox^post5+ox^0 == 0 /\ c^0 <= 0 /\ -x^post5+x^0 == 0), cost: 1
	New rule:
	l4 -> l3 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, (0 == 0 /\ c^0 <= 0), cost: 1
	
		propagated equality c^post5 = c^0
		
		propagated equality ox^post5 = ox^0
		
		propagated equality x^post5 = x^0
		
	Simplified Guard

	Original rule:
	l4 -> l3 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, (0 == 0 /\ c^0 <= 0), cost: 1
	New rule:
	l4 -> l3 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, c^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l4 -> l3 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, c^0 <= 0, cost: 1
	New rule:
	l4 -> l3 : c^0 <= 0, cost: 1
	
	Propagated Equalities

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

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

	Original rule:
	l4 -> l0 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, 1-c^0 <= 0, cost: 1
	New rule:
	l4 -> l0 : 1-c^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l1 -> l4 : c^0'=c^post7, ox^0'=ox^post7, x^0'=x^post7, (c^0-c^post7 == 0 /\ 1-x^0 <= 0 /\ -ox^post7+ox^0 == 0 /\ 1+x^post7-x^0 == 0), cost: 1
	New rule:
	l1 -> l4 : c^0'=c^0, ox^0'=ox^0, x^0'=-1+x^0, (0 == 0 /\ 1-x^0 <= 0), cost: 1
	
		propagated equality c^post7 = c^0
		
		propagated equality ox^post7 = ox^0
		
		propagated equality x^post7 = -1+x^0
		
	Simplified Guard

	Original rule:
	l1 -> l4 : c^0'=c^0, ox^0'=ox^0, x^0'=-1+x^0, (0 == 0 /\ 1-x^0 <= 0), cost: 1
	New rule:
	l1 -> l4 : c^0'=c^0, ox^0'=ox^0, x^0'=-1+x^0, 1-x^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l1 -> l4 : c^0'=c^0, ox^0'=ox^0, x^0'=-1+x^0, 1-x^0 <= 0, cost: 1
	New rule:
	l1 -> l4 : x^0'=-1+x^0, 1-x^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l6 -> l1 : c^0'=c^post8, ox^0'=ox^post8, x^0'=x^post8, (ox^post9-ox^post8 == 0 /\ c^post9 <= 0 /\ x^0-x^post9 == 0 /\ -c^post9+c^0 == 0 /\ c^post9-c^post8 == 0 /\ -ox^post9+ox^0 == 0 /\ x^post9-x^post8 == 0), cost: 1
	New rule:
	l6 -> l1 : c^0'=c^post9, ox^0'=ox^post9, x^0'=x^post9, (0 == 0 /\ c^post9 <= 0 /\ x^0-x^post9 == 0 /\ -c^post9+c^0 == 0 /\ -ox^post9+ox^0 == 0), cost: 1
	
		propagated equality ox^post8 = ox^post9
		
		propagated equality c^post8 = c^post9
		
		propagated equality x^post8 = x^post9
		
	Propagated Equalities

	Original rule:
	l6 -> l1 : c^0'=c^post9, ox^0'=ox^post9, x^0'=x^post9, (0 == 0 /\ c^post9 <= 0 /\ x^0-x^post9 == 0 /\ -c^post9+c^0 == 0 /\ -ox^post9+ox^0 == 0), cost: 1
	New rule:
	l6 -> l1 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, (0 == 0 /\ c^0 <= 0), cost: 1
	
		propagated equality x^post9 = x^0
		
		propagated equality c^post9 = c^0
		
		propagated equality ox^post9 = ox^0
		
	Simplified Guard

	Original rule:
	l6 -> l1 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, (0 == 0 /\ c^0 <= 0), cost: 1
	New rule:
	l6 -> l1 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, c^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l6 -> l1 : c^0'=c^0, ox^0'=ox^0, x^0'=x^0, c^0 <= 0, cost: 1
	New rule:
	l6 -> l1 : c^0 <= 0, cost: 1

Step with 17

	Trace

	17[(c^0 <= 0)]
	
	Blocked

	[{}, {}]

Step with 16

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {}, {}]

Step with 14

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)]
	
	Blocked

	[{}, {}, {}, {}]

Step with 12

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 12[(c^0 <= 0)]
	
	Blocked

	[{}, {}, {}, {}, {}]

Accelerate

Start location: l6
Program variables: c^0 ox^0 x^0
  10: l0 -> l1 : 1+x^0-ox^0 <= 0, cost: 1
  11: l0 -> l2 : -x^0+ox^0 <= 0, cost: 1
  16: l1 -> l4 : x^0'=-1+x^0, 1-x^0 <= 0, cost: 1
  18: l1 -> l1 : x^0'=-n+x^0, (-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0), cost: 1
  12: l3 -> l1 : c^0 <= 0, cost: 1
  13: l3 -> l1 : c^0'=1, ox^0'=x^0, T, cost: 1
  14: l4 -> l3 : c^0 <= 0, cost: 1
  15: l4 -> l0 : 1-c^0 <= 0, cost: 1
  17: l6 -> l1 : c^0 <= 0, cost: 1

	Loop Acceleration

	Original rule:
	l1 -> l1 : x^0'=-1+x^0, (c^0 <= 0 /\ 1-x^0 <= 0), cost: 1
	New rule:
	l1 -> l1 : x^0'=-n+x^0, (-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0), cost: 1

		-1+x^0 >= 0 [0]: montonic decrease yields -n+x^0 >= 0
		
		-1+x^0 >= 0 [1]: eventual increase yields (1 <= 0 /\ -1+x^0 >= 0)
		
		-c^0 >= 0 [0]: monotonic increase yields -c^0 >= 0
		
		Replacement map: {-1+x^0 >= 0 -> -n+x^0 >= 0, -c^0 >= 0 -> -c^0 >= 0}

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)]
	
	Blocked

	[{}, {}, {18[T]}]

Step with 16

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}]

Step with 14

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {}]

Step with 12

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 12[(c^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {}, {}]

Covered

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)]
	
	Blocked

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

Step with 13

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T]
	
	Blocked

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

Acceleration Failed

marked recursive suffix as redundant

Acceleration Failed

marked recursive suffix as redundant

Step with 16

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)]
	
	Blocked

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

Acceleration Failed

marked recursive suffix as redundant

Step with 15

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {}, {14[T]}, {}]

Step with 10

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)], 10[(1+x^0-ox^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {}, {14[T]}, {11[T]}, {}]

Accelerate

Start location: l6
Program variables: c^0 ox^0 x^0
  10: l0 -> l1 : 1+x^0-ox^0 <= 0, cost: 1
  11: l0 -> l2 : -x^0+ox^0 <= 0, cost: 1
  16: l1 -> l4 : x^0'=-1+x^0, 1-x^0 <= 0, cost: 1
  18: l1 -> l1 : x^0'=-n+x^0, (-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0), cost: 1
  19: l1 -> l1 : x^0'=-n2+x^0, (-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0), cost: 1
  12: l3 -> l1 : c^0 <= 0, cost: 1
  13: l3 -> l1 : c^0'=1, ox^0'=x^0, T, cost: 1
  14: l4 -> l3 : c^0 <= 0, cost: 1
  15: l4 -> l0 : 1-c^0 <= 0, cost: 1
  17: l6 -> l1 : c^0 <= 0, cost: 1

	Loop Acceleration

	Original rule:
	l1 -> l1 : x^0'=-1+x^0, (x^0-ox^0 <= 0 /\ 1-x^0 <= 0 /\ 1-c^0 <= 0), cost: 1
	New rule:
	l1 -> l1 : x^0'=-n2+x^0, (-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0), cost: 1

		-1+x^0 >= 0 [0]: montonic decrease yields -n2+x^0 >= 0
		
		-1+x^0 >= 0 [1]: eventual increase yields (1 <= 0 /\ -1+x^0 >= 0)
		
		-x^0+ox^0 >= 0 [0]: monotonic increase yields -x^0+ox^0 >= 0
		
		-1+c^0 >= 0 [0]: monotonic increase yields -1+c^0 >= 0
		
		Replacement map: {-1+x^0 >= 0 -> -n2+x^0 >= 0, -x^0+ox^0 >= 0 -> -x^0+ox^0 >= 0, -1+c^0 >= 0 -> -1+c^0 >= 0}

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {}, {19[T]}]

Acceleration Failed

marked recursive suffix as redundant

Acceleration Failed

marked recursive suffix as redundant

Step with 16

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {}, {19[T]}, {}]

Acceleration Failed

marked recursive suffix as redundant

Step with 15

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {}, {19[T]}, {}, {}]

Step with 10

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)], 10[(1+x^0-ox^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {}, {19[T]}, {}, {}, {}]

Covered

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {}, {19[T]}, {}, {10[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {}, {19[T]}, {15[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {}, {16[T], 19[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {19[T]}]

Step with 16

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {19[T]}, {}]

Step with 15

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {19[T]}, {}, {}]

Step with 10

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)], 10[(1+x^0-ox^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {19[T]}, {}, {}, {}]

Covered

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {19[T]}, {}, {10[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {19[T]}, {15[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T]}, {16[T], 19[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {}, {12[T], 13[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {}, {18[T]}, {14[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 18[(-1+n >= 0 /\ -n+x^0 >= 0 /\ -c^0 >= 0)]
	
	Blocked

	[{}, {}, {16[T], 18[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)]
	
	Blocked

	[{}, {18[T]}]

Step with 16

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {}]

Step with 14

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}]

Step with 13

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {}]

Step with 16

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {}, {}]

Step with 15

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {}, {14[T]}, {}]

Step with 10

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)], 10[(1+x^0-ox^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {}, {14[T]}, {}, {}]

Covered

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {}, {14[T]}, {10[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {}, {14[T], 15[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {16[T]}]

Step with 19

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {16[T], 18[T]}, {19[T]}]

Step with 16

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {16[T], 18[T]}, {19[T]}, {}]

Step with 15

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {16[T], 18[T]}, {19[T]}, {}, {}]

Step with 10

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)], 10[(1+x^0-ox^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {16[T], 18[T]}, {19[T]}, {}, {}, {}]

Covered

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)], 16[(1-x^0 <= 0)], 15[(1-c^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {16[T], 18[T]}, {19[T]}, {}, {10[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {16[T], 18[T]}, {19[T]}, {15[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T], 19[(-1+n2 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+c^0 >= 0 /\ -n2+x^0 >= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {16[T], 18[T]}, {16[T], 19[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 13[T]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {}, {16[T], 18[T], 19[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {13[T]}]

Step with 12

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)], 12[(c^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {13[T]}, {}]

Covered

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)], 14[(c^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {15[T]}, {12[T], 13[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)], 16[(1-x^0 <= 0)]
	
	Blocked

	[{}, {18[T]}, {14[T], 15[T]}]

Backtrack

	Trace

	17[(c^0 <= 0)]
	
	Blocked

	[{}, {16[T], 18[T]}]

Backtrack

	Trace

	Blocked

	[{17[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b