NO

Initial ITS
Start location: __init
   0: f1_0_main_New -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (arg2-arg4P0 == 0 /\ 1-arg3P0 == 0 /\ 1+arg2 > 0 /\ -1+arg2P0 > 0 /\ arg1 > 0 /\ arg1P0 > 0 /\ -1+arg2P0-arg1 <= 0 /\ -arg1+arg1P0 <= 0), cost: 1
   1: f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: 1
   5: f909_0_main_GE -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (arg4-arg4P5 == 0 /\ arg2 > 0 /\ -arg2+arg1P5 <= 0 /\ -1+arg4-arg3 > 0 /\ arg1 > 0 /\ -2+arg4-arg3 > 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0 /\ 4+arg3-arg3P5 == 0 /\ -6+arg2P5 > 0 /\ 1+arg4 > 0), cost: 1
   2: f1058_0_size_NULL -> f1097_0_outputList_NULL : arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (1+arg1P2 > 0 /\ 1+arg1 > 0), cost: 1
   3: f1058_0_size_NULL -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (1+arg1P3 > 0 /\ arg1 > 0), cost: 1
   4: f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (arg1 > 0 /\ 1+arg1P4 > 0), cost: 1
   6: __init -> f1_0_main_New : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, TRUE, cost: 1


Applied preprocessing
Original rule:
f1_0_main_New -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (arg2-arg4P0 == 0 /\ 1-arg3P0 == 0 /\ 1+arg2 > 0 /\ -1+arg2P0 > 0 /\ arg1 > 0 /\ arg1P0 > 0 /\ -1+arg2P0-arg1 <= 0 /\ -arg1+arg1P0 <= 0), cost: 1
New rule:
f1_0_main_New -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2, arg1'=arg1P0, arg3'=1, (1+arg2 > 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P0-arg1 <= 0 /\ -arg1+arg1P0 <= 0), cost: 1

Applied preprocessing
Original rule:
f909_0_main_GE -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (arg4-arg4P5 == 0 /\ arg2 > 0 /\ -arg2+arg1P5 <= 0 /\ -1+arg4-arg3 > 0 /\ arg1 > 0 /\ -2+arg4-arg3 > 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0 /\ 4+arg3-arg3P5 == 0 /\ -6+arg2P5 > 0 /\ 1+arg4 > 0), cost: 1
New rule:
f909_0_main_GE -> f909_0_main_GE : arg2'=arg2P5, arg1'=arg1P5, arg3'=4+arg3, (-arg2+arg1P5 <= 0 /\ -2+arg4-arg3 > 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ 1+arg4 > 0), cost: 1

Simplified rules
Start location: __init
   7: f1_0_main_New -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2, arg1'=arg1P0, arg3'=1, (1+arg2 > 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P0-arg1 <= 0 /\ -arg1+arg1P0 <= 0), cost: 1
   1: f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: 1
   8: f909_0_main_GE -> f909_0_main_GE : arg2'=arg2P5, arg1'=arg1P5, arg3'=4+arg3, (-arg2+arg1P5 <= 0 /\ -2+arg4-arg3 > 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ 1+arg4 > 0), cost: 1
   2: f1058_0_size_NULL -> f1097_0_outputList_NULL : arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (1+arg1P2 > 0 /\ 1+arg1 > 0), cost: 1
   3: f1058_0_size_NULL -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (1+arg1P3 > 0 /\ arg1 > 0), cost: 1
   4: f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (arg1 > 0 /\ 1+arg1P4 > 0), cost: 1
   6: __init -> f1_0_main_New : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, TRUE, cost: 1


Applied acceleration
Original rule:
f909_0_main_GE -> f909_0_main_GE : arg2'=arg2P5, arg1'=arg1P5, arg3'=4+arg3, (-arg2+arg1P5 <= 0 /\ -2+arg4-arg3 > 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ 1+arg4 > 0), cost: 1
New rule:
f909_0_main_GE -> f909_0_main_GE : arg2'=arg2P5, arg1'=arg1P5, arg3'=4*n+arg3, (arg2-arg1P5 >= 0 /\ -1+n >= 0 /\ 2-4*n+arg4-arg3 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1-arg1P5 >= 0 /\ 1+arg4 > 0 /\ arg2P5-arg1P5 >= 0), cost: n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_EjLghF.txt

