### Pre-processing the ITS problem ### Initial linear ITS problem Start location: f0 0: f0 -> f : [], cost: free Added constraints to the guards to ensure costs are nonnegative: Start location: f0 0: f0 -> f : [ free>=0 ], cost: free Checking for constant complexity: The following rule is satisfiable with cost >= 1, yielding constant complexity: 0: f0 -> f : [ free>=0 ], cost: free ### Simplification by acceleration and chaining ### ### Computing asymptotic complexity ### Fully simplified ITS problem Start location: f0 0: f0 -> f : [ free>=0 ], cost: free Computing asymptotic complexity for rule 0 Solved the limit problem by the following transformations: Created initial limit problem: 1+free (+/+!), free (+) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {free==n} resulting limit problem: [solved] Solution: free / n Resulting cost n has complexity: Unbounded Found new complexity Unbounded. Obtained the following overall complexity (w.r.t. the length of the input n): Complexity: Unbounded Cpx degree: Unbounded Solved cost: n Rule cost: free Rule guard: [ free>=0 ] WORST_CASE(INF,?)