NO

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1
   1: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P1, arg2'=arg2P1, (arg1 < 0 /\ -1+arg1 < 0 /\ 2+arg1-arg1P1 == 0 /\ 3+arg1 > 0), cost: 1
   2: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -3+arg1 < 0 /\ -2+arg1-arg1P2 == 0), cost: 1
   3: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P3, arg2'=arg2P3, (1-arg1 < 0 /\ 2-arg1-arg1P3 == 0 /\ -2+arg1 > 0), cost: 1
   4: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P4, arg2'=arg2P4, (arg1 < 0 /\ -1+arg1 < 0 /\ 1+arg1 < 0 /\ -2-arg1-arg1P4 == 0 /\ 3+arg1 <= 0 /\ 2+arg1 < 0), cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Applied preprocessing
Original rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1
New rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P1, arg2'=arg2P1, (arg1 < 0 /\ -1+arg1 < 0 /\ 2+arg1-arg1P1 == 0 /\ 3+arg1 > 0), cost: 1
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1

Applied preprocessing
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -3+arg1 < 0 /\ -2+arg1-arg1P2 == 0), cost: 1
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1

Applied preprocessing
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P3, arg2'=arg2P3, (1-arg1 < 0 /\ 2-arg1-arg1P3 == 0 /\ -2+arg1 > 0), cost: 1
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2-arg1, arg2'=arg2P3, -2+arg1 > 0, cost: 1

Applied preprocessing
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P4, arg2'=arg2P4, (arg1 < 0 /\ -1+arg1 < 0 /\ 1+arg1 < 0 /\ -2-arg1-arg1P4 == 0 /\ 3+arg1 <= 0 /\ 2+arg1 < 0), cost: 1
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2-arg1, arg2'=arg2P4, -2-arg1 > 0, cost: 1

Simplified rules
Start location: __init
   6: f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   7: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1
   8: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1
   9: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2-arg1, arg2'=arg2P3, -2+arg1 > 0, cost: 1
  10: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2-arg1, arg2'=arg2P4, -2-arg1 > 0, cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Applied acceleration
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1+2*n3, arg2'=arg2P1, (-arg1 > 0 /\ -1+n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: n3

Applied acceleration
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0), cost: n5

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P2, 1+arg1 == 0, cost: 2

Applied nonterm
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P2, 1+arg1 == 0, cost: 2
New rule:
f98_0_loop_EQ -> [3] : (1+arg1 >= 0 /\ -1-arg1 >= 0), cost: NONTERM

