unknown

Initial ITS

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

Chained Linear Paths

Start location: l4
Program variables: e^0 n^0
   7: l0 -> l0 : e^0'=e^post2, n^0'=n^post2, (e^post1-e^post2 == 0 /\ -1+e^post1-e^0 == 0 /\ 1-e^0 <= 0 /\ -11+n^post1-n^0 == 0 /\ -n^post2+n^post1 == 0 /\ -100+n^0 <= 0), cost: 1
   8: l0 -> l0 : e^0'=e^post4, n^0'=n^post4, (-n^post4+n^post3 == 0 /\ 1-e^0 <= 0 /\ 10+n^post3-n^0 == 0 /\ -e^post4+e^post3 == 0 /\ 101-n^0 <= 0 /\ 1+e^post3-e^0 == 0), cost: 1
   6: l4 -> l0 : e^0'=e^post5, n^0'=n^post5, (0 == 0 /\ -n^post6+n^0 == 0 /\ -1+e^post5 == 0 /\ -e^post6+e^0 == 0), cost: 1

	Eliminating location l3 by chaining:

	Applied chaining

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

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

	Applied chaining

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

	Removed the following rules: 0 1
	
	Eliminating location l2 by chaining:

	Applied chaining

	First rule:
	l0 -> l2 : e^0'=e^post3, n^0'=n^post3, (1-e^0 <= 0 /\ 10+n^post3-n^0 == 0 /\ 101-n^0 <= 0 /\ 1+e^post3-e^0 == 0), cost: 1
	Second rule:
	l2 -> l0 : e^0'=e^post4, n^0'=n^post4, (-e^post4+e^0 == 0 /\ -n^post4+n^0 == 0), cost: 1
	New rule:
	l0 -> l0 : e^0'=e^post4, n^0'=n^post4, (-n^post4+n^post3 == 0 /\ 1-e^0 <= 0 /\ 10+n^post3-n^0 == 0 /\ -e^post4+e^post3 == 0 /\ 101-n^0 <= 0 /\ 1+e^post3-e^0 == 0), cost: 1
	
	Applied deletion

	Removed the following rules: 2 3

Simplified Transitions

Start location: l4
Program variables: e^0 n^0
  10: l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (1-e^0 <= 0 /\ -100+n^0 <= 0), cost: 1
  11: l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (1-e^0 <= 0 /\ 101-n^0 <= 0), cost: 1
   9: l4 -> l0 : e^0'=1, n^0'=n^post5, T, cost: 1

	Propagated Equalities

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

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

	Original rule:
	l4 -> l0 : e^0'=1, n^0'=n^post5, 0 == 0, cost: 1
	New rule:
	l4 -> l0 : e^0'=1, n^0'=n^post5, T, cost: 1
	
	Propagated Equalities

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

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

	Original rule:
	l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (0 == 0 /\ 1-e^0 <= 0 /\ -100+n^0 <= 0), cost: 1
	New rule:
	l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (1-e^0 <= 0 /\ -100+n^0 <= 0), cost: 1
	
	Propagated Equalities

	Original rule:
	l0 -> l0 : e^0'=e^post4, n^0'=n^post4, (-n^post4+n^post3 == 0 /\ 1-e^0 <= 0 /\ 10+n^post3-n^0 == 0 /\ -e^post4+e^post3 == 0 /\ 101-n^0 <= 0 /\ 1+e^post3-e^0 == 0), cost: 1
	New rule:
	l0 -> l0 : e^0'=e^post3, n^0'=n^post3, (0 == 0 /\ 1-e^0 <= 0 /\ 10+n^post3-n^0 == 0 /\ 101-n^0 <= 0 /\ 1+e^post3-e^0 == 0), cost: 1
	
		propagated equality n^post4 = n^post3
		
		propagated equality e^post4 = e^post3
		
	Propagated Equalities

	Original rule:
	l0 -> l0 : e^0'=e^post3, n^0'=n^post3, (0 == 0 /\ 1-e^0 <= 0 /\ 10+n^post3-n^0 == 0 /\ 101-n^0 <= 0 /\ 1+e^post3-e^0 == 0), cost: 1
	New rule:
	l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (0 == 0 /\ 1-e^0 <= 0 /\ 101-n^0 <= 0), cost: 1
	
		propagated equality n^post3 = -10+n^0
		
		propagated equality e^post3 = -1+e^0
		
	Simplified Guard

	Original rule:
	l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (0 == 0 /\ 1-e^0 <= 0 /\ 101-n^0 <= 0), cost: 1
	New rule:
	l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (1-e^0 <= 0 /\ 101-n^0 <= 0), cost: 1

