details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	4.90968513489 seconds
cpu usage	8.063807524
max memory	3.13831424E8

stage attributes

key	value
output-size	21941
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, max(10 + 5 * Arg_1 + -5 * Arg_2, 5) + nat(1 + 2 * Arg_1 + -2 * Arg_2)). (0) CpxIntTrs (1) Koat2 Proof [FINISHED, 1004 ms] (2) BOUNDS(1, max(10 + 5 * Arg_1 + -5 * Arg_2, 5) + nat(1 + 2 * Arg_1 + -2 * Arg_2)) (3) Loat Proof [FINISHED, 3211 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalaaron2start(A, B, C) -> Com_1(evalaaron2entryin(A, B, C)) :|: TRUE evalaaron2entryin(A, B, C) -> Com_1(evalaaron2bb6in(A, C, B)) :|: A >= 0 evalaaron2entryin(A, B, C) -> Com_1(evalaaron2returnin(A, B, C)) :|: 0 >= A + 1 evalaaron2bb6in(A, B, C) -> Com_1(evalaaron2returnin(A, B, C)) :|: B >= C + 1 evalaaron2bb6in(A, B, C) -> Com_1(evalaaron2returnin(A, B, C)) :|: 0 >= A + 1 evalaaron2bb6in(A, B, C) -> Com_1(evalaaron2bb3in(A, B, C)) :|: C >= B && A >= 0 evalaaron2bb3in(A, B, C) -> Com_1(evalaaron2bb4in(A, B, C)) :|: 0 >= D + 1 evalaaron2bb3in(A, B, C) -> Com_1(evalaaron2bb4in(A, B, C)) :|: D >= 1 evalaaron2bb3in(A, B, C) -> Com_1(evalaaron2bb5in(A, B, C)) :|: TRUE evalaaron2bb4in(A, B, C) -> Com_1(evalaaron2bb6in(A, B, C - A - 1)) :|: TRUE evalaaron2bb5in(A, B, C) -> Com_1(evalaaron2bb6in(A, B + A + 1, C)) :|: TRUE evalaaron2returnin(A, B, C) -> Com_1(evalaaron2stop(A, B, C)) :|: TRUE The start-symbols are:[evalaaron2start_3] ---------------------------------------- (1) Koat2 Proof (FINISHED) YES( ?, 5+2*2*max([0, 1+Arg_1-Arg_2])+max([0, 1+Arg_1-Arg_2])+max([0, 1+-2*Arg_2+2*Arg_1]) {O(n)}) Initial Complexity Problem: Start: evalaaron2start Program_Vars: Arg_0, Arg_1, Arg_2 Temp_Vars: D Locations: evalaaron2bb3in, evalaaron2bb4in, evalaaron2bb5in, evalaaron2bb6in, evalaaron2entryin, evalaaron2returnin, evalaaron2start, evalaaron2stop Transitions: evalaaron2bb3in(Arg_0,Arg_1,Arg_2) -> evalaaron2bb4in(Arg_0,Arg_1,Arg_2):|:Arg_1 <= Arg_2 && 0 <= Arg_0 && D+1 <= 0 evalaaron2bb3in(Arg_0,Arg_1,Arg_2) -> evalaaron2bb4in(Arg_0,Arg_1,Arg_2):|:Arg_1 <= Arg_2 && 0 <= Arg_0 && 1 <= D evalaaron2bb3in(Arg_0,Arg_1,Arg_2) -> evalaaron2bb5in(Arg_0,Arg_1,Arg_2):|:Arg_1 <= Arg_2 && 0 <= Arg_0 evalaaron2bb4in(Arg_0,Arg_1,Arg_2) -> evalaaron2bb6in(Arg_0,Arg_1,Arg_2-Arg_0-1):|:Arg_1 <= Arg_2 && 0 <= Arg_0 evalaaron2bb5in(Arg_0,Arg_1,Arg_2) -> evalaaron2bb6in(Arg_0,Arg_1+Arg_0+1,Arg_2):|:Arg_1 <= Arg_2 && 0 <= Arg_0 evalaaron2bb6in(Arg_0,Arg_1,Arg_2) -> evalaaron2bb3in(Arg_0,Arg_1,Arg_2):|:0 <= Arg_0 && Arg_1 <= Arg_2 && 0 <= Arg_0 evalaaron2bb6in(Arg_0,Arg_1,Arg_2) -> evalaaron2returnin(Arg_0,Arg_1,Arg_2):|:0 <= Arg_0 && Arg_2+1 <= Arg_1 evalaaron2entryin(Arg_0,Arg_1,Arg_2) -> evalaaron2bb6in(Arg_0,Arg_2,Arg_1):|:0 <= Arg_0 evalaaron2entryin(Arg_0,Arg_1,Arg_2) -> evalaaron2returnin(Arg_0,Arg_1,Arg_2):|:Arg_0+1 <= 0 evalaaron2returnin(Arg_0,Arg_1,Arg_2) -> evalaaron2stop(Arg_0,Arg_1,Arg_2):|: evalaaron2start(Arg_0,Arg_1,Arg_2) -> evalaaron2entryin(Arg_0,Arg_1,Arg_2):|: Timebounds: Overall timebound: 5+2*2*max([0, 1+Arg_1-Arg_2])+max([0, 1+Arg_1-Arg_2])+max([0, 1+-2*Arg_2+2*Arg_1]) {O(n)} 6: evalaaron2bb3in->evalaaron2bb4in: max([0, 1+Arg_1-Arg_2]) {O(n)} 7: evalaaron2bb3in->evalaaron2bb4in: max([0, 1+Arg_1-Arg_2]) {O(n)} 8: evalaaron2bb3in->evalaaron2bb5in: max([0, 1+Arg_1-Arg_2]) {O(n)} 9: evalaaron2bb4in->evalaaron2bb6in: max([0, 1+-2*Arg_2+2*Arg_1]) {O(n)} 10: evalaaron2bb5in->evalaaron2bb6in: max([0, 1+Arg_1-Arg_2]) {O(n)} 3: evalaaron2bb6in->evalaaron2returnin: 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