NO

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

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, [ arg2==arg2P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1==arg1P_2 && 5==arg2P_2 ], cost: 1
     15: f3 -> f4 : arg1'=arg1P_16, arg2'=arg2P_16, [ arg1<0 && arg1==arg1P_16 && arg2==arg2P_16 ], cost: 1
     16: f3 -> f4 : arg1'=arg1P_17, arg2'=arg2P_17, [ arg1>0 && arg1==arg1P_17 && arg2==arg2P_17 ], cost: 1
     18: f3 -> f16 : arg1'=arg1P_19, arg2'=arg2P_19, [ arg1==0 && arg1==arg1P_19 && arg2==arg2P_19 ], cost: 1
      2: f5 -> f8 : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1P_3==-1+arg1 && arg2==arg2P_3 ], cost: 1
      3: f8 -> f9 : arg1'=arg1P_4, arg2'=arg2P_4, [ arg1P_4==-arg1 && arg2==arg2P_4 ], cost: 1
     13: f9 -> f7 : arg1'=arg1P_14, arg2'=arg2P_14, [ arg1==arg1P_14 && arg2==arg2P_14 ], cost: 1
      4: f10 -> f13 : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1P_5==1+arg1 && arg2==arg2P_5 ], cost: 1
      5: f13 -> f14 : arg1'=arg1P_6, arg2'=arg2P_6, [ arg1P_6==-arg1 && arg2==arg2P_6 ], cost: 1
      9: f14 -> f12 : arg1'=arg1P_10, arg2'=arg2P_10, [ arg1==arg1P_10 && arg2==arg2P_10 ], cost: 1
      6: f11 -> f15 : arg1'=arg1P_7, arg2'=arg2P_7, [ 0==arg1P_7 && arg2==arg2P_7 ], cost: 1
     10: f15 -> f12 : arg1'=arg1P_11, arg2'=arg2P_11, [ arg1==arg1P_11 && arg2==arg2P_11 ], cost: 1
      7: f6 -> f10 : arg1'=arg1P_8, arg2'=arg2P_8, [ arg1>arg2 && arg1==arg1P_8 && arg2==arg2P_8 ], cost: 1
      8: f6 -> f11 : arg1'=arg1P_9, arg2'=arg2P_9, [ arg1<=arg2 && arg1==arg1P_9 && arg2==arg2P_9 ], cost: 1
     14: f12 -> f7 : arg1'=arg1P_15, arg2'=arg2P_15, [ arg1==arg1P_15 && arg2==arg2P_15 ], cost: 1
     11: f4 -> f5 : arg1'=arg1P_12, arg2'=arg2P_12, [ arg1<-arg2 && arg1==arg1P_12 && arg2==arg2P_12 ], cost: 1
     12: f4 -> f6 : arg1'=arg1P_13, arg2'=arg2P_13, [ arg1>=-arg2 && arg1==arg1P_13 && arg2==arg2P_13 ], cost: 1
     17: f7 -> f3 : arg1'=arg1P_18, arg2'=arg2P_18, [ arg1==arg1P_18 && arg2==arg2P_18 ], cost: 1
     19: __init -> f1 : arg1'=arg1P_20, arg2'=arg2P_20, [], cost: 1

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

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, [ arg2==arg2P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1==arg1P_2 && 5==arg2P_2 ], cost: 1
     15: f3 -> f4 : arg1'=arg1P_16, arg2'=arg2P_16, [ arg1<0 && arg1==arg1P_16 && arg2==arg2P_16 ], cost: 1
     16: f3 -> f4 : arg1'=arg1P_17, arg2'=arg2P_17, [ arg1>0 && arg1==arg1P_17 && arg2==arg2P_17 ], cost: 1
      2: f5 -> f8 : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1P_3==-1+arg1 && arg2==arg2P_3 ], cost: 1
      3: f8 -> f9 : arg1'=arg1P_4, arg2'=arg2P_4, [ arg1P_4==-arg1 && arg2==arg2P_4 ], cost: 1
     13: f9 -> f7 : arg1'=arg1P_14, arg2'=arg2P_14, [ arg1==arg1P_14 && arg2==arg2P_14 ], cost: 1
      4: f10 -> f13 : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1P_5==1+arg1 && arg2==arg2P_5 ], cost: 1
      5: f13 -> f14 : arg1'=arg1P_6, arg2'=arg2P_6, [ arg1P_6==-arg1 && arg2==arg2P_6 ], cost: 1
      9: f14 -> f12 : arg1'=arg1P_10, arg2'=arg2P_10, [ arg1==arg1P_10 && arg2==arg2P_10 ], cost: 1
      6: f11 -> f15 : arg1'=arg1P_7, arg2'=arg2P_7, [ 0==arg1P_7 && arg2==arg2P_7 ], cost: 1
     10: f15 -> f12 : arg1'=arg1P_11, arg2'=arg2P_11, [ arg1==arg1P_11 && arg2==arg2P_11 ], cost: 1
      7: f6 -> f10 : arg1'=arg1P_8, arg2'=arg2P_8, [ arg1>arg2 && arg1==arg1P_8 && arg2==arg2P_8 ], cost: 1
      8: f6 -> f11 : arg1'=arg1P_9, arg2'=arg2P_9, [ arg1<=arg2 && arg1==arg1P_9 && arg2==arg2P_9 ], cost: 1
     14: f12 -> f7 : arg1'=arg1P_15, arg2'=arg2P_15, [ arg1==arg1P_15 && arg2==arg2P_15 ], cost: 1
     11: f4 -> f5 : arg1'=arg1P_12, arg2'=arg2P_12, [ arg1<-arg2 && arg1==arg1P_12 && arg2==arg2P_12 ], cost: 1
     12: f4 -> f6 : arg1'=arg1P_13, arg2'=arg2P_13, [ arg1>=-arg2 && arg1==arg1P_13 && arg2==arg2P_13 ], cost: 1
     17: f7 -> f3 : arg1'=arg1P_18, arg2'=arg2P_18, [ arg1==arg1P_18 && arg2==arg2P_18 ], cost: 1
     19: __init -> f1 : arg1'=arg1P_20, arg2'=arg2P_20, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
      1: f2 -> f3 : arg2'=5, [], cost: 1
     15: f3 -> f4 : [ arg1<0 ], cost: 1
     16: f3 -> f4 : [ arg1>0 ], cost: 1
      2: f5 -> f8 : arg1'=-1+arg1, [], cost: 1
      3: f8 -> f9 : arg1'=-arg1, [], cost: 1
     13: f9 -> f7 : [], cost: 1
      4: f10 -> f13 : arg1'=1+arg1, [], cost: 1
      5: f13 -> f14 : arg1'=-arg1, [], cost: 1
      9: f14 -> f12 : [], cost: 1
      6: f11 -> f15 : arg1'=0, [], cost: 1
     10: f15 -> f12 : [], cost: 1
      7: f6 -> f10 : [ arg1>arg2 ], cost: 1
      8: f6 -> f11 : [ arg1<=arg2 ], cost: 1
     14: f12 -> f7 : [], cost: 1
     11: f4 -> f5 : [ arg1<-arg2 ], cost: 1
     12: f4 -> f6 : [ arg1>=-arg2 ], cost: 1
     17: f7 -> f3 : [], cost: 1
     19: __init -> f1 : arg1'=arg1P_20, arg2'=arg2P_20, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     15: f3 -> f4 : [ arg1<0 ], cost: 1
     16: f3 -> f4 : [ arg1>0 ], cost: 1
     28: f6 -> f12 : arg1'=0, [ arg1<=arg2 ], cost: 3
     29: f6 -> f12 : arg1'=-1-arg1, [ arg1>arg2 ], cost: 4
     14: f12 -> f7 : [], cost: 1
     12: f4 -> f6 : [ arg1>=-arg2 ], cost: 1
     24: f4 -> f7 : arg1'=1-arg1, [ arg1<-arg2 ], cost: 4
     17: f7 -> f3 : [], cost: 1
     21: __init -> f3 : arg1'=arg1P_1, arg2'=5, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     30: f3 -> f6 : [ arg1<0 && arg1>=-arg2 ], cost: 2
     31: f3 -> f7 : arg1'=1-arg1, [ arg1<0 && arg1<-arg2 ], cost: 5
     32: f3 -> f6 : [ arg1>0 && arg1>=-arg2 ], cost: 2
     33: f3 -> f7 : arg1'=1-arg1, [ arg1>0 && arg1<-arg2 ], cost: 5
     34: f6 -> f7 : arg1'=0, [ arg1<=arg2 ], cost: 4
     35: f6 -> f7 : arg1'=-1-arg1, [ arg1>arg2 ], cost: 5
     17: f7 -> f3 : [], cost: 1
     21: __init -> f3 : arg1'=arg1P_1, arg2'=5, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     39: f3 -> f3 : arg1'=1-arg1, [ arg1<0 && arg1<-arg2 ], cost: 6
     40: f3 -> f3 : arg1'=1-arg1, [ arg1>0 && arg1<-arg2 ], cost: 6
     41: f3 -> f3 : arg1'=0, [ arg1<0 && arg1>=-arg2 && arg1<=arg2 ], cost: 7
     42: f3 -> f3 : arg1'=0, [ arg1>0 && arg1>=-arg2 && arg1<=arg2 ], cost: 7
     43: f3 -> f3 : arg1'=-1-arg1, [ arg1>0 && arg1>=-arg2 && arg1>arg2 ], cost: 8
     21: __init -> f3 : arg1'=arg1P_1, arg2'=5, [], cost: 3

