unknown

Initial ITS

Start location: [1]
Program variables: c n
   0: [1] -> [2] : c'=1, T, cost: 1
   1: [2] -> [3] : n'=nondet, T, cost: 1
   2: [3] -> [4] : c > 0, cost: 1
  12: [3] -> [12] : c <= 0, cost: 1
   3: [4] -> [6] : -100+n > 0, cost: 1
   7: [4] -> [9] : -100+n <= 0, cost: 1
  11: [5] -> [3] : T, cost: 1
   4: [6] -> [7] : n'=-10+n, T, cost: 1
   5: [7] -> [8] : c'=-1+c, T, cost: 1
   6: [8] -> [5] : T, cost: 1
   8: [9] -> [10] : n'=11+n, T, cost: 1
   9: [10] -> [11] : c'=1+c, T, cost: 1
  10: [11] -> [5] : T, cost: 1

Chained Linear Paths

Start location: [1]
Program variables: c n
  13: [1] -> [3] : c'=1, n'=nondet, T, cost: 1
   2: [3] -> [4] : c > 0, cost: 1
  12: [3] -> [12] : c <= 0, cost: 1
  18: [4] -> [5] : c'=-1+c, n'=-10+n, -100+n > 0, cost: 1
  19: [4] -> [5] : c'=1+c, n'=11+n, -100+n <= 0, cost: 1
  11: [5] -> [3] : T, cost: 1

	Eliminating location [2] by chaining:

	Applied chaining

	First rule:
	[1] -> [2] : c'=1, T, cost: 1
	Second rule:
	[2] -> [3] : n'=nondet, T, cost: 1
	New rule:
	[1] -> [3] : c'=1, n'=nondet, T, cost: 1
	
	Applied deletion

	Removed the following rules: 0 1
	
	Eliminating location [6] by chaining:

	Applied chaining

	First rule:
	[4] -> [6] : -100+n > 0, cost: 1
	Second rule:
	[6] -> [7] : n'=-10+n, T, cost: 1
	New rule:
	[4] -> [7] : n'=-10+n, -100+n > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 3 4
	
	Eliminating location [9] by chaining:

	Applied chaining

	First rule:
	[4] -> [9] : -100+n <= 0, cost: 1
	Second rule:
	[9] -> [10] : n'=11+n, T, cost: 1
	New rule:
	[4] -> [10] : n'=11+n, -100+n <= 0, cost: 1
	
	Applied deletion

	Removed the following rules: 7 8
	
	Eliminating location [7] by chaining:

	Applied chaining

	First rule:
	[4] -> [7] : n'=-10+n, -100+n > 0, cost: 1
	Second rule:
	[7] -> [8] : c'=-1+c, T, cost: 1
	New rule:
	[4] -> [8] : c'=-1+c, n'=-10+n, -100+n > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 5 14
	
	Eliminating location [10] by chaining:

	Applied chaining

	First rule:
	[4] -> [10] : n'=11+n, -100+n <= 0, cost: 1
	Second rule:
	[10] -> [11] : c'=1+c, T, cost: 1
	New rule:
	[4] -> [11] : c'=1+c, n'=11+n, -100+n <= 0, cost: 1
	
	Applied deletion

	Removed the following rules: 9 15
	
	Eliminating location [8] by chaining:

	Applied chaining

	First rule:
	[4] -> [8] : c'=-1+c, n'=-10+n, -100+n > 0, cost: 1
	Second rule:
	[8] -> [5] : T, cost: 1
	New rule:
	[4] -> [5] : c'=-1+c, n'=-10+n, -100+n > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 6 16
	
	Eliminating location [11] by chaining:

	Applied chaining

	First rule:
	[4] -> [11] : c'=1+c, n'=11+n, -100+n <= 0, cost: 1
	Second rule:
	[11] -> [5] : T, cost: 1
	New rule:
	[4] -> [5] : c'=1+c, n'=11+n, -100+n <= 0, cost: 1
	
	Applied deletion

	Removed the following rules: 10 17

Step with 13

	Trace

	13[T]
	
	Blocked

	[{}, {}]

Step with 2

	Trace

	13[T], 2[(c > 0)]
	
	Blocked

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

Step with 18

	Trace

	13[T], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

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

Step with 11

	Trace

	13[T], 2[(c > 0)], 18[(-100+n > 0)], 11[T]
	
	Blocked

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