Step with 9

	Trace

	9[T]
	
	Blocked

	[{}, {}]

Step with 10

	Trace

	9[T], 10[(1-e^0 <= 0 /\ -100+n^0 <= 0)]
	
	Blocked

	[{}, {}, {}]

Accelerate

Start location: l4
Program variables: e^0 n^0
  10: l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (1-e^0 <= 0 /\ -100+n^0 <= 0), cost: 1
  11: l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (1-e^0 <= 0 /\ 101-n^0 <= 0), cost: 1
  12: l0 -> l0 : e^0'=n+e^0, n^0'=11*n+n^0, (-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0), cost: 1
   9: l4 -> l0 : e^0'=1, n^0'=n^post5, T, cost: 1

	Loop Acceleration

	Original rule:
	l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (1-e^0 <= 0 /\ -100+n^0 <= 0), cost: 1
	New rule:
	l0 -> l0 : e^0'=n+e^0, n^0'=11*n+n^0, (-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0), cost: 1

		-1+e^0 >= 0 [0]: monotonic increase yields -1+e^0 >= 0
		
		100-n^0 >= 0 [0]: montonic decrease yields 111-11*n-n^0 >= 0
		
		100-n^0 >= 0 [1]: eventual increase yields (11 <= 0 /\ 100-n^0 >= 0)
		
		Replacement map: {-1+e^0 >= 0 -> -1+e^0 >= 0, 100-n^0 >= 0 -> 111-11*n-n^0 >= 0}

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)]
	
	Blocked

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

Step with 11

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)], 11[(1-e^0 <= 0 /\ 101-n^0 <= 0)]
	
	Blocked

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

Accelerate

Start location: l4
Program variables: e^0 n^0
  10: l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (1-e^0 <= 0 /\ -100+n^0 <= 0), cost: 1
  11: l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (1-e^0 <= 0 /\ 101-n^0 <= 0), cost: 1
  12: l0 -> l0 : e^0'=n+e^0, n^0'=11*n+n^0, (-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0), cost: 1
  13: l0 -> l0 : e^0'=-n2+e^0, n^0'=-10*n2+n^0, (-n2+e^0 >= 0 /\ -91-10*n2+n^0 >= 0 /\ -1+n2 >= 0), cost: 1
   9: l4 -> l0 : e^0'=1, n^0'=n^post5, T, cost: 1

	Loop Acceleration

	Original rule:
	l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (1-e^0 <= 0 /\ 101-n^0 <= 0), cost: 1
	New rule:
	l0 -> l0 : e^0'=-n2+e^0, n^0'=-10*n2+n^0, (-n2+e^0 >= 0 /\ -91-10*n2+n^0 >= 0 /\ -1+n2 >= 0), cost: 1

		-101+n^0 >= 0 [0]: montonic decrease yields -91-10*n2+n^0 >= 0
		
		-101+n^0 >= 0 [1]: eventual increase yields (-101+n^0 >= 0 /\ 10 <= 0)
		
		-1+e^0 >= 0 [0]: montonic decrease yields -n2+e^0 >= 0
		
		-1+e^0 >= 0 [1]: eventual increase yields (1 <= 0 /\ -1+e^0 >= 0)
		
		Replacement map: {-101+n^0 >= 0 -> -91-10*n2+n^0 >= 0, -1+e^0 >= 0 -> -n2+e^0 >= 0}

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)], 13[(-n2+e^0 >= 0 /\ -91-10*n2+n^0 >= 0 /\ -1+n2 >= 0)]
	
	Blocked

	[{}, {}, {10[T], 12[T]}, {11[T], 13[T]}]

Accelerate

