WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f33_0_rec_Cmp : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0 /\ -arg1P0+arg2 == 0), cost: 1
   1: f33_0_rec_Cmp -> f48_0_rec_GE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ arg1-arg1P1 == 0 /\ arg1-arg3P1 == 0), cost: 1
   2: f48_0_rec_GE -> f33_0_rec_Cmp : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg2 > 0 /\ -1+arg1-arg1P2 == 0 /\ -arg3+arg2 == 0 /\ -1 < 0), cost: 1
   3: f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (-arg3+arg2 == 0 /\ -100+arg2 < 0 /\ arg2 > 0 /\ -arg1P3+arg2 == 0), cost: 1
   4: f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (-arg3+arg2 == 0 /\ -100+arg2 < 0 /\ arg2 > 0 /\ -arg1P4+arg2 == 0), cost: 1
   5: f48_0_rec_GE -> f48_0_rec_GE : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, (-arg3+arg2 == 0 /\ -100+arg2 < 0 /\ arg1-arg1P5 == 0 /\ arg2 > 0 /\ 1+arg2-arg2P5 == 0 /\ 1-arg3P5+arg2 == 0), cost: 1
   6: f77_0_descend_LE -> f77_0_descend_LE : arg1'=arg1P6, arg3'=arg3P6, arg2'=arg2P6, (arg1 > 0 /\ -1+arg1-arg1P6 == 0 /\ -1 < 0), cost: 1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1


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

Applied preprocessing
Original rule:
f33_0_rec_Cmp -> f48_0_rec_GE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ arg1-arg1P1 == 0 /\ arg1-arg3P1 == 0), cost: 1
New rule:
f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=arg1, arg2'=arg1, TRUE, cost: 1

Applied preprocessing
Original rule:
f48_0_rec_GE -> f33_0_rec_Cmp : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg2 > 0 /\ -1+arg1-arg1P2 == 0 /\ -arg3+arg2 == 0 /\ -1 < 0), cost: 1
New rule:
f48_0_rec_GE -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg2 > 0 /\ -arg3+arg2 == 0), cost: 1

Applied preprocessing
Original rule:
f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (-arg3+arg2 == 0 /\ -100+arg2 < 0 /\ arg2 > 0 /\ -arg1P3+arg2 == 0), cost: 1
New rule:
f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg2, arg3'=arg3P3, arg2'=arg2P3, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (-arg3+arg2 == 0 /\ -100+arg2 < 0 /\ arg2 > 0 /\ -arg1P4+arg2 == 0), cost: 1
New rule:
f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg2, arg3'=arg3P4, arg2'=arg2P4, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f48_0_rec_GE -> f48_0_rec_GE : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, (-arg3+arg2 == 0 /\ -100+arg2 < 0 /\ arg1-arg1P5 == 0 /\ arg2 > 0 /\ 1+arg2-arg2P5 == 0 /\ 1-arg3P5+arg2 == 0), cost: 1
New rule:
f48_0_rec_GE -> f48_0_rec_GE : arg3'=1+arg2, arg2'=1+arg2, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f77_0_descend_LE -> f77_0_descend_LE : arg1'=arg1P6, arg3'=arg3P6, arg2'=arg2P6, (arg1 > 0 /\ -1+arg1-arg1P6 == 0 /\ -1 < 0), cost: 1
New rule:
f77_0_descend_LE -> f77_0_descend_LE : arg1'=-1+arg1, arg3'=arg3P6, arg2'=arg2P6, arg1 > 0, cost: 1

Simplified rules
Start location: __init
   8: f1_0_main_Load -> f33_0_rec_Cmp : arg1'=arg2, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   9: f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=arg1, arg2'=arg1, TRUE, cost: 1
  10: f48_0_rec_GE -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg2 > 0 /\ -arg3+arg2 == 0), cost: 1
  11: f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg2, arg3'=arg3P3, arg2'=arg2P3, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1
  12: f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg2, arg3'=arg3P4, arg2'=arg2P4, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1
  13: f48_0_rec_GE -> f48_0_rec_GE : arg3'=1+arg2, arg2'=1+arg2, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1
  14: f77_0_descend_LE -> f77_0_descend_LE : arg1'=-1+arg1, arg3'=arg3P6, arg2'=arg2P6, arg1 > 0, cost: 1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1


Applied acceleration
Original rule:
f48_0_rec_GE -> f48_0_rec_GE : arg3'=1+arg2, arg2'=1+arg2, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1
New rule:
f48_0_rec_GE -> f48_0_rec_GE : arg3'=arg2+n0, arg2'=arg2+n0, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -1+n0 >= 0 /\ 101-arg2-n0 > 0 /\ arg2 > 0), cost: n0

