WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f1_0_main_Load\' : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ arg2-arg2P0 == 0 /\ 1+arg2 > 0 /\ arg1-arg1P0 == 0), cost: 1
   1: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, arg4'=arg4P1, (arg1 > 0 /\ -5+arg2-5*x160 < 0 /\ -arg1P1+arg2 == 0 /\ -4*x170+arg2 >= 0 /\ -4-4*x170+arg2 < 0 /\ arg2-5*x160 >= 0 /\ -arg2P1+arg2-5*x160 == 0 /\ -4*x190+arg2 >= 0 /\ 1+arg2 > 0 /\ -5-5*x180+arg2 < 0 /\ -4-4*x190+arg2 < 0 /\ -5*x180-12*x190+5*arg2-arg4P1 == 0 /\ -5*x180+arg2 >= 0 /\ -4*x170+arg2-arg3P1 == 0), cost: 1
   2: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, (-1+arg1+3*arg3+arg2-arg4P2 == 0 /\ 1+arg4 > 0 /\ arg3-arg3P2 == 0 /\ -arg1+arg2 < 0 /\ -1+arg1-arg1P2 == 0 /\ -arg2P2+arg2 == 0), cost: 1
   3: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, arg4'=arg4P3, (arg3-arg3P3 == 0 /\ arg3-arg2 < 0 /\ 1+arg4 > 0 /\ 1+arg1-arg1P3 == 0 /\ -arg1+arg2 >= 0 /\ -1+arg1+3*arg3+arg2-arg4P3 == 0 /\ -2-arg2P3+arg2 == 0), cost: 1
   4: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, (1+arg1-arg1P4 == 0 /\ 1+arg2-arg2P4 == 0 /\ arg3-arg2 >= 0 /\ -1+arg1-arg4P4+3*arg3+arg2 == 0 /\ 1+arg4 > 0 /\ -1+arg3-arg3P4 == 0 /\ -arg1+arg2 >= 0), cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, arg4'=arg4P5, TRUE, cost: 1


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

Applied preprocessing
Original rule:
f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, arg4'=arg4P1, (arg1 > 0 /\ -5+arg2-5*x160 < 0 /\ -arg1P1+arg2 == 0 /\ -4*x170+arg2 >= 0 /\ -4-4*x170+arg2 < 0 /\ arg2-5*x160 >= 0 /\ -arg2P1+arg2-5*x160 == 0 /\ -4*x190+arg2 >= 0 /\ 1+arg2 > 0 /\ -5-5*x180+arg2 < 0 /\ -4-4*x190+arg2 < 0 /\ -5*x180-12*x190+5*arg2-arg4P1 == 0 /\ -5*x180+arg2 >= 0 /\ -4*x170+arg2-arg3P1 == 0), cost: 1
New rule:
f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg3'=-4*x170+arg2, arg2'=arg2-5*x160, arg4'=-5*x180-12*x190+5*arg2, (arg1 > 0 /\ -4*x170+arg2 >= 0 /\ 5+5*x180-arg2 > 0 /\ 4+4*x190-arg2 > 0 /\ arg2-5*x160 >= 0 /\ 5-arg2+5*x160 > 0 /\ -4*x190+arg2 >= 0 /\ 1+arg2 > 0 /\ 4+4*x170-arg2 > 0 /\ -5*x180+arg2 >= 0), cost: 1

Applied preprocessing
Original rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, (-1+arg1+3*arg3+arg2-arg4P2 == 0 /\ 1+arg4 > 0 /\ arg3-arg3P2 == 0 /\ -arg1+arg2 < 0 /\ -1+arg1-arg1P2 == 0 /\ -arg2P2+arg2 == 0), cost: 1
New rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1+arg1, arg4'=-1+arg1+3*arg3+arg2, (1+arg4 > 0 /\ arg1-arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, arg4'=arg4P3, (arg3-arg3P3 == 0 /\ arg3-arg2 < 0 /\ 1+arg4 > 0 /\ 1+arg1-arg1P3 == 0 /\ -arg1+arg2 >= 0 /\ -1+arg1+3*arg3+arg2-arg4P3 == 0 /\ -2-arg2P3+arg2 == 0), cost: 1
New rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=-2+arg2, arg4'=-1+arg1+3*arg3+arg2, (1+arg4 > 0 /\ -arg3+arg2 > 0 /\ -arg1+arg2 >= 0), cost: 1

