WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f115_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg2-arg2P0 == 0 /\ arg1 > 0 /\ -arg1P0 == 0 /\ 1+arg2 > 0), cost: 1
   1: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (1-arg2 == 0 /\ 1-arg1P1 == 0 /\ 2-arg2P1 == 0), cost: 1
   2: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (-10+arg2 < 0 /\ 1-arg1P2 == 0 /\ 1-arg1 == 0 /\ -1+arg2 > 0 /\ 1-arg2P2+arg2 == 0), cost: 1
   3: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (-1+arg2-arg2P3 == 0 /\ -10+arg2 < 0 /\ -arg1 == 0 /\ -1+arg2 > 0 /\ -arg1P3 == 0), cost: 1
   4: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (-10+arg2 > 0 /\ 1-arg1 == 0 /\ 1-arg2P4+arg2 == 0 /\ 1-arg1P4 == 0), cost: 1
   5: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P5, arg2'=arg2P5, (-10+arg2 > 0 /\ -arg1 == 0 /\ -arg1P5 == 0 /\ -1+arg2-arg2P5 == 0), cost: 1
   6: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P6, arg2'=arg2P6, (-arg1P6 == 0 /\ 10-arg2 == 0 /\ 9-arg2P6 == 0), cost: 1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1


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

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

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

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

Applied preprocessing
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (-10+arg2 > 0 /\ 1-arg1 == 0 /\ 1-arg2P4+arg2 == 0 /\ 1-arg1P4 == 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-10+arg2 > 0 /\ -1+arg1 == 0), cost: 1

Applied preprocessing
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P5, arg2'=arg2P5, (-10+arg2 > 0 /\ -arg1 == 0 /\ -arg1P5 == 0 /\ -1+arg2-arg2P5 == 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ -10+arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P6, arg2'=arg2P6, (-arg1P6 == 0 /\ 10-arg2 == 0 /\ 9-arg2P6 == 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=9, -10+arg2 == 0, cost: 1

Simplified rules
Start location: __init
   8: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   9: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=2, -1+arg2 == 0, cost: 1
  10: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-1+arg1 == 0 /\ -1+arg2 > 0 /\ 10-arg2 > 0), cost: 1
  11: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ -1+arg2 > 0 /\ 10-arg2 > 0), cost: 1
  12: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-10+arg2 > 0 /\ -1+arg1 == 0), cost: 1
  13: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ -10+arg2 > 0), cost: 1
  14: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=9, -10+arg2 == 0, cost: 1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1


Applied acceleration
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-1+arg1 == 0 /\ -1+arg2 > 0 /\ 10-arg2 > 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=n6+arg2, (11-n6-arg2 > 0 /\ -1+n6 >= 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ -1+arg2 > 0), cost: n6

Applied instantiation
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=n6+arg2, (11-n6-arg2 > 0 /\ -1+n6 >= 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ -1+arg2 > 0), cost: n6
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=10, (1 > 0 /\ 9-arg2 >= 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ -1+arg2 > 0), cost: 10-arg2

Applied acceleration
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ -1+arg2 > 0 /\ 10-arg2 > 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-n8+arg2, (arg1 >= 0 /\ -arg1 >= 0 /\ 10-arg2 > 0 /\ -n8+arg2 > 0 /\ -1+n8 >= 0), cost: n8

Applied instantiation
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-n8+arg2, (arg1 >= 0 /\ -arg1 >= 0 /\ 10-arg2 > 0 /\ -n8+arg2 > 0 /\ -1+n8 >= 0), cost: n8
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=1, (arg1 >= 0 /\ 1 > 0 /\ -arg1 >= 0 /\ -2+arg2 >= 0 /\ 10-arg2 > 0), cost: -1+arg2

Applied nonterm
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-10+arg2 > 0 /\ -1+arg1 == 0), cost: 1
New rule:
f115_0_loop_LE -> [3] : (-10+arg2 > 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0), cost: NONTERM

Applied acceleration
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-10+arg2 > 0 /\ -1+arg1 == 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=arg2+n10, (-10+arg2 > 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0), cost: n10

