NO

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

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1==864 && arg2==arg2P_1 ], cost: 1
     29: f2 -> f3 : arg1'=arg1P_30, arg2'=arg2P_30, [ arg1<=10 && arg1==arg1P_30 && arg2==arg2P_30 ], cost: 1
     30: f2 -> f4 : arg1'=arg1P_31, arg2'=arg2P_31, [ arg1>10 && arg1==arg1P_31 && arg2==arg2P_31 ], cost: 1
      1: f3 -> f6 : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1==arg1P_2 && 0==arg2P_2 ], cost: 1
      3: f6 -> f7 : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2<100 && arg1==arg1P_4 && arg2==arg2P_4 ], cost: 1
      5: f6 -> f9 : arg1'=arg1P_6, arg2'=arg2P_6, [ arg2>=100 && arg1==arg1P_6 && arg2==arg2P_6 ], cost: 1
      2: f7 -> f8 : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2P_3==1+arg2 && arg1==arg1P_3 ], cost: 1
      4: f8 -> f6 : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1==arg1P_5 && arg2==arg2P_5 ], cost: 1
     31: f9 -> f5 : arg1'=arg1P_32, arg2'=arg2P_32, [ arg1==arg1P_32 && arg2==arg2P_32 ], cost: 1
      6: f10 -> f13 : arg1'=arg1P_7, arg2'=arg2P_7, [ arg1==arg1P_7 && 0==arg2P_7 ], cost: 1
      8: f13 -> f14 : arg1'=arg1P_9, arg2'=arg2P_9, [ arg2<101 && arg1==arg1P_9 && arg2==arg2P_9 ], cost: 1
     10: f13 -> f16 : arg1'=arg1P_11, arg2'=arg2P_11, [ arg2>=101 && arg1==arg1P_11 && arg2==arg2P_11 ], cost: 1
      7: f14 -> f15 : arg1'=arg1P_8, arg2'=arg2P_8, [ arg2P_8==1+arg2 && arg1==arg1P_8 ], cost: 1
      9: f15 -> f13 : arg1'=arg1P_10, arg2'=arg2P_10, [ arg1==arg1P_10 && arg2==arg2P_10 ], cost: 1
     13: f16 -> f12 : arg1'=arg1P_14, arg2'=arg2P_14, [ arg1==arg1P_14 && arg2==arg2P_14 ], cost: 1
     11: f4 -> f10 : arg1'=arg1P_12, arg2'=arg2P_12, [ arg1<=50 && arg1==arg1P_12 && arg2==arg2P_12 ], cost: 1
     12: f4 -> f11 : arg1'=arg1P_13, arg2'=arg2P_13, [ arg1>50 && arg1==arg1P_13 && arg2==arg2P_13 ], cost: 1
     14: f11 -> f12 : arg1'=arg1P_15, arg2'=arg2P_15, [ arg1==arg1P_15 && arg2==arg2P_15 ], cost: 1
     25: f12 -> f17 : arg1'=arg1P_26, arg2'=arg2P_26, [ arg1<=100 && arg1==arg1P_26 && arg2==arg2P_26 ], cost: 1
     26: f12 -> f18 : arg1'=arg1P_27, arg2'=arg2P_27, [ arg1>100 && arg1==arg1P_27 && arg2==arg2P_27 ], cost: 1
     15: f17 -> f20 : arg1'=arg1P_16, arg2'=arg2P_16, [ arg1==arg1P_16 && 0==arg2P_16 ], cost: 1
     17: f20 -> f21 : arg1'=arg1P_18, arg2'=arg2P_18, [ arg2<102 && arg1==arg1P_18 && arg2==arg2P_18 ], cost: 1
     19: f20 -> f23 : arg1'=arg1P_20, arg2'=arg2P_20, [ arg2>=102 && arg1==arg1P_20 && arg2==arg2P_20 ], cost: 1
     16: f21 -> f22 : arg1'=arg1P_17, arg2'=arg2P_17, [ arg2P_17==1+arg2 && arg1==arg1P_17 ], cost: 1
     18: f22 -> f20 : arg1'=arg1P_19, arg2'=arg2P_19, [ arg1==arg1P_19 && arg2==arg2P_19 ], cost: 1
     27: f23 -> f19 : arg1'=arg1P_28, arg2'=arg2P_28, [ arg1==arg1P_28 && arg2==arg2P_28 ], cost: 1
     20: f18 -> f24 : arg1'=arg1P_21, arg2'=arg2P_21, [ arg1==arg1P_21 && 0==arg2P_21 ], cost: 1
     22: f24 -> f25 : arg1'=arg1P_23, arg2'=arg2P_23, [ arg2<103 && arg1==arg1P_23 && arg2==arg2P_23 ], cost: 1
     24: f24 -> f27 : arg1'=arg1P_25, arg2'=arg2P_25, [ arg2>=103 && arg1==arg1P_25 && arg2==arg2P_25 ], cost: 1
     21: f25 -> f26 : arg1'=arg1P_22, arg2'=arg2P_22, [ arg2P_22==arg2 && arg1==arg1P_22 ], cost: 1
     23: f26 -> f24 : arg1'=arg1P_24, arg2'=arg2P_24, [ arg1==arg1P_24 && arg2==arg2P_24 ], cost: 1
     28: f27 -> f19 : arg1'=arg1P_29, arg2'=arg2P_29, [ arg1==arg1P_29 && arg2==arg2P_29 ], cost: 1
     32: f19 -> f5 : arg1'=arg1P_33, arg2'=arg2P_33, [ arg1==arg1P_33 && arg2==arg2P_33 ], cost: 1
     33: __init -> f1 : arg1'=arg1P_34, arg2'=arg2P_34, [], cost: 1

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

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1==864 && arg2==arg2P_1 ], cost: 1
     29: f2 -> f3 : arg1'=arg1P_30, arg2'=arg2P_30, [ arg1<=10 && arg1==arg1P_30 && arg2==arg2P_30 ], cost: 1
     30: f2 -> f4 : arg1'=arg1P_31, arg2'=arg2P_31, [ arg1>10 && arg1==arg1P_31 && arg2==arg2P_31 ], cost: 1
      1: f3 -> f6 : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1==arg1P_2 && 0==arg2P_2 ], cost: 1
      3: f6 -> f7 : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2<100 && arg1==arg1P_4 && arg2==arg2P_4 ], cost: 1
      2: f7 -> f8 : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2P_3==1+arg2 && arg1==arg1P_3 ], cost: 1
      4: f8 -> f6 : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1==arg1P_5 && arg2==arg2P_5 ], cost: 1
      6: f10 -> f13 : arg1'=arg1P_7, arg2'=arg2P_7, [ arg1==arg1P_7 && 0==arg2P_7 ], cost: 1
      8: f13 -> f14 : arg1'=arg1P_9, arg2'=arg2P_9, [ arg2<101 && arg1==arg1P_9 && arg2==arg2P_9 ], cost: 1
     10: f13 -> f16 : arg1'=arg1P_11, arg2'=arg2P_11, [ arg2>=101 && arg1==arg1P_11 && arg2==arg2P_11 ], cost: 1
      7: f14 -> f15 : arg1'=arg1P_8, arg2'=arg2P_8, [ arg2P_8==1+arg2 && arg1==arg1P_8 ], cost: 1
      9: f15 -> f13 : arg1'=arg1P_10, arg2'=arg2P_10, [ arg1==arg1P_10 && arg2==arg2P_10 ], cost: 1
     13: f16 -> f12 : arg1'=arg1P_14, arg2'=arg2P_14, [ arg1==arg1P_14 && arg2==arg2P_14 ], cost: 1
     11: f4 -> f10 : arg1'=arg1P_12, arg2'=arg2P_12, [ arg1<=50 && arg1==arg1P_12 && arg2==arg2P_12 ], cost: 1
     12: f4 -> f11 : arg1'=arg1P_13, arg2'=arg2P_13, [ arg1>50 && arg1==arg1P_13 && arg2==arg2P_13 ], cost: 1
     14: f11 -> f12 : arg1'=arg1P_15, arg2'=arg2P_15, [ arg1==arg1P_15 && arg2==arg2P_15 ], cost: 1
     25: f12 -> f17 : arg1'=arg1P_26, arg2'=arg2P_26, [ arg1<=100 && arg1==arg1P_26 && arg2==arg2P_26 ], cost: 1
     26: f12 -> f18 : arg1'=arg1P_27, arg2'=arg2P_27, [ arg1>100 && arg1==arg1P_27 && arg2==arg2P_27 ], cost: 1
     15: f17 -> f20 : arg1'=arg1P_16, arg2'=arg2P_16, [ arg1==arg1P_16 && 0==arg2P_16 ], cost: 1
     17: f20 -> f21 : arg1'=arg1P_18, arg2'=arg2P_18, [ arg2<102 && arg1==arg1P_18 && arg2==arg2P_18 ], cost: 1
     16: f21 -> f22 : arg1'=arg1P_17, arg2'=arg2P_17, [ arg2P_17==1+arg2 && arg1==arg1P_17 ], cost: 1
     18: f22 -> f20 : arg1'=arg1P_19, arg2'=arg2P_19, [ arg1==arg1P_19 && arg2==arg2P_19 ], cost: 1
     20: f18 -> f24 : arg1'=arg1P_21, arg2'=arg2P_21, [ arg1==arg1P_21 && 0==arg2P_21 ], cost: 1
     22: f24 -> f25 : arg1'=arg1P_23, arg2'=arg2P_23, [ arg2<103 && arg1==arg1P_23 && arg2==arg2P_23 ], cost: 1
     21: f25 -> f26 : arg1'=arg1P_22, arg2'=arg2P_22, [ arg2P_22==arg2 && arg1==arg1P_22 ], cost: 1
     23: f26 -> f24 : arg1'=arg1P_24, arg2'=arg2P_24, [ arg1==arg1P_24 && arg2==arg2P_24 ], cost: 1
     33: __init -> f1 : arg1'=arg1P_34, arg2'=arg2P_34, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg1'=864, [], cost: 1
     29: f2 -> f3 : [ arg1<=10 ], cost: 1
     30: f2 -> f4 : [ arg1>10 ], cost: 1
      1: f3 -> f6 : arg2'=0, [], cost: 1
      3: f6 -> f7 : [ arg2<100 ], cost: 1
      2: f7 -> f8 : arg2'=1+arg2, [], cost: 1
      4: f8 -> f6 : [], cost: 1
      6: f10 -> f13 : arg2'=0, [], cost: 1
      8: f13 -> f14 : [ arg2<101 ], cost: 1
     10: f13 -> f16 : [ arg2>=101 ], cost: 1
      7: f14 -> f15 : arg2'=1+arg2, [], cost: 1
      9: f15 -> f13 : [], cost: 1
     13: f16 -> f12 : [], cost: 1
     11: f4 -> f10 : [ arg1<=50 ], cost: 1
     12: f4 -> f11 : [ arg1>50 ], cost: 1
     14: f11 -> f12 : [], cost: 1
     25: f12 -> f17 : [ arg1<=100 ], cost: 1
     26: f12 -> f18 : [ arg1>100 ], cost: 1
     15: f17 -> f20 : arg2'=0, [], cost: 1
     17: f20 -> f21 : [ arg2<102 ], cost: 1
     16: f21 -> f22 : arg2'=1+arg2, [], cost: 1
     18: f22 -> f20 : [], cost: 1
     20: f18 -> f24 : arg2'=0, [], cost: 1
     22: f24 -> f25 : [ arg2<103 ], cost: 1
     21: f25 -> f26 : [], cost: 1
     23: f26 -> f24 : [], cost: 1
     33: __init -> f1 : arg1'=arg1P_34, arg2'=arg2P_34, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     30: f2 -> f4 : [ arg1>10 ], cost: 1
     35: f2 -> f6 : arg2'=0, [ arg1<=10 ], cost: 2
     37: f6 -> f6 : arg2'=1+arg2, [ arg2<100 ], cost: 3
     41: f13 -> f12 : [ arg2>=101 ], cost: 2
     42: f13 -> f13 : arg2'=1+arg2, [ arg2<101 ], cost: 3
     38: f4 -> f13 : arg2'=0, [ arg1<=50 ], cost: 2
     39: f4 -> f12 : [ arg1>50 ], cost: 2
     43: f12 -> f20 : arg2'=0, [ arg1<=100 ], cost: 2
     44: f12 -> f24 : arg2'=0, [ arg1>100 ], cost: 2
     46: f20 -> f20 : arg2'=1+arg2, [ arg2<102 ], cost: 3
     48: f24 -> f24 : [ arg2<103 ], cost: 3
     34: __init -> f2 : arg1'=864, arg2'=arg2P_34, [], cost: 2

