details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.21999716759 seconds
cpu usage	5.517726826
max memory	2.83860992E8

stage attributes

key	value
output-size	10514
starexec-result	WORST_CASE(Omega(n^1), O(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), O(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, nat(2 * Arg_2) + max(1, 1 + Arg_0 + -1 * Arg_1)). (0) CpxIntTrs (1) Koat2 Proof [FINISHED, 231 ms] (2) BOUNDS(1, nat(2 * Arg_2) + max(1, 1 + Arg_0 + -1 * Arg_1)) (3) Loat Proof [FINISHED, 1528 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval0(A, B, C) -> Com_1(eval1(A, B, C)) :|: A >= 1 eval1(A, B, C) -> Com_1(eval1(A, B + A, C)) :|: A >= B + 1 && C >= A + 1 && A >= 1 eval1(A, B, C) -> Com_1(eval1(A, B, B - A)) :|: A >= B + 1 && C >= A + 1 && A >= 1 The start-symbols are:[eval0_3] ---------------------------------------- (1) Koat2 Proof (FINISHED) YES( ?, max([0, 2*Arg_2])+max([1, 1+Arg_0-Arg_1]) {O(n)}) Initial Complexity Problem: Start: eval0 Program_Vars: Arg_0, Arg_1, Arg_2 Temp_Vars: Locations: eval0, eval1 Transitions: eval0(Arg_0,Arg_1,Arg_2) -> eval1(Arg_0,Arg_1,Arg_2):|:1 <= Arg_0 eval1(Arg_0,Arg_1,Arg_2) -> eval1(Arg_0,Arg_1+Arg_0,Arg_2):|:1 <= Arg_0 && Arg_1+1 <= Arg_0 && Arg_0+1 <= Arg_2 && 1 <= Arg_0 eval1(Arg_0,Arg_1,Arg_2) -> eval1(Arg_0,Arg_1,Arg_1-Arg_0):|:1 <= Arg_0 && Arg_1+1 <= Arg_0 && Arg_0+1 <= Arg_2 && 1 <= Arg_0 Timebounds: Overall timebound: max([0, 2*Arg_2])+max([1, 1+Arg_0-Arg_1]) {O(n)} 0: eval0->eval1: 1 {O(1)} 1: eval1->eval1: max([0, Arg_0-Arg_1]) {O(n)} 2: eval1->eval1: max([0, 2*Arg_2]) {O(n)} Costbounds: Overall costbound: max([0, 2*Arg_2])+max([1, 1+Arg_0-Arg_1]) {O(n)} 0: eval0->eval1: 1 {O(1)} 1: eval1->eval1: max([0, Arg_0-Arg_1]) {O(n)} 2: eval1->eval1: max([0, 2*Arg_2]) {O(n)} Sizebounds: `Lower: 0: eval0->eval1, Arg_0: 1 {O(1)} 0: eval0->eval1, Arg_1: Arg_1 {O(n)} 0: eval0->eval1, Arg_2: Arg_2 {O(n)} 1: eval1->eval1, Arg_0: 1 {O(1)} 1: eval1->eval1, Arg_1: Arg_1 {O(n)} 1: eval1->eval1, Arg_2: 2 {O(1)} 2: eval1->eval1, Arg_0: 1 {O(1)} popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843