Accelerate

Start location: [1]
Program variables: c n
  13: [1] -> [3] : c'=1, n'=nondet, T, cost: 1
   2: [3] -> [4] : c > 0, cost: 1
  12: [3] -> [12] : c <= 0, cost: 1
  20: [3] -> [3] : c'=c-n5, n'=n-10*n5, (-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0), cost: 1
  18: [4] -> [5] : c'=-1+c, n'=-10+n, -100+n > 0, cost: 1
  19: [4] -> [5] : c'=1+c, n'=11+n, -100+n <= 0, cost: 1
  11: [5] -> [3] : T, cost: 1

	Loop Acceleration

	Original rule:
	[3] -> [3] : c'=-1+c, n'=-10+n, (-100+n > 0 /\ c > 0), cost: 1
	New rule:
	[3] -> [3] : c'=c-n5, n'=n-10*n5, (-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0), cost: 1

		-100+n > 0 [0]: montonic decrease yields -90+n-10*n5 > 0
		
		-100+n > 0 [1]: eventual increase yields (-100+n > 0 /\ 10 <= 0)
		
		c > 0 [0]: montonic decrease yields 1+c-n5 > 0
		
		c > 0 [1]: eventual increase yields (1 <= 0 /\ c > 0)
		
		Replacement map: {-100+n > 0 -> -90+n-10*n5 > 0, c > 0 -> 1+c-n5 > 0}

	Trace

	13[T], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)]
	
	Blocked

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

Step with 12

	Trace

	13[T], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 12[(c <= 0)]
	
	Blocked

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

Backtrack

	Trace

	13[T], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)]
	
	Blocked

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

Backtrack

	Trace

	13[T]
	
	Blocked

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

Step with 2

	Trace

	13[T], 2[(c > 0)]
	
	Blocked

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

Step with 18

	Trace

	13[T], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

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

Step with 11

	Trace

	13[T], 2[(c > 0)], 18[(-100+n > 0)], 11[T]
	
	Blocked

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

Covered

	Trace

	13[T], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {}, {11[T]}]

Backtrack

	Trace

	13[T], 2[(c > 0)]
	
	Blocked

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

Step with 19

	Trace

	13[T], 2[(c > 0)], 19[(-100+n <= 0)]
	
	Blocked

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

Step with 11

	Trace

	13[T], 2[(c > 0)], 19[(-100+n <= 0)], 11[T]
	
	Blocked

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

Accelerate

Start location: [1]
Program variables: c n
  13: [1] -> [3] : c'=1, n'=nondet, T, cost: 1
   2: [3] -> [4] : c > 0, cost: 1
  12: [3] -> [12] : c <= 0, cost: 1
  20: [3] -> [3] : c'=c-n5, n'=n-10*n5, (-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0), cost: 1
  21: [3] -> [3] : c'=c+n13, n'=n+11*n13, (c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0), cost: 1
  18: [4] -> [5] : c'=-1+c, n'=-10+n, -100+n > 0, cost: 1
  19: [4] -> [5] : c'=1+c, n'=11+n, -100+n <= 0, cost: 1
  11: [5] -> [3] : T, cost: 1

	Loop Acceleration

	Original rule:
	[3] -> [3] : c'=1+c, n'=11+n, (-100+n <= 0 /\ c > 0), cost: 1
	New rule:
	[3] -> [3] : c'=c+n13, n'=n+11*n13, (c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0), cost: 1

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

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {21[T]}]

Step with 2

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 2[(c > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {12[T], 21[T]}, {}]

Step with 19

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 2[(c > 0)], 19[(-100+n <= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {12[T], 21[T]}, {}, {}]

Step with 11

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 2[(c > 0)], 19[(-100+n <= 0)], 11[T]
	
	Blocked

	[{}, {12[T], 20[T]}, {12[T], 21[T]}, {}, {}, {}]

Covered

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 2[(c > 0)], 19[(-100+n <= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {12[T], 21[T]}, {}, {11[T]}]

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 2[(c > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {12[T], 21[T]}, {19[T]}]

Step with 18

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {12[T], 21[T]}, {19[T]}, {}]

Step with 11

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 2[(c > 0)], 18[(-100+n > 0)], 11[T]
	
	Blocked

	[{}, {12[T], 20[T]}, {12[T], 21[T]}, {19[T]}, {}, {}]

Covered

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {12[T], 21[T]}, {19[T]}, {11[T]}]

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 2[(c > 0)]
	
	Blocked

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

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}]

