NO

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f49_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1
   1: f49_0_loop_LE -> f49_0_loop_LE\' : arg1'=arg1P1, arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0 /\ arg1-arg1P1 == 0), cost: 1
   3: f49_0_loop_LE -> f49_0_loop_LE\' : arg1'=arg1P3, arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0 /\ arg1-arg1P3 == 0), cost: 1
   2: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (-5+arg1-5*x70 < 0 /\ arg1-arg1P2 == 0 /\ arg1-5*x70 >= 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1
   4: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -5+arg1-5*x110 < 0 /\ -1+arg1-arg1P4 == 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 -> f49_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1
New rule:
f1_0_main_Load -> f49_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f49_0_loop_LE -> f49_0_loop_LE\' : arg1'=arg1P1, arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0 /\ arg1-arg1P1 == 0), cost: 1
New rule:
f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0), cost: 1

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

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

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

Simplified rules
Start location: __init
   6: f1_0_main_Load -> f49_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   7: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0), cost: 1
   9: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 1
   8: f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1
  10: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ 5-arg1+5*x110 > 0), cost: 1
   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 -> f49_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
New rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2

Applied deletion
Removed the following rules: 5 6

Eliminated locations on linear paths
Start location: __init
   7: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0), cost: 1
   9: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 1
   8: f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1
  10: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ 5-arg1+5*x110 > 0), cost: 1
  11: __init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2


Eliminating location f49_0_loop_LE\' by chaining:

Applied chaining
First rule:
f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0), cost: 1
Second rule:
f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 2

Applied chaining
First rule:
f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 1
Second rule:
f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2

Applied chaining
First rule:
f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 1
Second rule:
f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ 5-arg1+5*x110 > 0), cost: 1
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2

Applied deletion
Removed the following rules: 7 8 9 10

Eliminated locations on tree-shaped paths
Start location: __init
  12: f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 2
  13: f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2
  14: f49_0_loop_LE -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2
  11: __init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2


Applied nonterm
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 2
New rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0), cost: NONTERM

Applied acceleration
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 2
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0), cost: 2*n2

