details

property	value
status	complete
benchmark	speedpldi2.c.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n058.star.cs.uiowa.edu
space	Flores-Montoya_16

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.49113893509 seconds
cpu usage	5.505819407
max memory	3.393536E8

stage attributes

key	value
output-size	36462
starexec-result	WORST_CASE(Omega(n^1), O(n^1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/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, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 329 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 746 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedpldi2_start(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_bb0_in(v_m, v_n, v_v1_0, v_v2_0)) :|: TRUE eval_speedpldi2_bb0_in(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_0(v_m, v_n, v_v1_0, v_v2_0)) :|: TRUE eval_speedpldi2_0(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_1(v_m, v_n, v_v1_0, v_v2_0)) :|: TRUE eval_speedpldi2_1(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_2(v_m, v_n, v_v1_0, v_v2_0)) :|: TRUE eval_speedpldi2_2(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_bb1_in(v_m, v_n, v_n, 0)) :|: v_n >= 0 && v_m > 0 eval_speedpldi2_2(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_bb4_in(v_m, v_n, v_v1_0, v_v2_0)) :|: v_n < 0 eval_speedpldi2_2(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_bb4_in(v_m, v_n, v_v1_0, v_v2_0)) :|: v_m <= 0 eval_speedpldi2_bb1_in(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_bb2_in(v_m, v_n, v_v1_0, v_v2_0)) :|: v_v1_0 > 0 eval_speedpldi2_bb1_in(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_bb4_in(v_m, v_n, v_v1_0, v_v2_0)) :|: v_v1_0 <= 0 eval_speedpldi2_bb2_in(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_bb3_in(v_m, v_n, v_v1_0, v_v2_0)) :|: v_v2_0 < v_m eval_speedpldi2_bb2_in(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_bb1_in(v_m, v_n, v_v1_0, 0)) :|: v_v2_0 >= v_m eval_speedpldi2_bb3_in(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_bb1_in(v_m, v_n, v_v1_0 - 1, v_v2_0 + 1)) :|: TRUE eval_speedpldi2_bb4_in(v_m, v_n, v_v1_0, v_v2_0) -> Com_1(eval_speedpldi2_stop(v_m, v_n, v_v1_0, v_v2_0)) :|: TRUE The start-symbols are:[eval_speedpldi2_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 28*ar_0 + 15) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedpldi2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalspeedpldi2bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi20(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalspeedpldi20(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi21(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalspeedpldi21(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi22(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalspeedpldi22(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb1in(ar_0, ar_1, ar_0, 0)) [ ar_0 >= 0 /\ ar_1 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi22(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi22(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedpldi2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalspeedpldi2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb1in(ar_0, ar_1, ar_2, 0)) [ ar_3 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedpldi2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb1in(ar_0, ar_1, ar_2 - 1, ar_3 + 1)) (Comp: ?, Cost: 1) evalspeedpldi2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) evalspeedpldi2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalspeedpldi2bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi20(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalspeedpldi20(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi21(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalspeedpldi21(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi22(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalspeedpldi22(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi2bb1in(ar_0, ar_1, ar_0, 0)) [ ar_0 >= 0 /\ ar_1 >= 1 ] popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843