Step with 20

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {20[T]}]

Acceleration Failed

marked recursive suffix as redundant

Step with 21

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {20[T]}, {21[T]}]

Accelerate

Start location: [1]
Program variables: c n
  13: [1] -> [3] : c'=1, n'=nondet, T, cost: 1
   2: [3] -> [4] : c > 0, cost: 1
  12: [3] -> [12] : c <= 0, cost: 1
  20: [3] -> [3] : c'=c-n5, n'=n-10*n5, (-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0), cost: 1
  21: [3] -> [3] : c'=c+n13, n'=n+11*n13, (c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0), cost: 1
  22: [3] -> [3] : c'=-n52*n23+n13*n23+c, n'=-10*n52*n23+11*n13*n23+n, (-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0), cost: 1
  18: [4] -> [5] : c'=-1+c, n'=-10+n, -100+n > 0, cost: 1
  19: [4] -> [5] : c'=1+c, n'=11+n, -100+n <= 0, cost: 1
  11: [5] -> [3] : T, cost: 1

	Loop Acceleration

	Original rule:
	[3] -> [3] : c'=-n52+c+n13, n'=-10*n52+n+11*n13, (-1+n52 >= 0 /\ -n52+c > 0 /\ 1-n52+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ -1+n13 >= 0), cost: 1
	New rule:
	[3] -> [3] : c'=-n52*n23+n13*n23+c, n'=-10*n52*n23+11*n13*n23+n, (-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0), cost: 1

		-1+n52 >= 0 [0]: monotonic increase yields -1+n52 >= 0
		
		-n52+c > 0 [0]: montonic decrease yields -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0, dependencies: -1+n52 >= 0 -90-10*n52+n > 0 111+10*n52-n-11*n13 >= 0
		
		-n52+c > 0 [1]: eventual decrease yields (-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -n52+c > 0)
		
		-n52+c > 0 [2]: eventual increase yields (-n52+c > 0 /\ n52-n13 <= 0)
		
		1-n52+c > 0 [0]: montonic decrease yields 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0, dependencies: -n52+c > 0
		
		1-n52+c > 0 [1]: eventual increase yields (1-n52+c > 0 /\ n52-n13 <= 0)
		
		-90-10*n52+n > 0 [0]: eventual decrease yields (-90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -90-10*n52+n > 0)
		
		-90-10*n52+n > 0 [1]: eventual increase yields (-90-10*n52+n > 0 /\ 10*n52-11*n13 <= 0)
		
		111+10*n52-n-11*n13 >= 0 [0]: eventual decrease yields (111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0)
		
		111+10*n52-n-11*n13 >= 0 [1]: eventual increase yields (-10*n52+11*n13 <= 0 /\ 111+10*n52-n-11*n13 >= 0)
		
		-1+n13 >= 0 [0]: monotonic increase yields -1+n13 >= 0
		
		Replacement map: {-1+n52 >= 0 -> -1+n52 >= 0, -n52+c > 0 -> -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0, 1-n52+c > 0 -> 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0, -90-10*n52+n > 0 -> (-90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -90-10*n52+n > 0), 111+10*n52-n-11*n13 >= 0 -> (111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0), -1+n13 >= 0 -> -1+n13 >= 0}

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 22[(-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {22[T]}]

Acceleration Failed

marked recursive suffix as redundant

Step with 2

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 22[(-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0)], 2[(c > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {12[T], 22[T]}, {}]

Step with 18

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 22[(-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0)], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {12[T], 22[T]}, {}, {}]

Step with 11

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 22[(-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0)], 2[(c > 0)], 18[(-100+n > 0)], 11[T]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {12[T], 22[T]}, {}, {}, {}]

Covered

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 22[(-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0)], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {12[T], 22[T]}, {}, {11[T]}]

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 22[(-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0)], 2[(c > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {12[T], 22[T]}, {18[T]}]

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 22[(-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {2[T], 12[T], 22[T]}]

Step with 20

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 22[(-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {2[T], 12[T], 22[T]}, {20[T]}]

Acceleration Failed

marked recursive suffix as redundant

Covered

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 22[(-1+n52 >= 0 /\ -90-10*n52-10*n52*(-1+n23)+n+11*n13*(-1+n23) > 0 /\ -n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ 1-n52-n52*(-1+n23)+n13*(-1+n23)+c > 0 /\ -90-10*n52+n > 0 /\ 111+10*n52-n-11*n13 >= 0 /\ 111+10*n52+10*n52*(-1+n23)-n-11*n13*(-1+n23)-11*n13 >= 0 /\ -1+n13 >= 0 /\ -1+n23 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T]}, {2[T], 12[T], 20[T], 22[T]}]

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}]

