details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.32235 seconds
cpu usage	4.98682
user time	4.66131
system time	0.32551
max virtual memory	1.8699172E7
max residence set size	220816.0

stage attributes

key	value
starexec-result	WORST_CASE(?, O(n^1))

output

4.93/2.29 WORST_CASE(?, O(n^1)) 4.93/2.30 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 4.93/2.30 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.93/2.30 4.93/2.30 4.93/2.30 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, max(5, 1 + 2 * Arg_1) * max(4, 4 * Arg_0) + max(5, 1 + 2 * Arg_1) * max(5, 5 * Arg_0) + max(5, 1 + 2 * Arg_1) * max(3, 3 * Arg_0) + nat(Arg_1) + max(11, 7 + 2 * Arg_1)). 4.93/2.30 4.93/2.30 (0) CpxIntTrs 4.93/2.30 (1) Koat Proof [FINISHED, 202 ms] 4.93/2.30 (2) BOUNDS(1, n^1) 4.93/2.30 (3) Loat Proof [FINISHED, 428 ms] 4.93/2.30 (4) BOUNDS(1, INF) 4.93/2.30 (5) Koat2 Proof [FINISHED, 647 ms] 4.93/2.30 (6) BOUNDS(1, max(5, 1 + 2 * Arg_1) * max(4, 4 * Arg_0) + max(5, 1 + 2 * Arg_1) * max(5, 5 * Arg_0) + max(5, 1 + 2 * Arg_1) * max(3, 3 * Arg_0) + nat(Arg_1) + max(11, 7 + 2 * Arg_1)) 4.93/2.30 4.93/2.30 4.93/2.30 ---------------------------------------- 4.93/2.30 4.93/2.30 (0) 4.93/2.30 Obligation: 4.93/2.30 Complexity Int TRS consisting of the following rules: 4.93/2.30 evalspeedpldi4start(A, B) -> Com_1(evalspeedpldi4entryin(A, B)) :|: TRUE 4.93/2.30 evalspeedpldi4entryin(A, B) -> Com_1(evalspeedpldi4returnin(A, B)) :|: 0 >= A 4.93/2.30 evalspeedpldi4entryin(A, B) -> Com_1(evalspeedpldi4returnin(A, B)) :|: A >= B 4.93/2.30 evalspeedpldi4entryin(A, B) -> Com_1(evalspeedpldi4bb5in(A, B)) :|: A >= 1 && B >= A + 1 4.93/2.30 evalspeedpldi4bb5in(A, B) -> Com_1(evalspeedpldi4bb2in(A, B)) :|: B >= 1 4.93/2.30 evalspeedpldi4bb5in(A, B) -> Com_1(evalspeedpldi4returnin(A, B)) :|: 0 >= B 4.93/2.30 evalspeedpldi4bb2in(A, B) -> Com_1(evalspeedpldi4bb3in(A, B)) :|: A >= B + 1 4.93/2.30 evalspeedpldi4bb2in(A, B) -> Com_1(evalspeedpldi4bb4in(A, B)) :|: B >= A 4.93/2.30 evalspeedpldi4bb3in(A, B) -> Com_1(evalspeedpldi4bb5in(A, B - 1)) :|: TRUE 4.93/2.30 evalspeedpldi4bb4in(A, B) -> Com_1(evalspeedpldi4bb5in(A, B - A)) :|: TRUE 4.93/2.30 evalspeedpldi4returnin(A, B) -> Com_1(evalspeedpldi4stop(A, B)) :|: TRUE 4.93/2.30 4.93/2.30 The start-symbols are:[evalspeedpldi4start_2] 4.93/2.30 4.93/2.30 4.93/2.30 ---------------------------------------- 4.93/2.30 4.93/2.30 (1) Koat Proof (FINISHED) 4.93/2.30 YES(?, 15*ar_0 + 15*ar_1 + 8) 4.93/2.30 4.93/2.30 4.93/2.30 4.93/2.30 Initial complexity problem: 4.93/2.30 4.93/2.30 1: T: 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4start(ar_0, ar_1) -> Com_1(evalspeedpldi4entryin(ar_0, ar_1)) 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4entryin(ar_0, ar_1) -> Com_1(evalspeedpldi4returnin(ar_0, ar_1)) [ 0 >= ar_0 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4entryin(ar_0, ar_1) -> Com_1(evalspeedpldi4returnin(ar_0, ar_1)) [ ar_0 >= ar_1 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4entryin(ar_0, ar_1) -> Com_1(evalspeedpldi4bb5in(ar_0, ar_1)) [ ar_0 >= 1 /\ ar_1 >= ar_0 + 1 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb5in(ar_0, ar_1) -> Com_1(evalspeedpldi4bb2in(ar_0, ar_1)) [ ar_1 >= 1 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb5in(ar_0, ar_1) -> Com_1(evalspeedpldi4returnin(ar_0, ar_1)) [ 0 >= ar_1 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb2in(ar_0, ar_1) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1)) [ ar_0 >= ar_1 + 1 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb2in(ar_0, ar_1) -> Com_1(evalspeedpldi4bb4in(ar_0, ar_1)) [ ar_1 >= ar_0 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb3in(ar_0, ar_1) -> Com_1(evalspeedpldi4bb5in(ar_0, ar_1 - 1)) 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb4in(ar_0, ar_1) -> Com_1(evalspeedpldi4bb5in(ar_0, ar_1 - ar_0)) 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4returnin(ar_0, ar_1) -> Com_1(evalspeedpldi4stop(ar_0, ar_1)) 4.93/2.30 4.93/2.30 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1) -> Com_1(evalspeedpldi4start(ar_0, ar_1)) [ 0 <= 0 ] 4.93/2.30 4.93/2.30 start location: koat_start 4.93/2.30 4.93/2.30 leaf cost: 0 4.93/2.30 4.93/2.30 4.93/2.30 4.93/2.30 Repeatedly propagating knowledge in problem 1 produces the following problem: 4.93/2.30 4.93/2.30 2: T: 4.93/2.30 4.93/2.30 (Comp: 1, Cost: 1) evalspeedpldi4start(ar_0, ar_1) -> Com_1(evalspeedpldi4entryin(ar_0, ar_1)) 4.93/2.30 4.93/2.30 (Comp: 1, Cost: 1) evalspeedpldi4entryin(ar_0, ar_1) -> Com_1(evalspeedpldi4returnin(ar_0, ar_1)) [ 0 >= ar_0 ] 4.93/2.30 4.93/2.30 (Comp: 1, Cost: 1) evalspeedpldi4entryin(ar_0, ar_1) -> Com_1(evalspeedpldi4returnin(ar_0, ar_1)) [ ar_0 >= ar_1 ] 4.93/2.30 4.93/2.30 (Comp: 1, Cost: 1) evalspeedpldi4entryin(ar_0, ar_1) -> Com_1(evalspeedpldi4bb5in(ar_0, ar_1)) [ ar_0 >= 1 /\ ar_1 >= ar_0 + 1 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb5in(ar_0, ar_1) -> Com_1(evalspeedpldi4bb2in(ar_0, ar_1)) [ ar_1 >= 1 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb5in(ar_0, ar_1) -> Com_1(evalspeedpldi4returnin(ar_0, ar_1)) [ 0 >= ar_1 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb2in(ar_0, ar_1) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1)) [ ar_0 >= ar_1 + 1 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb2in(ar_0, ar_1) -> Com_1(evalspeedpldi4bb4in(ar_0, ar_1)) [ ar_1 >= ar_0 ] 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb3in(ar_0, ar_1) -> Com_1(evalspeedpldi4bb5in(ar_0, ar_1 - 1)) 4.93/2.30 4.93/2.30 (Comp: ?, Cost: 1) evalspeedpldi4bb4in(ar_0, ar_1) -> Com_1(evalspeedpldi4bb5in(ar_0, ar_1 - ar_0)) popout

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

job log

popout

actions

all output return to Complexity_ITS 2019-03-21 04.46