Applied instantiation
Original rule:
f48_0_rec_GE -> f48_0_rec_GE : arg3'=arg2+n0, arg2'=arg2+n0, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -1+n0 >= 0 /\ 101-arg2-n0 > 0 /\ arg2 > 0), cost: n0
New rule:
f48_0_rec_GE -> f48_0_rec_GE : arg3'=100, arg2'=100, (1 > 0 /\ arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ arg2 > 0 /\ 99-arg2 >= 0), cost: 100-arg2

Applied simplification
Original rule:
f48_0_rec_GE -> f48_0_rec_GE : arg3'=100, arg2'=100, (1 > 0 /\ arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ arg2 > 0 /\ 99-arg2 >= 0), cost: 100-arg2
New rule:
f48_0_rec_GE -> f48_0_rec_GE : arg3'=100, arg2'=100, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ arg2 > 0 /\ 99-arg2 >= 0), cost: 100-arg2

Applied deletion
Removed the following rules: 13

Applied acceleration
Original rule:
f77_0_descend_LE -> f77_0_descend_LE : arg1'=-1+arg1, arg3'=arg3P6, arg2'=arg2P6, arg1 > 0, cost: 1
New rule:
f77_0_descend_LE -> f77_0_descend_LE : arg1'=arg1-n3, arg3'=arg3P6, arg2'=arg2P6, (-1+n3 >= 0 /\ 1+arg1-n3 > 0), cost: n3

Applied instantiation
Original rule:
f77_0_descend_LE -> f77_0_descend_LE : arg1'=arg1-n3, arg3'=arg3P6, arg2'=arg2P6, (-1+n3 >= 0 /\ 1+arg1-n3 > 0), cost: n3
New rule:
f77_0_descend_LE -> f77_0_descend_LE : arg1'=0, arg3'=arg3P6, arg2'=arg2P6, (1 > 0 /\ -1+arg1 >= 0), cost: arg1

Applied simplification
Original rule:
f77_0_descend_LE -> f77_0_descend_LE : arg1'=0, arg3'=arg3P6, arg2'=arg2P6, (1 > 0 /\ -1+arg1 >= 0), cost: arg1
New rule:
f77_0_descend_LE -> f77_0_descend_LE : arg1'=0, arg3'=arg3P6, arg2'=arg2P6, -1+arg1 >= 0, cost: arg1

Applied deletion
Removed the following rules: 14

Accelerated simple loops
Start location: __init
   8: f1_0_main_Load -> f33_0_rec_Cmp : arg1'=arg2, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   9: f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=arg1, arg2'=arg1, TRUE, cost: 1
  10: f48_0_rec_GE -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg2 > 0 /\ -arg3+arg2 == 0), cost: 1
  11: f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg2, arg3'=arg3P3, arg2'=arg2P3, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1
  12: f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg2, arg3'=arg3P4, arg2'=arg2P4, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1
  16: f48_0_rec_GE -> f48_0_rec_GE : arg3'=100, arg2'=100, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ arg2 > 0 /\ 99-arg2 >= 0), cost: 100-arg2
  18: f77_0_descend_LE -> f77_0_descend_LE : arg1'=0, arg3'=arg3P6, arg2'=arg2P6, -1+arg1 >= 0, cost: arg1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1


Applied chaining
First rule:
f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=arg1, arg2'=arg1, TRUE, cost: 1
Second rule:
f48_0_rec_GE -> f48_0_rec_GE : arg3'=100, arg2'=100, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ arg2 > 0 /\ 99-arg2 >= 0), cost: 100-arg2
New rule:
f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=100, arg2'=100, (arg1 > 0 /\ -99+arg1 <= 0), cost: 101-arg1

Applied deletion
Removed the following rules: 16

Applied chaining
First rule:
f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg2, arg3'=arg3P3, arg2'=arg2P3, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1
Second rule:
f77_0_descend_LE -> f77_0_descend_LE : arg1'=0, arg3'=arg3P6, arg2'=arg2P6, -1+arg1 >= 0, cost: arg1
New rule:
f48_0_rec_GE -> f77_0_descend_LE : arg1'=0, arg3'=arg3P6, arg2'=arg2P6, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1+arg2

