details

property	value
status	complete
benchmark	cyclic.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n050.star.cs.uiowa.edu
space	PLDI09

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.93689107895 seconds
cpu usage	6.481945689
max memory	3.53366016E8

stage attributes

key	value
output-size	9698
starexec-result	WORST_CASE(Omega(n^1), ?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 1322 ms] (2) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalcyclicstart(A, B, C) -> Com_1(evalcyclicentryin(A, B, C)) :|: TRUE evalcyclicentryin(A, B, C) -> Com_1(evalcyclicbb3in(A, B, A + 1)) :|: A >= 0 && B >= A + 1 evalcyclicbb3in(A, B, C) -> Com_1(evalcyclicreturnin(A, B, C)) :|: C >= A && C <= A evalcyclicbb3in(A, B, C) -> Com_1(evalcyclicbb4in(A, B, C)) :|: A >= C + 1 evalcyclicbb3in(A, B, C) -> Com_1(evalcyclicbb4in(A, B, C)) :|: C >= A + 1 evalcyclicbb4in(A, B, C) -> Com_1(evalcyclicbbin(A, B, C)) :|: 0 >= D + 1 evalcyclicbb4in(A, B, C) -> Com_1(evalcyclicbbin(A, B, C)) :|: D >= 1 evalcyclicbb4in(A, B, C) -> Com_1(evalcyclicreturnin(A, B, C)) :|: TRUE evalcyclicbbin(A, B, C) -> Com_1(evalcyclicbb3in(A, B, C + 1)) :|: B >= C evalcyclicbbin(A, B, C) -> Com_1(evalcyclicbb3in(A, B, 0)) :|: C >= B + 1 evalcyclicreturnin(A, B, C) -> Com_1(evalcyclicstop(A, B, C)) :|: TRUE The start-symbols are:[evalcyclicstart_3] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalcyclicstart 0: evalcyclicstart -> evalcyclicentryin : [], cost: 1 1: evalcyclicentryin -> evalcyclicbb3in : C'=1+A, [ A>=0 && B>=1+A ], cost: 1 2: evalcyclicbb3in -> evalcyclicreturnin : [ C==A ], cost: 1 3: evalcyclicbb3in -> evalcyclicbb4in : [ A>=1+C ], cost: 1 4: evalcyclicbb3in -> evalcyclicbb4in : [ C>=1+A ], cost: 1 5: evalcyclicbb4in -> evalcyclicbbin : [ 0>=1+free ], cost: 1 6: evalcyclicbb4in -> evalcyclicbbin : [ free_1>=1 ], cost: 1 7: evalcyclicbb4in -> evalcyclicreturnin : [], cost: 1 8: evalcyclicbbin -> evalcyclicbb3in : C'=1+C, [ B>=C ], cost: 1 9: evalcyclicbbin -> evalcyclicbb3in : C'=0, [ C>=1+B ], cost: 1 10: evalcyclicreturnin -> evalcyclicstop : [], cost: 1 Removed unreachable and leaf rules: Start location: evalcyclicstart 0: evalcyclicstart -> evalcyclicentryin : [], cost: 1 1: evalcyclicentryin -> evalcyclicbb3in : C'=1+A, [ A>=0 && B>=1+A ], cost: 1 3: evalcyclicbb3in -> evalcyclicbb4in : [ A>=1+C ], cost: 1 4: evalcyclicbb3in -> evalcyclicbb4in : [ C>=1+A ], cost: 1 5: evalcyclicbb4in -> evalcyclicbbin : [ 0>=1+free ], cost: 1 6: evalcyclicbb4in -> evalcyclicbbin : [ free_1>=1 ], cost: 1 8: evalcyclicbbin -> evalcyclicbb3in : C'=1+C, [ B>=C ], cost: 1 9: evalcyclicbbin -> evalcyclicbb3in : C'=0, [ C>=1+B ], cost: 1 Simplified all rules, resulting in: Start location: evalcyclicstart popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl Integ Trans Syste 26843