NO

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1
   1: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1P1, arg2'=arg2P1, (arg1 < 0 /\ 1-arg1-arg1P1 == 0 /\ -5+arg1 < 0), cost: 1
   2: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ 1-arg1-arg1P2 == 0 /\ -5+arg1 < 0), cost: 1
   3: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1P3, arg2'=arg2P3, (-1-arg1-arg1P3 == 0 /\ -4+arg1 > 0 /\ 2+arg1 > 0), cost: 1
   4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1


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

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

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

Applied preprocessing
Original rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1P3, arg2'=arg2P3, (-1-arg1-arg1P3 == 0 /\ -4+arg1 > 0 /\ 2+arg1 > 0), cost: 1
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1, arg2'=arg2P3, -4+arg1 > 0, cost: 1

Simplified rules
Start location: __init
   5: f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   6: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, -arg1 > 0, cost: 1
   7: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P2, (arg1 > 0 /\ 5-arg1 > 0), cost: 1
   8: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1, arg2'=arg2P3, -4+arg1 > 0, cost: 1
   4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1


Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, -arg1 > 0, cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P2, (arg1 > 0 /\ 5-arg1 > 0), cost: 1
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P2, (4+arg1 > 0 /\ -arg1 > 0), cost: 2

Applied nonterm
Original rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P2, (4+arg1 > 0 /\ -arg1 > 0), cost: 2
New rule:
f104_0_loop_EQ -> [3] : (4+arg1 > 0 /\ -arg1 > 0), cost: NONTERM

Applied acceleration
Original rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P2, (4+arg1 > 0 /\ -arg1 > 0), cost: 2
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P2, (4+arg1 > 0 /\ -arg1 > 0), cost: 2*n2

Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P2, (arg1 > 0 /\ 5-arg1 > 0), cost: 1
Second rule:
f104_0_loop_EQ -> [3] : (4+arg1 > 0 /\ -arg1 > 0), cost: NONTERM
New rule:
f104_0_loop_EQ -> [3] : (arg1 > 0 /\ -1+arg1 > 0 /\ 5-arg1 > 0), cost: NONTERM

Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P2, (arg1 > 0 /\ 5-arg1 > 0), cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P2, (4+arg1 > 0 /\ -arg1 > 0), cost: 2*n2
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P2, (arg1 > 0 /\ -1+arg1 > 0 /\ 5-arg1 > 0), cost: 1+2*n2

Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, -arg1 > 0, cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1, arg2'=arg2P3, -4+arg1 > 0, cost: 1
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P3, -3-arg1 > 0, cost: 2

Applied nonterm
Original rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P3, -3-arg1 > 0, cost: 2
New rule:
f104_0_loop_EQ -> [3] : -3-arg1 > 0, cost: NONTERM

Applied acceleration
Original rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P3, -3-arg1 > 0, cost: 2
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1-2*n4, arg2'=arg2P3, -3-arg1 > 0, cost: 2*n4

Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1, arg2'=arg2P3, -4+arg1 > 0, cost: 1
Second rule:
f104_0_loop_EQ -> [3] : -3-arg1 > 0, cost: NONTERM
New rule:
f104_0_loop_EQ -> [3] : (-2+arg1 > 0 /\ -4+arg1 > 0), cost: NONTERM

Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1, arg2'=arg2P3, -4+arg1 > 0, cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1-2*n4, arg2'=arg2P3, -3-arg1 > 0, cost: 2*n4
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1-2*n4, arg2'=arg2P3, (-2+arg1 > 0 /\ -4+arg1 > 0), cost: 1+2*n4

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

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

Applied acceleration
Original rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P1, (-1+arg1 > 0 /\ 5-arg1 > 0), cost: 2
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P1, (-1+arg1 > 0 /\ 5-arg1 > 0), cost: 2*n6

Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, -arg1 > 0, cost: 1
Second rule:
f104_0_loop_EQ -> [3] : (-1+arg1 > 0 /\ 5-arg1 > 0), cost: NONTERM
New rule:
f104_0_loop_EQ -> [3] : (4+arg1 > 0 /\ -arg1 > 0), cost: NONTERM

Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, -arg1 > 0, cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P1, (-1+arg1 > 0 /\ 5-arg1 > 0), cost: 2*n6
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, (4+arg1 > 0 /\ -arg1 > 0), cost: 1+2*n6

Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1, arg2'=arg2P3, -4+arg1 > 0, cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, -arg1 > 0, cost: 1
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, -4+arg1 > 0, cost: 2