Accelerating simple loops of location 2.
   Accelerating the following rules:
     39: f3 -> f3 : arg1'=1-arg1, [ arg1<0 && arg1<-arg2 ], cost: 6
     40: f3 -> f3 : arg1'=1-arg1, [ arg1>0 && arg1<-arg2 ], cost: 6
     41: f3 -> f3 : arg1'=0, [ arg1<0 && arg1>=-arg2 && arg1<=arg2 ], cost: 7
     42: f3 -> f3 : arg1'=0, [ arg1>0 && arg1>=-arg2 && arg1<=arg2 ], cost: 7
     43: f3 -> f3 : arg1'=-1-arg1, [ arg1>0 && arg1>=-arg2 && arg1>arg2 ], cost: 8

   Failed to prove monotonicity of the guard of rule 39.
   Failed to prove monotonicity of the guard of rule 40.
   Failed to prove monotonicity of the guard of rule 41.
   Failed to prove monotonicity of the guard of rule 42.
   Failed to prove monotonicity of the guard of rule 43.
[accelerate] Nesting with 5 inner and 5 outer candidates
   Nested simple loops 40 (outer loop) and 39 (inner loop) with Rule(2 | arg1<0, arg1<-arg2, 1-arg1<-arg2, | NONTERM || 17 | ), resulting in the new rules: 44, 45.
   Nested simple loops 43 (outer loop) and 39 (inner loop) with Rule(2 | arg1<0, arg1<-arg2, 1-arg1>=-arg2, | NONTERM || 17 | ), resulting in the new rules: 46, 47.
   Nested simple loops 39 (outer loop) and 40 (inner loop) with Rule(2 | arg1<-arg2, 1-arg1<0, 1-arg1<-arg2, | NONTERM || 17 | ), resulting in the new rules: 48, 49.
   Nested simple loops 39 (outer loop) and 43 (inner loop) with Rule(2 | arg1>0, arg1>=-arg2, arg1>arg2, | NONTERM || 17 | ), resulting in the new rules: 50, 51.
   Removing the simple loops: 39 40 43.
   Also removing duplicate rules: 44 45 46 47.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     41: f3 -> f3 : arg1'=0, [ arg1<0 && arg1>=-arg2 && arg1<=arg2 ], cost: 7
     42: f3 -> f3 : arg1'=0, [ arg1>0 && arg1>=-arg2 && arg1<=arg2 ], cost: 7
     48: f3 -> [17] : [ arg1<-arg2 && 1-arg1<0 && 1-arg1<-arg2 ], cost: NONTERM
     49: f3 -> [17] : [ arg1<0 && arg1<-arg2 && 1-arg1<-arg2 ], cost: NONTERM
     50: f3 -> [17] : [ arg1>0 && arg1>=-arg2 && arg1>arg2 ], cost: NONTERM
     51: f3 -> [17] : [ arg1<0 && arg1<-arg2 && 1-arg1>=-arg2 ], cost: NONTERM
     21: __init -> f3 : arg1'=arg1P_1, arg2'=5, [], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     21: __init -> f3 : arg1'=arg1P_1, arg2'=5, [], cost: 3
     52: __init -> f3 : arg1'=0, arg2'=5, [], cost: 10
     53: __init -> f3 : arg1'=0, arg2'=5, [], cost: 10
     54: __init -> [17] : [], cost: NONTERM
     55: __init -> [17] : [], cost: NONTERM

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

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     55: __init -> [17] : [], cost: NONTERM

Computing asymptotic complexity for rule 55
   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