Applied chaining
First rule:
f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg2, arg3'=arg3P4, arg2'=arg2P4, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1
Second rule:
f77_0_descend_LE -> f77_0_descend_LE : arg1'=0, arg3'=arg3P6, arg2'=arg2P6, -1+arg1 >= 0, cost: arg1
New rule:
f48_0_rec_GE -> f77_0_descend_LE : arg1'=0, arg3'=arg3P6, arg2'=arg2P6, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1+arg2

Applied deletion
Removed the following rules: 18

Chained accelerated rules with incoming rules
Start location: __init
   8: f1_0_main_Load -> f33_0_rec_Cmp : arg1'=arg2, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   9: f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=arg1, arg2'=arg1, TRUE, cost: 1
  19: f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=100, arg2'=100, (arg1 > 0 /\ -99+arg1 <= 0), cost: 101-arg1
  10: f48_0_rec_GE -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg2 > 0 /\ -arg3+arg2 == 0), cost: 1
  11: f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg2, arg3'=arg3P3, arg2'=arg2P3, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1
  12: f48_0_rec_GE -> f77_0_descend_LE : arg1'=arg2, arg3'=arg3P4, arg2'=arg2P4, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1
  20: f48_0_rec_GE -> f77_0_descend_LE : arg1'=0, arg3'=arg3P6, arg2'=arg2P6, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1+arg2
  21: f48_0_rec_GE -> f77_0_descend_LE : arg1'=0, arg3'=arg3P6, arg2'=arg2P6, (-arg3+arg2 == 0 /\ 100-arg2 > 0 /\ arg2 > 0), cost: 1+arg2
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1


Removed unreachable locations and irrelevant leafs
Start location: __init
   8: f1_0_main_Load -> f33_0_rec_Cmp : arg1'=arg2, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   9: f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=arg1, arg2'=arg1, TRUE, cost: 1
  19: f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=100, arg2'=100, (arg1 > 0 /\ -99+arg1 <= 0), cost: 101-arg1
  10: f48_0_rec_GE -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg2 > 0 /\ -arg3+arg2 == 0), cost: 1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1


Eliminating location f1_0_main_Load by chaining:

Applied chaining
First rule:
__init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1
Second rule:
f1_0_main_Load -> f33_0_rec_Cmp : arg1'=arg2, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
New rule:
__init -> f33_0_rec_Cmp : arg1'=arg2P7, arg3'=arg3P0, arg2'=arg2P0, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2

Applied deletion
Removed the following rules: 7 8

Eliminated locations on linear paths
Start location: __init
   9: f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=arg1, arg2'=arg1, TRUE, cost: 1
  19: f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=100, arg2'=100, (arg1 > 0 /\ -99+arg1 <= 0), cost: 101-arg1
  10: f48_0_rec_GE -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg2 > 0 /\ -arg3+arg2 == 0), cost: 1
  22: __init -> f33_0_rec_Cmp : arg1'=arg2P7, arg3'=arg3P0, arg2'=arg2P0, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2


Eliminating location f48_0_rec_GE by chaining:

Applied chaining
First rule:
f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=arg1, arg2'=arg1, TRUE, cost: 1
Second rule:
f48_0_rec_GE -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg2 > 0 /\ -arg3+arg2 == 0), cost: 1
New rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (0 == 0 /\ arg1 > 0 /\ -99+arg1 > 0), cost: 2

Applied simplification
Original rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (0 == 0 /\ arg1 > 0 /\ -99+arg1 > 0), cost: 2
New rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, -99+arg1 > 0, cost: 2

Applied chaining
First rule:
f33_0_rec_Cmp -> f48_0_rec_GE : arg3'=100, arg2'=100, (arg1 > 0 /\ -99+arg1 <= 0), cost: 101-arg1
Second rule:
f48_0_rec_GE -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg2 > 0 /\ -arg3+arg2 == 0), cost: 1
New rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (0 == 0 /\ arg1 > 0 /\ 1 > 0 /\ -99+arg1 <= 0), cost: 102-arg1

Applied simplification
Original rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (0 == 0 /\ arg1 > 0 /\ 1 > 0 /\ -99+arg1 <= 0), cost: 102-arg1
New rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg1 <= 0), cost: 102-arg1

Applied deletion
Removed the following rules: 9 10 19

Eliminated locations on tree-shaped paths
Start location: __init
  23: f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, -99+arg1 > 0, cost: 2
  24: f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg1 <= 0), cost: 102-arg1
  22: __init -> f33_0_rec_Cmp : arg1'=arg2P7, arg3'=arg3P0, arg2'=arg2P0, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2


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

