unknown

Initial ITS

Start location: l6
Program variables: i10^0 i13^0 n12^0 n9^0 n^0 tmp^0 tmp___0^0
   0: l0 -> l1 : i10^0'=i10^post1, i13^0'=i13^post1, n12^0'=n12^post1, n9^0'=n9^post1, n^0'=n^post1, tmp^0'=tmp^post1, tmp___0^0'=tmp___0^post1, (-n12^post1+n12^0 == 0 /\ i13^0-i13^post1 == 0 /\ n9^0-n9^post1 == 0 /\ -n^post1+n^0 == 0 /\ tmp^0-tmp^post1 == 0 /\ -i10^post1+i10^0 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1
   4: l1 -> l4 : i10^0'=i10^post5, i13^0'=i13^post5, n12^0'=n12^post5, n9^0'=n9^post5, n^0'=n^post5, tmp^0'=tmp^post5, tmp___0^0'=tmp___0^post5, (0 == 0 /\ n9^0-n9^post5 == 0 /\ i10^0-i10^post5 == 0 /\ i13^post5 == 0 /\ n12^post5-n^0 == 0 /\ n9^0-i10^0 <= 0 /\ -n^post5+n^0 == 0 /\ -tmp^post5+tmp^0 == 0), cost: 1
   5: l1 -> l0 : i10^0'=i10^post6, i13^0'=i13^post6, n12^0'=n12^post6, n9^0'=n9^post6, n^0'=n^post6, tmp^0'=tmp^post6, tmp___0^0'=tmp___0^post6, (-1+i10^post6-i10^0 == 0 /\ -n^post6+n^0 == 0 /\ i13^0-i13^post6 == 0 /\ n9^0-n9^post6 == 0 /\ -tmp___0^post6+tmp___0^0 == 0 /\ n12^0-n12^post6 == 0 /\ tmp^0-tmp^post6 == 0 /\ 1-n9^0+i10^0 <= 0), cost: 1
   1: l2 -> l3 : i10^0'=i10^post2, i13^0'=i13^post2, n12^0'=n12^post2, n9^0'=n9^post2, n^0'=n^post2, tmp^0'=tmp^post2, tmp___0^0'=tmp___0^post2, (-i13^0+n12^0 <= 0 /\ -tmp^post2+tmp^0 == 0 /\ -i10^post2+i10^0 == 0 /\ tmp___0^0-tmp___0^post2 == 0 /\ i13^0-i13^post2 == 0 /\ -n^post2+n^0 == 0 /\ -n12^post2+n12^0 == 0 /\ n9^0-n9^post2 == 0), cost: 1
   2: l2 -> l4 : i10^0'=i10^post3, i13^0'=i13^post3, n12^0'=n12^post3, n9^0'=n9^post3, n^0'=n^post3, tmp^0'=tmp^post3, tmp___0^0'=tmp___0^post3, (-tmp^post3+tmp^0 == 0 /\ tmp___0^0-tmp___0^post3 == 0 /\ -n12^post3+n12^0 == 0 /\ -1-i13^0+i13^post3 == 0 /\ 1+i13^0-n12^0 <= 0 /\ -n^post3+n^0 == 0 /\ n9^0-n9^post3 == 0 /\ -i10^post3+i10^0 == 0), cost: 1
   3: l4 -> l2 : i10^0'=i10^post4, i13^0'=i13^post4, n12^0'=n12^post4, n9^0'=n9^post4, n^0'=n^post4, tmp^0'=tmp^post4, tmp___0^0'=tmp___0^post4, (i10^0-i10^post4 == 0 /\ -n12^post4+n12^0 == 0 /\ n9^0-n9^post4 == 0 /\ tmp___0^0-tmp___0^post4 == 0 /\ -n^post4+n^0 == 0 /\ -i13^post4+i13^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1
   6: l5 -> l0 : i10^0'=i10^post7, i13^0'=i13^post7, n12^0'=n12^post7, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^post7, (0 == 0 /\ -n12^post7+n12^0 == 0 /\ i13^0-i13^post7 == 0 /\ i10^post7 == 0 /\ tmp___0^0-tmp___0^post7 == 0), cost: 1
   7: l6 -> l5 : i10^0'=i10^post8, i13^0'=i13^post8, n12^0'=n12^post8, n9^0'=n9^post8, n^0'=n^post8, tmp^0'=tmp^post8, tmp___0^0'=tmp___0^post8, (i10^0-i10^post8 == 0 /\ -n12^post8+n12^0 == 0 /\ n9^0-n9^post8 == 0 /\ -tmp^post8+tmp^0 == 0 /\ -i13^post8+i13^0 == 0 /\ -n^post8+n^0 == 0 /\ tmp___0^0-tmp___0^post8 == 0), cost: 1