Applied preprocessing
Original rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, (1+arg1-arg1P4 == 0 /\ 1+arg2-arg2P4 == 0 /\ arg3-arg2 >= 0 /\ -1+arg1-arg4P4+3*arg3+arg2 == 0 /\ 1+arg4 > 0 /\ -1+arg3-arg3P4 == 0 /\ -arg1+arg2 >= 0), cost: 1
New rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg3'=-1+arg3, arg2'=1+arg2, arg4'=-1+arg1+3*arg3+arg2, (arg3-arg2 >= 0 /\ 1+arg4 > 0 /\ -arg1+arg2 >= 0), cost: 1

Simplified rules
Start location: __init
   6: f1_0_main_Load -> f1_0_main_Load\' : arg3'=arg3P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   7: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg3'=-4*x170+arg2, arg2'=arg2-5*x160, arg4'=-5*x180-12*x190+5*arg2, (arg1 > 0 /\ -4*x170+arg2 >= 0 /\ 5+5*x180-arg2 > 0 /\ 4+4*x190-arg2 > 0 /\ arg2-5*x160 >= 0 /\ 5-arg2+5*x160 > 0 /\ -4*x190+arg2 >= 0 /\ 1+arg2 > 0 /\ 4+4*x170-arg2 > 0 /\ -5*x180+arg2 >= 0), cost: 1
   8: f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1+arg1, arg4'=-1+arg1+3*arg3+arg2, (1+arg4 > 0 /\ arg1-arg2 > 0), cost: 1
   9: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=-2+arg2, arg4'=-1+arg1+3*arg3+arg2, (1+arg4 > 0 /\ -arg3+arg2 > 0 /\ -arg1+arg2 >= 0), cost: 1
  10: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg3'=-1+arg3, arg2'=1+arg2, arg4'=-1+arg1+3*arg3+arg2, (arg3-arg2 >= 0 /\ 1+arg4 > 0 /\ -arg1+arg2 >= 0), cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, arg4'=arg4P5, TRUE, cost: 1


Applied acceleration
Original rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1+arg1, arg4'=-1+arg1+3*arg3+arg2, (1+arg4 > 0 /\ arg1-arg2 > 0), cost: 1
New rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1-n2, arg4'=arg1+3*arg3+arg2-n2, (1+arg4 > 0 /\ 2+arg1+3*arg3+arg2-n2 > 0 /\ -1+n2 >= 0 /\ 1+arg1-arg2-n2 > 0), cost: n2

Applied instantiation
Original rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1-n2, arg4'=arg1+3*arg3+arg2-n2, (1+arg4 > 0 /\ 2+arg1+3*arg3+arg2-n2 > 0 /\ -1+n2 >= 0 /\ 1+arg1-arg2-n2 > 0), cost: n2
New rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1-3*arg3-arg2, arg4'=-1, (1 > 0 /\ arg1+3*arg3+arg2 >= 0 /\ 1+arg4 > 0 /\ -3*arg3-2*arg2 > 0), cost: 1+arg1+3*arg3+arg2

Applied instantiation
Original rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1-n2, arg4'=arg1+3*arg3+arg2-n2, (1+arg4 > 0 /\ 2+arg1+3*arg3+arg2-n2 > 0 /\ -1+n2 >= 0 /\ 1+arg1-arg2-n2 > 0), cost: n2
New rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg2, arg4'=3*arg3+2*arg2, (-1+arg1-arg2 >= 0 /\ 1 > 0 /\ 1+arg4 > 0 /\ 2+3*arg3+2*arg2 > 0), cost: arg1-arg2

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

Applied instantiation
Original rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1+n5, arg2'=-2*n5+arg2, arg4'=arg1-n5+3*arg3+arg2, (1+arg4 > 0 /\ 2-2*n5-arg3+arg2 > 0 /\ 3-arg1-3*n5+arg2 >= 0 /\ 2+arg1-n5+3*arg3+arg2 > 0 /\ -1+n5 >= 0), cost: n5
New rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+2*arg1+3*arg3+arg2, arg2'=-2-2*arg1-6*arg3-arg2, arg4'=-1, (1 > 0 /\ arg1+3*arg3+arg2 >= 0 /\ -2*arg1-7*arg3-arg2 > 0 /\ 1+arg4 > 0 /\ -4*arg1-9*arg3-2*arg2 >= 0), cost: 1+arg1+3*arg3+arg2

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

Applied instantiation
Original rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1+n7, arg3'=-n7+arg3, arg2'=n7+arg2, arg4'=arg1-n7+3*arg3+arg2, (2-2*n7+arg3-arg2 >= 0 /\ 1+arg4 > 0 /\ 2+arg1-n7+3*arg3+arg2 > 0 /\ -1+n7 >= 0 /\ -arg1+arg2 >= 0), cost: n7
New rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+2*arg1+3*arg3+arg2, arg3'=-1-arg1-2*arg3-arg2, arg2'=1+arg1+3*arg3+2*arg2, arg4'=-1, (1 > 0 /\ arg1+3*arg3+arg2 >= 0 /\ 1+arg4 > 0 /\ -arg1+arg2 >= 0 /\ -2*arg1-5*arg3-3*arg2 >= 0), cost: 1+arg1+3*arg3+arg2

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

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

