details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.74527287483 seconds
cpu usage	3.72504449
max memory	2.58166784E8

stage attributes

key	value
output-size	4340
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, max(2, 2 + Arg_0)). (0) CpxIntTrs (1) Koat2 Proof [FINISHED, 38 ms] (2) BOUNDS(1, max(2, 2 + Arg_0)) (3) Loat Proof [FINISHED, 145 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: f2(A, B) -> Com_1(f3(A, 1)) :|: 0 >= A f0(A, B) -> Com_1(f2(A, 0)) :|: TRUE f2(A, B) -> Com_1(f2(A - 1, B)) :|: A >= 1 The start-symbols are:[f0_2] ---------------------------------------- (1) Koat2 Proof (FINISHED) YES( ?, max([2, 2+Arg_0]) {O(n)}) Initial Complexity Problem: Start: f0 Program_Vars: Arg_0, Arg_1 Temp_Vars: Locations: f0, f2, f3 Transitions: f0(Arg_0,Arg_1) -> f2(Arg_0,0):|: f2(Arg_0,Arg_1) -> f2(Arg_0-1,Arg_1):|:Arg_1 <= 0 && 0 <= Arg_1 && 1 <= Arg_0 f2(Arg_0,Arg_1) -> f3(Arg_0,1):|:Arg_1 <= 0 && 0 <= Arg_1 && Arg_0 <= 0 Timebounds: Overall timebound: max([2, 2+Arg_0]) {O(n)} 1: f0->f2: 1 {O(1)} 0: f2->f3: 1 {O(1)} 2: f2->f2: max([0, Arg_0]) {O(n)} Costbounds: Overall costbound: max([2, 2+Arg_0]) {O(n)} 1: f0->f2: 1 {O(1)} 0: f2->f3: 1 {O(1)} 2: f2->f2: max([0, Arg_0]) {O(n)} Sizebounds: `Lower: 1: f0->f2, Arg_0: Arg_0 {O(n)} 1: f0->f2, Arg_1: 0 {O(1)} 0: f2->f3, Arg_0: min([0, Arg_0]) {O(n)} 0: f2->f3, Arg_1: 1 {O(1)} 2: f2->f2, Arg_0: 0 {O(1)} 2: f2->f2, Arg_1: 0 {O(1)} `Upper: popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843