Chained Linear Paths

Start location: l6
Program variables: i10^0 i13^0 n12^0 n9^0 n^0 tmp^0 tmp___0^0
   0: l0 -> l1 : i10^0'=i10^post1, i13^0'=i13^post1, n12^0'=n12^post1, n9^0'=n9^post1, n^0'=n^post1, tmp^0'=tmp^post1, tmp___0^0'=tmp___0^post1, (-n12^post1+n12^0 == 0 /\ i13^0-i13^post1 == 0 /\ n9^0-n9^post1 == 0 /\ -n^post1+n^0 == 0 /\ tmp^0-tmp^post1 == 0 /\ -i10^post1+i10^0 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1
   4: l1 -> l4 : i10^0'=i10^post5, i13^0'=i13^post5, n12^0'=n12^post5, n9^0'=n9^post5, n^0'=n^post5, tmp^0'=tmp^post5, tmp___0^0'=tmp___0^post5, (0 == 0 /\ n9^0-n9^post5 == 0 /\ i10^0-i10^post5 == 0 /\ i13^post5 == 0 /\ n12^post5-n^0 == 0 /\ n9^0-i10^0 <= 0 /\ -n^post5+n^0 == 0 /\ -tmp^post5+tmp^0 == 0), cost: 1
   5: l1 -> l0 : i10^0'=i10^post6, i13^0'=i13^post6, n12^0'=n12^post6, n9^0'=n9^post6, n^0'=n^post6, tmp^0'=tmp^post6, tmp___0^0'=tmp___0^post6, (-1+i10^post6-i10^0 == 0 /\ -n^post6+n^0 == 0 /\ i13^0-i13^post6 == 0 /\ n9^0-n9^post6 == 0 /\ -tmp___0^post6+tmp___0^0 == 0 /\ n12^0-n12^post6 == 0 /\ tmp^0-tmp^post6 == 0 /\ 1-n9^0+i10^0 <= 0), cost: 1
   1: l2 -> l3 : i10^0'=i10^post2, i13^0'=i13^post2, n12^0'=n12^post2, n9^0'=n9^post2, n^0'=n^post2, tmp^0'=tmp^post2, tmp___0^0'=tmp___0^post2, (-i13^0+n12^0 <= 0 /\ -tmp^post2+tmp^0 == 0 /\ -i10^post2+i10^0 == 0 /\ tmp___0^0-tmp___0^post2 == 0 /\ i13^0-i13^post2 == 0 /\ -n^post2+n^0 == 0 /\ -n12^post2+n12^0 == 0 /\ n9^0-n9^post2 == 0), cost: 1
   2: l2 -> l4 : i10^0'=i10^post3, i13^0'=i13^post3, n12^0'=n12^post3, n9^0'=n9^post3, n^0'=n^post3, tmp^0'=tmp^post3, tmp___0^0'=tmp___0^post3, (-tmp^post3+tmp^0 == 0 /\ tmp___0^0-tmp___0^post3 == 0 /\ -n12^post3+n12^0 == 0 /\ -1-i13^0+i13^post3 == 0 /\ 1+i13^0-n12^0 <= 0 /\ -n^post3+n^0 == 0 /\ n9^0-n9^post3 == 0 /\ -i10^post3+i10^0 == 0), cost: 1
   3: l4 -> l2 : i10^0'=i10^post4, i13^0'=i13^post4, n12^0'=n12^post4, n9^0'=n9^post4, n^0'=n^post4, tmp^0'=tmp^post4, tmp___0^0'=tmp___0^post4, (i10^0-i10^post4 == 0 /\ -n12^post4+n12^0 == 0 /\ n9^0-n9^post4 == 0 /\ tmp___0^0-tmp___0^post4 == 0 /\ -n^post4+n^0 == 0 /\ -i13^post4+i13^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1
   8: l6 -> l0 : i10^0'=i10^post7, i13^0'=i13^post7, n12^0'=n12^post7, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^post7, (0 == 0 /\ i10^0-i10^post8 == 0 /\ -tmp___0^post7+tmp___0^post8 == 0 /\ -n12^post8+n12^0 == 0 /\ -n12^post7+n12^post8 == 0 /\ n9^0-n9^post8 == 0 /\ -tmp^post8+tmp^0 == 0 /\ -i13^post8+i13^0 == 0 /\ i10^post7 == 0 /\ -n^post8+n^0 == 0 /\ tmp___0^0-tmp___0^post8 == 0 /\ i13^post8-i13^post7 == 0), cost: 1

	Eliminating location l5 by chaining:

	Applied chaining

	First rule:
	l6 -> l5 : i10^0'=i10^post8, i13^0'=i13^post8, n12^0'=n12^post8, n9^0'=n9^post8, n^0'=n^post8, tmp^0'=tmp^post8, tmp___0^0'=tmp___0^post8, (i10^0-i10^post8 == 0 /\ -n12^post8+n12^0 == 0 /\ n9^0-n9^post8 == 0 /\ -tmp^post8+tmp^0 == 0 /\ -i13^post8+i13^0 == 0 /\ -n^post8+n^0 == 0 /\ tmp___0^0-tmp___0^post8 == 0), cost: 1
	Second rule:
	l5 -> l0 : i10^0'=i10^post7, i13^0'=i13^post7, n12^0'=n12^post7, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^post7, (0 == 0 /\ -n12^post7+n12^0 == 0 /\ i13^0-i13^post7 == 0 /\ i10^post7 == 0 /\ tmp___0^0-tmp___0^post7 == 0), cost: 1
	New rule:
	l6 -> l0 : i10^0'=i10^post7, i13^0'=i13^post7, n12^0'=n12^post7, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^post7, (0 == 0 /\ i10^0-i10^post8 == 0 /\ -tmp___0^post7+tmp___0^post8 == 0 /\ -n12^post8+n12^0 == 0 /\ -n12^post7+n12^post8 == 0 /\ n9^0-n9^post8 == 0 /\ -tmp^post8+tmp^0 == 0 /\ -i13^post8+i13^0 == 0 /\ i10^post7 == 0 /\ -n^post8+n^0 == 0 /\ tmp___0^0-tmp___0^post8 == 0 /\ i13^post8-i13^post7 == 0), cost: 1
	
	Applied deletion

	Removed the following rules: 6 7