Applied nonterm
Original rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, -4+arg1 > 0, cost: 2
New rule:
f104_0_loop_EQ -> [3] : -4+arg1 > 0, cost: NONTERM

Applied acceleration
Original rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, -4+arg1 > 0, cost: 2
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1+2*n8, arg2'=arg2P1, -4+arg1 > 0, cost: 2*n8

Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, -arg1 > 0, cost: 1
Second rule:
f104_0_loop_EQ -> [3] : -4+arg1 > 0, cost: NONTERM
New rule:
f104_0_loop_EQ -> [3] : (-3-arg1 > 0 /\ -arg1 > 0), cost: NONTERM

Applied chaining
First rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, -arg1 > 0, cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1+2*n8, arg2'=arg2P1, -4+arg1 > 0, cost: 2*n8
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1+2*n8, arg2'=arg2P1, (-3-arg1 > 0 /\ -arg1 > 0), cost: 1+2*n8

Applied simplification
Original rule:
f104_0_loop_EQ -> [3] : (arg1 > 0 /\ -1+arg1 > 0 /\ 5-arg1 > 0), cost: NONTERM
New rule:
f104_0_loop_EQ -> [3] : (-1+arg1 > 0 /\ 5-arg1 > 0), cost: NONTERM

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

Applied simplification
Original rule:
f104_0_loop_EQ -> [3] : (-2+arg1 > 0 /\ -4+arg1 > 0), cost: NONTERM
New rule:
f104_0_loop_EQ -> [3] : -4+arg1 > 0, cost: NONTERM

Applied simplification
Original rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1-2*n4, arg2'=arg2P3, (-2+arg1 > 0 /\ -4+arg1 > 0), cost: 1+2*n4
New rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1-2*n4, arg2'=arg2P3, -4+arg1 > 0, cost: 1+2*n4

Applied simplification
Original rule:
f104_0_loop_EQ -> [3] : (-3-arg1 > 0 /\ -arg1 > 0), cost: NONTERM
New rule:
f104_0_loop_EQ -> [3] : -3-arg1 > 0, cost: NONTERM

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

Applied deletion
Removed the following rules: 9 13 17 21

Accelerated simple loops
Start location: __init
   5: f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   6: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, -arg1 > 0, cost: 1
   7: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P2, (arg1 > 0 /\ 5-arg1 > 0), cost: 1
   8: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1, arg2'=arg2P3, -4+arg1 > 0, cost: 1
  11: f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P2, (4+arg1 > 0 /\ -arg1 > 0), cost: 2*n2
  15: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1-2*n4, arg2'=arg2P3, -3-arg1 > 0, cost: 2*n4
  18: f104_0_loop_EQ -> [3] : (4+arg1 > 0 /\ -arg1 > 0), cost: NONTERM
  19: f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P1, (-1+arg1 > 0 /\ 5-arg1 > 0), cost: 2*n6
  20: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P1, (4+arg1 > 0 /\ -arg1 > 0), cost: 1+2*n6
  23: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1+2*n8, arg2'=arg2P1, -4+arg1 > 0, cost: 2*n8
  25: f104_0_loop_EQ -> [3] : (-1+arg1 > 0 /\ 5-arg1 > 0), cost: NONTERM
  26: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P2, (-1+arg1 > 0 /\ 5-arg1 > 0), cost: 1+2*n2
  27: f104_0_loop_EQ -> [3] : -4+arg1 > 0, cost: NONTERM
  28: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1-2*n4, arg2'=arg2P3, -4+arg1 > 0, cost: 1+2*n4
  29: f104_0_loop_EQ -> [3] : -3-arg1 > 0, cost: NONTERM
  30: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1+2*n8, arg2'=arg2P1, -3-arg1 > 0, cost: 1+2*n8
   4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1


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

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

Applied chaining
First rule:
f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg2'=arg2P1, (-1+arg1 > 0 /\ 5-arg1 > 0), cost: 2*n6
New rule:
f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P1, (arg1 > 0 /\ -1+arg2 > 0 /\ 5-arg2 > 0), cost: 1+2*n6

