details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.79965209961 seconds
cpu usage	8.361831923
max memory	4.03296256E8

stage attributes

key	value
output-size	55714
starexec-result	WORST_CASE(Omega(n^1), O(n^1))

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/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, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 322 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 2123 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalrandom2dstart(A, B, C, D) -> Com_1(evalrandom2dentryin(A, B, C, D)) :|: TRUE evalrandom2dentryin(A, B, C, D) -> Com_1(evalrandom2dbb10in(0, B, C, D)) :|: TRUE evalrandom2dbb10in(A, B, C, D) -> Com_1(evalrandom2dbbin(A, B, C, D)) :|: B >= A + 1 evalrandom2dbb10in(A, B, C, D) -> Com_1(evalrandom2dreturnin(A, B, C, D)) :|: A >= B evalrandom2dbbin(A, B, C, D) -> Com_1(evalrandom2dbb2in(A, B, A + 1, E)) :|: E >= 0 && 3 >= E evalrandom2dbbin(A, B, C, D) -> Com_1(evalrandom2dbb10in(A + 1, B, C, D)) :|: 0 >= E + 1 evalrandom2dbbin(A, B, C, D) -> Com_1(evalrandom2dbb10in(A + 1, B, C, D)) :|: E >= 4 evalrandom2dbb2in(A, B, C, D) -> Com_1(evalrandom2dNodeBlock9in(A, B, C, D)) :|: TRUE evalrandom2dNodeBlock9in(A, B, C, D) -> Com_1(evalrandom2dNodeBlockin(A, B, C, D)) :|: 1 >= D evalrandom2dNodeBlock9in(A, B, C, D) -> Com_1(evalrandom2dNodeBlock7in(A, B, C, D)) :|: D >= 2 evalrandom2dNodeBlockin(A, B, C, D) -> Com_1(evalrandom2dLeafBlockin(A, B, C, D)) :|: 0 >= D evalrandom2dNodeBlockin(A, B, C, D) -> Com_1(evalrandom2dLeafBlock1in(A, B, C, D)) :|: D >= 1 evalrandom2dLeafBlockin(A, B, C, D) -> Com_1(evalrandom2dbb3in(A, B, C, D)) :|: D >= 0 && D <= 0 evalrandom2dLeafBlockin(A, B, C, D) -> Com_1(evalrandom2dNewDefaultin(A, B, C, D)) :|: 0 >= D + 1 evalrandom2dLeafBlockin(A, B, C, D) -> Com_1(evalrandom2dNewDefaultin(A, B, C, D)) :|: D >= 1 evalrandom2dbb3in(A, B, C, D) -> Com_1(evalrandom2dbb10in(C, B, C, D)) :|: TRUE evalrandom2dLeafBlock1in(A, B, C, D) -> Com_1(evalrandom2dbb5in(A, B, C, D)) :|: D >= 1 && D <= 1 evalrandom2dLeafBlock1in(A, B, C, D) -> Com_1(evalrandom2dNewDefaultin(A, B, C, D)) :|: 0 >= D evalrandom2dLeafBlock1in(A, B, C, D) -> Com_1(evalrandom2dNewDefaultin(A, B, C, D)) :|: D >= 2 evalrandom2dbb5in(A, B, C, D) -> Com_1(evalrandom2dbb10in(C, B, C, D)) :|: TRUE evalrandom2dNodeBlock7in(A, B, C, D) -> Com_1(evalrandom2dLeafBlock3in(A, B, C, D)) :|: 2 >= D evalrandom2dNodeBlock7in(A, B, C, D) -> Com_1(evalrandom2dLeafBlock5in(A, B, C, D)) :|: D >= 3 evalrandom2dLeafBlock3in(A, B, C, D) -> Com_1(evalrandom2dbb7in(A, B, C, D)) :|: D >= 2 && D <= 2 evalrandom2dLeafBlock3in(A, B, C, D) -> Com_1(evalrandom2dNewDefaultin(A, B, C, D)) :|: 1 >= D evalrandom2dLeafBlock3in(A, B, C, D) -> Com_1(evalrandom2dNewDefaultin(A, B, C, D)) :|: D >= 3 evalrandom2dbb7in(A, B, C, D) -> Com_1(evalrandom2dbb10in(C, B, C, D)) :|: TRUE evalrandom2dLeafBlock5in(A, B, C, D) -> Com_1(evalrandom2dbb9in(A, B, C, D)) :|: D >= 3 && D <= 3 evalrandom2dLeafBlock5in(A, B, C, D) -> Com_1(evalrandom2dNewDefaultin(A, B, C, D)) :|: 2 >= D evalrandom2dLeafBlock5in(A, B, C, D) -> Com_1(evalrandom2dNewDefaultin(A, B, C, D)) :|: D >= 4 evalrandom2dbb9in(A, B, C, D) -> Com_1(evalrandom2dbb10in(C, B, C, D)) :|: TRUE evalrandom2dNewDefaultin(A, B, C, D) -> Com_1(evalrandom2dbb10in(C, B, C, D)) :|: TRUE evalrandom2dreturnin(A, B, C, D) -> Com_1(evalrandom2dstop(A, B, C, D)) :|: TRUE The start-symbols are:[evalrandom2dstart_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 27*ar_1 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalrandom2dstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dentryin(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrandom2dentryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dbb10in(0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrandom2dbb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dbbin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalrandom2dbb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dreturnin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalrandom2dbbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dbb2in(ar_0, ar_1, ar_0 + 1, e)) [ e >= 0 /\ 3 >= e ] (Comp: ?, Cost: 1) evalrandom2dbbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dbb10in(ar_0 + 1, ar_1, ar_2, ar_3)) [ 0 >= e + 1 ] (Comp: ?, Cost: 1) evalrandom2dbbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dbb10in(ar_0 + 1, ar_1, ar_2, ar_3)) [ e >= 4 ] (Comp: ?, Cost: 1) evalrandom2dbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dNodeBlock9in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrandom2dNodeBlock9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dNodeBlockin(ar_0, ar_1, ar_2, ar_3)) [ 1 >= ar_3 ] (Comp: ?, Cost: 1) evalrandom2dNodeBlock9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dNodeBlock7in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= 2 ] (Comp: ?, Cost: 1) evalrandom2dNodeBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dLeafBlockin(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalrandom2dNodeBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dLeafBlock1in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalrandom2dLeafBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dbb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 = 0 ] (Comp: ?, Cost: 1) evalrandom2dLeafBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom2dNewDefaultin(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_3 + 1 ] popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843