/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, 596 ms]
(2) BOUNDS(INF, INF)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f18(A, B, C, D, E, F, G, H, I, J) -> Com_1(f24(A, B, C, D, E, F, G, H, I, J)) :|: 0 >= A
f31(A, B, C, D, E, F, G, H, I, J) -> Com_1(f31(A, B, C, D, E, F, G, H, I, J)) :|: TRUE
f33(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A, B, C, D, E, F, G, H, I, J)) :|: TRUE
f24(A, B, C, D, E, F, G, H, I, J) -> Com_1(f31(A, K, C, D, E, F, G, H, I, J)) :|: A >= 1
f24(A, B, C, D, E, F, G, H, I, J) -> Com_1(f31(A, L, C, K, E, F, G, H, I, J)) :|: 0 >= A && 999 + C >= K
f24(A, B, C, D, E, F, G, H, I, J) -> Com_1(f31(1, L, C, K, E, F, G, H, I, J)) :|: 0 >= A && K >= C + 1000
f18(A, B, C, D, E, F, G, H, I, J) -> Com_1(f24(0, B, K, D, K, F, G, H, I, J)) :|: A >= 1
f0(A, B, C, D, E, F, G, H, I, J) -> Com_1(f18(1, B, C, D, E, K, K, H, I, J)) :|: 0 >= K
f0(A, B, C, D, E, F, G, H, I, J) -> Com_1(f18(1, B, C, D, E, K, 0, 1, L, L)) :|: K >= 1 && L >= 1
f0(A, B, C, D, E, F, G, H, I, J) -> Com_1(f31(1, B, C, D, E, K, 0, 1, L, L)) :|: K >= 1 && 0 >= L

The start-symbols are:[f0_10]


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

(1) Loat Proof (FINISHED)


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



Initial linear ITS problem

   Start location: f0

      0: f18 -> f24 : [ 0>=A ], cost: 1

      6: f18 -> f24 : A'=0, C'=free_5, E'=free_5, [ A>=1 ], cost: 1

      1: f31 -> f31 : [], cost: 1

      2: f33 -> f36 : [], cost: 1

      3: f24 -> f31 : B'=free, [ A>=1 ], cost: 1

      4: f24 -> f31 : B'=free_1, D'=free_2, [ 0>=A && 999+C>=free_2 ], cost: 1

      5: f24 -> f31 : A'=1, B'=free_3, D'=free_4, [ 0>=A && free_4>=1000+C ], cost: 1

      7: f0 -> f18 : A'=1, F'=free_6, G'=free_6, [ 0>=free_6 ], cost: 1

      8: f0 -> f18 : A'=1, F'=free_7, G'=0, H'=1, Q'=free_8, J'=free_8, [ free_7>=1 && free_8>=1 ], cost: 1

      9: f0 -> f31 : A'=1, F'=free_9, G'=0, H'=1, Q'=free_10, J'=free_10, [ free_9>=1 && 0>=free_10 ], cost: 1



Checking for constant complexity:

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

      7: f0 -> f18 : A'=1, F'=free_6, G'=free_6, [ 0>=free_6 ], cost: 1



Removed unreachable and leaf rules:

   Start location: f0

      0: f18 -> f24 : [ 0>=A ], cost: 1

      6: f18 -> f24 : A'=0, C'=free_5, E'=free_5, [ A>=1 ], cost: 1

      1: f31 -> f31 : [], cost: 1

      3: f24 -> f31 : B'=free, [ A>=1 ], cost: 1

      4: f24 -> f31 : B'=free_1, D'=free_2, [ 0>=A && 999+C>=free_2 ], cost: 1

      5: f24 -> f31 : A'=1, B'=free_3, D'=free_4, [ 0>=A && free_4>=1000+C ], cost: 1

      7: f0 -> f18 : A'=1, F'=free_6, G'=free_6, [ 0>=free_6 ], cost: 1

      8: f0 -> f18 : A'=1, F'=free_7, G'=0, H'=1, Q'=free_8, J'=free_8, [ free_7>=1 && free_8>=1 ], cost: 1

      9: f0 -> f31 : A'=1, F'=free_9, G'=0, H'=1, Q'=free_10, J'=free_10, [ free_9>=1 && 0>=free_10 ], cost: 1



