unknown

Initial ITS

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

Chained Linear Paths

Start location: [1]
Program variables: c i j
  13: [1] -> [3] : c'=0, i'=0, T, cost: 1
  15: [3] -> [8] : j'=5, -100+i >= 0, cost: 1
  17: [3] -> [3] : c'=1+c, i'=1+i, -100+i < 0, cost: 1
  12: [8] -> [12] : -21+j >= 0, cost: 1
  20: [8] -> [8] : c'=1+c, j'=3+j, -21+j < 0, cost: 1

	Eliminating location [2] by chaining:

	Applied chaining

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

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

	Applied chaining

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

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

	Applied chaining

	First rule:
	[3] -> [7] : -100+i >= 0, cost: 1
	Second rule:
	[7] -> [8] : j'=5, T, cost: 1
	New rule:
	[3] -> [8] : j'=5, -100+i >= 0, cost: 1
	
	Applied deletion

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

	Applied chaining

	First rule:
	[3] -> [5] : c'=1+c, -100+i < 0, cost: 1
	Second rule:
	[5] -> [6] : i'=1+i, T, cost: 1
	New rule:
	[3] -> [6] : c'=1+c, i'=1+i, -100+i < 0, cost: 1
	
	Applied deletion

	Removed the following rules: 4 14
	
	Eliminating location [6] by chaining:

	Applied chaining

	First rule:
	[3] -> [6] : c'=1+c, i'=1+i, -100+i < 0, cost: 1
	Second rule:
	[6] -> [3] : T, cost: 1
	New rule:
	[3] -> [3] : c'=1+c, i'=1+i, -100+i < 0, cost: 1
	
	Applied deletion

	Removed the following rules: 5 16
	
	Eliminating location [9] by chaining:

	Applied chaining

	First rule:
	[8] -> [9] : -21+j < 0, cost: 1
	Second rule:
	[9] -> [10] : c'=1+c, T, cost: 1
	New rule:
	[8] -> [10] : c'=1+c, -21+j < 0, cost: 1
	
	Applied deletion

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

	Applied chaining

	First rule:
	[8] -> [10] : c'=1+c, -21+j < 0, cost: 1
	Second rule:
	[10] -> [11] : j'=3+j, T, cost: 1
	New rule:
	[8] -> [11] : c'=1+c, j'=3+j, -21+j < 0, cost: 1
	
	Applied deletion

	Removed the following rules: 10 18
	
	Eliminating location [11] by chaining:

	Applied chaining

	First rule:
	[8] -> [11] : c'=1+c, j'=3+j, -21+j < 0, cost: 1
	Second rule:
	[11] -> [8] : T, cost: 1
	New rule:
	[8] -> [8] : c'=1+c, j'=3+j, -21+j < 0, cost: 1
	
	Applied deletion

	Removed the following rules: 11 19

Step with 13

	Trace

	13[T]
	
	Blocked

	[{}, {}]

Step with 17

	Trace

	13[T], 17[(-100+i < 0)]
	
	Blocked

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

Accelerate

