WORST_CASE(Omega(0),?)

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


Applied preprocessing
Original rule:
f213_0_main_GT -> f252_0_main_LE : arg2'=arg2P1, arg1'=arg1P1, arg3'=arg3P1, (arg3-arg3P1 == 0 /\ arg1-arg1P1 == 0 /\ arg2-arg2P1 == 0 /\ -arg2+arg3 < 0), cost: 1
New rule:
f213_0_main_GT -> f252_0_main_LE : arg2-arg3 > 0, cost: 1

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

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

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

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

Simplified rules
Start location: __init
   0: f1_0_main_Load -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 1
   7: f213_0_main_GT -> f252_0_main_LE : arg2-arg3 > 0, cost: 1
   8: f213_0_main_GT -> f252_0_main_LE : (arg1-arg3 > 0 /\ arg2-arg3 <= 0), cost: 1
   9: f252_0_main_LE -> f213_0_main_GT : arg2'=-1+arg2, arg2-arg3 > 0, cost: 1
  10: f252_0_main_LE -> f213_0_main_GT : (-arg1+arg3 >= 0 /\ -arg2+arg3 >= 0), cost: 1
  11: f252_0_main_LE -> f213_0_main_GT : arg1'=-1+arg1, (arg1-arg3 > 0 /\ -arg2+arg3 >= 0), cost: 1
   6: __init -> f1_0_main_Load : arg2'=arg2P6, arg1'=arg1P6, arg3'=arg3P6, TRUE, cost: 1


Eliminating location f1_0_main_Load by chaining:

Applied chaining
First rule:
__init -> f1_0_main_Load : arg2'=arg2P6, arg1'=arg1P6, arg3'=arg3P6, TRUE, cost: 1
Second rule:
f1_0_main_Load -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 1
New rule:
__init -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (arg1P6 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P6 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 2

Applied deletion
Removed the following rules: 0 6

Eliminated locations on linear paths
Start location: __init
   7: f213_0_main_GT -> f252_0_main_LE : arg2-arg3 > 0, cost: 1
   8: f213_0_main_GT -> f252_0_main_LE : (arg1-arg3 > 0 /\ arg2-arg3 <= 0), cost: 1
   9: f252_0_main_LE -> f213_0_main_GT : arg2'=-1+arg2, arg2-arg3 > 0, cost: 1
  10: f252_0_main_LE -> f213_0_main_GT : (-arg1+arg3 >= 0 /\ -arg2+arg3 >= 0), cost: 1
  11: f252_0_main_LE -> f213_0_main_GT : arg1'=-1+arg1, (arg1-arg3 > 0 /\ -arg2+arg3 >= 0), cost: 1
  12: __init -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (arg1P6 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P6 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 2


Eliminating location f252_0_main_LE by chaining:

Applied chaining
First rule:
f213_0_main_GT -> f252_0_main_LE : arg2-arg3 > 0, cost: 1
Second rule:
f252_0_main_LE -> f213_0_main_GT : arg2'=-1+arg2, arg2-arg3 > 0, cost: 1
New rule:
f213_0_main_GT -> f213_0_main_GT : arg2'=-1+arg2, arg2-arg3 > 0, cost: 2

Applied chaining
First rule:
f213_0_main_GT -> f252_0_main_LE : (arg1-arg3 > 0 /\ arg2-arg3 <= 0), cost: 1
Second rule:
f252_0_main_LE -> f213_0_main_GT : arg1'=-1+arg1, (arg1-arg3 > 0 /\ -arg2+arg3 >= 0), cost: 1
New rule:
f213_0_main_GT -> f213_0_main_GT : arg1'=-1+arg1, (arg1-arg3 > 0 /\ arg2-arg3 <= 0 /\ -arg2+arg3 >= 0), cost: 2

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

Applied deletion
Removed the following rules: 7 8 9 10 11

Eliminated locations on tree-shaped paths
Start location: __init
  13: f213_0_main_GT -> f213_0_main_GT : arg2'=-1+arg2, arg2-arg3 > 0, cost: 2
  14: f213_0_main_GT -> f213_0_main_GT : arg1'=-1+arg1, (arg1-arg3 > 0 /\ -arg2+arg3 >= 0), cost: 2
  12: __init -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (arg1P6 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P6 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 2


Applied acceleration
Original rule:
f213_0_main_GT -> f213_0_main_GT : arg2'=-1+arg2, arg2-arg3 > 0, cost: 2
New rule:
f213_0_main_GT -> f213_0_main_GT : arg2'=arg2-n, (1+arg2-n-arg3 > 0 /\ n >= 0), cost: 2*n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_AhkgLo.txt

Applied instantiation
Original rule:
f213_0_main_GT -> f213_0_main_GT : arg2'=arg2-n, (1+arg2-n-arg3 > 0 /\ n >= 0), cost: 2*n
New rule:
f213_0_main_GT -> f213_0_main_GT : arg2'=arg3, (1 > 0 /\ arg2-arg3 >= 0), cost: 2*arg2-2*arg3

Applied acceleration
Original rule:
f213_0_main_GT -> f213_0_main_GT : arg1'=-1+arg1, (arg1-arg3 > 0 /\ -arg2+arg3 >= 0), cost: 2
New rule:
f213_0_main_GT -> f213_0_main_GT : arg1'=arg1-n0, (1+arg1-arg3-n0 > 0 /\ n0 >= 0 /\ -arg2+arg3 >= 0), cost: 2*n0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_jePdEA.txt

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

Applied simplification
Original rule:
f213_0_main_GT -> f213_0_main_GT : arg2'=arg3, (1 > 0 /\ arg2-arg3 >= 0), cost: 2*arg2-2*arg3
New rule:
f213_0_main_GT -> f213_0_main_GT : arg2'=arg3, arg2-arg3 >= 0, cost: 2*arg2-2*arg3

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

Applied deletion
Removed the following rules: 13 14

Accelerated simple loops
Start location: __init
  17: f213_0_main_GT -> f213_0_main_GT : arg2'=arg3, arg2-arg3 >= 0, cost: 2*arg2-2*arg3
  18: f213_0_main_GT -> f213_0_main_GT : arg1'=arg3, (arg1-arg3 >= 0 /\ -arg2+arg3 >= 0), cost: 2*arg1-2*arg3
  12: __init -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (arg1P6 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P6 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 2


Applied chaining
First rule:
__init -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (arg1P6 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P6 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 2
Second rule:
f213_0_main_GT -> f213_0_main_GT : arg2'=arg3, arg2-arg3 >= 0, cost: 2*arg2-2*arg3
New rule:
__init -> f213_0_main_GT : arg2'=arg3P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ 1+arg3P0 > 0 /\ arg2P0-arg3P0 >= 0), cost: 2+2*arg2P0-2*arg3P0

Applied chaining
First rule:
__init -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (arg1P6 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P6 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 2
Second rule:
f213_0_main_GT -> f213_0_main_GT : arg1'=arg3, (arg1-arg3 >= 0 /\ -arg2+arg3 >= 0), cost: 2*arg1-2*arg3
New rule:
__init -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg3P0, arg3'=arg3P0, (-arg2P0+arg3P0 >= 0 /\ arg1P0-arg3P0 >= 0 /\ 1+arg2P0 > 0), cost: 2+2*arg1P0-2*arg3P0

Applied deletion
Removed the following rules: 17 18

Chained accelerated rules with incoming rules
Start location: __init
  12: __init -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (arg1P6 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P6 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 2
  19: __init -> f213_0_main_GT : arg2'=arg3P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ 1+arg3P0 > 0 /\ arg2P0-arg3P0 >= 0), cost: 2+2*arg2P0-2*arg3P0
  20: __init -> f213_0_main_GT : arg2'=arg2P0, arg1'=arg3P0, arg3'=arg3P0, (-arg2P0+arg3P0 >= 0 /\ arg1P0-arg3P0 >= 0 /\ 1+arg2P0 > 0), cost: 2+2*arg1P0-2*arg3P0


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