Applied deletion
Removed the following rules: 8

Applied acceleration
Original rule:
f1058_0_size_NULL -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (1+arg1P3 > 0 /\ arg1 > 0), cost: 1
New rule:
f1058_0_size_NULL -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg1P3 > 0 /\ 1+arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0), cost: n0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_KLCKDI.txt

Applied nonterm
Original rule:
f1058_0_size_NULL -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (1+arg1P3 > 0 /\ arg1 > 0), cost: 1
New rule:
f1058_0_size_NULL -> [6] : (-arg1P3+arg1 <= 0 /\ 1+arg1P3 > 0 /\ arg1 > 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_ainnPj.txt

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

Applied simplification
Original rule:
f1058_0_size_NULL -> [6] : (-arg1P3+arg1 <= 0 /\ 1+arg1P3 > 0 /\ arg1 > 0), cost: NONTERM
New rule:
f1058_0_size_NULL -> [6] : (-arg1P3+arg1 <= 0 /\ arg1 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 3

Applied acceleration
Original rule:
f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (arg1 > 0 /\ 1+arg1P4 > 0), cost: 1
New rule:
f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (-1+n1 >= 0 /\ arg1P4 > 0 /\ arg1 > 0 /\ 1+arg1P4 > 0), cost: n1
Sub-proof via acceration calculus written to file:///tmp/tmpnam_NeeFcL.txt

Applied nonterm
Original rule:
f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (arg1 > 0 /\ 1+arg1P4 > 0), cost: 1
New rule:
f1097_0_outputList_NULL -> [7] : (-arg1P4+arg1 <= 0 /\ arg1 > 0 /\ 1+arg1P4 > 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_AoNNGj.txt

Applied simplification
Original rule:
f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (-1+n1 >= 0 /\ arg1P4 > 0 /\ arg1 > 0 /\ 1+arg1P4 > 0), cost: n1
New rule:
f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (-1+n1 >= 0 /\ arg1P4 > 0 /\ arg1 > 0), cost: n1

Applied simplification
Original rule:
f1097_0_outputList_NULL -> [7] : (-arg1P4+arg1 <= 0 /\ arg1 > 0 /\ 1+arg1P4 > 0), cost: NONTERM
New rule:
f1097_0_outputList_NULL -> [7] : (-arg1P4+arg1 <= 0 /\ arg1 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 4

Accelerated simple loops
Start location: __init
   7: f1_0_main_New -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2, arg1'=arg1P0, arg3'=1, (1+arg2 > 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P0-arg1 <= 0 /\ -arg1+arg1P0 <= 0), cost: 1
   1: f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: 1
   9: f909_0_main_GE -> f909_0_main_GE : arg2'=arg2P5, arg1'=arg1P5, arg3'=4*n+arg3, (arg2-arg1P5 >= 0 /\ -1+n >= 0 /\ 2-4*n+arg4-arg3 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1-arg1P5 >= 0 /\ 1+arg4 > 0 /\ arg2P5-arg1P5 >= 0), cost: n
   2: f1058_0_size_NULL -> f1097_0_outputList_NULL : arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (1+arg1P2 > 0 /\ 1+arg1 > 0), cost: 1
  12: f1058_0_size_NULL -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0), cost: n0
  13: f1058_0_size_NULL -> [6] : (-arg1P3+arg1 <= 0 /\ arg1 > 0), cost: NONTERM
  16: f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (-1+n1 >= 0 /\ arg1P4 > 0 /\ arg1 > 0), cost: n1
  17: f1097_0_outputList_NULL -> [7] : (-arg1P4+arg1 <= 0 /\ arg1 > 0), cost: NONTERM
   6: __init -> f1_0_main_New : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_New -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2, arg1'=arg1P0, arg3'=1, (1+arg2 > 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P0-arg1 <= 0 /\ -arg1+arg1P0 <= 0), cost: 1
Second rule:
f909_0_main_GE -> f909_0_main_GE : arg2'=arg2P5, arg1'=arg1P5, arg3'=4*n+arg3, (arg2-arg1P5 >= 0 /\ -1+n >= 0 /\ 2-4*n+arg4-arg3 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1-arg1P5 >= 0 /\ 1+arg4 > 0 /\ arg2P5-arg1P5 >= 0), cost: n
New rule:
f1_0_main_New -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg2, arg1'=arg1P5, arg3'=1+4*n, (1+arg2-4*n > 0 /\ -1+n >= 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg2P5-arg1P5 >= 0), cost: 1+n

Applied deletion
Removed the following rules: 9

Applied chaining
First rule:
f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: 1
Second rule:
f1058_0_size_NULL -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0), cost: n0
New rule:
f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0 /\ arg4-arg3 <= 0), cost: 1+n0

Applied chaining
First rule:
f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: 1
Second rule:
f1058_0_size_NULL -> [6] : (-arg1P3+arg1 <= 0 /\ arg1 > 0), cost: NONTERM
New rule:
f909_0_main_GE -> [6] : (arg2 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: NONTERM

Applied deletion
Removed the following rules: 12 13

Applied chaining
First rule:
f1058_0_size_NULL -> f1097_0_outputList_NULL : arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (1+arg1P2 > 0 /\ 1+arg1 > 0), cost: 1
Second rule:
f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (-1+n1 >= 0 /\ arg1P4 > 0 /\ arg1 > 0), cost: n1
New rule:
f1058_0_size_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (1+arg1 > 0 /\ -1+n1 >= 0 /\ arg1P4 > 0), cost: 1+n1

Applied chaining
First rule:
f1058_0_size_NULL -> f1097_0_outputList_NULL : arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (1+arg1P2 > 0 /\ 1+arg1 > 0), cost: 1
Second rule:
f1097_0_outputList_NULL -> [7] : (-arg1P4+arg1 <= 0 /\ arg1 > 0), cost: NONTERM
New rule:
f1058_0_size_NULL -> [7] : 1+arg1 > 0, cost: NONTERM

Applied deletion
Removed the following rules: 16 17

Chained accelerated rules with incoming rules
Start location: __init
   7: f1_0_main_New -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2, arg1'=arg1P0, arg3'=1, (1+arg2 > 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P0-arg1 <= 0 /\ -arg1+arg1P0 <= 0), cost: 1
  18: f1_0_main_New -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg2, arg1'=arg1P5, arg3'=1+4*n, (1+arg2-4*n > 0 /\ -1+n >= 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg2P5-arg1P5 >= 0), cost: 1+n
   1: f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: 1
  19: f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0 /\ arg4-arg3 <= 0), cost: 1+n0
  20: f909_0_main_GE -> [6] : (arg2 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: NONTERM
   2: f1058_0_size_NULL -> f1097_0_outputList_NULL : arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (1+arg1P2 > 0 /\ 1+arg1 > 0), cost: 1
  21: f1058_0_size_NULL -> f1097_0_outputList_NULL : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (1+arg1 > 0 /\ -1+n1 >= 0 /\ arg1P4 > 0), cost: 1+n1
  22: f1058_0_size_NULL -> [7] : 1+arg1 > 0, cost: NONTERM
   6: __init -> f1_0_main_New : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, TRUE, cost: 1


Removed unreachable locations and irrelevant leafs
Start location: __init
   7: f1_0_main_New -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2, arg1'=arg1P0, arg3'=1, (1+arg2 > 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P0-arg1 <= 0 /\ -arg1+arg1P0 <= 0), cost: 1
  18: f1_0_main_New -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg2, arg1'=arg1P5, arg3'=1+4*n, (1+arg2-4*n > 0 /\ -1+n >= 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg2P5-arg1P5 >= 0), cost: 1+n
   1: f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: 1
  19: f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0 /\ arg4-arg3 <= 0), cost: 1+n0
  20: f909_0_main_GE -> [6] : (arg2 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: NONTERM
  22: f1058_0_size_NULL -> [7] : 1+arg1 > 0, cost: NONTERM
   6: __init -> f1_0_main_New : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, TRUE, cost: 1


Eliminating location f1_0_main_New by chaining:

Applied chaining
First rule:
__init -> f1_0_main_New : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, TRUE, cost: 1
Second rule:
f1_0_main_New -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2, arg1'=arg1P0, arg3'=1, (1+arg2 > 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P0-arg1 <= 0 /\ -arg1+arg1P0 <= 0), cost: 1
New rule:
__init -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2P6, arg1'=arg1P0, arg3'=1, (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0), cost: 2

Applied chaining
First rule:
__init -> f1_0_main_New : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, TRUE, cost: 1
Second rule:
f1_0_main_New -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg2, arg1'=arg1P5, arg3'=1+4*n, (1+arg2-4*n > 0 /\ -1+n >= 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg2P5-arg1P5 >= 0), cost: 1+n
New rule:
__init -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg2P6, arg1'=arg1P5, arg3'=1+4*n, (-1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: 2+n

Applied deletion
Removed the following rules: 6 7 18

Eliminating location f1058_0_size_NULL by chaining:

Applied chaining
First rule:
f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: 1
Second rule:
f1058_0_size_NULL -> [7] : 1+arg1 > 0, cost: NONTERM
New rule:
f909_0_main_GE -> [7] : (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: NONTERM

Applied chaining
First rule:
f909_0_main_GE -> f1058_0_size_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0 /\ arg4-arg3 <= 0), cost: 1+n0
Second rule:
f1058_0_size_NULL -> [7] : 1+arg1 > 0, cost: NONTERM
New rule:
f909_0_main_GE -> [7] : (arg2 > 0 /\ arg1P3 > 0 /\ 1+arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0 /\ arg4-arg3 <= 0), cost: NONTERM

Applied simplification
Original rule:
f909_0_main_GE -> [7] : (arg2 > 0 /\ arg1P3 > 0 /\ 1+arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0 /\ arg4-arg3 <= 0), cost: NONTERM
New rule:
f909_0_main_GE -> [7] : (arg2 > 0 /\ arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0 /\ arg4-arg3 <= 0), cost: NONTERM

Applied deletion
Removed the following rules: 1 19 22

Eliminated locations on tree-shaped paths
Start location: __init
  20: f909_0_main_GE -> [6] : (arg2 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: NONTERM
  25: f909_0_main_GE -> [7] : (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: NONTERM
  26: f909_0_main_GE -> [7] : (arg2 > 0 /\ arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0 /\ arg4-arg3 <= 0), cost: NONTERM
  23: __init -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2P6, arg1'=arg1P0, arg3'=1, (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0), cost: 2
  24: __init -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg2P6, arg1'=arg1P5, arg3'=1+4*n, (-1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: 2+n


Eliminating location f909_0_main_GE by chaining:

Applied chaining
First rule:
__init -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2P6, arg1'=arg1P0, arg3'=1, (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0), cost: 2
Second rule:
f909_0_main_GE -> [6] : (arg2 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: NONTERM
New rule:
__init -> [6] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ arg2P0 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P6 <= 0), cost: NONTERM

Applied simplification
Original rule:
__init -> [6] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ arg2P0 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P6 <= 0), cost: NONTERM
New rule:
__init -> [6] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P6 <= 0), cost: NONTERM

Applied chaining
First rule:
__init -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2P6, arg1'=arg1P0, arg3'=1, (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0), cost: 2
Second rule:
f909_0_main_GE -> [7] : (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: NONTERM
New rule:
__init -> [7] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ arg2P0 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ 1+arg1P1 > 0 /\ arg1P0 > 0 /\ -1+arg2P6 <= 0), cost: NONTERM

Applied simplification
Original rule:
__init -> [7] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ arg2P0 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ 1+arg1P1 > 0 /\ arg1P0 > 0 /\ -1+arg2P6 <= 0), cost: NONTERM
New rule:
__init -> [7] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ 1+arg1P1 > 0 /\ arg1P0 > 0 /\ -1+arg2P6 <= 0), cost: NONTERM

Applied chaining
First rule:
__init -> f909_0_main_GE : arg2'=arg2P0, arg4'=arg2P6, arg1'=arg1P0, arg3'=1, (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0), cost: 2
Second rule:
f909_0_main_GE -> [7] : (arg2 > 0 /\ arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0 /\ arg4-arg3 <= 0), cost: NONTERM
New rule:
__init -> [7] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ arg1P3 > 0 /\ arg2P0 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+n0 >= 0 /\ -1+arg2P6 <= 0), cost: NONTERM

Applied simplification
Original rule:
__init -> [7] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ arg1P3 > 0 /\ arg2P0 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+n0 >= 0 /\ -1+arg2P6 <= 0), cost: NONTERM
New rule:
__init -> [7] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ arg1P3 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+n0 >= 0 /\ -1+arg2P6 <= 0), cost: NONTERM

