/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(NON_POLY, ?)
proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF).

(0) CpxIntTrs
(1) Loat Proof [FINISHED, 234 ms]
(2) BOUNDS(INF, INF)


----------------------------------------

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f2(A, B, C) -> Com_1(f2(A, -(1) + B, C)) :|: 29 >= A
f2(A, B, C) -> Com_1(f300(A, -(1) + B, C)) :|: A >= 30
f300(A, B, C) -> Com_1(f2(A, B, C)) :|: 19 >= B
f300(A, B, C) -> Com_1(f1(A, B, D)) :|: B >= 20
f3(A, B, C) -> Com_1(f300(A, B, C)) :|: TRUE

The start-symbols are:[f3_3]


----------------------------------------

(1) Loat Proof (FINISHED)


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



Initial linear ITS problem

   Start location: f3

      0: f2 -> f2 : B'=-1+B, [ 29>=A ], cost: 1

      1: f2 -> f300 : B'=-1+B, [ A>=30 ], cost: 1

      2: f300 -> f2 : [ 19>=B ], cost: 1

      3: f300 -> f1 : C'=free, [ B>=20 ], cost: 1

      4: f3 -> f300 : [], cost: 1



Checking for constant complexity:

   The following rule is satisfiable with cost >= 1, yielding constant complexity:

      4: f3 -> f300 : [], cost: 1



Removed unreachable and leaf rules:

   Start location: f3

      0: f2 -> f2 : B'=-1+B, [ 29>=A ], cost: 1

      1: f2 -> f300 : B'=-1+B, [ A>=30 ], cost: 1

      2: f300 -> f2 : [ 19>=B ], cost: 1

      4: f3 -> f300 : [], cost: 1



### Simplification by acceleration and chaining ###



Accelerating simple loops of location 0.

   Accelerating the following rules:

      0: f2 -> f2 : B'=-1+B, [ 29>=A ], cost: 1



   Accelerated rule 0 with NONTERM, yielding the new rule 5.

   Removing the simple loops: 0.



Accelerated all simple loops using metering functions (where possible):

   Start location: f3

      1: f2 -> f300 : B'=-1+B, [ A>=30 ], cost: 1

      5: f2 -> [4] : [ 29>=A ], cost: NONTERM

      2: f300 -> f2 : [ 19>=B ], cost: 1

      4: f3 -> f300 : [], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: f3

      1: f2 -> f300 : B'=-1+B, [ A>=30 ], cost: 1

      2: f300 -> f2 : [ 19>=B ], cost: 1

      6: f300 -> [4] : [ 19>=B && 29>=A ], cost: NONTERM

      4: f3 -> f300 : [], cost: 1



Eliminated locations (on linear paths):

   Start location: f3

      6: f300 -> [4] : [ 19>=B && 29>=A ], cost: NONTERM

      7: f300 -> f300 : B'=-1+B, [ 19>=B && A>=30 ], cost: 2

      4: f3 -> f300 : [], cost: 1



Accelerating simple loops of location 1.

   Accelerating the following rules:

      7: f300 -> f300 : B'=-1+B, [ 19>=B && A>=30 ], cost: 2



   Accelerated rule 7 with NONTERM, yielding the new rule 8.

   Removing the simple loops: 7.



Accelerated all simple loops using metering functions (where possible):

   Start location: f3

      6: f300 -> [4] : [ 19>=B && 29>=A ], cost: NONTERM

      8: f300 -> [5] : [ 19>=B && A>=30 ], cost: NONTERM

      4: f3 -> f300 : [], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: f3

      6: f300 -> [4] : [ 19>=B && 29>=A ], cost: NONTERM

      4: f3 -> f300 : [], cost: 1

      9: f3 -> [5] : [ 19>=B && A>=30 ], cost: NONTERM



Eliminated locations (on linear paths):

   Start location: f3

      9: f3 -> [5] : [ 19>=B && A>=30 ], cost: NONTERM

     10: f3 -> [4] : [ 19>=B && 29>=A ], cost: NONTERM



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: f3

      9: f3 -> [5] : [ 19>=B && A>=30 ], cost: NONTERM

     10: f3 -> [4] : [ 19>=B && 29>=A ], cost: NONTERM



Computing asymptotic complexity for rule 9

   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:  [ 19>=B && A>=30 ]



NO


----------------------------------------

(2)
BOUNDS(INF, INF)