WORST_CASE(Omega(0),?)

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


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

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

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

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

Simplified rules
Start location: __init
   0: f1_0_main_Load -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1
   6: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2-2*x100 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1
   8: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 1
   7: f145_0_main_LE\' -> f145_0_main_LE : arg2'=1+arg2, (1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1
   9: f145_0_main_LE\' -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 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 -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1
New rule:
__init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2

Applied deletion
Removed the following rules: 0 5

Eliminated locations on linear paths
Start location: __init
   6: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2-2*x100 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1
   8: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 1
   7: f145_0_main_LE\' -> f145_0_main_LE : arg2'=1+arg2, (1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1
   9: f145_0_main_LE\' -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1
  10: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2


Eliminating location f145_0_main_LE\' by chaining:

Applied chaining
First rule:
f145_0_main_LE -> f145_0_main_LE\' : (1+arg2-2*x100 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1
Second rule:
f145_0_main_LE\' -> f145_0_main_LE : arg2'=1+arg2, (1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1
New rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=1+arg2, (1+arg2-2*x100 == 0 /\ 1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 2

Applied chaining
First rule:
f145_0_main_LE -> f145_0_main_LE\' : (1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 1
Second rule:
f145_0_main_LE\' -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1
New rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 2

Applied deletion
Removed the following rules: 6 7 8 9

Eliminated locations on tree-shaped paths
Start location: __init
  11: f145_0_main_LE -> f145_0_main_LE : arg2'=1+arg2, (1+arg2-2*x100 == 0 /\ 1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 2
  12: f145_0_main_LE -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 2
  10: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2


Applied acceleration
Original rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=1+arg2, (1+arg2-2*x100 == 0 /\ 1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 2
New rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=arg2+n1, (-1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-arg2-n1 > 0 /\ 2*x130-arg2-n1 >= 0 /\ -arg2-n1+2*x100 >= 0 /\ -1+2*x130-arg2 >= 0 /\ n1 >= 0 /\ 1+arg2 > 0), cost: 2*n1

Applied instantiation
Original rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=arg2+n1, (-1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-arg2-n1 > 0 /\ 2*x130-arg2-n1 >= 0 /\ -arg2-n1+2*x100 >= 0 /\ -1+2*x130-arg2 >= 0 /\ n1 >= 0 /\ 1+arg2 > 0), cost: 2*n1
New rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=2*x130, (0 >= 0 /\ -2*x130+2*x100 >= 0 /\ -1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-2*x130 > 0 /\ 2*x130-arg2 >= 0 /\ -1+2*x130-arg2 >= 0 /\ 1+arg2 > 0), cost: 4*x130-2*arg2

Applied instantiation
Original rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=arg2+n1, (-1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-arg2-n1 > 0 /\ 2*x130-arg2-n1 >= 0 /\ -arg2-n1+2*x100 >= 0 /\ -1+2*x130-arg2 >= 0 /\ n1 >= 0 /\ 1+arg2 > 0), cost: 2*n1
New rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=2*x100, (0 >= 0 /\ -1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-2*x100 > 0 /\ -1+2*x130-arg2 >= 0 /\ 1+arg2 > 0 /\ -arg2+2*x100 >= 0 /\ 2*x130-2*x100 >= 0), cost: -2*arg2+4*x100

Applied instantiation
Original rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=arg2+n1, (-1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-arg2-n1 > 0 /\ 2*x130-arg2-n1 >= 0 /\ -arg2-n1+2*x100 >= 0 /\ -1+2*x130-arg2 >= 0 /\ n1 >= 0 /\ 1+arg2 > 0), cost: 2*n1
New rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=arg1, (1 > 0 /\ -1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ -1+2*x130-arg2 >= 0 /\ -arg1+2*x100 >= 0 /\ 1+arg2 > 0 /\ arg1-arg2 >= 0 /\ -arg1+2*x130 >= 0), cost: 2*arg1-2*arg2

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

Applied simplification
Original rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=2*x130, (0 >= 0 /\ -2*x130+2*x100 >= 0 /\ -1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-2*x130 > 0 /\ 2*x130-arg2 >= 0 /\ -1+2*x130-arg2 >= 0 /\ 1+arg2 > 0), cost: 4*x130-2*arg2
New rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=2*x130, (-1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-2*x130 > 0 /\ -1+2*x130-arg2 >= 0 /\ 1+arg2 > 0), cost: 4*x130-2*arg2

Applied simplification
Original rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=2*x100, (0 >= 0 /\ -1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-2*x100 > 0 /\ -1+2*x130-arg2 >= 0 /\ 1+arg2 > 0 /\ -arg2+2*x100 >= 0 /\ 2*x130-2*x100 >= 0), cost: -2*arg2+4*x100
New rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=2*x100, (1-2*x130+arg2 >= 0 /\ 1+arg1-2*x100 > 0 /\ -1+2*x130-arg2 >= 0 /\ 1+arg2 > 0 /\ -arg2+2*x100 >= 0 /\ 2*x130-2*x100 >= 0), cost: -2*arg2+4*x100

Applied simplification
Original rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=arg1, (1 > 0 /\ -1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ -1+2*x130-arg2 >= 0 /\ -arg1+2*x100 >= 0 /\ 1+arg2 > 0 /\ arg1-arg2 >= 0 /\ -arg1+2*x130 >= 0), cost: 2*arg1-2*arg2
New rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=arg1, (1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ -1+2*x130-arg2 >= 0 /\ -arg1+2*x100 >= 0 /\ 1+arg2 > 0 /\ arg1-arg2 >= 0), cost: 2*arg1-2*arg2

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

Applied deletion
Removed the following rules: 11 12

Accelerated simple loops
Start location: __init
  17: f145_0_main_LE -> f145_0_main_LE : arg2'=2*x130, (-1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-2*x130 > 0 /\ -1+2*x130-arg2 >= 0 /\ 1+arg2 > 0), cost: 4*x130-2*arg2
  18: f145_0_main_LE -> f145_0_main_LE : arg2'=2*x100, (1-2*x130+arg2 >= 0 /\ 1+arg1-2*x100 > 0 /\ -1+2*x130-arg2 >= 0 /\ 1+arg2 > 0 /\ -arg2+2*x100 >= 0 /\ 2*x130-2*x100 >= 0), cost: -2*arg2+4*x100
  19: f145_0_main_LE -> f145_0_main_LE : arg2'=arg1, (1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ -1+2*x130-arg2 >= 0 /\ -arg1+2*x100 >= 0 /\ 1+arg2 > 0 /\ arg1-arg2 >= 0), cost: 2*arg1-2*arg2
  20: f145_0_main_LE -> f145_0_main_LE : arg2'=2*n5+arg2, (arg2-2*x190 >= 0 /\ n5 >= 0 /\ -arg2+2*x160 >= 0 /\ 2+arg1-2*n5-arg2 > 0 /\ 2-2*n5-arg2+2*x190 >= 0 /\ 1+arg2 > 0 /\ -arg2+2*x190 >= 0 /\ arg2-2*x160 >= 0), cost: 2*n5
  10: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2


Applied chaining
First rule:
__init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=2*x130, (-1-arg2+2*x100 >= 0 /\ 1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ 1+arg1-2*x130 > 0 /\ -1+2*x130-arg2 >= 0 /\ 1+arg2 > 0), cost: 4*x130-2*arg2
New rule:
__init -> f145_0_main_LE : arg1'=arg1P0, arg2'=2*x100, (1+arg1P0-2*x100 > 0 /\ 2*x100 > 0), cost: 4

Applied chaining
First rule:
__init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=2*x100, (1-2*x130+arg2 >= 0 /\ 1+arg1-2*x100 > 0 /\ -1+2*x130-arg2 >= 0 /\ 1+arg2 > 0 /\ -arg2+2*x100 >= 0 /\ 2*x130-2*x100 >= 0), cost: -2*arg2+4*x100
New rule:
__init -> f145_0_main_LE : arg1'=arg1P0, arg2'=2*x100, (1-2*x130+2*x100 >= 0 /\ 1+arg1P0-2*x100 > 0 /\ 2*x130 > 0 /\ 2*x130-2*x100 >= 0), cost: 4-4*x130+4*x100

Applied chaining
First rule:
__init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=arg1, (1+arg2-2*x100 >= 0 /\ 1-2*x130+arg2 >= 0 /\ -1+2*x130-arg2 >= 0 /\ -arg1+2*x100 >= 0 /\ 1+arg2 > 0 /\ arg1-arg2 >= 0), cost: 2*arg1-2*arg2
New rule:
__init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg1P0, (-arg1P0+2*x100 >= 0 /\ 2*x130 > 0 /\ 1+arg1P0-2*x130 >= 0 /\ 2*x130-2*x100 >= 0), cost: 4+2*arg1P0-4*x130

Applied chaining
First rule:
__init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2
Second rule:
f145_0_main_LE -> f145_0_main_LE : arg2'=2*n5+arg2, (arg2-2*x190 >= 0 /\ n5 >= 0 /\ -arg2+2*x160 >= 0 /\ 2+arg1-2*n5-arg2 > 0 /\ 2-2*n5-arg2+2*x190 >= 0 /\ 1+arg2 > 0 /\ -arg2+2*x190 >= 0 /\ arg2-2*x160 >= 0), cost: 2*n5
New rule:
__init -> f145_0_main_LE : arg1'=arg1P0, arg2'=2*n5+2*x160, (2-2*n5+arg1P0-2*x160 > 0 /\ n5 >= 0 /\ 1+2*x160 > 0 /\ 1+arg1P0 > 0 /\ 2-2*n5 >= 0), cost: 2+2*n5

Applied deletion
Removed the following rules: 17 18 19 20

Chained accelerated rules with incoming rules
Start location: __init
  10: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2
  21: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=2*x100, (1+arg1P0-2*x100 > 0 /\ 2*x100 > 0), cost: 4
  22: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=2*x100, (1-2*x130+2*x100 >= 0 /\ 1+arg1P0-2*x100 > 0 /\ 2*x130 > 0 /\ 2*x130-2*x100 >= 0), cost: 4-4*x130+4*x100
  23: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg1P0, (-arg1P0+2*x100 >= 0 /\ 2*x130 > 0 /\ 1+arg1P0-2*x130 >= 0 /\ 2*x130-2*x100 >= 0), cost: 4+2*arg1P0-4*x130
  24: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=2*n5+2*x160, (2-2*n5+arg1P0-2*x160 > 0 /\ n5 >= 0 /\ 1+2*x160 > 0 /\ 1+arg1P0 > 0 /\ 2-2*n5 >= 0), cost: 2+2*n5


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