unknown Initial ITS Start location: [1] Program variables: c x y 0: [1] -> [2] : x'=nondet, T, cost: 1 1: [2] -> [3] : y'=nondet1, T, cost: 1 2: [3] -> [4] : c'=0, T, cost: 1 3: [4] -> [6] : (y > 0 /\ x > 0), cost: 1 15: [4] -> [5] : (y <= 0 \/ x <= 0), cost: 1 4: [6] -> [7] : (x < 0 \/ x > 0), cost: 1 13: [6] -> [14] : (x <= 0 /\ x >= 0), cost: 1 5: [7] -> [9] : -y+x > 0, cost: 1 8: [7] -> [11] : -y+x <= 0, cost: 1 11: [8] -> [13] : c'=1+c, T, cost: 1 6: [9] -> [10] : x'=y, T, cost: 1 7: [10] -> [8] : T, cost: 1 9: [11] -> [12] : x'=-1+x, T, cost: 1 10: [12] -> [8] : T, cost: 1 12: [13] -> [6] : T, cost: 1 14: [14] -> [5] : T, cost: 1 Chained Linear Paths Start location: [1] Program variables: c x y 17: [1] -> [4] : c'=0, x'=nondet, y'=nondet1, T, cost: 1 3: [4] -> [6] : (y > 0 /\ x > 0), cost: 1 15: [4] -> [5] : (y <= 0 \/ x <= 0), cost: 1 4: [6] -> [7] : (x < 0 \/ x > 0), cost: 1 18: [6] -> [5] : (x <= 0 /\ x >= 0), cost: 1 21: [7] -> [8] : x'=y, -y+x > 0, cost: 1 22: [7] -> [8] : x'=-1+x, -y+x <= 0, cost: 1 23: [8] -> [6] : c'=1+c, T, cost: 1 Eliminating location [2] by chaining: Applied chaining First rule: [1] -> [2] : x'=nondet, T, cost: 1 Second rule: [2] -> [3] : y'=nondet1, T, cost: 1 New rule: [1] -> [3] : x'=nondet, y'=nondet1, T, cost: 1 Applied deletion Removed the following rules: 0 1 Eliminating location [3] by chaining: Applied chaining First rule: [1] -> [3] : x'=nondet, y'=nondet1, T, cost: 1 Second rule: [3] -> [4] : c'=0, T, cost: 1 New rule: [1] -> [4] : c'=0, x'=nondet, y'=nondet1, T, cost: 1 Applied deletion Removed the following rules: 2 16 Eliminating location [14] by chaining: Applied chaining First rule: [6] -> [14] : (x <= 0 /\ x >= 0), cost: 1 Second rule: [14] -> [5] : T, cost: 1 New rule: [6] -> [5] : (x <= 0 /\ x >= 0), cost: 1 Applied deletion Removed the following rules: 13 14 Eliminating location [9] by chaining: Applied chaining First rule: [7] -> [9] : -y+x > 0, cost: 1 Second rule: [9] -> [10] : x'=y, T, cost: 1 New rule: [7] -> [10] : x'=y, -y+x > 0, cost: 1 Applied deletion Removed the following rules: 5 6 Eliminating location [11] by chaining: Applied chaining First rule: [7] -> [11] : -y+x <= 0, cost: 1 Second rule: [11] -> [12] : x'=-1+x, T, cost: 1 New rule: [7] -> [12] : x'=-1+x, -y+x <= 0, cost: 1 Applied deletion Removed the following rules: 8 9 Eliminating location [10] by chaining: Applied chaining First rule: [7] -> [10] : x'=y, -y+x > 0, cost: 1 Second rule: [10] -> [8] : T, cost: 1 New rule: [7] -> [8] : x'=y, -y+x > 0, cost: 1 Applied deletion Removed the following rules: 7 19 Eliminating location [12] by chaining: Applied chaining First rule: [7] -> [12] : x'=-1+x, -y+x <= 0, cost: 1 Second rule: [12] -> [8] : T, cost: 1 New rule: [7] -> [8] : x'=-1+x, -y+x <= 0, cost: 1 Applied deletion Removed the following rules: 10 20 Eliminating location [13] by chaining: Applied chaining First rule: [8] -> [13] : c'=1+c, T, cost: 1 Second rule: [13] -> [6] : T, cost: 1 New rule: [8] -> [6] : c'=1+c, T, cost: 1 Applied deletion Removed the following rules: 11 12 Step with 17 Trace 17[T] Blocked [{}, {}] Step with 3 Trace 17[T], 3[(y > 0 /\ x > 0)] Blocked [{}, {}, {}] Step with 4 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)] Blocked [{}, {}, {18[T]}, {}] Step with 21 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)] Blocked [{}, {}, {18[T]}, {}, {}] Step with 23 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 23[T] Blocked [{}, {}, {18[T]}, {}, {}, {}] Acceleration Failed marked recursive suffix as redundant Step with 4 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 23[T], 4[(x > 0)] Blocked [{}, {}, {18[T]}, {}, {}, {}, {}] Acceleration Failed marked recursive suffix as redundant Step with 22 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 23[T], 4[(x > 0)], 22[(-y+x <= 0)] Blocked [{}, {}, {18[T]}, {}, {}, {}, {21[T]}, {}] Accelerate Start location: [1] Program variables: c x y 17: [1] -> [4] : c'=0, x'=nondet, y'=nondet1, T, cost: 1 3: [4] -> [6] : (y > 0 /\ x > 0), cost: 1 15: [4] -> [5] : (y <= 0 \/ x <= 0), cost: 1 4: [6] -> [7] : (x < 0 \/ x > 0), cost: 1 18: [6] -> [5] : (x <= 0 /\ x >= 0), cost: 1 21: [7] -> [8] : x'=y, -y+x > 0, cost: 1 22: [7] -> [8] : x'=-1+x, -y+x <= 0, cost: 1 23: [8] -> [6] : c'=1+c, T, cost: 1 24: [8] -> [8] : c'=c+n, x'=-n+x, (y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0), cost: 1 Loop Acceleration Original rule: [8] -> [8] : c'=1+c, x'=-1+x, (-y+x <= 0 /\ x > 0), cost: 1 New rule: [8] -> [8] : c'=c+n, x'=-n+x, (y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0), cost: 1 y-x >= 0 [0]: monotonic increase yields y-x >= 0 x > 0 [0]: montonic decrease yields 1-n+x > 0 x > 0 [1]: eventual increase yields (1 <= 0 /\ x > 0) Replacement map: {y-x >= 0 -> y-x >= 0, x > 0 -> 1-n+x > 0} Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)] Blocked [{}, {}, {18[T]}, {}, {}, {24[T]}] Step with 23 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)], 23[T] Blocked [{}, {}, {18[T]}, {}, {}, {24[T]}, {}] Acceleration Failed marked recursive suffix as redundant Step with 4 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)], 23[T], 4[(x > 0)] Blocked [{}, {}, {18[T]}, {}, {}, {24[T]}, {}, {}] Acceleration Failed marked recursive suffix as redundant Step with 22 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)], 23[T], 4[(x > 0)], 22[(-y+x <= 0)] Blocked [{}, {}, {18[T]}, {}, {}, {24[T]}, {}, {}, {}] Covered Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)], 23[T], 4[(x > 0)] Blocked [{}, {}, {18[T]}, {}, {}, {24[T]}, {}, {22[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)], 23[T] Blocked [{}, {}, {18[T]}, {}, {}, {24[T]}, {4[x > 0]}] Step with 18 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)], 23[T], 18[(x <= 0 /\ x >= 0)] Blocked [{}, {}, {18[T]}, {}, {}, {24[T]}, {4[T]}, {}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)], 23[T] Blocked [{}, {}, {18[T]}, {}, {}, {24[T]}, {4[T], 18[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)] Blocked [{}, {}, {18[T]}, {}, {}, {23[T], 24[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)] Blocked [{}, {}, {18[T]}, {}, {24[T]}] Step with 23 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 23[T] Blocked [{}, {}, {18[T]}, {}, {24[T]}, {}] Step with 4 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 23[T], 4[(x > 0)] Blocked [{}, {}, {18[T]}, {}, {24[T]}, {18[T]}, {}] Covered Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 23[T] Blocked [{}, {}, {18[T]}, {}, {24[T]}, {4[x > 0], 18[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)] Blocked [{}, {}, {18[T]}, {}, {23[T], 24[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)] Blocked [{}, {}, {18[T]}, {21[T]}] Step with 22 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 22[(-y+x <= 0)] Blocked [{}, {}, {18[T]}, {21[T]}, {}] Step with 23 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 22[(-y+x <= 0)], 23[T] Blocked [{}, {}, {18[T]}, {21[T]}, {}, {}] Accelerate Start location: [1] Program variables: c x y 17: [1] -> [4] : c'=0, x'=nondet, y'=nondet1, T, cost: 1 3: [4] -> [6] : (y > 0 /\ x > 0), cost: 1 15: [4] -> [5] : (y <= 0 \/ x <= 0), cost: 1 4: [6] -> [7] : (x < 0 \/ x > 0), cost: 1 18: [6] -> [5] : (x <= 0 /\ x >= 0), cost: 1 25: [6] -> [6] : c'=c+n2, x'=-n2+x, (y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0), cost: 1 21: [7] -> [8] : x'=y, -y+x > 0, cost: 1 22: [7] -> [8] : x'=-1+x, -y+x <= 0, cost: 1 23: [8] -> [6] : c'=1+c, T, cost: 1 24: [8] -> [8] : c'=c+n, x'=-n+x, (y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0), cost: 1 Loop Acceleration Original rule: [6] -> [6] : c'=1+c, x'=-1+x, (-y+x <= 0 /\ x > 0), cost: 1 New rule: [6] -> [6] : c'=c+n2, x'=-n2+x, (y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0), cost: 1 y-x >= 0 [0]: monotonic increase yields y-x >= 0 x > 0 [0]: montonic decrease yields 1-n2+x > 0 x > 0 [1]: eventual increase yields (1 <= 0 /\ x > 0) Replacement map: {y-x >= 0 -> y-x >= 0, x > 0 -> 1-n2+x > 0} Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)] Blocked [{}, {}, {18[T]}, {25[T]}] Step with 18 Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)], 18[(x <= 0 /\ x >= 0)] Blocked [{}, {}, {18[T]}, {25[T]}, {}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)] Blocked [{}, {}, {18[T]}, {18[T], 25[T]}] Step with 4 Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)], 4[(x > 0)] Blocked [{}, {}, {18[T]}, {18[T], 25[T]}, {}] Step with 22 Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)], 4[(x > 0)], 22[(-y+x <= 0)] Blocked [{}, {}, {18[T]}, {18[T], 25[T]}, {}, {}] Step with 23 Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)], 4[(x > 0)], 22[(-y+x <= 0)], 23[T] Blocked [{}, {}, {18[T]}, {18[T], 25[T]}, {}, {}, {}] Covered Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)], 4[(x > 0)], 22[(-y+x <= 0)] Blocked [{}, {}, {18[T]}, {18[T], 25[T]}, {}, {23[T]}] Step with 24 Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)], 4[(x > 0)], 22[(-y+x <= 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)] Blocked [{}, {}, {18[T]}, {18[T], 25[T]}, {}, {23[T]}, {24[T]}] Step with 23 Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)], 4[(x > 0)], 22[(-y+x <= 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)], 23[T] Blocked [{}, {}, {18[T]}, {18[T], 25[T]}, {}, {23[T]}, {24[T]}, {}] Covered Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)], 4[(x > 0)], 22[(-y+x <= 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)] Blocked [{}, {}, {18[T]}, {18[T], 25[T]}, {}, {23[T]}, {23[T], 24[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)], 4[(x > 0)], 22[(-y+x <= 0)] Blocked [{}, {}, {18[T]}, {18[T], 25[T]}, {}, {23[T], 24[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)], 4[(x > 0)] Blocked [{}, {}, {18[T]}, {18[T], 25[T]}, {22[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 25[(y-x >= 0 /\ 1-n2+x > 0 /\ -1+n2 >= 0)] Blocked [{}, {}, {18[T]}, {4[x > 0], 18[T], 25[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)] Blocked [{}, {}, {18[T], 25[T]}] Step with 4 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)] Blocked [{}, {}, {18[T], 25[T]}, {}] Step with 22 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 22[(-y+x <= 0)] Blocked [{}, {}, {18[T], 25[T]}, {}, {}] Step with 23 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 22[(-y+x <= 0)], 23[T] Blocked [{}, {}, {18[T], 25[T]}, {}, {}, {}] Covered Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 22[(-y+x <= 0)] Blocked [{}, {}, {18[T], 25[T]}, {}, {23[T]}] Step with 24 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 22[(-y+x <= 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)] Blocked [{}, {}, {18[T], 25[T]}, {}, {23[T]}, {24[T]}] Step with 23 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 22[(-y+x <= 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)], 23[T] Blocked [{}, {}, {18[T], 25[T]}, {}, {23[T]}, {24[T]}, {}] Covered Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 22[(-y+x <= 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)] Blocked [{}, {}, {18[T], 25[T]}, {}, {23[T]}, {23[T], 24[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 22[(-y+x <= 0)] Blocked [{}, {}, {18[T], 25[T]}, {}, {23[T], 24[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)] Blocked [{}, {}, {18[T], 25[T]}, {22[T]}] Step with 21 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)] Blocked [{}, {}, {18[T], 25[T]}, {22[T]}, {}] Step with 23 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 23[T] Blocked [{}, {}, {18[T], 25[T]}, {22[T]}, {}, {}] Covered Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)] Blocked [{}, {}, {18[T], 25[T]}, {22[T]}, {23[T]}] Step with 24 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)] Blocked [{}, {}, {18[T], 25[T]}, {22[T]}, {23[T]}, {24[T]}] Step with 23 Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)], 23[T] Blocked [{}, {}, {18[T], 25[T]}, {22[T]}, {23[T]}, {24[T]}, {}] Covered Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)], 24[(y-x >= 0 /\ -1+n >= 0 /\ 1-n+x > 0)] Blocked [{}, {}, {18[T], 25[T]}, {22[T]}, {23[T]}, {23[T], 24[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)], 21[(-y+x > 0)] Blocked [{}, {}, {18[T], 25[T]}, {22[T]}, {23[T], 24[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)], 4[(x > 0)] Blocked [{}, {}, {18[T], 25[T]}, {21[T], 22[T]}] Backtrack Trace 17[T], 3[(y > 0 /\ x > 0)] Blocked [{}, {}, {4[x > 0], 18[T], 25[T]}] Backtrack Trace 17[T] Blocked [{}, {3[T]}] Step with 15 Trace 17[T], 15[(x <= 0)] Blocked [{}, {3[T]}, {}] Backtrack Trace 17[T] Blocked [{}, {3[T], 15[x <= 0]}] Step with 15 Trace 17[T], 15[(y <= 0)] Blocked [{}, {3[T], 15[x <= 0]}, {}] Backtrack Trace 17[T] Blocked [{}, {3[T], 15[(y <= 0 /\ x <= 0)]}] Backtrack Trace Blocked [{17[T]}] Accept unknown Build SHA: a05f16bf13df659c382799650051f91bf6828c7b