details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.18465209007 seconds
cpu usage	4.497627835
max memory	2.43204096E8

stage attributes

key	value
output-size	6908
starexec-result	WORST_CASE(?, 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(?, 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(1, max(3, 105 + -1 * Arg_0 + Arg_1 + -1 * Arg_2) + max(103 + -1 * Arg_0 + Arg_1 + -1 * Arg_2, 2)). (0) CpxIntTrs (1) Koat2 Proof [FINISHED, 440 ms] (2) BOUNDS(1, max(3, 105 + -1 * Arg_0 + Arg_1 + -1 * Arg_2) + max(103 + -1 * Arg_0 + Arg_1 + -1 * Arg_2, 2)) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalexministart(A, B, C) -> Com_1(evalexminientryin(A, B, C)) :|: TRUE evalexminientryin(A, B, C) -> Com_1(evalexminibb1in(B, A, C)) :|: TRUE evalexminibb1in(A, B, C) -> Com_1(evalexminibbin(A, B, C)) :|: 100 >= B && A >= C evalexminibb1in(A, B, C) -> Com_1(evalexminireturnin(A, B, C)) :|: B >= 101 evalexminibb1in(A, B, C) -> Com_1(evalexminireturnin(A, B, C)) :|: C >= A + 1 evalexminibbin(A, B, C) -> Com_1(evalexminibb1in(A - 1, C, B + 1)) :|: TRUE evalexminireturnin(A, B, C) -> Com_1(evalexministop(A, B, C)) :|: TRUE The start-symbols are:[evalexministart_3] ---------------------------------------- (1) Koat2 Proof (FINISHED) YES( ?, 3+max([0, 102+Arg_1+-(Arg_2)-Arg_0])+max([2, 103+Arg_1+-(Arg_2)-Arg_0]) {O(n)}) Initial Complexity Problem: Start: evalexministart Program_Vars: Arg_0, Arg_1, Arg_2 Temp_Vars: Locations: evalexminibb1in, evalexminibbin, evalexminientryin, evalexminireturnin, evalexministart, evalexministop Transitions: evalexminibb1in(Arg_0,Arg_1,Arg_2) -> evalexminibbin(Arg_0,Arg_1,Arg_2):|:Arg_1 <= 100 && Arg_2 <= Arg_0 evalexminibb1in(Arg_0,Arg_1,Arg_2) -> evalexminireturnin(Arg_0,Arg_1,Arg_2):|:101 <= Arg_1 evalexminibb1in(Arg_0,Arg_1,Arg_2) -> evalexminireturnin(Arg_0,Arg_1,Arg_2):|:Arg_0+1 <= Arg_2 evalexminibbin(Arg_0,Arg_1,Arg_2) -> evalexminibb1in(Arg_0-1,Arg_2,Arg_1+1):|:Arg_2 <= Arg_0 && Arg_1 <= 100 evalexminientryin(Arg_0,Arg_1,Arg_2) -> evalexminibb1in(Arg_1,Arg_0,Arg_2):|: evalexminireturnin(Arg_0,Arg_1,Arg_2) -> evalexministop(Arg_0,Arg_1,Arg_2):|: evalexministart(Arg_0,Arg_1,Arg_2) -> evalexminientryin(Arg_0,Arg_1,Arg_2):|: Timebounds: Overall timebound: 3+max([0, 102+Arg_1+-(Arg_2)-Arg_0])+max([2, 103+Arg_1+-(Arg_2)-Arg_0]) {O(n)} 2: evalexminibb1in->evalexminibbin: max([0, 101+Arg_1+-(Arg_2)-Arg_0]) {O(n)} 3: evalexminibb1in->evalexminireturnin: 1 {O(1)} 4: evalexminibb1in->evalexminireturnin: 1 {O(1)} 5: evalexminibbin->evalexminibb1in: max([0, 102+Arg_1+-(Arg_2)-Arg_0]) {O(n)} 1: evalexminientryin->evalexminibb1in: 1 {O(1)} 6: evalexminireturnin->evalexministop: 1 {O(1)} 0: evalexministart->evalexminientryin: 1 {O(1)} Costbounds: Overall costbound: 3+max([0, 102+Arg_1+-(Arg_2)-Arg_0])+max([2, 103+Arg_1+-(Arg_2)-Arg_0]) {O(n)} 2: evalexminibb1in->evalexminibbin: max([0, 101+Arg_1+-(Arg_2)-Arg_0]) {O(n)} 3: evalexminibb1in->evalexminireturnin: 1 {O(1)} 4: evalexminibb1in->evalexminireturnin: 1 {O(1)} 5: evalexminibbin->evalexminibb1in: max([0, 102+Arg_1+-(Arg_2)-Arg_0]) {O(n)} popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843