NO

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

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1==arg1P_1 && 100==arg2P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, [ 0==arg1P_2 && arg2==arg2P_2 ], cost: 1
     10: f3 -> f4 : arg1'=arg1P_11, arg2'=arg2P_11, [ arg1<arg2 && arg1==arg1P_11 && arg2==arg2P_11 ], cost: 1
     12: f3 -> f12 : arg1'=arg1P_13, arg2'=arg2P_13, [ arg1>=arg2 && arg1==arg1P_13 && arg2==arg2P_13 ], 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, [ arg2P_4==-1+arg2 && arg1==arg1P_4 ], cost: 1
      8: f9 -> f7 : arg1'=arg1P_9, arg2'=arg2P_9, [ arg1==arg1P_9 && arg2==arg2P_9 ], cost: 1
      4: f6 -> f10 : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1P_5==-1+arg1 && arg2==arg2P_5 ], cost: 1
      5: f10 -> f11 : arg1'=arg1P_6, arg2'=arg2P_6, [ arg2P_6==1+arg2 && arg1==arg1P_6 ], cost: 1
      9: f11 -> f7 : arg1'=arg1P_10, arg2'=arg2P_10, [ arg1==arg1P_10 && arg2==arg2P_10 ], cost: 1
      6: f4 -> f5 : arg1'=arg1P_7, arg2'=arg2P_7, [ 51<arg2 && arg1==arg1P_7 && arg2==arg2P_7 ], cost: 1
      7: f4 -> f6 : arg1'=arg1P_8, arg2'=arg2P_8, [ 51>=arg2 && arg1==arg1P_8 && arg2==arg2P_8 ], cost: 1
     11: f7 -> f3 : arg1'=arg1P_12, arg2'=arg2P_12, [ arg1==arg1P_12 && arg2==arg2P_12 ], cost: 1
     13: __init -> f1 : arg1'=arg1P_14, arg2'=arg2P_14, [], cost: 1

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

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1==arg1P_1 && 100==arg2P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, [ 0==arg1P_2 && arg2==arg2P_2 ], cost: 1
     10: f3 -> f4 : arg1'=arg1P_11, arg2'=arg2P_11, [ arg1<arg2 && arg1==arg1P_11 && arg2==arg2P_11 ], 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, [ arg2P_4==-1+arg2 && arg1==arg1P_4 ], cost: 1
      8: f9 -> f7 : arg1'=arg1P_9, arg2'=arg2P_9, [ arg1==arg1P_9 && arg2==arg2P_9 ], cost: 1
      4: f6 -> f10 : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1P_5==-1+arg1 && arg2==arg2P_5 ], cost: 1
      5: f10 -> f11 : arg1'=arg1P_6, arg2'=arg2P_6, [ arg2P_6==1+arg2 && arg1==arg1P_6 ], cost: 1
      9: f11 -> f7 : arg1'=arg1P_10, arg2'=arg2P_10, [ arg1==arg1P_10 && arg2==arg2P_10 ], cost: 1
      6: f4 -> f5 : arg1'=arg1P_7, arg2'=arg2P_7, [ 51<arg2 && arg1==arg1P_7 && arg2==arg2P_7 ], cost: 1
      7: f4 -> f6 : arg1'=arg1P_8, arg2'=arg2P_8, [ 51>=arg2 && arg1==arg1P_8 && arg2==arg2P_8 ], cost: 1
     11: f7 -> f3 : arg1'=arg1P_12, arg2'=arg2P_12, [ arg1==arg1P_12 && arg2==arg2P_12 ], cost: 1
     13: __init -> f1 : arg1'=arg1P_14, arg2'=arg2P_14, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg2'=100, [], cost: 1
      1: f2 -> f3 : arg1'=0, [], cost: 1
     10: f3 -> f4 : [ arg1<arg2 ], cost: 1
      2: f5 -> f8 : arg1'=1+arg1, [], cost: 1
      3: f8 -> f9 : arg2'=-1+arg2, [], cost: 1
      8: f9 -> f7 : [], cost: 1
      4: f6 -> f10 : arg1'=-1+arg1, [], cost: 1
      5: f10 -> f11 : arg2'=1+arg2, [], cost: 1
      9: f11 -> f7 : [], cost: 1
      6: f4 -> f5 : [ 51<arg2 ], cost: 1
      7: f4 -> f6 : [ 51>=arg2 ], cost: 1
     11: f7 -> f3 : [], cost: 1
     13: __init -> f1 : arg1'=arg1P_14, arg2'=arg2P_14, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     10: f3 -> f4 : [ arg1<arg2 ], cost: 1
     20: f4 -> f7 : arg1'=1+arg1, arg2'=-1+arg2, [ 51<arg2 ], cost: 4
     21: f4 -> f7 : arg1'=-1+arg1, arg2'=1+arg2, [ 51>=arg2 ], cost: 4
     11: f7 -> f3 : [], cost: 1
     15: __init -> f3 : arg1'=0, arg2'=100, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     22: f3 -> f7 : arg1'=1+arg1, arg2'=-1+arg2, [ arg1<arg2 && 51<arg2 ], cost: 5
     23: f3 -> f7 : arg1'=-1+arg1, arg2'=1+arg2, [ arg1<arg2 && 51>=arg2 ], cost: 5
     11: f7 -> f3 : [], cost: 1
     15: __init -> f3 : arg1'=0, arg2'=100, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     24: f3 -> f3 : arg1'=1+arg1, arg2'=-1+arg2, [ arg1<arg2 && 51<arg2 ], cost: 6
     25: f3 -> f3 : arg1'=-1+arg1, arg2'=1+arg2, [ arg1<arg2 && 51>=arg2 ], cost: 6
     15: __init -> f3 : arg1'=0, arg2'=100, [], cost: 3