Start location: l4
Program variables: e^0 n^0
  10: l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (1-e^0 <= 0 /\ -100+n^0 <= 0), cost: 1
  11: l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (1-e^0 <= 0 /\ 101-n^0 <= 0), cost: 1
  12: l0 -> l0 : e^0'=n+e^0, n^0'=11*n+n^0, (-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0), cost: 1
  13: l0 -> l0 : e^0'=-n2+e^0, n^0'=-10*n2+n^0, (-n2+e^0 >= 0 /\ -91-10*n2+n^0 >= 0 /\ -1+n2 >= 0), cost: 1
  14: l0 -> l0 : e^0'=-n3*n2+n1*n3+e^0, n^0'=-10*n3*n2+11*n1*n3+n^0, (n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0), cost: 1
   9: l4 -> l0 : e^0'=1, n^0'=n^post5, T, cost: 1

	Loop Acceleration

	Original rule:
	l0 -> l0 : e^0'=n1-n2+e^0, n^0'=11*n1-10*n2+n^0, (-91+11*n1-10*n2+n^0 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ n1-n2+e^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0), cost: 1
	New rule:
	l0 -> l0 : e^0'=-n3*n2+n1*n3+e^0, n^0'=-10*n3*n2+11*n1*n3+n^0, (n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0), cost: 1

		-91+11*n1-10*n2+n^0 >= 0 [0]: eventual decrease yields (-91+11*n1-10*n2+n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0)
		
		-91+11*n1-10*n2+n^0 >= 0 [1]: eventual increase yields (-91+11*n1-10*n2+n^0 >= 0 /\ -11*n1+10*n2 <= 0)
		
		-1+n1 >= 0 [0]: monotonic increase yields -1+n1 >= 0
		
		-1+e^0 >= 0 [0]: eventual decrease yields (-1+e^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)
		
		-1+e^0 >= 0 [1]: eventual increase yields (-1+e^0 >= 0 /\ -n1+n2 <= 0)
		
		n1-n2+e^0 >= 0 [0]: montonic decrease yields n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0, dependencies: -1+e^0 >= 0
		
		n1-n2+e^0 >= 0 [1]: eventual increase yields (n1-n2+e^0 >= 0 /\ -n1+n2 <= 0)
		
		-1+n2 >= 0 [0]: monotonic increase yields -1+n2 >= 0
		
		111-11*n1-n^0 >= 0 [0]: eventual decrease yields (111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ 111-11*n1-n^0 >= 0)
		
		111-11*n1-n^0 >= 0 [1]: eventual increase yields (11*n1-10*n2 <= 0 /\ 111-11*n1-n^0 >= 0)
		
		Replacement map: {-91+11*n1-10*n2+n^0 >= 0 -> (-91+11*n1-10*n2+n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0), -1+n1 >= 0 -> -1+n1 >= 0, -1+e^0 >= 0 -> (-1+e^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0), n1-n2+e^0 >= 0 -> n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0, -1+n2 >= 0 -> -1+n2 >= 0, 111-11*n1-n^0 >= 0 -> (111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ 111-11*n1-n^0 >= 0)}

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)]
	
	Blocked

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

Step with 10

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)], 10[(1-e^0 <= 0 /\ -100+n^0 <= 0)]
	
	Blocked

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

Covered

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)]
	
	Blocked

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

Step with 11

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)], 11[(1-e^0 <= 0 /\ 101-n^0 <= 0)]
	
	Blocked

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

Covered

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)]
	
	Blocked

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

Step with 12

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)]
	
	Blocked

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

Acceleration Failed

marked recursive suffix as redundant

Step with 13

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)], 13[(-n2+e^0 >= 0 /\ -91-10*n2+n^0 >= 0 /\ -1+n2 >= 0)]
	
	Blocked

	[{}, {}, {10[T], 11[T], 14[T]}, {12[T]}, {13[T]}]

Covered

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)]
	
	Blocked

	[{}, {}, {10[T], 11[T], 14[T]}, {12[T], 13[T]}]

Step with 11

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)], 11[(1-e^0 <= 0 /\ 101-n^0 <= 0)]
	
	Blocked

	[{}, {}, {10[T], 11[T], 14[T]}, {10[T], 12[T], 13[T], 14[T]}, {}]