Simplified Transitions

Start location: l6
Program variables: i10^0 i13^0 n12^0 n9^0 n^0 tmp^0 tmp___0^0
   9: l0 -> l1 : T, cost: 1
  13: l1 -> l4 : i13^0'=0, n12^0'=n^0, tmp___0^0'=tmp___0^post5, n9^0-i10^0 <= 0, cost: 1
  14: l1 -> l0 : i10^0'=1+i10^0, 1-n9^0+i10^0 <= 0, cost: 1
  10: l2 -> l3 : -i13^0+n12^0 <= 0, cost: 1
  11: l2 -> l4 : i13^0'=1+i13^0, 1+i13^0-n12^0 <= 0, cost: 1
  12: l4 -> l2 : T, cost: 1
  15: l6 -> l0 : i10^0'=0, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, T, cost: 1

	Propagated Equalities

	Original rule:
	l0 -> l1 : i10^0'=i10^post1, i13^0'=i13^post1, n12^0'=n12^post1, n9^0'=n9^post1, n^0'=n^post1, tmp^0'=tmp^post1, tmp___0^0'=tmp___0^post1, (-n12^post1+n12^0 == 0 /\ i13^0-i13^post1 == 0 /\ n9^0-n9^post1 == 0 /\ -n^post1+n^0 == 0 /\ tmp^0-tmp^post1 == 0 /\ -i10^post1+i10^0 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1
	New rule:
	l0 -> l1 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, 0 == 0, cost: 1
	
		propagated equality n12^post1 = n12^0
		
		propagated equality i13^post1 = i13^0
		
		propagated equality n9^post1 = n9^0
		
		propagated equality n^post1 = n^0
		
		propagated equality tmp^post1 = tmp^0
		
		propagated equality i10^post1 = i10^0
		
		propagated equality tmp___0^post1 = tmp___0^0
		
	Simplified Guard

	Original rule:
	l0 -> l1 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, 0 == 0, cost: 1
	New rule:
	l0 -> l1 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l0 -> l1 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, T, cost: 1
	New rule:
	l0 -> l1 : T, cost: 1
	
	Propagated Equalities

	Original rule:
	l2 -> l3 : i10^0'=i10^post2, i13^0'=i13^post2, n12^0'=n12^post2, n9^0'=n9^post2, n^0'=n^post2, tmp^0'=tmp^post2, tmp___0^0'=tmp___0^post2, (-i13^0+n12^0 <= 0 /\ -tmp^post2+tmp^0 == 0 /\ -i10^post2+i10^0 == 0 /\ tmp___0^0-tmp___0^post2 == 0 /\ i13^0-i13^post2 == 0 /\ -n^post2+n^0 == 0 /\ -n12^post2+n12^0 == 0 /\ n9^0-n9^post2 == 0), cost: 1
	New rule:
	l2 -> l3 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, (0 == 0 /\ -i13^0+n12^0 <= 0), cost: 1
	
		propagated equality tmp^post2 = tmp^0
		
		propagated equality i10^post2 = i10^0
		
		propagated equality tmp___0^post2 = tmp___0^0
		
		propagated equality i13^post2 = i13^0
		
		propagated equality n^post2 = n^0
		
		propagated equality n12^post2 = n12^0
		
		propagated equality n9^post2 = n9^0
		
	Simplified Guard

	Original rule:
	l2 -> l3 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, (0 == 0 /\ -i13^0+n12^0 <= 0), cost: 1
	New rule:
	l2 -> l3 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, -i13^0+n12^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l2 -> l3 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, -i13^0+n12^0 <= 0, cost: 1
	New rule:
	l2 -> l3 : -i13^0+n12^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l2 -> l4 : i10^0'=i10^post3, i13^0'=i13^post3, n12^0'=n12^post3, n9^0'=n9^post3, n^0'=n^post3, tmp^0'=tmp^post3, tmp___0^0'=tmp___0^post3, (-tmp^post3+tmp^0 == 0 /\ tmp___0^0-tmp___0^post3 == 0 /\ -n12^post3+n12^0 == 0 /\ -1-i13^0+i13^post3 == 0 /\ 1+i13^0-n12^0 <= 0 /\ -n^post3+n^0 == 0 /\ n9^0-n9^post3 == 0 /\ -i10^post3+i10^0 == 0), cost: 1
	New rule:
	l2 -> l4 : i10^0'=i10^0, i13^0'=1+i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, (0 == 0 /\ 1+i13^0-n12^0 <= 0), cost: 1
	
		propagated equality tmp^post3 = tmp^0
		
		propagated equality tmp___0^post3 = tmp___0^0
		
		propagated equality n12^post3 = n12^0
		
		propagated equality i13^post3 = 1+i13^0
		
		propagated equality n^post3 = n^0
		
		propagated equality n9^post3 = n9^0
		
		propagated equality i10^post3 = i10^0
		
	Simplified Guard

	Original rule:
	l2 -> l4 : i10^0'=i10^0, i13^0'=1+i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, (0 == 0 /\ 1+i13^0-n12^0 <= 0), cost: 1
	New rule:
	l2 -> l4 : i10^0'=i10^0, i13^0'=1+i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, 1+i13^0-n12^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l2 -> l4 : i10^0'=i10^0, i13^0'=1+i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, 1+i13^0-n12^0 <= 0, cost: 1
	New rule:
	l2 -> l4 : i13^0'=1+i13^0, 1+i13^0-n12^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l4 -> l2 : i10^0'=i10^post4, i13^0'=i13^post4, n12^0'=n12^post4, n9^0'=n9^post4, n^0'=n^post4, tmp^0'=tmp^post4, tmp___0^0'=tmp___0^post4, (i10^0-i10^post4 == 0 /\ -n12^post4+n12^0 == 0 /\ n9^0-n9^post4 == 0 /\ tmp___0^0-tmp___0^post4 == 0 /\ -n^post4+n^0 == 0 /\ -i13^post4+i13^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1
	New rule:
	l4 -> l2 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, 0 == 0, cost: 1
	
		propagated equality i10^post4 = i10^0
		
		propagated equality n12^post4 = n12^0
		
		propagated equality n9^post4 = n9^0
		
		propagated equality tmp___0^post4 = tmp___0^0
		
		propagated equality n^post4 = n^0
		
		propagated equality i13^post4 = i13^0
		
		propagated equality tmp^post4 = tmp^0
		
	Simplified Guard

	Original rule:
	l4 -> l2 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, 0 == 0, cost: 1
	New rule:
	l4 -> l2 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l4 -> l2 : i10^0'=i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, T, cost: 1
	New rule:
	l4 -> l2 : T, cost: 1
	
	Propagated Equalities

	Original rule:
	l1 -> l4 : i10^0'=i10^post5, i13^0'=i13^post5, n12^0'=n12^post5, n9^0'=n9^post5, n^0'=n^post5, tmp^0'=tmp^post5, tmp___0^0'=tmp___0^post5, (0 == 0 /\ n9^0-n9^post5 == 0 /\ i10^0-i10^post5 == 0 /\ i13^post5 == 0 /\ n12^post5-n^0 == 0 /\ n9^0-i10^0 <= 0 /\ -n^post5+n^0 == 0 /\ -tmp^post5+tmp^0 == 0), cost: 1
	New rule:
	l1 -> l4 : i10^0'=i10^0, i13^0'=0, n12^0'=n^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^post5, (0 == 0 /\ n9^0-i10^0 <= 0), cost: 1
	
		propagated equality n9^post5 = n9^0
		
		propagated equality i10^post5 = i10^0
		
		propagated equality i13^post5 = 0
		
		propagated equality n12^post5 = n^0
		
		propagated equality n^post5 = n^0
		
		propagated equality tmp^post5 = tmp^0
		
	Simplified Guard

	Original rule:
	l1 -> l4 : i10^0'=i10^0, i13^0'=0, n12^0'=n^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^post5, (0 == 0 /\ n9^0-i10^0 <= 0), cost: 1
	New rule:
	l1 -> l4 : i10^0'=i10^0, i13^0'=0, n12^0'=n^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^post5, n9^0-i10^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l1 -> l4 : i10^0'=i10^0, i13^0'=0, n12^0'=n^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^post5, n9^0-i10^0 <= 0, cost: 1
	New rule:
	l1 -> l4 : i13^0'=0, n12^0'=n^0, tmp___0^0'=tmp___0^post5, n9^0-i10^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l1 -> l0 : i10^0'=i10^post6, i13^0'=i13^post6, n12^0'=n12^post6, n9^0'=n9^post6, n^0'=n^post6, tmp^0'=tmp^post6, tmp___0^0'=tmp___0^post6, (-1+i10^post6-i10^0 == 0 /\ -n^post6+n^0 == 0 /\ i13^0-i13^post6 == 0 /\ n9^0-n9^post6 == 0 /\ -tmp___0^post6+tmp___0^0 == 0 /\ n12^0-n12^post6 == 0 /\ tmp^0-tmp^post6 == 0 /\ 1-n9^0+i10^0 <= 0), cost: 1
	New rule:
	l1 -> l0 : i10^0'=1+i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, (0 == 0 /\ 1-n9^0+i10^0 <= 0), cost: 1
	
		propagated equality i10^post6 = 1+i10^0
		
		propagated equality n^post6 = n^0
		
		propagated equality i13^post6 = i13^0
		
		propagated equality n9^post6 = n9^0
		
		propagated equality tmp___0^post6 = tmp___0^0
		
		propagated equality n12^post6 = n12^0
		
		propagated equality tmp^post6 = tmp^0
		
	Simplified Guard

	Original rule:
	l1 -> l0 : i10^0'=1+i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, (0 == 0 /\ 1-n9^0+i10^0 <= 0), cost: 1
	New rule:
	l1 -> l0 : i10^0'=1+i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, 1-n9^0+i10^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l1 -> l0 : i10^0'=1+i10^0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^0, n^0'=n^0, tmp^0'=tmp^0, tmp___0^0'=tmp___0^0, 1-n9^0+i10^0 <= 0, cost: 1
	New rule:
	l1 -> l0 : i10^0'=1+i10^0, 1-n9^0+i10^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l6 -> l0 : i10^0'=i10^post7, i13^0'=i13^post7, n12^0'=n12^post7, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^post7, (0 == 0 /\ i10^0-i10^post8 == 0 /\ -tmp___0^post7+tmp___0^post8 == 0 /\ -n12^post8+n12^0 == 0 /\ -n12^post7+n12^post8 == 0 /\ n9^0-n9^post8 == 0 /\ -tmp^post8+tmp^0 == 0 /\ -i13^post8+i13^0 == 0 /\ i10^post7 == 0 /\ -n^post8+n^0 == 0 /\ tmp___0^0-tmp___0^post8 == 0 /\ i13^post8-i13^post7 == 0), cost: 1
	New rule:
	l6 -> l0 : i10^0'=0, i13^0'=i13^post8, n12^0'=n12^post8, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^post8, (0 == 0 /\ i10^0-i10^post8 == 0 /\ -n12^post8+n12^0 == 0 /\ n9^0-n9^post8 == 0 /\ -tmp^post8+tmp^0 == 0 /\ -i13^post8+i13^0 == 0 /\ -n^post8+n^0 == 0 /\ tmp___0^0-tmp___0^post8 == 0), cost: 1
	
		propagated equality tmp___0^post7 = tmp___0^post8
		
		propagated equality n12^post7 = n12^post8
		
		propagated equality i10^post7 = 0
		
		propagated equality i13^post7 = i13^post8
		
	Propagated Equalities

	Original rule:
	l6 -> l0 : i10^0'=0, i13^0'=i13^post8, n12^0'=n12^post8, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^post8, (0 == 0 /\ i10^0-i10^post8 == 0 /\ -n12^post8+n12^0 == 0 /\ n9^0-n9^post8 == 0 /\ -tmp^post8+tmp^0 == 0 /\ -i13^post8+i13^0 == 0 /\ -n^post8+n^0 == 0 /\ tmp___0^0-tmp___0^post8 == 0), cost: 1
	New rule:
	l6 -> l0 : i10^0'=0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^0, 0 == 0, cost: 1
	
		propagated equality i10^post8 = i10^0
		
		propagated equality n12^post8 = n12^0
		
		propagated equality n9^post8 = n9^0
		
		propagated equality tmp^post8 = tmp^0
		
		propagated equality i13^post8 = i13^0
		
		propagated equality n^post8 = n^0
		
		propagated equality tmp___0^post8 = tmp___0^0
		
	Simplified Guard

	Original rule:
	l6 -> l0 : i10^0'=0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^0, 0 == 0, cost: 1
	New rule:
	l6 -> l0 : i10^0'=0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l6 -> l0 : i10^0'=0, i13^0'=i13^0, n12^0'=n12^0, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, tmp___0^0'=tmp___0^0, T, cost: 1
	New rule:
	l6 -> l0 : i10^0'=0, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, T, cost: 1

Step with 15

	Trace

	15[T]
	
	Blocked

	[{}, {}]

Step with 9

	Trace

	15[T], 9[T]
	
	Blocked

	[{}, {}, {}]

Step with 13

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)]
	
	Blocked

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

