WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1
   1: f74_0_main_LE -> f74_0_main_LE\' : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ arg1-2*x50 == 0 /\ arg1-arg1P1 == 0), cost: 1
   2: f74_0_main_LE\' -> f74_0_main_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -2+arg1-2*x70 < 0 /\ arg1-2*x70 >= 0 /\ arg1-2*x70 == 0 /\ -1+arg1-arg1P2 == 0), cost: 1
   3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1


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

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

Simplified rules
Start location: __init
   0: f1_0_main_Load -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1
   4: f74_0_main_LE -> f74_0_main_LE\' : arg2'=arg2P1, (arg1 > 0 /\ arg1-2*x50 == 0), cost: 1
   5: f74_0_main_LE\' -> f74_0_main_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ arg1-2*x70 == 0), cost: 1
   3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1


Eliminating location f1_0_main_Load by chaining:

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

Applied deletion
Removed the following rules: 0 3

Eliminating location f74_0_main_LE\' by chaining:

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

Applied deletion
Removed the following rules: 4 5

Eliminated locations on linear paths
Start location: __init
   7: f74_0_main_LE -> f74_0_main_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ arg1-2*x70 == 0 /\ arg1-2*x50 == 0), cost: 2
   6: __init -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0 /\ 1+arg1P0 > 0), cost: 2


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

Applied instantiation
Original rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=arg1-n0, arg2'=arg2P2, (1+arg1-n0-2*x70 >= 0 /\ -1+n0 >= 0 /\ arg1-2*x70 >= 0 /\ 1+arg1-n0-2*x50 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ (1+arg1-n0 > 0 \/ (arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0))), cost: 2*n0
New rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=0, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ -1+arg1 >= 0 /\ arg1-2*x50 >= 0 /\ 1-2*x70 >= 0 /\ -arg1+2*x50 >= 0 /\ 1-2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ ((arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0) \/ 1 > 0)), cost: 2*arg1

Applied instantiation
Original rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=arg1-n0, arg2'=arg2P2, (1+arg1-n0-2*x70 >= 0 /\ -1+n0 >= 0 /\ arg1-2*x70 >= 0 /\ 1+arg1-n0-2*x50 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ (1+arg1-n0 > 0 \/ (arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0))), cost: 2*n0
New rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x70, arg2'=arg2P2, (0 >= 0 /\ arg1-2*x70 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ 2*x70-2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ ((arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0) \/ 2*x70 > 0)), cost: 2+2*arg1-4*x70

Applied instantiation
Original rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=arg1-n0, arg2'=arg2P2, (1+arg1-n0-2*x70 >= 0 /\ -1+n0 >= 0 /\ arg1-2*x70 >= 0 /\ 1+arg1-n0-2*x50 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ (1+arg1-n0 > 0 \/ (arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0))), cost: 2*n0
New rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x50, arg2'=arg2P2, (0 >= 0 /\ -2*x70+2*x50 >= 0 /\ arg1-2*x70 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ ((arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0) \/ 2*x50 > 0)), cost: 2+2*arg1-4*x50

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

Applied simplification
Original rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x70, arg2'=arg2P2, (0 >= 0 /\ arg1-2*x70 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ 2*x70-2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ ((arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0) \/ 2*x70 > 0)), cost: 2+2*arg1-4*x70
New rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x70, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ -arg1+2*x50 >= 0 /\ 2*x70 > 0 /\ 2*x70-2*x50 >= 0), cost: 2+2*arg1-4*x70

Applied simplification
Original rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x50, arg2'=arg2P2, (0 >= 0 /\ -2*x70+2*x50 >= 0 /\ arg1-2*x70 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ ((arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0) \/ 2*x50 > 0)), cost: 2+2*arg1-4*x50
New rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x50, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ arg1-2*x50 >= 0 /\ 2*x50 > 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0), cost: 2+2*arg1-4*x50

Applied deletion
Removed the following rules: 7

Accelerated simple loops
Start location: __init
  11: f74_0_main_LE -> f74_0_main_LE : arg1'=0, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ -1+arg1 >= 0 /\ arg1-2*x50 >= 0 /\ 1-2*x70 >= 0 /\ -arg1+2*x50 >= 0 /\ 1-2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ (1 > 0 \/ (arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0))), cost: 2*arg1
  12: f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x70, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ -arg1+2*x50 >= 0 /\ 2*x70 > 0 /\ 2*x70-2*x50 >= 0), cost: 2+2*arg1-4*x70
  13: f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x50, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ arg1-2*x50 >= 0 /\ 2*x50 > 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0), cost: 2+2*arg1-4*x50
   6: __init -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0 /\ 1+arg1P0 > 0), cost: 2


Applied chaining
First rule:
__init -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0 /\ 1+arg1P0 > 0), cost: 2
Second rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x70, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ -arg1+2*x50 >= 0 /\ 2*x70 > 0 /\ 2*x70-2*x50 >= 0), cost: 2+2*arg1-4*x70
New rule:
__init -> f74_0_main_LE : arg1'=-1+2*x70, arg2'=arg2P2, (-arg1P0+2*x50 >= 0 /\ 2*x70 > 0 /\ 2*x70-2*x50 >= 0 /\ arg1P0-2*x70 >= 0), cost: 4+2*arg1P0-4*x70

Applied chaining
First rule:
__init -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0 /\ 1+arg1P0 > 0), cost: 2
Second rule:
f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x50, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ arg1-2*x50 >= 0 /\ 2*x50 > 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0), cost: 2+2*arg1-4*x50
New rule:
__init -> f74_0_main_LE : arg1'=-1+2*x50, arg2'=arg2P2, 2*x50 > 0, cost: 4

Applied deletion
Removed the following rules: 11 12 13

Chained accelerated rules with incoming rules
Start location: __init
   6: __init -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0 /\ 1+arg1P0 > 0), cost: 2
  14: __init -> f74_0_main_LE : arg1'=-1+2*x70, arg2'=arg2P2, (-arg1P0+2*x50 >= 0 /\ 2*x70 > 0 /\ 2*x70-2*x50 >= 0 /\ arg1P0-2*x70 >= 0), cost: 4+2*arg1P0-4*x70
  15: __init -> f74_0_main_LE : arg1'=-1+2*x50, arg2'=arg2P2, 2*x50 > 0, cost: 4


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