details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.37326097488 seconds
cpu usage	5.04143001
max memory	2.56483328E8

stage attributes

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

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843