Applied chaining
First rule:
__init -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg2P6, arg1'=arg1P5, arg3'=1+4*n, (-1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: 2+n
Second rule:
f909_0_main_GE -> [6] : (arg2 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: NONTERM
New rule:
__init -> [6] : (arg2P5 > 0 /\ -1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM

Applied simplification
Original rule:
__init -> [6] : (arg2P5 > 0 /\ -1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM
New rule:
__init -> [6] : (-1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM

Applied chaining
First rule:
__init -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg2P6, arg1'=arg1P5, arg3'=1+4*n, (-1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: 2+n
Second rule:
f909_0_main_GE -> [7] : (arg2 > 0 /\ 1+arg1P1 > 0 /\ arg1 > 0 /\ arg4-arg3 <= 0), cost: NONTERM
New rule:
__init -> [7] : (arg2P5 > 0 /\ -1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1+arg1P1 > 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM

Applied simplification
Original rule:
__init -> [7] : (arg2P5 > 0 /\ -1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1+arg1P1 > 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM
New rule:
__init -> [7] : (-1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1+arg1P1 > 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM

Applied chaining
First rule:
__init -> f909_0_main_GE : arg2'=arg2P5, arg4'=arg2P6, arg1'=arg1P5, arg3'=1+4*n, (-1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: 2+n
Second rule:
f909_0_main_GE -> [7] : (arg2 > 0 /\ arg1P3 > 0 /\ arg1 > 0 /\ -1+n0 >= 0 /\ arg4-arg3 <= 0), cost: NONTERM
New rule:
__init -> [7] : (arg1P3 > 0 /\ arg2P5 > 0 /\ -1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ -1+n0 >= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM

Applied simplification
Original rule:
__init -> [7] : (arg1P3 > 0 /\ arg2P5 > 0 /\ -1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ -1+n0 >= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM
New rule:
__init -> [7] : (arg1P3 > 0 /\ -1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ -1+n0 >= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 20 23 24 25 26

Eliminated locations on tree-shaped paths
Start location: __init
  27: __init -> [6] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P6 <= 0), cost: NONTERM
  28: __init -> [7] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ 1+arg1P1 > 0 /\ arg1P0 > 0 /\ -1+arg2P6 <= 0), cost: NONTERM
  29: __init -> [7] : (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ arg1P3 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+n0 >= 0 /\ -1+arg2P6 <= 0), cost: NONTERM
  30: __init -> [6] : (-1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM
  31: __init -> [7] : (-1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1+arg1P1 > 0 /\ 1-4*n+arg2P6 > 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM
  32: __init -> [7] : (arg1P3 > 0 /\ -1-4*n+arg2P6 <= 0 /\ -1+n >= 0 /\ 1-4*n+arg2P6 > 0 /\ -1+n0 >= 0 /\ arg1P5 > 0 /\ -6+arg2P5 > 0 /\ arg1P5-arg1P6 <= 0 /\ arg2P5-arg1P5 >= 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 27 via SMT.

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

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (arg1P0-arg1P6 <= 0 /\ 1+arg2P6 > 0 /\ -1+arg2P0-arg1P6 <= 0 /\ -1+arg2P0 > 0 /\ arg1P0 > 0 /\ -1+arg2P6 <= 0)