Step with 12

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

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

Step with 10

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T], 10[(-i13^0+n12^0 <= 0)]
	
	Blocked

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

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

	[{}, {}, {}, {}, {10[T]}]

Step with 11

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T], 11[(1+i13^0-n12^0 <= 0)]
	
	Blocked

	[{}, {}, {}, {}, {10[T]}, {}]

Accelerate

Start location: l6
Program variables: i10^0 i13^0 n12^0 n9^0 n^0 tmp^0 tmp___0^0
   9: l0 -> l1 : T, cost: 1
  13: l1 -> l4 : i13^0'=0, n12^0'=n^0, tmp___0^0'=tmp___0^post5, n9^0-i10^0 <= 0, cost: 1
  14: l1 -> l0 : i10^0'=1+i10^0, 1-n9^0+i10^0 <= 0, cost: 1
  10: l2 -> l3 : -i13^0+n12^0 <= 0, cost: 1
  11: l2 -> l4 : i13^0'=1+i13^0, 1+i13^0-n12^0 <= 0, cost: 1
  12: l4 -> l2 : T, cost: 1
  16: l4 -> l4 : i13^0'=n+i13^0, (-1+n >= 0 /\ -n-i13^0+n12^0 >= 0), cost: 1
  15: l6 -> l0 : i10^0'=0, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, T, cost: 1

	Loop Acceleration

	Original rule:
	l4 -> l4 : i13^0'=1+i13^0, 1+i13^0-n12^0 <= 0, cost: 1
	New rule:
	l4 -> l4 : i13^0'=n+i13^0, (-1+n >= 0 /\ -n-i13^0+n12^0 >= 0), cost: 1

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

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)]
	
	Blocked

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