Accelerating simple loops of location 2.
   Accelerating the following rules:
     24: f3 -> f3 : arg1'=1+arg1, arg2'=-1+arg2, [ arg1<arg2 && 51<arg2 ], cost: 6
     25: f3 -> f3 : arg1'=-1+arg1, arg2'=1+arg2, [ arg1<arg2 && 51>=arg2 ], cost: 6

   Accelerated rule 24 with backward acceleration, yielding the new rule 26.
   Accelerated rule 25 with backward acceleration, yielding the new rule 27.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Nested simple loops 25 (outer loop) and 26 (inner loop) with Rule(2 | -51+arg2>=0, -51+arg2+arg1<51, | NONTERM || 13 | ), resulting in the new rules: 28, 29.
   Nested simple loops 24 (outer loop) and 27 (inner loop) with Rule(2 | 51<arg2, 53-arg2>=0, k_2>=1, 1+arg1<51, | 12*k_2 || 2 | 0=arg1, 1=52, ), resulting in the new rules: 30, 31.
   Removing the simple loops: 24 25.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     26: f3 -> f3 : arg1'=k+arg1, arg2'=-k+arg2, [ k>=0 && -1+k+arg1<1-k+arg2 && 51<1-k+arg2 ], cost: 6*k
     27: f3 -> f3 : arg1'=-52+arg2+arg1, arg2'=52, [ arg1<arg2 && 52-arg2>=0 ], cost: 312-6*arg2
     28: f3 -> [13] : [ -51+arg2>=0 && -51+arg2+arg1<51 ], cost: NONTERM
     29: f3 -> [13] : [ arg1<arg2 && 51>=arg2 && -50+arg2>=0 && -51+arg2+arg1<51 ], cost: NONTERM
     30: f3 -> f3 : arg1'=arg1, arg2'=52, [ 51<arg2 && 53-arg2>=0 && k_2>=1 && 1+arg1<51 ], cost: 12*k_2
     31: f3 -> f3 : arg1'=-52+arg2+arg1, arg2'=52, [ arg1<arg2 && 52-arg2>=0 && k_2>=1 && -51+arg2+arg1<51 ], cost: 312-6*arg2+12*k_2
     15: __init -> f3 : arg1'=0, arg2'=100, [], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     15: __init -> f3 : arg1'=0, arg2'=100, [], cost: 3
     32: __init -> f3 : arg1'=k, arg2'=100-k, [ k>=0 && -1+k<101-k && 51<101-k ], cost: 3+6*k
     33: __init -> [13] : [], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     32: __init -> f3 : arg1'=k, arg2'=100-k, [ k>=0 && -1+k<101-k && 51<101-k ], cost: 3+6*k
     33: __init -> [13] : [], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     32: __init -> f3 : arg1'=k, arg2'=100-k, [ k>=0 && -1+k<101-k && 51<101-k ], cost: 3+6*k
     33: __init -> [13] : [], cost: NONTERM

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