Accelerating simple loops of location 3.
   Accelerating the following rules:
     37: f6 -> f6 : arg2'=1+arg2, [ arg2<100 ], cost: 3

   Accelerated rule 37 with backward acceleration, yielding the new rule 49.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 37.

Accelerating simple loops of location 8.
   Accelerating the following rules:
     42: f13 -> f13 : arg2'=1+arg2, [ arg2<101 ], cost: 3

   Accelerated rule 42 with backward acceleration, yielding the new rule 50.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 42.

Accelerating simple loops of location 16.
   Accelerating the following rules:
     46: f20 -> f20 : arg2'=1+arg2, [ arg2<102 ], cost: 3

   Accelerated rule 46 with backward acceleration, yielding the new rule 51.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 46.

Accelerating simple loops of location 21.
   Accelerating the following rules:
     48: f24 -> f24 : [ arg2<103 ], cost: 3

   Accelerated rule 48 with non-termination, yielding the new rule 52.
[accelerate] Nesting with 0 inner and 0 outer candidates
   Removing the simple loops: 48.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     30: f2 -> f4 : [ arg1>10 ], cost: 1
     35: f2 -> f6 : arg2'=0, [ arg1<=10 ], cost: 2
     49: f6 -> f6 : arg2'=100, [ 100-arg2>=0 ], cost: 300-3*arg2
     41: f13 -> f12 : [ arg2>=101 ], cost: 2
     50: f13 -> f13 : arg2'=101, [ 101-arg2>=0 ], cost: 303-3*arg2
     38: f4 -> f13 : arg2'=0, [ arg1<=50 ], cost: 2
     39: f4 -> f12 : [ arg1>50 ], cost: 2
     43: f12 -> f20 : arg2'=0, [ arg1<=100 ], cost: 2
     44: f12 -> f24 : arg2'=0, [ arg1>100 ], cost: 2
     51: f20 -> f20 : arg2'=102, [ 102-arg2>=0 ], cost: 306-3*arg2
     52: f24 -> [31] : [ arg2<103 ], cost: NONTERM
     34: __init -> f2 : arg1'=864, arg2'=arg2P_34, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     30: f2 -> f4 : [ arg1>10 ], cost: 1
     35: f2 -> f6 : arg2'=0, [ arg1<=10 ], cost: 2
     53: f2 -> f6 : arg2'=100, [ arg1<=10 ], cost: 302
     41: f13 -> f12 : [ arg2>=101 ], cost: 2
     38: f4 -> f13 : arg2'=0, [ arg1<=50 ], cost: 2
     39: f4 -> f12 : [ arg1>50 ], cost: 2
     54: f4 -> f13 : arg2'=101, [ arg1<=50 ], cost: 305
     43: f12 -> f20 : arg2'=0, [ arg1<=100 ], cost: 2
     44: f12 -> f24 : arg2'=0, [ arg1>100 ], cost: 2
     55: f12 -> f20 : arg2'=102, [ arg1<=100 ], cost: 308
     56: f12 -> [31] : [ arg1>100 ], cost: NONTERM
     34: __init -> f2 : arg1'=864, arg2'=arg2P_34, [], cost: 2

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     30: f2 -> f4 : [ arg1>10 ], cost: 1
     41: f13 -> f12 : [ arg2>=101 ], cost: 2
     38: f4 -> f13 : arg2'=0, [ arg1<=50 ], cost: 2
     39: f4 -> f12 : [ arg1>50 ], cost: 2
     54: f4 -> f13 : arg2'=101, [ arg1<=50 ], cost: 305
     56: f12 -> [31] : [ arg1>100 ], cost: NONTERM
     34: __init -> f2 : arg1'=864, arg2'=arg2P_34, [], cost: 2

Eliminated locations (on linear paths):
   Start location: __init
     41: f13 -> f12 : [ arg2>=101 ], cost: 2
     38: f4 -> f13 : arg2'=0, [ arg1<=50 ], cost: 2
     39: f4 -> f12 : [ arg1>50 ], cost: 2
     54: f4 -> f13 : arg2'=101, [ arg1<=50 ], cost: 305
     56: f12 -> [31] : [ arg1>100 ], cost: NONTERM
     57: __init -> f4 : arg1'=864, arg2'=arg2P_34, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     41: f13 -> f12 : [ arg2>=101 ], cost: 2
     56: f12 -> [31] : [ arg1>100 ], cost: NONTERM
     58: __init -> f12 : arg1'=864, arg2'=arg2P_34, [], cost: 5

Applied pruning (of leafs and parallel rules):
   Start location: __init
     56: f12 -> [31] : [ arg1>100 ], cost: NONTERM
     58: __init -> f12 : arg1'=864, arg2'=arg2P_34, [], cost: 5

Eliminated locations (on linear paths):
   Start location: __init
     59: __init -> [31] : [], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     59: __init -> [31] : [], cost: NONTERM

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