Step with 12

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T]
	
	Blocked

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

Step with 11

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T], 11[(1+i13^0-n12^0 <= 0)]
	
	Blocked

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

Covered

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T]
	
	Blocked

	[{}, {}, {}, {}, {16[T]}, {11[T]}]

Step with 10

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T], 10[(-i13^0+n12^0 <= 0)]
	
	Blocked

	[{}, {}, {}, {}, {16[T]}, {11[T]}, {}]

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T]
	
	Blocked

	[{}, {}, {}, {}, {16[T]}, {10[T], 11[T]}]

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)]
	
	Blocked

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

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)]
	
	Blocked

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

Step with 12

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

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

Step with 10

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T], 10[(-i13^0+n12^0 <= 0)]
	
	Blocked

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

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

	[{}, {}, {}, {16[T]}, {10[T]}]

Step with 11

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T], 11[(1+i13^0-n12^0 <= 0)]
	
	Blocked

	[{}, {}, {}, {16[T]}, {10[T]}, {}]

Covered

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

	[{}, {}, {}, {16[T]}, {10[T], 11[T]}]

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)]
	
	Blocked

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

Backtrack

	Trace

	15[T], 9[T]
	
	Blocked

	[{}, {}, {13[T]}]

Step with 14

	Trace

	15[T], 9[T], 14[(1-n9^0+i10^0 <= 0)]
	
	Blocked

	[{}, {}, {13[T]}, {}]