Applied acceleration
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P2, 1+arg1 == 0, cost: 2
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P2, (1+arg1 >= 0 /\ -1-arg1 >= 0), cost: 2*n7

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> [3] : (1+arg1 >= 0 /\ -1-arg1 >= 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (arg1 > 0 /\ 3-arg1 > 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0), cost: NONTERM

Heuristically decided not to add the following rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P2, (1+arg1 >= 0 /\ -1-arg1 >= 0), cost: 2*n7

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P1, -1+arg1 == 0, cost: 2

Applied nonterm
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P1, -1+arg1 == 0, cost: 2
New rule:
f98_0_loop_EQ -> [3] : (1-arg1 >= 0 /\ -1+arg1 >= 0), cost: NONTERM

Applied acceleration
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P1, -1+arg1 == 0, cost: 2
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P1, (1-arg1 >= 0 /\ -1+arg1 >= 0), cost: 2*n9

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> [3] : (1-arg1 >= 0 /\ -1+arg1 >= 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (-arg1 > 0 /\ 1+arg1 >= 0 /\ -1-arg1 >= 0 /\ 3+arg1 > 0), cost: NONTERM

Heuristically decided not to add the following rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P1, (1-arg1 >= 0 /\ -1+arg1 >= 0), cost: 2*n9

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0), cost: n5
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1-2*n5, arg2'=arg2P2, (-1+n5 >= 0 /\ 1+arg1 == 0 /\ 4+arg1-2*n5 > 0), cost: 1+n5

Applied nonterm
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1-2*n5, arg2'=arg2P2, (-1+n5 >= 0 /\ 1+arg1 == 0 /\ 4+arg1-2*n5 > 0), cost: 1+n5
New rule:
f98_0_loop_EQ -> [3] : (-1+n5 >= 0 /\ 1+arg1 >= 0 /\ -1-arg1 >= 0 /\ 4+arg1-2*n5 > 0), cost: NONTERM

Applied acceleration
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1-2*n5, arg2'=arg2P2, (-1+n5 >= 0 /\ 1+arg1 == 0 /\ 4+arg1-2*n5 > 0), cost: 1+n5
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5*n17+2*n17, arg2'=arg2P2, (-1+n5 >= 0 /\ -1+n17 >= 0 /\ ((1-arg1-2*n17+2*n5*(-1+n17) >= 0 /\ -1-arg1 >= 0) \/ (-1+n5 >= 0 /\ -1-arg1 >= 0)) /\ ((-1-arg1 >= 0 /\ 4+arg1-2*n5 > 0) \/ (-1+n5 >= 0 /\ 2+arg1-2*n5+2*n17-2*n5*(-1+n17) > 0 /\ 4+arg1-2*n5 > 0)) /\ ((1+arg1 >= 0 /\ 4+arg1-2*n5 > 0) \/ (-1+n5 >= 0 /\ -1+arg1+2*n17-2*n5*(-1+n17) >= 0))), cost: n5*n17+n17

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0), cost: n5
Second rule:
f98_0_loop_EQ -> [3] : (-1+n5 >= 0 /\ 1+arg1 >= 0 /\ -1-arg1 >= 0 /\ 4+arg1-2*n5 > 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (arg1 > 0 /\ 3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0 /\ 1+arg1-2*n5 >= 0 /\ -1-arg1+2*n5 >= 0 /\ 4+arg1-4*n5 > 0), cost: NONTERM

Heuristically decided not to add the following rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5*n17+2*n17, arg2'=arg2P2, (-1+n5 >= 0 /\ -1+n17 >= 0 /\ ((1-arg1-2*n17+2*n5*(-1+n17) >= 0 /\ -1-arg1 >= 0) \/ (-1+n5 >= 0 /\ -1-arg1 >= 0)) /\ ((-1-arg1 >= 0 /\ 4+arg1-2*n5 > 0) \/ (-1+n5 >= 0 /\ 2+arg1-2*n5+2*n17-2*n5*(-1+n17) > 0 /\ 4+arg1-2*n5 > 0)) /\ ((1+arg1 >= 0 /\ 4+arg1-2*n5 > 0) \/ (-1+n5 >= 0 /\ -1+arg1+2*n17-2*n5*(-1+n17) >= 0))), cost: n5*n17+n17

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0), cost: n5
Second rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1-2*n5, arg2'=arg2P1, (3-arg1 > 0 /\ -1+n5 >= 0 /\ -1-arg1+2*n5 == 0), cost: 1+n5

Applied nonterm
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1-2*n5, arg2'=arg2P1, (3-arg1 > 0 /\ -1+n5 >= 0 /\ -1-arg1+2*n5 == 0), cost: 1+n5
New rule:
f98_0_loop_EQ -> [3] : (3-arg1 > 0 /\ -1+n5 >= 0 /\ 1+arg1-2*n5 >= 0 /\ -1-arg1+2*n5 >= 0), cost: NONTERM