### Simplification by acceleration and chaining ###



Accelerating simple loops of location 1.

   Accelerating the following rules:

      1: f31 -> f31 : [], cost: 1



   Accelerated rule 1 with NONTERM, yielding the new rule 10.

   Removing the simple loops: 1.



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

   Start location: f0

      0: f18 -> f24 : [ 0>=A ], cost: 1

      6: f18 -> f24 : A'=0, C'=free_5, E'=free_5, [ A>=1 ], cost: 1

     10: f31 -> [6] : [], cost: NONTERM

      3: f24 -> f31 : B'=free, [ A>=1 ], cost: 1

      4: f24 -> f31 : B'=free_1, D'=free_2, [ 0>=A && 999+C>=free_2 ], cost: 1

      5: f24 -> f31 : A'=1, B'=free_3, D'=free_4, [ 0>=A && free_4>=1000+C ], cost: 1

      7: f0 -> f18 : A'=1, F'=free_6, G'=free_6, [ 0>=free_6 ], cost: 1

      8: f0 -> f18 : A'=1, F'=free_7, G'=0, H'=1, Q'=free_8, J'=free_8, [ free_7>=1 && free_8>=1 ], cost: 1

      9: f0 -> f31 : A'=1, F'=free_9, G'=0, H'=1, Q'=free_10, J'=free_10, [ free_9>=1 && 0>=free_10 ], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: f0

      0: f18 -> f24 : [ 0>=A ], cost: 1

      6: f18 -> f24 : A'=0, C'=free_5, E'=free_5, [ A>=1 ], cost: 1

      3: f24 -> f31 : B'=free, [ A>=1 ], cost: 1

      4: f24 -> f31 : B'=free_1, D'=free_2, [ 0>=A && 999+C>=free_2 ], cost: 1

      5: f24 -> f31 : A'=1, B'=free_3, D'=free_4, [ 0>=A && free_4>=1000+C ], cost: 1

     11: f24 -> [6] : B'=free, [ A>=1 ], cost: NONTERM

     12: f24 -> [6] : B'=free_1, D'=free_2, [ 0>=A && 999+C>=free_2 ], cost: NONTERM

     13: f24 -> [6] : A'=1, B'=free_3, D'=free_4, [ 0>=A && free_4>=1000+C ], cost: NONTERM

      7: f0 -> f18 : A'=1, F'=free_6, G'=free_6, [ 0>=free_6 ], cost: 1

      8: f0 -> f18 : A'=1, F'=free_7, G'=0, H'=1, Q'=free_8, J'=free_8, [ free_7>=1 && free_8>=1 ], cost: 1

      9: f0 -> f31 : A'=1, F'=free_9, G'=0, H'=1, Q'=free_10, J'=free_10, [ free_9>=1 && 0>=free_10 ], cost: 1

     14: f0 -> [6] : A'=1, F'=free_9, G'=0, H'=1, Q'=free_10, J'=free_10, [ free_9>=1 && 0>=free_10 ], cost: NONTERM



Removed unreachable locations (and leaf rules with constant cost):

   Start location: f0

      0: f18 -> f24 : [ 0>=A ], cost: 1

      6: f18 -> f24 : A'=0, C'=free_5, E'=free_5, [ A>=1 ], cost: 1

     11: f24 -> [6] : B'=free, [ A>=1 ], cost: NONTERM

     12: f24 -> [6] : B'=free_1, D'=free_2, [ 0>=A && 999+C>=free_2 ], cost: NONTERM

     13: f24 -> [6] : A'=1, B'=free_3, D'=free_4, [ 0>=A && free_4>=1000+C ], cost: NONTERM

      7: f0 -> f18 : A'=1, F'=free_6, G'=free_6, [ 0>=free_6 ], cost: 1

      8: f0 -> f18 : A'=1, F'=free_7, G'=0, H'=1, Q'=free_8, J'=free_8, [ free_7>=1 && free_8>=1 ], cost: 1

     14: f0 -> [6] : A'=1, F'=free_9, G'=0, H'=1, Q'=free_10, J'=free_10, [ free_9>=1 && 0>=free_10 ], cost: NONTERM



