NO

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

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ 2==arg1P_1 && arg2==arg2P_1 && arg3==arg3P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1==arg1P_2 && 13==arg2P_2 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
      2: f3 -> f4 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && 17==arg3P_3 && arg4==arg4P_3 ], cost: 1
     12: f4 -> f5 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2<arg3 && arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
     14: f4 -> f13 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg2>=arg3 && arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
      3: f5 -> f6 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && arg3==arg4P_4 ], cost: 1
      4: f6 -> f7 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3P_5==1+arg2 && arg1==arg1P_5 && arg2==arg2P_5 && arg4==arg4P_5 ], cost: 1
      5: f7 -> f8 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1==arg1P_6 && arg4==arg2P_6 && arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
      7: f8 -> f9 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1<arg2 && arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      8: f8 -> f9 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1<arg3 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
      9: f8 -> f10 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>=arg2 && arg1>=arg3 && arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
      6: f9 -> f12 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1==arg1P_7 && arg1==arg2P_7 && arg3==arg3P_7 && arg4==arg4P_7 ], cost: 1
     10: f12 -> f11 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     11: f10 -> f11 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
     13: f11 -> f4 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && arg4==arg4P_14 ], cost: 1
     15: __init -> f1 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     15: __init -> f1 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ 2==arg1P_1 && arg2==arg2P_1 && arg3==arg3P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1==arg1P_2 && 13==arg2P_2 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
      2: f3 -> f4 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && 17==arg3P_3 && arg4==arg4P_3 ], cost: 1
     12: f4 -> f5 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2<arg3 && arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
      3: f5 -> f6 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && arg3==arg4P_4 ], cost: 1
      4: f6 -> f7 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3P_5==1+arg2 && arg1==arg1P_5 && arg2==arg2P_5 && arg4==arg4P_5 ], cost: 1
      5: f7 -> f8 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1==arg1P_6 && arg4==arg2P_6 && arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
      7: f8 -> f9 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1<arg2 && arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      8: f8 -> f9 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1<arg3 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
      9: f8 -> f10 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>=arg2 && arg1>=arg3 && arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
      6: f9 -> f12 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1==arg1P_7 && arg1==arg2P_7 && arg3==arg3P_7 && arg4==arg4P_7 ], cost: 1
     10: f12 -> f11 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     11: f10 -> f11 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
     13: f11 -> f4 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && arg4==arg4P_14 ], cost: 1
     15: __init -> f1 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg1'=2, [], cost: 1
      1: f2 -> f3 : arg2'=13, [], cost: 1
      2: f3 -> f4 : arg3'=17, [], cost: 1
     12: f4 -> f5 : [ arg2<arg3 ], cost: 1
      3: f5 -> f6 : arg4'=arg3, [], cost: 1
      4: f6 -> f7 : arg3'=1+arg2, [], cost: 1
      5: f7 -> f8 : arg2'=arg4, [], cost: 1
      7: f8 -> f9 : [ arg1<arg2 ], cost: 1
      8: f8 -> f9 : [ arg1<arg3 ], cost: 1
      9: f8 -> f10 : [ arg1>=arg2 && arg1>=arg3 ], cost: 1
      6: f9 -> f12 : arg2'=arg1, [], cost: 1
     10: f12 -> f11 : [], cost: 1
     11: f10 -> f11 : [], cost: 1
     13: f11 -> f4 : [], cost: 1
     15: __init -> f1 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     21: f4 -> f8 : arg2'=arg3, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 ], cost: 4
      7: f8 -> f9 : [ arg1<arg2 ], cost: 1
      8: f8 -> f9 : [ arg1<arg3 ], cost: 1
     22: f8 -> f11 : [ arg1>=arg2 && arg1>=arg3 ], cost: 2
     23: f9 -> f11 : arg2'=arg1, [], cost: 2
     13: f11 -> f4 : [], cost: 1
     18: __init -> f4 : arg1'=2, arg2'=13, arg3'=17, arg4'=arg4P_16, [], cost: 4

Eliminated locations (on tree-shaped paths):
   Start location: __init
     24: f4 -> f9 : arg2'=arg3, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1<arg3 ], cost: 5
     25: f4 -> f9 : arg2'=arg3, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1<1+arg2 ], cost: 5
     26: f4 -> f11 : arg2'=arg3, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1>=arg3 && arg1>=1+arg2 ], cost: 6
     23: f9 -> f11 : arg2'=arg1, [], cost: 2
     13: f11 -> f4 : [], cost: 1
     18: __init -> f4 : arg1'=2, arg2'=13, arg3'=17, arg4'=arg4P_16, [], cost: 4

Eliminated locations (on tree-shaped paths):
   Start location: __init
     29: f4 -> f4 : arg2'=arg3, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1>=arg3 && arg1>=1+arg2 ], cost: 7
     30: f4 -> f4 : arg2'=arg1, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1<arg3 ], cost: 8
     31: f4 -> f4 : arg2'=arg1, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1<1+arg2 ], cost: 8
     18: __init -> f4 : arg1'=2, arg2'=13, arg3'=17, arg4'=arg4P_16, [], cost: 4

Accelerating simple loops of location 3.
   Accelerating the following rules:
     29: f4 -> f4 : arg2'=arg3, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1>=arg3 && arg1>=1+arg2 ], cost: 7
     30: f4 -> f4 : arg2'=arg1, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1<arg3 ], cost: 8
     31: f4 -> f4 : arg2'=arg1, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1<1+arg2 ], cost: 8

   Failed to prove monotonicity of the guard of rule 29.
   Accelerated rule 30 with non-termination, yielding the new rule 32.
   Accelerated rule 31 with non-termination, yielding the new rule 33.
[accelerate] Nesting with 1 inner and 2 outer candidates
   Removing the simple loops: 31.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     29: f4 -> f4 : arg2'=arg3, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1>=arg3 && arg1>=1+arg2 ], cost: 7
     30: f4 -> f4 : arg2'=arg1, arg3'=1+arg2, arg4'=arg3, [ arg2<arg3 && arg1<arg3 ], cost: 8
     32: f4 -> [14] : [ arg2<arg3 && arg1<arg3 && arg1<1+arg2 ], cost: NONTERM
     33: f4 -> [14] : [ arg2<arg3 && arg1<1+arg2 ], cost: NONTERM
     18: __init -> f4 : arg1'=2, arg2'=13, arg3'=17, arg4'=arg4P_16, [], cost: 4

Chained accelerated rules (with incoming rules):
   Start location: __init
     18: __init -> f4 : arg1'=2, arg2'=13, arg3'=17, arg4'=arg4P_16, [], cost: 4
     34: __init -> f4 : arg1'=2, arg2'=2, arg3'=14, arg4'=17, [], cost: 12
     35: __init -> [14] : [], cost: NONTERM
     36: __init -> [14] : [], cost: NONTERM

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

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     36: __init -> [14] : [], cost: NONTERM

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