Applied instantiation
Original rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=arg1-n7, arg3'=arg3P2, arg2'=arg2P2, (-1+n7 >= 0 /\ -98+arg1-n7 > 0), cost: 2*n7
New rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=99, arg3'=arg3P2, arg2'=arg2P2, (1 > 0 /\ -100+arg1 >= 0), cost: -198+2*arg1

Applied acceleration
Original rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=-1+arg1, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -99+arg1 <= 0), cost: 102-arg1
New rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=arg1-n9, arg3'=arg3P2, arg2'=arg2P2, (1+arg1-n9 > 0 /\ 99-arg1 >= 0 /\ -1+n9 >= 0), cost: 1/2*n9^2+203/2*n9-arg1*n9

Applied instantiation
Original rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=arg1-n9, arg3'=arg3P2, arg2'=arg2P2, (1+arg1-n9 > 0 /\ 99-arg1 >= 0 /\ -1+n9 >= 0), cost: 1/2*n9^2+203/2*n9-arg1*n9
New rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=0, arg3'=arg3P2, arg2'=arg2P2, (1 > 0 /\ -1+arg1 >= 0 /\ 99-arg1 >= 0), cost: 203/2*arg1-1/2*arg1^2

Applied simplification
Original rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=99, arg3'=arg3P2, arg2'=arg2P2, (1 > 0 /\ -100+arg1 >= 0), cost: -198+2*arg1
New rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=99, arg3'=arg3P2, arg2'=arg2P2, -100+arg1 >= 0, cost: -198+2*arg1

Applied simplification
Original rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=0, arg3'=arg3P2, arg2'=arg2P2, (1 > 0 /\ -1+arg1 >= 0 /\ 99-arg1 >= 0), cost: 203/2*arg1-1/2*arg1^2
New rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=0, arg3'=arg3P2, arg2'=arg2P2, (-99+arg1 <= 0 /\ -1+arg1 >= 0), cost: 203/2*arg1-1/2*arg1^2

Applied deletion
Removed the following rules: 23 24

Accelerated simple loops
Start location: __init
  27: f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=99, arg3'=arg3P2, arg2'=arg2P2, -100+arg1 >= 0, cost: -198+2*arg1
  28: f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=0, arg3'=arg3P2, arg2'=arg2P2, (-99+arg1 <= 0 /\ -1+arg1 >= 0), cost: 203/2*arg1-1/2*arg1^2
  22: __init -> f33_0_rec_Cmp : arg1'=arg2P7, arg3'=arg3P0, arg2'=arg2P0, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2


Applied chaining
First rule:
__init -> f33_0_rec_Cmp : arg1'=arg2P7, arg3'=arg3P0, arg2'=arg2P0, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2
Second rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=99, arg3'=arg3P2, arg2'=arg2P2, -100+arg1 >= 0, cost: -198+2*arg1
New rule:
__init -> f33_0_rec_Cmp : arg1'=99, arg3'=arg3P2, arg2'=arg2P2, -100+arg2P7 >= 0, cost: -196+2*arg2P7

Applied chaining
First rule:
__init -> f33_0_rec_Cmp : arg1'=arg2P7, arg3'=arg3P0, arg2'=arg2P0, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2
Second rule:
f33_0_rec_Cmp -> f33_0_rec_Cmp : arg1'=0, arg3'=arg3P2, arg2'=arg2P2, (-99+arg1 <= 0 /\ -1+arg1 >= 0), cost: 203/2*arg1-1/2*arg1^2
New rule:
__init -> f33_0_rec_Cmp : arg1'=0, arg3'=arg3P2, arg2'=arg2P2, (-1+arg2P7 >= 0 /\ -99+arg2P7 <= 0), cost: 2+203/2*arg2P7-1/2*arg2P7^2

Applied deletion
Removed the following rules: 27 28

Chained accelerated rules with incoming rules
Start location: __init
  22: __init -> f33_0_rec_Cmp : arg1'=arg2P7, arg3'=arg3P0, arg2'=arg2P0, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2
  29: __init -> f33_0_rec_Cmp : arg1'=99, arg3'=arg3P2, arg2'=arg2P2, -100+arg2P7 >= 0, cost: -196+2*arg2P7
  30: __init -> f33_0_rec_Cmp : arg1'=0, arg3'=arg3P2, arg2'=arg2P2, (-1+arg2P7 >= 0 /\ -99+arg2P7 <= 0), cost: 2+203/2*arg2P7-1/2*arg2P7^2


Removed unreachable locations and irrelevant leafs
Start location: __init
  <empty>


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0