Applied acceleration
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1-2*n5, arg2'=arg2P1, (3-arg1 > 0 /\ -1+n5 >= 0 /\ -1-arg1+2*n5 == 0), cost: 1+n5
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5*n19+2*n19, arg2'=arg2P1, (-1+n5 >= 0 /\ -1+n19 >= 0 /\ ((-1+n5 >= 0 /\ -1-arg1+2*n5 >= 0) \/ (3-arg1 > 0 /\ 1-arg1+2*n5+2*n5*(-1+n19)-2*n19 >= 0)) /\ ((3-arg1 > 0 /\ 5-arg1+2*n5*(-1+n19)-2*n19 > 0) \/ (3-arg1 > 0 /\ -1+n5 >= 0)) /\ ((3-arg1 > 0 /\ 1+arg1-2*n5 >= 0) \/ (-1+n5 >= 0 /\ -1+arg1-2*n5-2*n5*(-1+n19)+2*n19 >= 0))), cost: n5*n19+n19

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> [3] : (3-arg1 > 0 /\ -1+n5 >= 0 /\ 1+arg1-2*n5 >= 0 /\ -1-arg1+2*n5 >= 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (3+arg1-2*n5 >= 0 /\ -1+n5 >= 0 /\ 1-arg1 > 0 /\ -arg1 > 0 /\ -3-arg1+2*n5 >= 0 /\ 3+arg1 > 0), cost: NONTERM

Heuristically decided not to add the following rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5*n19+2*n19, arg2'=arg2P1, (-1+n5 >= 0 /\ -1+n19 >= 0 /\ ((-1+n5 >= 0 /\ -1-arg1+2*n5 >= 0) \/ (3-arg1 > 0 /\ 1-arg1+2*n5+2*n5*(-1+n19)-2*n19 >= 0)) /\ ((3-arg1 > 0 /\ 5-arg1+2*n5*(-1+n19)-2*n19 > 0) \/ (3-arg1 > 0 /\ -1+n5 >= 0)) /\ ((3-arg1 > 0 /\ 1+arg1-2*n5 >= 0) \/ (-1+n5 >= 0 /\ -1+arg1-2*n5-2*n5*(-1+n19)+2*n19 >= 0))), cost: n5*n19+n19

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1+2*n3, arg2'=arg2P1, (-arg1 > 0 /\ -1+n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: n3
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1+2*n3, arg2'=arg2P1, (4-arg1-2*n3 > 0 /\ 1-arg1 == 0 /\ -1+n3 >= 0), cost: 1+n3

Applied nonterm
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1+2*n3, arg2'=arg2P1, (4-arg1-2*n3 > 0 /\ 1-arg1 == 0 /\ -1+n3 >= 0), cost: 1+n3
New rule:
f98_0_loop_EQ -> [3] : (4-arg1-2*n3 > 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ -1+n3 >= 0), cost: NONTERM

Applied acceleration
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1+2*n3, arg2'=arg2P1, (4-arg1-2*n3 > 0 /\ 1-arg1 == 0 /\ -1+n3 >= 0), cost: 1+n3
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1+2*n3*n21-2*n21, arg2'=arg2P1, (-1+n21 >= 0 /\ -1+n3 >= 0 /\ ((1-arg1 >= 0 /\ -1+n3 >= 0 /\ -1-arg1-2*n3*(-1+n21)+2*n21 >= 0) \/ (4-arg1-2*n3 > 0 /\ 1-arg1 >= 0)) /\ ((-1+arg1 >= 0 /\ -1+n3 >= 0) \/ (-1+arg1 >= 0 /\ 1+arg1+2*n3*(-1+n21)-2*n21 >= 0)) /\ ((4-arg1-2*n3 > 0 /\ 2-arg1-2*n3*(-1+n21)-2*n3+2*n21 > 0 /\ -1+n3 >= 0) \/ (4-arg1-2*n3 > 0 /\ -1+arg1 >= 0))), cost: n3*n21+n21

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1+2*n3, arg2'=arg2P1, (-arg1 > 0 /\ -1+n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: n3
Second rule:
f98_0_loop_EQ -> [3] : (4-arg1-2*n3 > 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ -1+n3 >= 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (4-arg1-4*n3 > 0 /\ -arg1 > 0 /\ -1+n3 >= 0 /\ -1+arg1+2*n3 >= 0 /\ 1-arg1-2*n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: NONTERM

Heuristically decided not to add the following rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1+2*n3*n21-2*n21, arg2'=arg2P1, (-1+n21 >= 0 /\ -1+n3 >= 0 /\ ((1-arg1 >= 0 /\ -1+n3 >= 0 /\ -1-arg1-2*n3*(-1+n21)+2*n21 >= 0) \/ (4-arg1-2*n3 > 0 /\ 1-arg1 >= 0)) /\ ((-1+arg1 >= 0 /\ -1+n3 >= 0) \/ (-1+arg1 >= 0 /\ 1+arg1+2*n3*(-1+n21)-2*n21 >= 0)) /\ ((4-arg1-2*n3 > 0 /\ 2-arg1-2*n3*(-1+n21)-2*n3+2*n21 > 0 /\ -1+n3 >= 0) \/ (4-arg1-2*n3 > 0 /\ -1+arg1 >= 0))), cost: n3*n21+n21

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1+2*n3, arg2'=arg2P1, (-arg1 > 0 /\ -1+n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: n3
Second rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1+2*n3, arg2'=arg2P2, (-1+n3 >= 0 /\ 1-arg1-2*n3 == 0 /\ 3+arg1 > 0), cost: 1+n3

Applied nonterm
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1+2*n3, arg2'=arg2P2, (-1+n3 >= 0 /\ 1-arg1-2*n3 == 0 /\ 3+arg1 > 0), cost: 1+n3
New rule:
f98_0_loop_EQ -> [3] : (-1+n3 >= 0 /\ -1+arg1+2*n3 >= 0 /\ 1-arg1-2*n3 >= 0 /\ 3+arg1 > 0), cost: NONTERM

Applied acceleration
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1+2*n3, arg2'=arg2P2, (-1+n3 >= 0 /\ 1-arg1-2*n3 == 0 /\ 3+arg1 > 0), cost: 1+n3
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n23+2*n23*n3, arg2'=arg2P2, (-1+n23 >= 0 /\ -1+n3 >= 0 /\ -1+arg1+2*n3 >= 0 /\ ((-1+arg1+2*n3 >= 0 /\ 1-arg1-2*n3 >= 0 /\ 3+arg1 > 0) \/ (-1-arg1+2*n23-2*n3-2*n3*(-1+n23) >= 0 /\ -1+n3 >= 0)) /\ ((5+arg1-2*n23+2*n3*(-1+n23) > 0 /\ 3+arg1 > 0) \/ (-1+arg1+2*n3 >= 0 /\ 3+arg1 > 0))), cost: n23+n23*n3

Applied chaining
First rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> [3] : (-1+n3 >= 0 /\ -1+arg1+2*n3 >= 0 /\ 1-arg1-2*n3 >= 0 /\ 3+arg1 > 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (arg1 > 0 /\ 3-arg1 > 0 /\ -3+arg1+2*n3 >= 0 /\ -1+n3 >= 0 /\ 1+arg1 > 0 /\ 3-arg1-2*n3 >= 0), cost: NONTERM

Heuristically decided not to add the following rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n23+2*n23*n3, arg2'=arg2P2, (-1+n23 >= 0 /\ -1+n3 >= 0 /\ -1+arg1+2*n3 >= 0 /\ ((-1+arg1+2*n3 >= 0 /\ 1-arg1-2*n3 >= 0 /\ 3+arg1 > 0) \/ (-1-arg1+2*n23-2*n3-2*n3*(-1+n23) >= 0 /\ -1+n3 >= 0)) /\ ((5+arg1-2*n23+2*n3*(-1+n23) > 0 /\ 3+arg1 > 0) \/ (-1+arg1+2*n3 >= 0 /\ 3+arg1 > 0))), cost: n23+n23*n3

Applied simplification
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1+2*n3, arg2'=arg2P1, (-arg1 > 0 /\ -1+n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: n3
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1+2*n3, arg2'=arg2P1, (-1+n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: n3

Applied simplification
Original rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0), cost: n5
New rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5, arg2'=arg2P2, (3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0), cost: n5

Applied simplification
Original rule:
f98_0_loop_EQ -> [3] : (1+arg1 >= 0 /\ -1-arg1 >= 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (1+arg1 <= 0 /\ 1+arg1 >= 0), cost: NONTERM

Applied simplification
Original rule:
f98_0_loop_EQ -> [3] : (arg1 > 0 /\ 3-arg1 > 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (-1+arg1 <= 0 /\ -1+arg1 >= 0), cost: NONTERM

Applied simplification
Original rule:
f98_0_loop_EQ -> [3] : (1-arg1 >= 0 /\ -1+arg1 >= 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (-1+arg1 <= 0 /\ -1+arg1 >= 0), cost: NONTERM

Applied simplification
Original rule:
f98_0_loop_EQ -> [3] : (-arg1 > 0 /\ 1+arg1 >= 0 /\ -1-arg1 >= 0 /\ 3+arg1 > 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (1+arg1 <= 0 /\ 1+arg1 >= 0), cost: NONTERM

Applied simplification
Original rule:
f98_0_loop_EQ -> [3] : (-1+n5 >= 0 /\ 1+arg1 >= 0 /\ -1-arg1 >= 0 /\ 4+arg1-2*n5 > 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (-1+n5 >= 0 /\ 1+arg1 <= 0 /\ 4+arg1-2*n5 > 0), cost: NONTERM

Applied simplification
Original rule:
f98_0_loop_EQ -> [3] : (arg1 > 0 /\ 3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0 /\ 1+arg1-2*n5 >= 0 /\ -1-arg1+2*n5 >= 0 /\ 4+arg1-4*n5 > 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (-1+n5 >= 0 /\ -1-arg1+2*n5 >= 0 /\ 4+arg1-4*n5 > 0), cost: NONTERM

Applied simplification
Original rule:
f98_0_loop_EQ -> [3] : (3+arg1-2*n5 >= 0 /\ -1+n5 >= 0 /\ 1-arg1 > 0 /\ -arg1 > 0 /\ -3-arg1+2*n5 >= 0 /\ 3+arg1 > 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (3+arg1-2*n5 >= 0 /\ -arg1 > 0 /\ -3-arg1+2*n5 >= 0 /\ 3+arg1 > 0), cost: NONTERM

Applied simplification
Original rule:
f98_0_loop_EQ -> [3] : (4-arg1-2*n3 > 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ -1+n3 >= 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (4-arg1-2*n3 > 0 /\ -1+arg1 >= 0 /\ -1+n3 >= 0), cost: NONTERM

Applied simplification
Original rule:
f98_0_loop_EQ -> [3] : (4-arg1-4*n3 > 0 /\ -arg1 > 0 /\ -1+n3 >= 0 /\ -1+arg1+2*n3 >= 0 /\ 1-arg1-2*n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (-1+n3 >= 0 /\ -1+arg1+2*n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: NONTERM

Applied simplification
Original rule:
f98_0_loop_EQ -> [3] : (arg1 > 0 /\ 3-arg1 > 0 /\ -3+arg1+2*n3 >= 0 /\ -1+n3 >= 0 /\ 1+arg1 > 0 /\ 3-arg1-2*n3 >= 0), cost: NONTERM
New rule:
f98_0_loop_EQ -> [3] : (-3+arg1+2*n3 >= 0 /\ -1+n3 >= 0 /\ 1+arg1 > 0 /\ 3-arg1-2*n3 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 7 8

Applied deletion
Removed the following rules: 27 28

Accelerated simple loops
Start location: __init
   6: f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   9: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2-arg1, arg2'=arg2P3, -2+arg1 > 0, cost: 1
  10: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2-arg1, arg2'=arg2P4, -2-arg1 > 0, cost: 1
  19: f98_0_loop_EQ -> [3] : (3-arg1 > 0 /\ -1+n5 >= 0 /\ 1+arg1-2*n5 >= 0 /\ -1-arg1+2*n5 >= 0), cost: NONTERM
  23: f98_0_loop_EQ -> [3] : (-1+n3 >= 0 /\ -1+arg1+2*n3 >= 0 /\ 1-arg1-2*n3 >= 0 /\ 3+arg1 > 0), cost: NONTERM
  25: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1+2*n3, arg2'=arg2P1, (-1+n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: n3
  26: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5, arg2'=arg2P2, (3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0), cost: n5
  29: f98_0_loop_EQ -> [3] : (-1+arg1 <= 0 /\ -1+arg1 >= 0), cost: NONTERM
  30: f98_0_loop_EQ -> [3] : (1+arg1 <= 0 /\ 1+arg1 >= 0), cost: NONTERM
  31: f98_0_loop_EQ -> [3] : (-1+n5 >= 0 /\ 1+arg1 <= 0 /\ 4+arg1-2*n5 > 0), cost: NONTERM
  32: f98_0_loop_EQ -> [3] : (-1+n5 >= 0 /\ -1-arg1+2*n5 >= 0 /\ 4+arg1-4*n5 > 0), cost: NONTERM
  33: f98_0_loop_EQ -> [3] : (3+arg1-2*n5 >= 0 /\ -arg1 > 0 /\ -3-arg1+2*n5 >= 0 /\ 3+arg1 > 0), cost: NONTERM
  34: f98_0_loop_EQ -> [3] : (4-arg1-2*n3 > 0 /\ -1+arg1 >= 0 /\ -1+n3 >= 0), cost: NONTERM
  35: f98_0_loop_EQ -> [3] : (-1+n3 >= 0 /\ -1+arg1+2*n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: NONTERM
  36: f98_0_loop_EQ -> [3] : (-3+arg1+2*n3 >= 0 /\ -1+n3 >= 0 /\ 1+arg1 > 0 /\ 3-arg1-2*n3 >= 0), cost: NONTERM
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2-arg1, arg2'=arg2P3, -2+arg1 > 0, cost: 1
New rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=2-arg2, arg2'=arg2P3, (arg1 > 0 /\ -2+arg2 > 0), cost: 2

Applied chaining
First rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> [3] : (3-arg1 > 0 /\ -1+n5 >= 0 /\ 1+arg1-2*n5 >= 0 /\ -1-arg1+2*n5 >= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ 3-arg2 > 0 /\ 1+arg2 > 0 /\ 1-2*n5+arg2 == 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5, arg2'=arg2P2, (3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0), cost: n5
New rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=-2*n5+arg2, arg2'=arg2P2, (arg1 > 0 /\ -1+n5 >= 0 /\ 3-arg2 > 0 /\ 2-2*n5+arg2 > 0), cost: 1+n5

Applied chaining
First rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> [3] : (-1+arg1 <= 0 /\ -1+arg1 >= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+arg2 == 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> [3] : (-1+n5 >= 0 /\ -1-arg1+2*n5 >= 0 /\ 4+arg1-4*n5 > 0), cost: NONTERM
New rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+2*n5-arg2 >= 0 /\ 1+arg2 > 0 /\ 4-4*n5+arg2 > 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> [3] : (4-arg1-2*n3 > 0 /\ -1+arg1 >= 0 /\ -1+n3 >= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+n3 >= 0 /\ -1+arg2 >= 0 /\ 4-2*n3-arg2 > 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f98_0_loop_EQ -> [3] : (-3+arg1+2*n3 >= 0 /\ -1+n3 >= 0 /\ 1+arg1 > 0 /\ 3-arg1-2*n3 >= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+n3 >= 0 /\ 3-2*n3-arg2 == 0 /\ 1+arg2 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 9 10 19 23 25 26 29 30 31 32 33 34 35 36

Chained accelerated rules with incoming rules
Start location: __init
   6: f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
  37: f1_0_main_Load -> f98_0_loop_EQ : arg1'=2-arg2, arg2'=arg2P3, (arg1 > 0 /\ -2+arg2 > 0), cost: 2
  38: f1_0_main_Load -> [3] : (arg1 > 0 /\ 3-arg2 > 0 /\ 1+arg2 > 0 /\ 1-2*n5+arg2 == 0), cost: NONTERM
  39: f1_0_main_Load -> f98_0_loop_EQ : arg1'=-2*n5+arg2, arg2'=arg2P2, (arg1 > 0 /\ -1+n5 >= 0 /\ 3-arg2 > 0 /\ 2-2*n5+arg2 > 0), cost: 1+n5
  40: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+arg2 == 0), cost: NONTERM
  41: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+2*n5-arg2 >= 0 /\ 1+arg2 > 0 /\ 4-4*n5+arg2 > 0), cost: NONTERM
  42: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+n3 >= 0 /\ -1+arg2 >= 0 /\ 4-2*n3-arg2 > 0), cost: NONTERM
  43: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+n3 >= 0 /\ 3-2*n3-arg2 == 0 /\ 1+arg2 > 0), cost: NONTERM
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Removed unreachable locations and irrelevant leafs
Start location: __init
  38: f1_0_main_Load -> [3] : (arg1 > 0 /\ 3-arg2 > 0 /\ 1+arg2 > 0 /\ 1-2*n5+arg2 == 0), cost: NONTERM
  40: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+arg2 == 0), cost: NONTERM
  41: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+2*n5-arg2 >= 0 /\ 1+arg2 > 0 /\ 4-4*n5+arg2 > 0), cost: NONTERM
  42: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+n3 >= 0 /\ -1+arg2 >= 0 /\ 4-2*n3-arg2 > 0), cost: NONTERM
  43: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+n3 >= 0 /\ 3-2*n3-arg2 == 0 /\ 1+arg2 > 0), cost: NONTERM
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Eliminating location f1_0_main_Load by chaining:

Applied chaining
First rule:
__init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1
Second rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ 3-arg2 > 0 /\ 1+arg2 > 0 /\ 1-2*n5+arg2 == 0), cost: NONTERM
New rule:
__init -> [3] : (1-2*n5+arg2P5 == 0 /\ 1+arg2P5 > 0 /\ arg1P5 > 0 /\ 3-arg2P5 > 0), cost: NONTERM

Applied chaining
First rule:
__init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1
Second rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+arg2 == 0), cost: NONTERM
New rule:
__init -> [3] : (-1+arg2P5 == 0 /\ arg1P5 > 0), cost: NONTERM

Applied chaining
First rule:
__init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1
Second rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+2*n5-arg2 >= 0 /\ 1+arg2 > 0 /\ 4-4*n5+arg2 > 0), cost: NONTERM
New rule:
__init -> [3] : (4-4*n5+arg2P5 > 0 /\ 1+arg2P5 > 0 /\ arg1P5 > 0 /\ -1+2*n5-arg2P5 >= 0), cost: NONTERM

Applied chaining
First rule:
__init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1
Second rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+n3 >= 0 /\ -1+arg2 >= 0 /\ 4-2*n3-arg2 > 0), cost: NONTERM
New rule:
__init -> [3] : (-1+n3 >= 0 /\ -1+arg2P5 >= 0 /\ 4-2*n3-arg2P5 > 0 /\ arg1P5 > 0), cost: NONTERM

Applied chaining
First rule:
__init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1
Second rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+n3 >= 0 /\ 3-2*n3-arg2 == 0 /\ 1+arg2 > 0), cost: NONTERM
New rule:
__init -> [3] : (1+arg2P5 > 0 /\ -1+n3 >= 0 /\ 3-2*n3-arg2P5 == 0 /\ arg1P5 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 5 38 40 41 42 43

Eliminated locations on tree-shaped paths
Start location: __init
  44: __init -> [3] : (1-2*n5+arg2P5 == 0 /\ 1+arg2P5 > 0 /\ arg1P5 > 0 /\ 3-arg2P5 > 0), cost: NONTERM
  45: __init -> [3] : (-1+arg2P5 == 0 /\ arg1P5 > 0), cost: NONTERM
  46: __init -> [3] : (4-4*n5+arg2P5 > 0 /\ 1+arg2P5 > 0 /\ arg1P5 > 0 /\ -1+2*n5-arg2P5 >= 0), cost: NONTERM
  47: __init -> [3] : (-1+n3 >= 0 /\ -1+arg2P5 >= 0 /\ 4-2*n3-arg2P5 > 0 /\ arg1P5 > 0), cost: NONTERM
  48: __init -> [3] : (1+arg2P5 > 0 /\ -1+n3 >= 0 /\ 3-2*n3-arg2P5 == 0 /\ arg1P5 > 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 44 via SMT.

Proved the following lower bound
Complexity:  Nonterm
Cpx degree: Nonterm

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (1-2*n5+arg2P5 == 0 /\ 1+arg2P5 > 0 /\ arg1P5 > 0 /\ 3-arg2P5 > 0)