Start location: [1]
Program variables: c i j
  13: [1] -> [3] : c'=0, i'=0, T, cost: 1
  15: [3] -> [8] : j'=5, -100+i >= 0, cost: 1
  17: [3] -> [3] : c'=1+c, i'=1+i, -100+i < 0, cost: 1
  21: [3] -> [3] : c'=c+n, i'=i+n, (101-i-n > 0 /\ -1+n >= 0), cost: 1
  12: [8] -> [12] : -21+j >= 0, cost: 1
  20: [8] -> [8] : c'=1+c, j'=3+j, -21+j < 0, cost: 1

	Loop Acceleration

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

		100-i > 0 [0]: montonic decrease yields 101-i-n > 0
		
		100-i > 0 [1]: eventual increase yields (1 <= 0 /\ 100-i > 0)
		
		Replacement map: {100-i > 0 -> 101-i-n > 0}

	Trace

	13[T], 21[(101-i-n > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {15[T]}, {17[T], 21[T]}]

Step with 15

	Trace

	13[T], 21[(101-i-n > 0 /\ -1+n >= 0)], 15[(-100+i >= 0)]
	
	Blocked

	[{}, {15[T]}, {17[T], 21[T]}, {}]

Step with 20

	Trace

	13[T], 21[(101-i-n > 0 /\ -1+n >= 0)], 15[(-100+i >= 0)], 20[(-21+j < 0)]
	
	Blocked

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

Accelerate

Start location: [1]
Program variables: c i j
  13: [1] -> [3] : c'=0, i'=0, T, cost: 1
  15: [3] -> [8] : j'=5, -100+i >= 0, cost: 1
  17: [3] -> [3] : c'=1+c, i'=1+i, -100+i < 0, cost: 1
  21: [3] -> [3] : c'=c+n, i'=i+n, (101-i-n > 0 /\ -1+n >= 0), cost: 1
  12: [8] -> [12] : -21+j >= 0, cost: 1
  20: [8] -> [8] : c'=1+c, j'=3+j, -21+j < 0, cost: 1
  22: [8] -> [8] : c'=c+n2, j'=j+3*n2, (24-j-3*n2 > 0 /\ -1+n2 >= 0), cost: 1

	Loop Acceleration

	Original rule:
	[8] -> [8] : c'=1+c, j'=3+j, (-21+j < 0), cost: 1
	New rule:
	[8] -> [8] : c'=c+n2, j'=j+3*n2, (24-j-3*n2 > 0 /\ -1+n2 >= 0), cost: 1

		21-j > 0 [0]: montonic decrease yields 24-j-3*n2 > 0
		
		21-j > 0 [1]: eventual increase yields (3 <= 0 /\ 21-j > 0)
		
		Replacement map: {21-j > 0 -> 24-j-3*n2 > 0}

	Trace

	13[T], 21[(101-i-n > 0 /\ -1+n >= 0)], 15[(-100+i >= 0)], 22[(24-j-3*n2 > 0 /\ -1+n2 >= 0)]
	
	Blocked

	[{}, {15[T]}, {17[T], 21[T]}, {12[T]}, {20[T], 22[T]}]

Step with 12

	Trace

	13[T], 21[(101-i-n > 0 /\ -1+n >= 0)], 15[(-100+i >= 0)], 22[(24-j-3*n2 > 0 /\ -1+n2 >= 0)], 12[(-21+j >= 0)]
	
	Blocked

	[{}, {15[T]}, {17[T], 21[T]}, {12[T]}, {20[T], 22[T]}, {}]

Backtrack

	Trace

	13[T], 21[(101-i-n > 0 /\ -1+n >= 0)], 15[(-100+i >= 0)], 22[(24-j-3*n2 > 0 /\ -1+n2 >= 0)]
	
	Blocked

	[{}, {15[T]}, {17[T], 21[T]}, {12[T]}, {12[T], 20[T], 22[T]}]

Backtrack

	Trace

	13[T], 21[(101-i-n > 0 /\ -1+n >= 0)], 15[(-100+i >= 0)]
	
	Blocked

	[{}, {15[T]}, {17[T], 21[T]}, {12[T], 22[T]}]

Step with 20

	Trace

	13[T], 21[(101-i-n > 0 /\ -1+n >= 0)], 15[(-100+i >= 0)], 20[(-21+j < 0)]
	
	Blocked

	[{}, {15[T]}, {17[T], 21[T]}, {12[T], 22[T]}, {}]

Covered

	Trace

	13[T], 21[(101-i-n > 0 /\ -1+n >= 0)], 15[(-100+i >= 0)]
	
	Blocked

	[{}, {15[T]}, {17[T], 21[T]}, {12[T], 20[T], 22[T]}]

Backtrack

	Trace

	13[T], 21[(101-i-n > 0 /\ -1+n >= 0)]
	
	Blocked

	[{}, {15[T]}, {15[T], 17[T], 21[T]}]

Backtrack

	Trace

	13[T]
	
	Blocked

	[{}, {15[T], 21[T]}]

Step with 17

	Trace

	13[T], 17[(-100+i < 0)]
	
	Blocked

	[{}, {15[T], 21[T]}, {}]

Covered

	Trace

	13[T]
	
	Blocked

	[{}, {15[T], 17[T], 21[T]}]

Backtrack

	Trace

	Blocked

	[{13[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b