Accelerate

Start location: l6
Program variables: i10^0 i13^0 n12^0 n9^0 n^0 tmp^0 tmp___0^0
   9: l0 -> l1 : T, cost: 1
  17: l0 -> l0 : i10^0'=n2+i10^0, (-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0), cost: 1
  13: l1 -> l4 : i13^0'=0, n12^0'=n^0, tmp___0^0'=tmp___0^post5, n9^0-i10^0 <= 0, cost: 1
  14: l1 -> l0 : i10^0'=1+i10^0, 1-n9^0+i10^0 <= 0, cost: 1
  10: l2 -> l3 : -i13^0+n12^0 <= 0, cost: 1
  11: l2 -> l4 : i13^0'=1+i13^0, 1+i13^0-n12^0 <= 0, cost: 1
  12: l4 -> l2 : T, cost: 1
  16: l4 -> l4 : i13^0'=n+i13^0, (-1+n >= 0 /\ -n-i13^0+n12^0 >= 0), cost: 1
  15: l6 -> l0 : i10^0'=0, n9^0'=n9^post7, n^0'=n^post7, tmp^0'=tmp^post7, T, cost: 1

	Loop Acceleration

	Original rule:
	l0 -> l0 : i10^0'=1+i10^0, 1-n9^0+i10^0 <= 0, cost: 1
	New rule:
	l0 -> l0 : i10^0'=n2+i10^0, (-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0), cost: 1

		-1+n9^0-i10^0 >= 0 [0]: montonic decrease yields -n2+n9^0-i10^0 >= 0
		
		-1+n9^0-i10^0 >= 0 [1]: eventual increase yields (1 <= 0 /\ -1+n9^0-i10^0 >= 0)
		
		Replacement map: {-1+n9^0-i10^0 >= 0 -> -n2+n9^0-i10^0 >= 0}

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)]
	
	Blocked

	[{}, {}, {17[T]}]