Applied simplification
Original rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+2*arg1+3*arg3+arg2, arg2'=-2-2*arg1-6*arg3-arg2, arg4'=-1, (1 > 0 /\ arg1+3*arg3+arg2 >= 0 /\ -2*arg1-7*arg3-arg2 > 0 /\ 1+arg4 > 0 /\ -4*arg1-9*arg3-2*arg2 >= 0), cost: 1+arg1+3*arg3+arg2
New rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+2*arg1+3*arg3+arg2, arg2'=-2-2*arg1-6*arg3-arg2, arg4'=-1, (arg1+3*arg3+arg2 >= 0 /\ -2*arg1-7*arg3-arg2 > 0 /\ 1+arg4 > 0 /\ -4*arg1-9*arg3-2*arg2 >= 0), cost: 1+arg1+3*arg3+arg2

Applied simplification
Original rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+2*arg1+3*arg3+arg2, arg3'=-1-arg1-2*arg3-arg2, arg2'=1+arg1+3*arg3+2*arg2, arg4'=-1, (1 > 0 /\ arg1+3*arg3+arg2 >= 0 /\ 1+arg4 > 0 /\ -arg1+arg2 >= 0 /\ -2*arg1-5*arg3-3*arg2 >= 0), cost: 1+arg1+3*arg3+arg2
New rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+2*arg1+3*arg3+arg2, arg3'=-1-arg1-2*arg3-arg2, arg2'=1+arg1+3*arg3+2*arg2, arg4'=-1, (arg1+3*arg3+arg2 >= 0 /\ 1+arg4 > 0 /\ -arg1+arg2 >= 0 /\ -2*arg1-5*arg3-3*arg2 >= 0), cost: 1+arg1+3*arg3+arg2

Applied deletion
Removed the following rules: 8 9 10

Accelerated simple loops
Start location: __init
   6: f1_0_main_Load -> f1_0_main_Load\' : arg3'=arg3P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   7: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg3'=-4*x170+arg2, arg2'=arg2-5*x160, arg4'=-5*x180-12*x190+5*arg2, (arg1 > 0 /\ -4*x170+arg2 >= 0 /\ 5+5*x180-arg2 > 0 /\ 4+4*x190-arg2 > 0 /\ arg2-5*x160 >= 0 /\ 5-arg2+5*x160 > 0 /\ -4*x190+arg2 >= 0 /\ 1+arg2 > 0 /\ 4+4*x170-arg2 > 0 /\ -5*x180+arg2 >= 0), cost: 1
  15: f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1-3*arg3-arg2, arg4'=-1, (arg1+3*arg3+arg2 >= 0 /\ 1+arg4 > 0 /\ -3*arg3-2*arg2 > 0), cost: 1+arg1+3*arg3+arg2
  16: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg2, arg4'=3*arg3+2*arg2, (-1+arg1-arg2 >= 0 /\ 1+arg4 > 0 /\ 2+3*arg3+2*arg2 > 0), cost: arg1-arg2
  17: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+2*arg1+3*arg3+arg2, arg2'=-2-2*arg1-6*arg3-arg2, arg4'=-1, (arg1+3*arg3+arg2 >= 0 /\ -2*arg1-7*arg3-arg2 > 0 /\ 1+arg4 > 0 /\ -4*arg1-9*arg3-2*arg2 >= 0), cost: 1+arg1+3*arg3+arg2
  18: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+2*arg1+3*arg3+arg2, arg3'=-1-arg1-2*arg3-arg2, arg2'=1+arg1+3*arg3+2*arg2, arg4'=-1, (arg1+3*arg3+arg2 >= 0 /\ 1+arg4 > 0 /\ -arg1+arg2 >= 0 /\ -2*arg1-5*arg3-3*arg2 >= 0), cost: 1+arg1+3*arg3+arg2
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, arg4'=arg4P5, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg3'=-4*x170+arg2, arg2'=arg2-5*x160, arg4'=-5*x180-12*x190+5*arg2, (arg1 > 0 /\ -4*x170+arg2 >= 0 /\ 5+5*x180-arg2 > 0 /\ 4+4*x190-arg2 > 0 /\ arg2-5*x160 >= 0 /\ 5-arg2+5*x160 > 0 /\ -4*x190+arg2 >= 0 /\ 1+arg2 > 0 /\ 4+4*x170-arg2 > 0 /\ -5*x180+arg2 >= 0), cost: 1
Second rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg2, arg4'=3*arg3+2*arg2, (-1+arg1-arg2 >= 0 /\ 1+arg4 > 0 /\ 2+3*arg3+2*arg2 > 0), cost: arg1-arg2
New rule:
f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2-5*x160, arg3'=-4*x170+arg2, arg2'=arg2-5*x160, arg4'=-12*x170+5*arg2-10*x160, (arg1 > 0 /\ -4*x170+arg2 >= 0 /\ 5+5*x180-arg2 > 0 /\ 4+4*x190-arg2 > 0 /\ arg2-5*x160 >= 0 /\ 5-arg2+5*x160 > 0 /\ -4*x190+arg2 >= 0 /\ -1+5*x160 >= 0 /\ 4+4*x170-arg2 > 0 /\ -5*x180+arg2 >= 0), cost: 1+5*x160

