WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1
   1: f278_0_main_NE -> f322_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, arg4'=arg4P1, (arg2-arg1P1 == 0 /\ arg1-arg4P1 == 0 /\ -arg2P1+arg2 == 0 /\ -arg3+arg2 == 0 /\ -arg1+arg2 > 0 /\ -arg3P1+arg2 == 0), cost: 1
   2: f322_0_main_LE -> f278_0_main_NE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, (arg1-arg2P2 == 0 /\ -arg1P2+arg4 == 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 >= 0 /\ -arg3P2+arg2 == 0), cost: 1
   3: f322_0_main_LE -> f322_0_main_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, arg4'=arg4P3, (-1+arg2-arg2P3 == 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 < 0 /\ -1+arg1-arg1P3 == 0 /\ -1+arg2-arg3P3 == 0 /\ -arg4P3+arg4 == 0), cost: 1
   4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, TRUE, cost: 1


Applied preprocessing
Original rule:
f278_0_main_NE -> f322_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, arg4'=arg4P1, (arg2-arg1P1 == 0 /\ arg1-arg4P1 == 0 /\ -arg2P1+arg2 == 0 /\ -arg3+arg2 == 0 /\ -arg1+arg2 > 0 /\ -arg3P1+arg2 == 0), cost: 1
New rule:
f278_0_main_NE -> f322_0_main_LE : arg1'=arg2, arg3'=arg2, arg4'=arg1, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 1

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

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

Simplified rules
Start location: __init
   0: f1_0_main_Load -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1
   5: f278_0_main_NE -> f322_0_main_LE : arg1'=arg2, arg3'=arg2, arg4'=arg1, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 1
   6: f322_0_main_LE -> f278_0_main_NE : arg1'=arg4, arg3'=arg2, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg2+arg4 >= 0), cost: 1
   7: f322_0_main_LE -> f322_0_main_LE : arg1'=-1+arg1, arg3'=-1+arg2, arg2'=-1+arg2, (arg2-arg4 > 0 /\ -arg3+arg2 == 0), cost: 1
   4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, TRUE, cost: 1


Applied acceleration
Original rule:
f322_0_main_LE -> f322_0_main_LE : arg1'=-1+arg1, arg3'=-1+arg2, arg2'=-1+arg2, (arg2-arg4 > 0 /\ -arg3+arg2 == 0), cost: 1
New rule:
f322_0_main_LE -> f322_0_main_LE : arg1'=arg1-n0, arg3'=-n0+arg2, arg2'=-n0+arg2, (arg3-arg2 >= 0 /\ 1-n0+arg2-arg4 > 0 /\ -1+n0 >= 0 /\ -arg3+arg2 >= 0), cost: n0

Applied instantiation
Original rule:
f322_0_main_LE -> f322_0_main_LE : arg1'=arg1-n0, arg3'=-n0+arg2, arg2'=-n0+arg2, (arg3-arg2 >= 0 /\ 1-n0+arg2-arg4 > 0 /\ -1+n0 >= 0 /\ -arg3+arg2 >= 0), cost: n0
New rule:
f322_0_main_LE -> f322_0_main_LE : arg1'=arg1-arg2+arg4, arg3'=arg4, arg2'=arg4, (1 > 0 /\ arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -1+arg2-arg4 >= 0), cost: arg2-arg4

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

Applied deletion
Removed the following rules: 7

Accelerated simple loops
Start location: __init
   0: f1_0_main_Load -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1
   5: f278_0_main_NE -> f322_0_main_LE : arg1'=arg2, arg3'=arg2, arg4'=arg1, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 1
   6: f322_0_main_LE -> f278_0_main_NE : arg1'=arg4, arg3'=arg2, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg2+arg4 >= 0), cost: 1
   9: f322_0_main_LE -> f322_0_main_LE : arg1'=arg1-arg2+arg4, arg3'=arg4, arg2'=arg4, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -1+arg2-arg4 >= 0), cost: arg2-arg4
   4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, TRUE, cost: 1


Applied chaining
First rule:
f278_0_main_NE -> f322_0_main_LE : arg1'=arg2, arg3'=arg2, arg4'=arg1, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 1
Second rule:
f322_0_main_LE -> f322_0_main_LE : arg1'=arg1-arg2+arg4, arg3'=arg4, arg2'=arg4, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -1+arg2-arg4 >= 0), cost: arg2-arg4
New rule:
f278_0_main_NE -> f322_0_main_LE : arg3'=arg1, arg2'=arg1, arg4'=arg1, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 1-arg1+arg2

Applied deletion
Removed the following rules: 9