Step with 9

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T]
	
	Blocked

	[{}, {}, {17[T]}, {}]

Step with 14

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 14[(1-n9^0+i10^0 <= 0)]
	
	Blocked

	[{}, {}, {17[T]}, {}, {}]

Covered

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}]

Step with 13

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {}]

Step with 12

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {}, {}]

Step with 11

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T], 11[(1+i13^0-n12^0 <= 0)]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {}, {}, {}]

Covered

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {}, {11[T]}]

Step with 10

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T], 10[(-i13^0+n12^0 <= 0)]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {}, {11[T]}, {}]

Backtrack

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {}, {10[T], 11[T]}]

Backtrack

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)]
	
	Blocked

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

Step with 16

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {12[T]}, {16[T]}]

Step with 12

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {12[T]}, {16[T]}, {}]

Step with 10

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T], 10[(-i13^0+n12^0 <= 0)]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {12[T]}, {16[T]}, {}, {}]

Backtrack

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {12[T]}, {16[T]}, {10[T]}]

Step with 11

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T], 11[(1+i13^0-n12^0 <= 0)]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {12[T]}, {16[T]}, {10[T]}, {}]

Covered

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {12[T]}, {16[T]}, {10[T], 11[T]}]

Backtrack

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {12[T]}, {12[T], 16[T]}]