Covered

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)]
	
	Blocked

	[{}, {}, {10[T], 11[T], 14[T]}, {10[T], 11[T], 12[T], 13[T], 14[T]}]

Backtrack

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)]
	
	Blocked

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

Step with 13

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)], 13[(-n2+e^0 >= 0 /\ -91-10*n2+n^0 >= 0 /\ -1+n2 >= 0)]
	
	Blocked

	[{}, {}, {10[T], 11[T], 12[T], 14[T]}, {13[T]}]

Covered

	Trace

	9[T], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)]
	
	Blocked

	[{}, {}, {10[T], 11[T], 12[T], 13[T], 14[T]}]

Backtrack

	Trace

	9[T]
	
	Blocked

	[{}, {14[T]}]

Step with 13

	Trace

	9[T], 13[(-n2+e^0 >= 0 /\ -91-10*n2+n^0 >= 0 /\ -1+n2 >= 0)]
	
	Blocked

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

Backtrack

	Trace

	9[T]
	
	Blocked

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

Step with 10

	Trace

	9[T], 10[(1-e^0 <= 0 /\ -100+n^0 <= 0)]
	
	Blocked

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

Covered

	Trace

	9[T]
	
	Blocked

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

Step with 11

	Trace

	9[T], 11[(1-e^0 <= 0 /\ 101-n^0 <= 0)]
	
	Blocked

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

Covered

	Trace

	9[T]
	
	Blocked

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

Step with 12

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)]
	
	Blocked

	[{}, {10[T], 11[T], 13[T], 14[T]}, {12[T]}]

Step with 13

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)], 13[(-n2+e^0 >= 0 /\ -91-10*n2+n^0 >= 0 /\ -1+n2 >= 0)]
	
	Blocked

	[{}, {10[T], 11[T], 13[T], 14[T]}, {12[T]}, {13[T]}]

Covered

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)]
	
	Blocked

	[{}, {10[T], 11[T], 13[T], 14[T]}, {12[T], 13[T]}]

Step with 14

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)], 14[(n1-n2-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0 /\ -91+11*n1-10*n2+n^0 >= 0 /\ -1+n3 >= 0 /\ -1+n1 >= 0 /\ -1+e^0 >= 0 /\ 111-11*n1+10*(-1+n3)*n2-11*n1*(-1+n3)-n^0 >= 0 /\ -91+11*n1-10*n2-10*(-1+n3)*n2+11*n1*(-1+n3)+n^0 >= 0 /\ -1+n2 >= 0 /\ 111-11*n1-n^0 >= 0 /\ -1-(-1+n3)*n2+n1*(-1+n3)+e^0 >= 0)]
	
	Blocked

	[{}, {10[T], 11[T], 13[T], 14[T]}, {12[T], 13[T]}, {14[T]}]

Covered

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)]
	
	Blocked

	[{}, {10[T], 11[T], 13[T], 14[T]}, {12[T], 13[T], 14[T]}]

Step with 10

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)], 10[(1-e^0 <= 0 /\ -100+n^0 <= 0)]
	
	Blocked

	[{}, {10[T], 11[T], 13[T], 14[T]}, {12[T], 13[T], 14[T]}, {}]

Covered

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)]
	
	Blocked

	[{}, {10[T], 11[T], 13[T], 14[T]}, {10[T], 12[T], 13[T], 14[T]}]

Step with 11

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)], 11[(1-e^0 <= 0 /\ 101-n^0 <= 0)]
	
	Blocked

	[{}, {10[T], 11[T], 13[T], 14[T]}, {10[T], 12[T], 13[T], 14[T]}, {}]

Covered

	Trace

	9[T], 12[(-1+n >= 0 /\ -1+e^0 >= 0 /\ 111-11*n-n^0 >= 0)]
	
	Blocked

	[{}, {10[T], 11[T], 13[T], 14[T]}, {10[T], 11[T], 12[T], 13[T], 14[T]}]

Backtrack

	Trace

	9[T]
	
	Blocked

	[{}, {10[T], 11[T], 12[T], 13[T], 14[T]}]

Backtrack

	Trace

	Blocked

	[{9[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b