details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.96801996231 seconds
cpu usage	4.362645341
max memory	2.56495616E8

stage attributes

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