Applied nonterm
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2
New rule:
f49_0_loop_LE -> [4] : (-arg1+5*x70 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM

Applied acceleration
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (-arg1+5*x70 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2*n4

Applied acceleration
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=arg1-n6, arg2'=arg2P4, (-1+n6 >= 0 /\ 1+arg1-n6-5*x110 > 0 /\ -1+arg1-n6 > 0 /\ 1+arg1-n6-5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2*n6

Applied instantiation
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=arg1-n6, arg2'=arg2P4, (-1+n6 >= 0 /\ 1+arg1-n6-5*x110 > 0 /\ -1+arg1-n6 > 0 /\ 1+arg1-n6-5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2*n6
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x110, arg2'=arg2P4, (1 > 0 /\ 1+5*x110-5*x90 > 0 /\ -1+5*x110 > 0 /\ -1+arg1-5*x110 >= 0 /\ 5-arg1+5*x110 > 0), cost: 2*arg1-10*x110

Applied instantiation
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=arg1-n6, arg2'=arg2P4, (-1+n6 >= 0 /\ 1+arg1-n6-5*x110 > 0 /\ -1+arg1-n6 > 0 /\ 1+arg1-n6-5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2*n6
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=2, arg2'=arg2P4, (1 > 0 /\ 3-5*x90 > 0 /\ -3+arg1 >= 0 /\ 5-arg1+5*x110 > 0 /\ 3-5*x110 > 0), cost: -4+2*arg1

Applied instantiation
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=arg1-n6, arg2'=arg2P4, (-1+n6 >= 0 /\ 1+arg1-n6-5*x110 > 0 /\ -1+arg1-n6 > 0 /\ 1+arg1-n6-5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2*n6
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x90, arg2'=arg2P4, (-1+arg1-5*x90 >= 0 /\ 1 > 0 /\ 1-5*x110+5*x90 > 0 /\ -1+5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2*arg1-10*x90

Applied chaining
First rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 2
Second rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 4

Applied nonterm
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 4
New rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM

Applied acceleration
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 4
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 4*n10

Applied chaining
First rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2
Second rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
New rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM

Heuristically decided not to add the following rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 4*n10

Applied chaining
First rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2
Second rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 2
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 4

Applied nonterm
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 4
New rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM

Applied acceleration
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 4
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 4*n12

Applied chaining
First rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 2
Second rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
New rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ arg1-5*x50 == 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM

Heuristically decided not to add the following rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 4*n12

Applied simplification
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x110, arg2'=arg2P4, (1 > 0 /\ 1+5*x110-5*x90 > 0 /\ -1+5*x110 > 0 /\ -1+arg1-5*x110 >= 0 /\ 5-arg1+5*x110 > 0), cost: 2*arg1-10*x110
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x110, arg2'=arg2P4, (1+5*x110-5*x90 > 0 /\ -1+5*x110 > 0 /\ -1+arg1-5*x110 >= 0 /\ 5-arg1+5*x110 > 0), cost: 2*arg1-10*x110

Applied simplification
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=2, arg2'=arg2P4, (1 > 0 /\ 3-5*x90 > 0 /\ -3+arg1 >= 0 /\ 5-arg1+5*x110 > 0 /\ 3-5*x110 > 0), cost: -4+2*arg1
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=2, arg2'=arg2P4, (3-5*x90 > 0 /\ -3+arg1 >= 0 /\ 5-arg1+5*x110 > 0 /\ 3-5*x110 > 0), cost: -4+2*arg1

Applied simplification
Original rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x90, arg2'=arg2P4, (-1+arg1-5*x90 >= 0 /\ 1 > 0 /\ 1-5*x110+5*x90 > 0 /\ -1+5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2*arg1-10*x90
New rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x90, arg2'=arg2P4, (-1+arg1-5*x90 >= 0 /\ 1-5*x110+5*x90 > 0 /\ -1+5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2*arg1-10*x90

Applied simplification
Original rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
New rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM

Applied simplification
Original rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ arg1-5*x50 == 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
New rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 12 13 14

Applied deletion
Removed the following rules: 22

Accelerated simple loops
Start location: __init
  15: f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0), cost: NONTERM
  16: f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0), cost: 2*n2
  17: f49_0_loop_LE -> [4] : (-arg1+5*x70 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
  18: f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (-arg1+5*x70 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2*n4
  24: f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
  26: f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x110, arg2'=arg2P4, (1+5*x110-5*x90 > 0 /\ -1+5*x110 > 0 /\ -1+arg1-5*x110 >= 0 /\ 5-arg1+5*x110 > 0), cost: 2*arg1-10*x110
  27: f49_0_loop_LE -> f49_0_loop_LE : arg1'=2, arg2'=arg2P4, (3-5*x90 > 0 /\ -3+arg1 >= 0 /\ 5-arg1+5*x110 > 0 /\ 3-5*x110 > 0), cost: -4+2*arg1
  28: f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x90, arg2'=arg2P4, (-1+arg1-5*x90 >= 0 /\ 1-5*x110+5*x90 > 0 /\ -1+5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2*arg1-10*x90
  29: f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
  30: f49_0_loop_LE -> [4] : (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
  11: __init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2


Applied chaining
First rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0), cost: NONTERM
New rule:
__init -> [4] : -2+5*x50 > 0, cost: NONTERM

Applied chaining
First rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0), cost: 2*n2
New rule:
__init -> f49_0_loop_LE : arg1'=5*x50, arg2'=arg2P2, -2+5*x50 > 0, cost: 2+2*n2

Applied chaining
First rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f49_0_loop_LE -> [4] : (-arg1+5*x70 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
New rule:
__init -> [4] : (-2+5*x70 > 0 /\ 5*x70-5*x90 > 0), cost: NONTERM

Applied chaining
First rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (-arg1+5*x70 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2*n4
New rule:
__init -> f49_0_loop_LE : arg1'=5*x70, arg2'=arg2P2, (-2+5*x70 > 0 /\ 5*x70-5*x90 > 0), cost: 2+2*n4

Applied chaining
First rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x70 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 >= 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
New rule:
__init -> [4] : (-2+5*x50 > 0 /\ 5*x50-5*x90 > 0), cost: NONTERM

Applied chaining
First rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x110, arg2'=arg2P4, (1+5*x110-5*x90 > 0 /\ -1+5*x110 > 0 /\ -1+arg1-5*x110 >= 0 /\ 5-arg1+5*x110 > 0), cost: 2*arg1-10*x110
New rule:
__init -> f49_0_loop_LE : arg1'=5*x110, arg2'=arg2P4, (5+5*x110-arg2P5 > 0 /\ 1+5*x110-5*x90 > 0 /\ -1-5*x110+arg2P5 >= 0 /\ -1+5*x110 > 0), cost: 2-10*x110+2*arg2P5

Applied chaining
First rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=2, arg2'=arg2P4, (3-5*x90 > 0 /\ -3+arg1 >= 0 /\ 5-arg1+5*x110 > 0 /\ 3-5*x110 > 0), cost: -4+2*arg1
New rule:
__init -> f49_0_loop_LE : arg1'=2, arg2'=arg2P4, (-3+arg2P5 >= 0 /\ 5+5*x110-arg2P5 > 0 /\ 3-5*x90 > 0 /\ 3-5*x110 > 0), cost: -2+2*arg2P5

Applied chaining
First rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x90, arg2'=arg2P4, (-1+arg1-5*x90 >= 0 /\ 1-5*x110+5*x90 > 0 /\ -1+5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2*arg1-10*x90
New rule:
__init -> f49_0_loop_LE : arg1'=5*x90, arg2'=arg2P4, (5+5*x110-arg2P5 > 0 /\ 1-5*x110+5*x90 > 0 /\ -1+5*x90 > 0 /\ -1-5*x90+arg2P5 >= 0), cost: 2-10*x90+2*arg2P5

Applied chaining
First rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 >= 0 /\ -arg1+5*x50 >= 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
New rule:
__init -> [4] : (-2+5*x50 > 0 /\ 5*x50-5*x90 > 0), cost: NONTERM

Applied chaining
First rule:
__init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f49_0_loop_LE -> [4] : (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: NONTERM
New rule:
__init -> [4] : (-2+5*x50 > 0 /\ 5*x50-5*x90 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 15 16 17 18 24 26 27 28 29 30

Chained accelerated rules with incoming rules
Start location: __init
  11: __init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2
  31: __init -> [4] : -2+5*x50 > 0, cost: NONTERM
  32: __init -> f49_0_loop_LE : arg1'=5*x50, arg2'=arg2P2, -2+5*x50 > 0, cost: 2+2*n2
  33: __init -> [4] : (-2+5*x70 > 0 /\ 5*x70-5*x90 > 0), cost: NONTERM
  34: __init -> f49_0_loop_LE : arg1'=5*x70, arg2'=arg2P2, (-2+5*x70 > 0 /\ 5*x70-5*x90 > 0), cost: 2+2*n4
  35: __init -> [4] : (-2+5*x50 > 0 /\ 5*x50-5*x90 > 0), cost: NONTERM
  36: __init -> f49_0_loop_LE : arg1'=5*x110, arg2'=arg2P4, (5+5*x110-arg2P5 > 0 /\ 1+5*x110-5*x90 > 0 /\ -1-5*x110+arg2P5 >= 0 /\ -1+5*x110 > 0), cost: 2-10*x110+2*arg2P5
  37: __init -> f49_0_loop_LE : arg1'=2, arg2'=arg2P4, (-3+arg2P5 >= 0 /\ 5+5*x110-arg2P5 > 0 /\ 3-5*x90 > 0 /\ 3-5*x110 > 0), cost: -2+2*arg2P5
  38: __init -> f49_0_loop_LE : arg1'=5*x90, arg2'=arg2P4, (5+5*x110-arg2P5 > 0 /\ 1-5*x110+5*x90 > 0 /\ -1+5*x90 > 0 /\ -1-5*x90+arg2P5 >= 0), cost: 2-10*x90+2*arg2P5
  39: __init -> [4] : (-2+5*x50 > 0 /\ 5*x50-5*x90 > 0), cost: NONTERM
  40: __init -> [4] : (-2+5*x50 > 0 /\ 5*x50-5*x90 > 0), cost: NONTERM


Removed unreachable locations and irrelevant leafs
Start location: __init
  31: __init -> [4] : -2+5*x50 > 0, cost: NONTERM
  33: __init -> [4] : (-2+5*x70 > 0 /\ 5*x70-5*x90 > 0), cost: NONTERM
  35: __init -> [4] : (-2+5*x50 > 0 /\ 5*x50-5*x90 > 0), cost: NONTERM
  39: __init -> [4] : (-2+5*x50 > 0 /\ 5*x50-5*x90 > 0), cost: NONTERM
  40: __init -> [4] : (-2+5*x50 > 0 /\ 5*x50-5*x90 > 0), cost: NONTERM


Removed duplicate rules (ignoring updates)
Start location: __init
  31: __init -> [4] : -2+5*x50 > 0, cost: NONTERM
  33: __init -> [4] : (-2+5*x70 > 0 /\ 5*x70-5*x90 > 0), cost: NONTERM
  40: __init -> [4] : (-2+5*x50 > 0 /\ 5*x50-5*x90 > 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 31 via SMT.

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

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  -2+5*x50 > 0