Chained accelerated rules with incoming rules
Start location: __init
   0: f1_0_main_Load -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1
   5: f278_0_main_NE -> f322_0_main_LE : arg1'=arg2, arg3'=arg2, arg4'=arg1, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 1
  10: f278_0_main_NE -> f322_0_main_LE : arg3'=arg1, arg2'=arg1, arg4'=arg1, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 1-arg1+arg2
   6: f322_0_main_LE -> f278_0_main_NE : arg1'=arg4, arg3'=arg2, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg2+arg4 >= 0), cost: 1
   4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, TRUE, cost: 1


Eliminating location f1_0_main_Load by chaining:

Applied chaining
First rule:
__init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, TRUE, cost: 1
Second rule:
f1_0_main_Load -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1
New rule:
__init -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P4 > 0 /\ arg1P4 > 0), cost: 2

Applied deletion
Removed the following rules: 0 4

Eliminated locations on linear paths
Start location: __init
   5: f278_0_main_NE -> f322_0_main_LE : arg1'=arg2, arg3'=arg2, arg4'=arg1, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 1
  10: f278_0_main_NE -> f322_0_main_LE : arg3'=arg1, arg2'=arg1, arg4'=arg1, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 1-arg1+arg2
   6: f322_0_main_LE -> f278_0_main_NE : arg1'=arg4, arg3'=arg2, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg2+arg4 >= 0), cost: 1
  11: __init -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P4 > 0 /\ arg1P4 > 0), cost: 2


Eliminating location f322_0_main_LE by chaining:

Applied chaining
First rule:
f278_0_main_NE -> f322_0_main_LE : arg3'=arg1, arg2'=arg1, arg4'=arg1, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 1-arg1+arg2
Second rule:
f322_0_main_LE -> f278_0_main_NE : arg1'=arg4, arg3'=arg2, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg2+arg4 >= 0), cost: 1
New rule:
f278_0_main_NE -> f278_0_main_NE : arg1'=arg1, arg3'=arg1, arg2'=arg1, arg4'=arg4P2, (0 >= 0 /\ 0 == 0 /\ -arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 2-arg1+arg2

Applied simplification
Original rule:
f278_0_main_NE -> f278_0_main_NE : arg1'=arg1, arg3'=arg1, arg2'=arg1, arg4'=arg4P2, (0 >= 0 /\ 0 == 0 /\ -arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 2-arg1+arg2
New rule:
f278_0_main_NE -> f278_0_main_NE : arg1'=arg1, arg3'=arg1, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 2-arg1+arg2

Applied deletion
Removed the following rules: 5 6 10

Eliminated locations on tree-shaped paths
Start location: __init
  12: f278_0_main_NE -> f278_0_main_NE : arg1'=arg1, arg3'=arg1, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 2-arg1+arg2
  11: __init -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P4 > 0 /\ arg1P4 > 0), cost: 2


Applied simplification
Original rule:
f278_0_main_NE -> f278_0_main_NE : arg1'=arg1, arg3'=arg1, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 2-arg1+arg2
New rule:
f278_0_main_NE -> f278_0_main_NE : arg3'=arg1, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 2-arg1+arg2

Simplified simple loops
Start location: __init
  13: f278_0_main_NE -> f278_0_main_NE : arg3'=arg1, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 2-arg1+arg2
  11: __init -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P4 > 0 /\ arg1P4 > 0), cost: 2


Accelerated simple loops
Start location: __init
  13: f278_0_main_NE -> f278_0_main_NE : arg3'=arg1, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 2-arg1+arg2
  11: __init -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P4 > 0 /\ arg1P4 > 0), cost: 2


Applied chaining
First rule:
__init -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P4 > 0 /\ arg1P4 > 0), cost: 2
Second rule:
f278_0_main_NE -> f278_0_main_NE : arg3'=arg1, arg2'=arg1, arg4'=arg4P2, (-arg3+arg2 == 0 /\ -arg1+arg2 > 0), cost: 2-arg1+arg2
New rule:
__init -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg1P0, arg2'=arg1P0, arg4'=arg4P2, (-arg1P0+arg2P0 > 0 /\ 1+arg1P0 > 0), cost: 4-arg1P0+arg2P0

Applied deletion
Removed the following rules: 13

Chained accelerated rules with incoming rules
Start location: __init
  11: __init -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (1+arg3P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P4 > 0 /\ arg1P4 > 0), cost: 2
  14: __init -> f278_0_main_NE : arg1'=arg1P0, arg3'=arg1P0, arg2'=arg1P0, arg4'=arg4P2, (-arg1P0+arg2P0 > 0 /\ 1+arg1P0 > 0), cost: 4-arg1P0+arg2P0


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