Backtrack

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T], 13[(n9^0-i10^0 <= 0)]
	
	Blocked

	[{}, {}, {17[T]}, {14[T]}, {12[T], 16[T]}]

Backtrack

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)], 9[T]
	
	Blocked

	[{}, {}, {17[T]}, {13[T], 14[T]}]

Backtrack

	Trace

	15[T], 17[(-1+n2 >= 0 /\ -n2+n9^0-i10^0 >= 0)]
	
	Blocked

	[{}, {}, {9[T], 17[T]}]

Backtrack

	Trace

	15[T]
	
	Blocked

	[{}, {17[T]}]

Step with 9

	Trace

	15[T], 9[T]
	
	Blocked

	[{}, {17[T]}, {}]

Step with 13

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)]
	
	Blocked

	[{}, {17[T]}, {}, {}]

Step with 12

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

	[{}, {17[T]}, {}, {}, {}]

Step with 11

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T], 11[(1+i13^0-n12^0 <= 0)]
	
	Blocked

	[{}, {17[T]}, {}, {}, {}, {}]

Covered

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

	[{}, {17[T]}, {}, {}, {11[T]}]

Step with 10

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T], 10[(-i13^0+n12^0 <= 0)]
	
	Blocked

	[{}, {17[T]}, {}, {}, {11[T]}, {}]

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 12[T]
	
	Blocked

	[{}, {17[T]}, {}, {}, {10[T], 11[T]}]

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)]
	
	Blocked

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

Step with 16

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)]
	
	Blocked

	[{}, {17[T]}, {}, {12[T]}, {16[T]}]

Step with 12

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T]
	
	Blocked

	[{}, {17[T]}, {}, {12[T]}, {16[T]}, {}]

Step with 10

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T], 10[(-i13^0+n12^0 <= 0)]
	
	Blocked

	[{}, {17[T]}, {}, {12[T]}, {16[T]}, {}, {}]

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T]
	
	Blocked

	[{}, {17[T]}, {}, {12[T]}, {16[T]}, {10[T]}]

Step with 11

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T], 11[(1+i13^0-n12^0 <= 0)]
	
	Blocked

	[{}, {17[T]}, {}, {12[T]}, {16[T]}, {10[T]}, {}]

Covered

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)], 12[T]
	
	Blocked

	[{}, {17[T]}, {}, {12[T]}, {16[T]}, {10[T], 11[T]}]

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)], 16[(-1+n >= 0 /\ -n-i13^0+n12^0 >= 0)]
	
	Blocked

	[{}, {17[T]}, {}, {12[T]}, {12[T], 16[T]}]

Backtrack

	Trace

	15[T], 9[T], 13[(n9^0-i10^0 <= 0)]
	
	Blocked

	[{}, {17[T]}, {}, {12[T], 16[T]}]

Backtrack

	Trace

	15[T], 9[T]
	
	Blocked

	[{}, {17[T]}, {13[T]}]

Step with 14

	Trace

	15[T], 9[T], 14[(1-n9^0+i10^0 <= 0)]
	
	Blocked

	[{}, {17[T]}, {13[T]}, {}]

Covered

	Trace

	15[T], 9[T]
	
	Blocked

	[{}, {17[T]}, {13[T], 14[T]}]

Backtrack

	Trace

	15[T]
	
	Blocked

	[{}, {9[T], 17[T]}]

Backtrack

	Trace

	Blocked

	[{15[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b