Applied chaining
First rule:
f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg3'=-4*x170+arg2, arg2'=arg2-5*x160, arg4'=-5*x180-12*x190+5*arg2, (arg1 > 0 /\ -4*x170+arg2 >= 0 /\ 5+5*x180-arg2 > 0 /\ 4+4*x190-arg2 > 0 /\ arg2-5*x160 >= 0 /\ 5-arg2+5*x160 > 0 /\ -4*x190+arg2 >= 0 /\ 1+arg2 > 0 /\ 4+4*x170-arg2 > 0 /\ -5*x180+arg2 >= 0), cost: 1
Second rule:
f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+2*arg1+3*arg3+arg2, arg3'=-1-arg1-2*arg3-arg2, arg2'=1+arg1+3*arg3+2*arg2, arg4'=-1, (arg1+3*arg3+arg2 >= 0 /\ 1+arg4 > 0 /\ -arg1+arg2 >= 0 /\ -2*arg1-5*arg3-3*arg2 >= 0), cost: 1+arg1+3*arg3+arg2
New rule:
f1_0_main_Load\' -> f384_0_iter_LT : arg1'=1-12*x170+6*arg2-5*x160, arg3'=-1+8*x170-4*arg2+5*x160, arg2'=1-12*x170+6*arg2-10*x160, arg4'=-1, (arg1 > 0 /\ 5+5*x180-arg2 > 0 /\ -12*x170+5*arg2-5*x160 >= 0 /\ 4+4*x190-arg2 > 0 /\ -4*x190+arg2 >= 0 /\ 1+arg2 > 0 /\ -5*x160 >= 0 /\ 20*x170-10*arg2+15*x160 >= 0 /\ -5*x180+arg2 >= 0), cost: 2-12*x170+5*arg2-5*x160

Applied deletion
Removed the following rules: 15 16 17 18

Chained accelerated rules with incoming rules
Start location: __init
   6: f1_0_main_Load -> f1_0_main_Load\' : arg3'=arg3P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   7: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg3'=-4*x170+arg2, arg2'=arg2-5*x160, arg4'=-5*x180-12*x190+5*arg2, (arg1 > 0 /\ -4*x170+arg2 >= 0 /\ 5+5*x180-arg2 > 0 /\ 4+4*x190-arg2 > 0 /\ arg2-5*x160 >= 0 /\ 5-arg2+5*x160 > 0 /\ -4*x190+arg2 >= 0 /\ 1+arg2 > 0 /\ 4+4*x170-arg2 > 0 /\ -5*x180+arg2 >= 0), cost: 1
  19: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2-5*x160, arg3'=-4*x170+arg2, arg2'=arg2-5*x160, arg4'=-12*x170+5*arg2-10*x160, (arg1 > 0 /\ -4*x170+arg2 >= 0 /\ 5+5*x180-arg2 > 0 /\ 4+4*x190-arg2 > 0 /\ arg2-5*x160 >= 0 /\ 5-arg2+5*x160 > 0 /\ -4*x190+arg2 >= 0 /\ -1+5*x160 >= 0 /\ 4+4*x170-arg2 > 0 /\ -5*x180+arg2 >= 0), cost: 1+5*x160
  20: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=1-12*x170+6*arg2-5*x160, arg3'=-1+8*x170-4*arg2+5*x160, arg2'=1-12*x170+6*arg2-10*x160, arg4'=-1, (arg1 > 0 /\ 5+5*x180-arg2 > 0 /\ -12*x170+5*arg2-5*x160 >= 0 /\ 4+4*x190-arg2 > 0 /\ -4*x190+arg2 >= 0 /\ 1+arg2 > 0 /\ -5*x160 >= 0 /\ 20*x170-10*arg2+15*x160 >= 0 /\ -5*x180+arg2 >= 0), cost: 2-12*x170+5*arg2-5*x160
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, arg4'=arg4P5, TRUE, cost: 1


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