NO

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

Initial linear ITS problem
   Start location: __init
      0: f1 -> f1 : [], cost: 1
      1: __init -> f1 : [], cost: 1

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

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 0.
   Accelerating the following rules:
      0: f1 -> f1 : [], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      2: f1 -> [2] : [], cost: NONTERM
      1: __init -> f1 : [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      1: __init -> f1 : [], cost: 1
      3: __init -> [2] : [], cost: NONTERM

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

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
      3: __init -> [2] : [], cost: NONTERM

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