details

property	value
status	complete
benchmark	gcd.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	SAS10

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	289.792704105 seconds
cpu usage	296.064658644
max memory	3.467264E8

stage attributes

key	value
output-size	73574
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, 1 + Arg_2) + nat(Arg_0) + nat(-1 + Arg_0) + max(8, 8 + Arg_0) + max(3, 3 * Arg_2) + max(3, -3 + 3 * Arg_2) + nat(2 * Arg_2)). (0) CpxIntTrs (1) Koat2 Proof [FINISHED, 2745 ms] (2) BOUNDS(1, max(2, 1 + Arg_2) + nat(Arg_0) + nat(-1 + Arg_0) + max(8, 8 + Arg_0) + max(3, 3 * Arg_2) + max(3, -3 + 3 * Arg_2) + nat(2 * Arg_2)) (3) Loat Proof [FINISHED, 288.2 s] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: start(A, B, C, D) -> Com_1(stop(A, B, C, D)) :|: 0 >= A && B >= C && B <= C && D >= A && D <= A start(A, B, C, D) -> Com_1(lbl6(A, B, C, D)) :|: A >= 1 && 0 >= C && B >= C && B <= C && D >= A && D <= A start(A, B, C, D) -> Com_1(cut(A, B, C, D)) :|: A >= 1 && D >= A && D <= A && B >= A && B <= A && C >= A && C <= A start(A, B, C, D) -> Com_1(lbl101(A, B - D, C, D)) :|: A >= 1 && C >= A + 1 && B >= C && B <= C && D >= A && D <= A start(A, B, C, D) -> Com_1(lbl111(A, B, C, D - B)) :|: A >= C + 1 && C >= 1 && B >= C && B <= C && D >= A && D <= A lbl6(A, B, C, D) -> Com_1(stop(A, B, C, D)) :|: A >= 1 && 0 >= C && D >= A && D <= A && B >= C && B <= C lbl101(A, B, C, D) -> Com_1(cut(A, B, C, D)) :|: A >= B && B >= 1 && C >= 2 * B && D >= B && D <= B lbl101(A, B, C, D) -> Com_1(lbl101(A, B - D, C, D)) :|: B >= D + 1 && A >= D && B >= 1 && D >= 1 && C >= D + B lbl101(A, B, C, D) -> Com_1(lbl111(A, B, C, D - B)) :|: D >= B + 1 && A >= D && B >= 1 && D >= 1 && C >= D + B lbl111(A, B, C, D) -> Com_1(cut(A, B, C, D)) :|: C >= B && B >= 1 && A >= 2 * B && D >= B && D <= B lbl111(A, B, C, D) -> Com_1(lbl101(A, B - D, C, D)) :|: B >= D + 1 && C >= B && B >= 1 && D >= 1 && A >= D + B lbl111(A, B, C, D) -> Com_1(lbl111(A, B, C, D - B)) :|: D >= B + 1 && C >= B && B >= 1 && D >= 1 && A >= D + B cut(A, B, C, D) -> Com_1(stop(A, B, C, D)) :|: A >= B && B >= 1 && C >= B && D >= B && D <= B start0(A, B, C, D) -> Com_1(start(A, C, C, A)) :|: TRUE The start-symbols are:[start0_4] ---------------------------------------- (1) Koat2 Proof (FINISHED) YES( ?, 8+max([0, Arg_0])+max([3, 3*Arg_2])+max([3, 3*(-1+Arg_2)])+max([0, Arg_2])+max([2, 1+Arg_2])+max([0, Arg_2])+max([0, Arg_0])+max([0, -1+Arg_0]) {O(n)}) Initial Complexity Problem: Start: start0 Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3 Temp_Vars: Locations: cut, lbl101, lbl111, lbl6, start, start0, stop Transitions: cut(Arg_0,Arg_1,Arg_2,Arg_3) -> stop(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3 <= Arg_2 && Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && 1 <= Arg_3 && 2 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && Arg_1 <= Arg_3 && 2 <= Arg_0+Arg_3 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && Arg_1 <= Arg_2 && 2 <= Arg_0+Arg_2 && Arg_1 <= Arg_0 && 1 <= Arg_1 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_1 <= Arg_0 && 1 <= Arg_1 && Arg_1 <= Arg_2 && Arg_3 <= Arg_1 && Arg_1 <= Arg_3 lbl101(Arg_0,Arg_1,Arg_2,Arg_3) -> cut(Arg_0,Arg_1,Arg_2,Arg_3):|:1+Arg_3 <= Arg_2 && Arg_3 <= Arg_0 && 1 <= Arg_3 && 3 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && 2 <= Arg_0+Arg_3 && 2 <= Arg_2 && 3 <= Arg_1+Arg_2 && 1+Arg_1 <= Arg_2 && 3 <= Arg_0+Arg_2 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_1 <= Arg_0 && 1 <= Arg_1 && (2)*Arg_1 <= Arg_2 && Arg_3 <= Arg_1 && Arg_1 <= Arg_3 lbl101(Arg_0,Arg_1,Arg_2,Arg_3) -> lbl101(Arg_0,Arg_1-Arg_3,Arg_2,Arg_3):|:1+Arg_3 <= Arg_2 && Arg_3 <= Arg_0 && 1 <= Arg_3 && 3 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && 2 <= Arg_0+Arg_3 && 2 <= Arg_2 && 3 <= Arg_1+Arg_2 && 1+Arg_1 <= Arg_2 && 3 <= Arg_0+Arg_2 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_3+1 <= Arg_1 && Arg_3 <= Arg_0 && 1 <= Arg_1 && 1 <= Arg_3 && Arg_3+Arg_1 <= Arg_2 lbl101(Arg_0,Arg_1,Arg_2,Arg_3) -> lbl111(Arg_0,Arg_1,Arg_2,Arg_3-Arg_1):|:1+Arg_3 <= Arg_2 && Arg_3 <= Arg_0 && 1 <= Arg_3 && 3 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && 2 <= Arg_0+Arg_3 && 2 <= Arg_2 && 3 <= Arg_1+Arg_2 && 1+Arg_1 <= Arg_2 && 3 <= Arg_0+Arg_2 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_1+1 <= Arg_3 && Arg_3 <= Arg_0 && 1 <= Arg_1 && 1 <= Arg_3 && Arg_3+Arg_1 <= Arg_2 lbl111(Arg_0,Arg_1,Arg_2,Arg_3) -> cut(Arg_0,Arg_1,Arg_2,Arg_3):|:1+Arg_3 <= Arg_0 && 2 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && 3 <= Arg_0+Arg_3 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && Arg_1 <= Arg_2 && 3 <= Arg_0+Arg_2 && 1+Arg_1 <= Arg_0 && 1 <= Arg_1 && 3 <= Arg_0+Arg_1 && 2 <= Arg_0 && Arg_1 <= Arg_2 && 1 <= Arg_1 && (2)*Arg_1 <= Arg_0 && Arg_3 <= Arg_1 && Arg_1 <= Arg_3 lbl111(Arg_0,Arg_1,Arg_2,Arg_3) -> lbl101(Arg_0,Arg_1-Arg_3,Arg_2,Arg_3):|:1+Arg_3 <= Arg_0 && 2 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && 3 <= Arg_0+Arg_3 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && Arg_1 <= Arg_2 && 3 <= Arg_0+Arg_2 && 1+Arg_1 <= Arg_0 && 1 <= Arg_1 && 3 <= Arg_0+Arg_1 && 2 <= Arg_0 && Arg_3+1 <= Arg_1 && Arg_1 <= Arg_2 && 1 <= Arg_1 && 1 <= Arg_3 && Arg_3+Arg_1 <= Arg_0 lbl111(Arg_0,Arg_1,Arg_2,Arg_3) -> lbl111(Arg_0,Arg_1,Arg_2,Arg_3-Arg_1):|:1+Arg_3 <= Arg_0 && 2 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && 3 <= Arg_0+Arg_3 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && Arg_1 <= Arg_2 && 3 <= Arg_0+Arg_2 && 1+Arg_1 <= Arg_0 && 1 <= Arg_1 && 3 <= Arg_0+Arg_1 && 2 <= Arg_0 && Arg_1+1 <= Arg_3 && Arg_1 <= Arg_2 && 1 <= Arg_1 && 1 <= Arg_3 && Arg_3+Arg_1 <= Arg_0 lbl6(Arg_0,Arg_1,Arg_2,Arg_3) -> stop(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3 <= Arg_0 && 1 <= Arg_3 && 1+Arg_2 <= Arg_3 && 1+Arg_1 <= Arg_3 && 2 <= Arg_0+Arg_3 && Arg_0 <= Arg_3 && Arg_2 <= 0 && Arg_2 <= Arg_1 && Arg_1+Arg_2 <= 0 && 1+Arg_2 <= Arg_0 && Arg_1 <= Arg_2 && Arg_1 <= 0 && 1+Arg_1 <= Arg_0 && 1 <= Arg_0 && 1 <= Arg_0 && Arg_2 <= 0 && Arg_3 <= Arg_0 && Arg_0 <= Arg_3 && Arg_1 <= Arg_2 && Arg_2 <= Arg_1 start(Arg_0,Arg_1,Arg_2,Arg_3) -> cut(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3 <= Arg_0 && Arg_0 <= Arg_3 && Arg_2 <= Arg_1 && Arg_1 <= Arg_2 && 1 <= Arg_0 && Arg_3 <= Arg_0 && Arg_0 <= Arg_3 && Arg_1 <= Arg_0 && Arg_0 <= Arg_1 && Arg_2 <= Arg_0 && Arg_0 <= Arg_2 start(Arg_0,Arg_1,Arg_2,Arg_3) -> lbl101(Arg_0,Arg_1-Arg_3,Arg_2,Arg_3):|:Arg_3 <= Arg_0 && Arg_0 <= Arg_3 && Arg_2 <= Arg_1 && Arg_1 <= Arg_2 && 1 <= Arg_0 && Arg_0+1 <= Arg_2 && Arg_1 <= Arg_2 && Arg_2 <= Arg_1 && Arg_3 <= Arg_0 && Arg_0 <= Arg_3 start(Arg_0,Arg_1,Arg_2,Arg_3) -> lbl111(Arg_0,Arg_1,Arg_2,Arg_3-Arg_1):|:Arg_3 <= Arg_0 && Arg_0 <= Arg_3 && Arg_2 <= Arg_1 && Arg_1 <= Arg_2 && Arg_2+1 <= Arg_0 && 1 <= Arg_2 && Arg_1 <= Arg_2 && Arg_2 <= Arg_1 && Arg_3 <= Arg_0 && Arg_0 <= Arg_3 start(Arg_0,Arg_1,Arg_2,Arg_3) -> lbl6(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3 <= Arg_0 && Arg_0 <= Arg_3 && Arg_2 <= Arg_1 && Arg_1 <= Arg_2 && 1 <= Arg_0 && Arg_2 <= 0 && Arg_1 <= Arg_2 && Arg_2 <= Arg_1 && Arg_3 <= Arg_0 && Arg_0 <= Arg_3 start(Arg_0,Arg_1,Arg_2,Arg_3) -> stop(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3 <= Arg_0 && Arg_0 <= Arg_3 && Arg_2 <= Arg_1 && Arg_1 <= Arg_2 && Arg_0 <= 0 && Arg_1 <= Arg_2 && Arg_2 <= Arg_1 && Arg_3 <= Arg_0 && Arg_0 <= Arg_3 start0(Arg_0,Arg_1,Arg_2,Arg_3) -> start(Arg_0,Arg_2,Arg_2,Arg_0):|: Timebounds: Overall timebound: 8+max([0, Arg_0])+max([3, 3*Arg_2])+max([3, 3*(-1+Arg_2)])+max([0, Arg_2])+max([2, 1+Arg_2])+max([0, Arg_2])+max([0, Arg_0])+max([0, -1+Arg_0]) {O(n)} 12: cut->stop: 1 {O(1)} 6: lbl101->cut: 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