Applied chaining
First rule:
f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1+2*n8, arg2'=arg2P1, -4+arg1 > 0, cost: 2*n8
New rule:
f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2+2*n8, arg2'=arg2P1, (arg1 > 0 /\ -4+arg2 > 0), cost: 1+2*n8

Applied chaining
First rule:
f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f104_0_loop_EQ -> [3] : (-1+arg1 > 0 /\ 5-arg1 > 0), cost: NONTERM
New rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+arg2 > 0 /\ 5-arg2 > 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P2, (-1+arg1 > 0 /\ 5-arg1 > 0), cost: 1+2*n2
New rule:
f1_0_main_Load -> f104_0_loop_EQ : arg1'=1-arg2, arg2'=arg2P2, (arg1 > 0 /\ -1+arg2 > 0 /\ 5-arg2 > 0), cost: 2+2*n2

Applied chaining
First rule:
f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f104_0_loop_EQ -> [3] : -4+arg1 > 0, cost: NONTERM
New rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -4+arg2 > 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1-2*n4, arg2'=arg2P3, -4+arg1 > 0, cost: 1+2*n4
New rule:
f1_0_main_Load -> f104_0_loop_EQ : arg1'=-1-arg2-2*n4, arg2'=arg2P3, (arg1 > 0 /\ -4+arg2 > 0), cost: 2+2*n4

Applied deletion
Removed the following rules: 6 7 8 11 15 18 19 20 23 25 26 27 28 29 30

Chained accelerated rules with incoming rules
Start location: __init
   5: f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
  31: f1_0_main_Load -> f104_0_loop_EQ : arg1'=1-arg2, arg2'=arg2P2, (arg1 > 0 /\ arg2 > 0 /\ 5-arg2 > 0), cost: 2
  32: f1_0_main_Load -> f104_0_loop_EQ : arg1'=-1-arg2, arg2'=arg2P3, (arg1 > 0 /\ -4+arg2 > 0), cost: 2
  33: f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P1, (arg1 > 0 /\ -1+arg2 > 0 /\ 5-arg2 > 0), cost: 1+2*n6
  34: f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2+2*n8, arg2'=arg2P1, (arg1 > 0 /\ -4+arg2 > 0), cost: 1+2*n8
  35: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+arg2 > 0 /\ 5-arg2 > 0), cost: NONTERM
  36: f1_0_main_Load -> f104_0_loop_EQ : arg1'=1-arg2, arg2'=arg2P2, (arg1 > 0 /\ -1+arg2 > 0 /\ 5-arg2 > 0), cost: 2+2*n2
  37: f1_0_main_Load -> [3] : (arg1 > 0 /\ -4+arg2 > 0), cost: NONTERM
  38: f1_0_main_Load -> f104_0_loop_EQ : arg1'=-1-arg2-2*n4, arg2'=arg2P3, (arg1 > 0 /\ -4+arg2 > 0), cost: 2+2*n4
   4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1


Removed unreachable locations and irrelevant leafs
Start location: __init
  35: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+arg2 > 0 /\ 5-arg2 > 0), cost: NONTERM
  37: f1_0_main_Load -> [3] : (arg1 > 0 /\ -4+arg2 > 0), cost: NONTERM
   4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1


Eliminating location f1_0_main_Load by chaining:

Applied chaining
First rule:
__init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1
Second rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+arg2 > 0 /\ 5-arg2 > 0), cost: NONTERM
New rule:
__init -> [3] : (5-arg2P4 > 0 /\ -1+arg2P4 > 0 /\ arg1P4 > 0), cost: NONTERM

Applied chaining
First rule:
__init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1
Second rule:
f1_0_main_Load -> [3] : (arg1 > 0 /\ -4+arg2 > 0), cost: NONTERM
New rule:
__init -> [3] : (-4+arg2P4 > 0 /\ arg1P4 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 4 35 37

Eliminated locations on tree-shaped paths
Start location: __init
  39: __init -> [3] : (5-arg2P4 > 0 /\ -1+arg2P4 > 0 /\ arg1P4 > 0), cost: NONTERM
  40: __init -> [3] : (-4+arg2P4 > 0 /\ arg1P4 > 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 39 via SMT.

Proved the following lower bound
Complexity:  Nonterm
Cpx degree: Nonterm

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (5-arg2P4 > 0 /\ -1+arg2P4 > 0 /\ arg1P4 > 0)