Applied acceleration
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ -10+arg2 > 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-n12+arg2, (arg1 >= 0 /\ -1+n12 >= 0 /\ -arg1 >= 0 /\ -9-n12+arg2 > 0), cost: n12

Applied instantiation
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-n12+arg2, (arg1 >= 0 /\ -1+n12 >= 0 /\ -arg1 >= 0 /\ -9-n12+arg2 > 0), cost: n12
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=10, (arg1 >= 0 /\ 1 > 0 /\ -arg1 >= 0 /\ -11+arg2 >= 0), cost: -10+arg2

Applied simplification
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=10, (1 > 0 /\ 9-arg2 >= 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ -1+arg2 > 0), cost: 10-arg2
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=10, (-1+arg1 <= 0 /\ -1+arg1 >= 0 /\ -1+arg2 > 0 /\ -9+arg2 <= 0), cost: 10-arg2

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

Applied simplification
Original rule:
f115_0_loop_LE -> [3] : (-10+arg2 > 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0), cost: NONTERM
New rule:
f115_0_loop_LE -> [3] : (-10+arg2 > 0 /\ -1+arg1 <= 0 /\ -1+arg1 >= 0), cost: NONTERM

Applied simplification
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=arg2+n10, (-10+arg2 > 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0), cost: n10
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=arg2+n10, (-10+arg2 > 0 /\ -1+arg1 <= 0 /\ -1+arg1 >= 0), cost: n10

Applied simplification
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=10, (arg1 >= 0 /\ 1 > 0 /\ -arg1 >= 0 /\ -11+arg2 >= 0), cost: -10+arg2
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=10, (arg1 <= 0 /\ arg1 >= 0 /\ -11+arg2 >= 0), cost: -10+arg2

Applied deletion
Removed the following rules: 10 11 12 13

Accelerated simple loops
Start location: __init
   8: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   9: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=2, -1+arg2 == 0, cost: 1
  14: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=9, -10+arg2 == 0, cost: 1
  20: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=10, (-1+arg1 <= 0 /\ -1+arg1 >= 0 /\ -1+arg2 > 0 /\ -9+arg2 <= 0), cost: 10-arg2
  21: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=1, (arg1 <= 0 /\ arg1 >= 0 /\ -2+arg2 >= 0 /\ 10-arg2 > 0), cost: -1+arg2
  22: f115_0_loop_LE -> [3] : (-10+arg2 > 0 /\ -1+arg1 <= 0 /\ -1+arg1 >= 0), cost: NONTERM
  23: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=arg2+n10, (-10+arg2 > 0 /\ -1+arg1 <= 0 /\ -1+arg1 >= 0), cost: n10
  24: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=10, (arg1 <= 0 /\ arg1 >= 0 /\ -11+arg2 >= 0), cost: -10+arg2
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_Load -> f115_0_loop_LE : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=2, -1+arg2 == 0, cost: 1
New rule:
f1_0_main_Load -> f115_0_loop_LE : arg1'=1, arg2'=2, (arg1 > 0 /\ -1+arg2 == 0), cost: 2

Applied chaining
First rule:
f1_0_main_Load -> f115_0_loop_LE : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=9, -10+arg2 == 0, cost: 1
New rule:
f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=9, (arg1 > 0 /\ -10+arg2 == 0), cost: 2

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

Applied chaining
First rule:
f1_0_main_Load -> f115_0_loop_LE : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=10, (arg1 <= 0 /\ arg1 >= 0 /\ -11+arg2 >= 0), cost: -10+arg2
New rule:
f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=10, (arg1 > 0 /\ -11+arg2 >= 0), cost: -9+arg2

Applied deletion
Removed the following rules: 9 14 20 21 22 23 24

Chained accelerated rules with incoming rules
Start location: __init
   8: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
  25: f1_0_main_Load -> f115_0_loop_LE : arg1'=1, arg2'=2, (arg1 > 0 /\ -1+arg2 == 0), cost: 2
  26: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=9, (arg1 > 0 /\ -10+arg2 == 0), cost: 2
  27: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=1, (arg1 > 0 /\ -2+arg2 >= 0 /\ 10-arg2 > 0), cost: arg2
  28: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=10, (arg1 > 0 /\ -11+arg2 >= 0), cost: -9+arg2
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, 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