Eliminated locations (on tree-shaped paths):

   Start location: f0

     11: f24 -> [6] : B'=free, [ A>=1 ], cost: NONTERM

     12: f24 -> [6] : B'=free_1, D'=free_2, [ 0>=A && 999+C>=free_2 ], cost: NONTERM

     13: f24 -> [6] : A'=1, B'=free_3, D'=free_4, [ 0>=A && free_4>=1000+C ], cost: NONTERM

     14: f0 -> [6] : A'=1, F'=free_9, G'=0, H'=1, Q'=free_10, J'=free_10, [ free_9>=1 && 0>=free_10 ], cost: NONTERM

     15: f0 -> f24 : A'=0, C'=free_5, E'=free_5, F'=free_6, G'=free_6, [ 0>=free_6 ], cost: 2

     16: f0 -> f24 : A'=0, C'=free_5, E'=free_5, F'=free_7, G'=0, H'=1, Q'=free_8, J'=free_8, [ free_7>=1 && free_8>=1 ], cost: 2



Eliminated locations (on tree-shaped paths):

   Start location: f0

     14: f0 -> [6] : A'=1, F'=free_9, G'=0, H'=1, Q'=free_10, J'=free_10, [ free_9>=1 && 0>=free_10 ], cost: NONTERM

     17: f0 -> [6] : A'=0, B'=free_1, C'=free_5, D'=free_2, E'=free_5, F'=free_6, G'=free_6, [ 0>=free_6 && 999+free_5>=free_2 ], cost: NONTERM

     18: f0 -> [6] : A'=1, B'=free_3, C'=free_5, D'=free_4, E'=free_5, F'=free_6, G'=free_6, [ 0>=free_6 && free_4>=1000+free_5 ], cost: NONTERM

     19: f0 -> [6] : A'=0, B'=free_1, C'=free_5, D'=free_2, E'=free_5, F'=free_7, G'=0, H'=1, Q'=free_8, J'=free_8, [ free_7>=1 && free_8>=1 && 999+free_5>=free_2 ], cost: NONTERM

     20: f0 -> [6] : A'=1, B'=free_3, C'=free_5, D'=free_4, E'=free_5, F'=free_7, G'=0, H'=1, Q'=free_8, J'=free_8, [ free_7>=1 && free_8>=1 && free_4>=1000+free_5 ], cost: NONTERM



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: f0

     14: f0 -> [6] : A'=1, F'=free_9, G'=0, H'=1, Q'=free_10, J'=free_10, [ free_9>=1 && 0>=free_10 ], cost: NONTERM

     17: f0 -> [6] : A'=0, B'=free_1, C'=free_5, D'=free_2, E'=free_5, F'=free_6, G'=free_6, [ 0>=free_6 && 999+free_5>=free_2 ], cost: NONTERM

     18: f0 -> [6] : A'=1, B'=free_3, C'=free_5, D'=free_4, E'=free_5, F'=free_6, G'=free_6, [ 0>=free_6 && free_4>=1000+free_5 ], cost: NONTERM

     19: f0 -> [6] : A'=0, B'=free_1, C'=free_5, D'=free_2, E'=free_5, F'=free_7, G'=0, H'=1, Q'=free_8, J'=free_8, [ free_7>=1 && free_8>=1 && 999+free_5>=free_2 ], cost: NONTERM

     20: f0 -> [6] : A'=1, B'=free_3, C'=free_5, D'=free_4, E'=free_5, F'=free_7, G'=0, H'=1, Q'=free_8, J'=free_8, [ free_7>=1 && free_8>=1 && free_4>=1000+free_5 ], cost: NONTERM



Computing asymptotic complexity for rule 14

   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:  [ free_9>=1 && 0>=free_10 ]



NO


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

(2)
BOUNDS(INF, INF)