NO

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
     26: f2 -> f3 : arg1'=arg1P_27, [ arg1>=0 && arg1==arg1P_27 ], cost: 1
     28: f2 -> f21 : arg1'=arg1P_29, [ arg1<0 && arg1==arg1P_29 ], cost: 1
      1: f4 -> f7 : arg1'=arg1P_2, [ arg1P_2==1+arg1 ], cost: 1
     24: f7 -> f6 : arg1'=arg1P_25, [ arg1==arg1P_25 ], cost: 1
      2: f8 -> f11 : arg1'=arg1P_3, [ arg1P_3==2+arg1 ], cost: 1
     19: f11 -> f10 : arg1'=arg1P_20, [ arg1==arg1P_20 ], cost: 1
      3: f12 -> f15 : arg1'=arg1P_4, [ arg1P_4==3+arg1 ], cost: 1
     14: f15 -> f14 : arg1'=arg1P_15, [ arg1==arg1P_15 ], cost: 1
      4: f16 -> f19 : arg1'=arg1P_5, [ arg1P_5==4+arg1 ], cost: 1
      9: f19 -> f18 : arg1'=arg1P_10, [ arg1==arg1P_10 ], cost: 1
      5: f17 -> f20 : arg1'=arg1P_6, [ arg1P_6==-1 ], cost: 1
     10: f20 -> f18 : arg1'=arg1P_11, [ arg1==arg1P_11 ], cost: 1
      6: f13 -> f16 : arg1'=arg1P_7, [ x7_1<0 && arg1==arg1P_7 ], cost: 1
      7: f13 -> f16 : arg1'=arg1P_8, [ x42_1>0 && arg1==arg1P_8 ], cost: 1
      8: f13 -> f17 : arg1'=arg1P_9, [ x9_1==0 && arg1==arg1P_9 ], cost: 1
     15: f18 -> f14 : arg1'=arg1P_16, [ arg1==arg1P_16 ], cost: 1
     11: f9 -> f12 : arg1'=arg1P_12, [ x13_1<0 && arg1==arg1P_12 ], cost: 1
     12: f9 -> f12 : arg1'=arg1P_13, [ x44_1>0 && arg1==arg1P_13 ], cost: 1
     13: f9 -> f13 : arg1'=arg1P_14, [ x15_1==0 && arg1==arg1P_14 ], cost: 1
     20: f14 -> f10 : arg1'=arg1P_21, [ arg1==arg1P_21 ], cost: 1
     16: f5 -> f8 : arg1'=arg1P_17, [ x19_1<0 && arg1==arg1P_17 ], cost: 1
     17: f5 -> f8 : arg1'=arg1P_18, [ x46_1>0 && arg1==arg1P_18 ], cost: 1
     18: f5 -> f9 : arg1'=arg1P_19, [ x21_1==0 && arg1==arg1P_19 ], cost: 1
     25: f10 -> f6 : arg1'=arg1P_26, [ arg1==arg1P_26 ], cost: 1
     21: f3 -> f4 : arg1'=arg1P_22, [ x25_1<0 && arg1==arg1P_22 ], cost: 1
     22: f3 -> f4 : arg1'=arg1P_23, [ x48_1>0 && arg1==arg1P_23 ], cost: 1
     23: f3 -> f5 : arg1'=arg1P_24, [ x27_1==0 && arg1==arg1P_24 ], cost: 1
     27: f6 -> f2 : arg1'=arg1P_28, [ arg1==arg1P_28 ], cost: 1
     29: __init -> f1 : arg1'=arg1P_30, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     29: __init -> f1 : arg1'=arg1P_30, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
     26: f2 -> f3 : arg1'=arg1P_27, [ arg1>=0 && arg1==arg1P_27 ], cost: 1
      1: f4 -> f7 : arg1'=arg1P_2, [ arg1P_2==1+arg1 ], cost: 1
     24: f7 -> f6 : arg1'=arg1P_25, [ arg1==arg1P_25 ], cost: 1
      2: f8 -> f11 : arg1'=arg1P_3, [ arg1P_3==2+arg1 ], cost: 1
     19: f11 -> f10 : arg1'=arg1P_20, [ arg1==arg1P_20 ], cost: 1
      3: f12 -> f15 : arg1'=arg1P_4, [ arg1P_4==3+arg1 ], cost: 1
     14: f15 -> f14 : arg1'=arg1P_15, [ arg1==arg1P_15 ], cost: 1
      4: f16 -> f19 : arg1'=arg1P_5, [ arg1P_5==4+arg1 ], cost: 1
      9: f19 -> f18 : arg1'=arg1P_10, [ arg1==arg1P_10 ], cost: 1
      5: f17 -> f20 : arg1'=arg1P_6, [ arg1P_6==-1 ], cost: 1
     10: f20 -> f18 : arg1'=arg1P_11, [ arg1==arg1P_11 ], cost: 1
      6: f13 -> f16 : arg1'=arg1P_7, [ x7_1<0 && arg1==arg1P_7 ], cost: 1
      7: f13 -> f16 : arg1'=arg1P_8, [ x42_1>0 && arg1==arg1P_8 ], cost: 1
      8: f13 -> f17 : arg1'=arg1P_9, [ x9_1==0 && arg1==arg1P_9 ], cost: 1
     15: f18 -> f14 : arg1'=arg1P_16, [ arg1==arg1P_16 ], cost: 1
     11: f9 -> f12 : arg1'=arg1P_12, [ x13_1<0 && arg1==arg1P_12 ], cost: 1
     12: f9 -> f12 : arg1'=arg1P_13, [ x44_1>0 && arg1==arg1P_13 ], cost: 1
     13: f9 -> f13 : arg1'=arg1P_14, [ x15_1==0 && arg1==arg1P_14 ], cost: 1
     20: f14 -> f10 : arg1'=arg1P_21, [ arg1==arg1P_21 ], cost: 1
     16: f5 -> f8 : arg1'=arg1P_17, [ x19_1<0 && arg1==arg1P_17 ], cost: 1
     17: f5 -> f8 : arg1'=arg1P_18, [ x46_1>0 && arg1==arg1P_18 ], cost: 1
     18: f5 -> f9 : arg1'=arg1P_19, [ x21_1==0 && arg1==arg1P_19 ], cost: 1
     25: f10 -> f6 : arg1'=arg1P_26, [ arg1==arg1P_26 ], cost: 1
     21: f3 -> f4 : arg1'=arg1P_22, [ x25_1<0 && arg1==arg1P_22 ], cost: 1
     22: f3 -> f4 : arg1'=arg1P_23, [ x48_1>0 && arg1==arg1P_23 ], cost: 1
     23: f3 -> f5 : arg1'=arg1P_24, [ x27_1==0 && arg1==arg1P_24 ], cost: 1
     27: f6 -> f2 : arg1'=arg1P_28, [ arg1==arg1P_28 ], cost: 1
     29: __init -> f1 : arg1'=arg1P_30, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
     26: f2 -> f3 : [ arg1>=0 ], cost: 1
      1: f4 -> f7 : arg1'=1+arg1, [], cost: 1
     24: f7 -> f6 : [], cost: 1
      2: f8 -> f11 : arg1'=2+arg1, [], cost: 1
     19: f11 -> f10 : [], cost: 1
      3: f12 -> f15 : arg1'=3+arg1, [], cost: 1
     14: f15 -> f14 : [], cost: 1
      4: f16 -> f19 : arg1'=4+arg1, [], cost: 1
      9: f19 -> f18 : [], cost: 1
      5: f17 -> f20 : arg1'=-1, [], cost: 1
     10: f20 -> f18 : [], cost: 1
      7: f13 -> f16 : [], cost: 1
      8: f13 -> f17 : [], cost: 1
     15: f18 -> f14 : [], cost: 1
     12: f9 -> f12 : [], cost: 1
     13: f9 -> f13 : [], cost: 1
     20: f14 -> f10 : [], cost: 1
     17: f5 -> f8 : [], cost: 1
     18: f5 -> f9 : [], cost: 1
     25: f10 -> f6 : [], cost: 1
     22: f3 -> f4 : [], cost: 1
     23: f3 -> f5 : [], cost: 1
     27: f6 -> f2 : [], cost: 1
     29: __init -> f1 : arg1'=arg1P_30, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     26: f2 -> f3 : [ arg1>=0 ], cost: 1
     39: f13 -> f18 : arg1'=4+arg1, [], cost: 3
     40: f13 -> f18 : arg1'=-1, [], cost: 3
     15: f18 -> f14 : [], cost: 1
     13: f9 -> f13 : [], cost: 1
     36: f9 -> f14 : arg1'=3+arg1, [], cost: 3
     20: f14 -> f10 : [], cost: 1
     18: f5 -> f9 : [], cost: 1
     34: f5 -> f10 : arg1'=2+arg1, [], cost: 3
     25: f10 -> f6 : [], cost: 1
     23: f3 -> f5 : [], cost: 1
     32: f3 -> f6 : arg1'=1+arg1, [], cost: 3
     27: f6 -> f2 : [], cost: 1
     30: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     41: f2 -> f5 : [ arg1>=0 ], cost: 2
     42: f2 -> f6 : arg1'=1+arg1, [ arg1>=0 ], cost: 4
     45: f13 -> f14 : arg1'=4+arg1, [], cost: 4
     46: f13 -> f14 : arg1'=-1, [], cost: 4
     20: f14 -> f10 : [], cost: 1
     34: f5 -> f10 : arg1'=2+arg1, [], cost: 3
     43: f5 -> f13 : [], cost: 2
     44: f5 -> f14 : arg1'=3+arg1, [], cost: 4
     25: f10 -> f6 : [], cost: 1
     27: f6 -> f2 : [], cost: 1
     30: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     42: f2 -> f6 : arg1'=1+arg1, [ arg1>=0 ], cost: 4
     47: f2 -> f10 : arg1'=2+arg1, [ arg1>=0 ], cost: 5
     48: f2 -> f13 : [ arg1>=0 ], cost: 4
     49: f2 -> f14 : arg1'=3+arg1, [ arg1>=0 ], cost: 6
     45: f13 -> f14 : arg1'=4+arg1, [], cost: 4
     46: f13 -> f14 : arg1'=-1, [], cost: 4
     20: f14 -> f10 : [], cost: 1
     25: f10 -> f6 : [], cost: 1
     27: f6 -> f2 : [], cost: 1
     30: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     59: f2 -> f2 : arg1'=1+arg1, [ arg1>=0 ], cost: 5
     60: f2 -> f2 : arg1'=2+arg1, [ arg1>=0 ], cost: 7
     61: f2 -> f2 : arg1'=3+arg1, [ arg1>=0 ], cost: 9
     62: f2 -> f2 : arg1'=4+arg1, [ arg1>=0 ], cost: 11
     63: f2 -> f2 : arg1'=-1, [ arg1>=0 ], cost: 11
     30: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
     59: f2 -> f2 : arg1'=1+arg1, [ arg1>=0 ], cost: 5
     60: f2 -> f2 : arg1'=2+arg1, [ arg1>=0 ], cost: 7
     61: f2 -> f2 : arg1'=3+arg1, [ arg1>=0 ], cost: 9
     62: f2 -> f2 : arg1'=4+arg1, [ arg1>=0 ], cost: 11
     63: f2 -> f2 : arg1'=-1, [ arg1>=0 ], cost: 11

   Accelerated rule 59 with non-termination, yielding the new rule 64.
   Accelerated rule 60 with non-termination, yielding the new rule 65.
   Accelerated rule 61 with non-termination, yielding the new rule 66.
   Accelerated rule 62 with non-termination, yielding the new rule 67.
   Failed to prove monotonicity of the guard of rule 63.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 59 60 61 62.
   Also removing duplicate rules: 64 65 66.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     63: f2 -> f2 : arg1'=-1, [ arg1>=0 ], cost: 11
     67: f2 -> [22] : [ arg1>=0 ], cost: NONTERM
     30: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     30: __init -> f2 : arg1'=arg1P_1, [], cost: 2
     68: __init -> f2 : arg1'=-1, [], cost: 13
     69: __init -> [22] : [], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     69: __init -> [22] : [], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     69: __init -> [22] : [], cost: NONTERM

Computing asymptotic complexity for rule 69
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  []

NO