Step with 20

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {20[T]}]

Step with 21

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {20[T]}, {21[T]}]

Covered

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {20[T], 21[T]}]

Step with 12

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 12[(c <= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {20[T], 21[T], 22[T]}, {}]

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {12[T], 20[T], 21[T], 22[T]}]

Step with 2

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 2[(c > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {12[T], 20[T], 21[T], 22[T]}, {}]

Step with 18

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {12[T], 20[T], 21[T], 22[T]}, {}, {}]

Step with 11

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 2[(c > 0)], 18[(-100+n > 0)], 11[T]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {12[T], 20[T], 21[T], 22[T]}, {}, {}, {}]

Covered

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {12[T], 20[T], 21[T], 22[T]}, {}, {11[T]}]

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 2[(c > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {12[T], 20[T], 21[T], 22[T]}, {18[T]}]

Step with 19

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 2[(c > 0)], 19[(-100+n <= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {12[T], 20[T], 21[T], 22[T]}, {18[T]}, {}]

Step with 11

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 2[(c > 0)], 19[(-100+n <= 0)], 11[T]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {12[T], 20[T], 21[T], 22[T]}, {18[T]}, {}, {}]

Covered

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 2[(c > 0)], 19[(-100+n <= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {12[T], 20[T], 21[T], 22[T]}, {18[T]}, {11[T]}]

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)], 2[(c > 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {12[T], 20[T], 21[T], 22[T]}, {18[T], 19[T]}]

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)], 20[(-90+n-10*n5 > 0 /\ 1+c-n5 > 0 /\ -1+n5 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 21[T], 22[T]}, {2[T], 12[T], 20[T], 21[T], 22[T]}]

Backtrack

	Trace

	13[T], 21[(c > 0 /\ 111-n-11*n13 >= 0 /\ -1+n13 >= 0)]
	
	Blocked

	[{}, {12[T], 20[T]}, {2[T], 12[T], 20[T], 21[T], 22[T]}]

Backtrack

	Trace

	13[T]
	
	Blocked

	[{}, {12[T], 20[T], 21[T]}]

Step with 2

	Trace

	13[T], 2[(c > 0)]
	
	Blocked

	[{}, {12[T], 20[T], 21[T]}, {}]

Step with 19

	Trace

	13[T], 2[(c > 0)], 19[(-100+n <= 0)]
	
	Blocked

	[{}, {12[T], 20[T], 21[T]}, {}, {}]

Step with 11

	Trace

	13[T], 2[(c > 0)], 19[(-100+n <= 0)], 11[T]
	
	Blocked

	[{}, {12[T], 20[T], 21[T]}, {}, {}, {}]

Covered

	Trace

	13[T], 2[(c > 0)], 19[(-100+n <= 0)]
	
	Blocked

	[{}, {12[T], 20[T], 21[T]}, {}, {11[T]}]

Backtrack

	Trace

	13[T], 2[(c > 0)]
	
	Blocked

	[{}, {12[T], 20[T], 21[T]}, {19[T]}]

Step with 18

	Trace

	13[T], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

	[{}, {12[T], 20[T], 21[T]}, {19[T]}, {}]

Step with 11

	Trace

	13[T], 2[(c > 0)], 18[(-100+n > 0)], 11[T]
	
	Blocked

	[{}, {12[T], 20[T], 21[T]}, {19[T]}, {}, {}]

Covered

	Trace

	13[T], 2[(c > 0)], 18[(-100+n > 0)]
	
	Blocked

	[{}, {12[T], 20[T], 21[T]}, {19[T]}, {11[T]}]

Backtrack

	Trace

	13[T], 2[(c > 0)]
	
	Blocked

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

Backtrack

	Trace

	13[T]
	
	Blocked

	[{}, {2[T], 12[T], 20[T], 21[T]}]

Backtrack

	Trace

	Blocked

	[{13[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b