Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744473
details
property
value
status
complete
benchmark
speedpldi2.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n084.star.cs.uiowa.edu
space
WTC
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.42971205711 seconds
cpu usage
5.340508996
max memory
3.47541504E8
stage attributes
key
value
output-size
15176
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(6 + 2 * Arg_0, 6) + max(1, 1 + 2 * Arg_0) + nat(Arg_0)). (0) CpxIntTrs (1) Koat2 Proof [FINISHED, 822 ms] (2) BOUNDS(1, max(6 + 2 * Arg_0, 6) + max(1, 1 + 2 * Arg_0) + nat(Arg_0)) (3) Loat Proof [FINISHED, 710 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalspeedpldi2start(A, B, C) -> Com_1(evalspeedpldi2entryin(A, B, C)) :|: TRUE evalspeedpldi2entryin(A, B, C) -> Com_1(evalspeedpldi2bb5in(B, 0, A)) :|: A >= 0 && B >= 1 evalspeedpldi2entryin(A, B, C) -> Com_1(evalspeedpldi2returnin(A, B, C)) :|: 0 >= A + 1 evalspeedpldi2entryin(A, B, C) -> Com_1(evalspeedpldi2returnin(A, B, C)) :|: 0 >= B evalspeedpldi2bb5in(A, B, C) -> Com_1(evalspeedpldi2bb2in(A, B, C)) :|: C >= 1 evalspeedpldi2bb5in(A, B, C) -> Com_1(evalspeedpldi2returnin(A, B, C)) :|: 0 >= C evalspeedpldi2bb2in(A, B, C) -> Com_1(evalspeedpldi2bb3in(A, B, C)) :|: A >= B + 1 evalspeedpldi2bb2in(A, B, C) -> Com_1(evalspeedpldi2bb5in(A, 0, C)) :|: B >= A evalspeedpldi2bb3in(A, B, C) -> Com_1(evalspeedpldi2bb5in(A, B + 1, C - 1)) :|: TRUE evalspeedpldi2returnin(A, B, C) -> Com_1(evalspeedpldi2stop(A, B, C)) :|: TRUE The start-symbols are:[evalspeedpldi2start_3] ---------------------------------------- (1) Koat2 Proof (FINISHED) YES( ?, 6+2*max([0, Arg_0])+max([1, 1+2*Arg_0])+max([0, Arg_0]) {O(n)}) Initial Complexity Problem: Start: evalspeedpldi2start Program_Vars: Arg_0, Arg_1, Arg_2 Temp_Vars: Locations: evalspeedpldi2bb2in, evalspeedpldi2bb3in, evalspeedpldi2bb5in, evalspeedpldi2entryin, evalspeedpldi2returnin, evalspeedpldi2start, evalspeedpldi2stop Transitions: evalspeedpldi2bb2in(Arg_0,Arg_1,Arg_2) -> evalspeedpldi2bb3in(Arg_0,Arg_1,Arg_2):|:1 <= Arg_2 && 1 <= Arg_1+Arg_2 && 2 <= Arg_0+Arg_2 && 0 <= Arg_1 && 1 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_1+1 <= Arg_0 evalspeedpldi2bb2in(Arg_0,Arg_1,Arg_2) -> evalspeedpldi2bb5in(Arg_0,0,Arg_2):|:1 <= Arg_2 && 1 <= Arg_1+Arg_2 && 2 <= Arg_0+Arg_2 && 0 <= Arg_1 && 1 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_0 <= Arg_1 evalspeedpldi2bb3in(Arg_0,Arg_1,Arg_2) -> evalspeedpldi2bb5in(Arg_0,Arg_1+1,Arg_2-1):|:1 <= Arg_2 && 1 <= Arg_1+Arg_2 && 2 <= Arg_0+Arg_2 && 1+Arg_1 <= Arg_0 && 0 <= Arg_1 && 1 <= Arg_0+Arg_1 && 1 <= Arg_0 evalspeedpldi2bb5in(Arg_0,Arg_1,Arg_2) -> evalspeedpldi2bb2in(Arg_0,Arg_1,Arg_2):|:0 <= Arg_2 && 0 <= Arg_1+Arg_2 && 1 <= Arg_0+Arg_2 && 0 <= Arg_1 && 1 <= Arg_0+Arg_1 && 1 <= Arg_0 && 1 <= Arg_2 evalspeedpldi2bb5in(Arg_0,Arg_1,Arg_2) -> evalspeedpldi2returnin(Arg_0,Arg_1,Arg_2):|:0 <= Arg_2 && 0 <= Arg_1+Arg_2 && 1 <= Arg_0+Arg_2 && 0 <= Arg_1 && 1 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_2 <= 0 evalspeedpldi2entryin(Arg_0,Arg_1,Arg_2) -> evalspeedpldi2bb5in(Arg_1,0,Arg_0):|:0 <= Arg_0 && 1 <= Arg_1 evalspeedpldi2entryin(Arg_0,Arg_1,Arg_2) -> evalspeedpldi2returnin(Arg_0,Arg_1,Arg_2):|:Arg_0+1 <= 0 evalspeedpldi2entryin(Arg_0,Arg_1,Arg_2) -> evalspeedpldi2returnin(Arg_0,Arg_1,Arg_2):|:Arg_1 <= 0 evalspeedpldi2returnin(Arg_0,Arg_1,Arg_2) -> evalspeedpldi2stop(Arg_0,Arg_1,Arg_2):|: evalspeedpldi2start(Arg_0,Arg_1,Arg_2) -> evalspeedpldi2entryin(Arg_0,Arg_1,Arg_2):|: Timebounds: Overall timebound: 6+2*max([0, Arg_0])+max([1, 1+2*Arg_0])+max([0, Arg_0]) {O(n)} 6: evalspeedpldi2bb2in->evalspeedpldi2bb3in: max([0, Arg_0]) {O(n)} 7: evalspeedpldi2bb2in->evalspeedpldi2bb5in: max([0, Arg_0]) {O(n)} 8: evalspeedpldi2bb3in->evalspeedpldi2bb5in: max([0, Arg_0]) {O(n)} 4: evalspeedpldi2bb5in->evalspeedpldi2bb2in: max([1, 1+2*Arg_0]) {O(n)} 5: evalspeedpldi2bb5in->evalspeedpldi2returnin: 1 {O(1)} 1: evalspeedpldi2entryin->evalspeedpldi2bb5in: 1 {O(1)} 2: evalspeedpldi2entryin->evalspeedpldi2returnin: 1 {O(1)} 3: evalspeedpldi2entryin->evalspeedpldi2returnin: 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