details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.47754192352 seconds
cpu usage	5.062335996
max memory	3.602432E8

stage attributes

key	value
output-size	33276
starexec-result	WORST_CASE(?, 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(?, 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(1, 2 + max(5, 1 + 2 * Arg_1) * nat(Arg_0) + max(2 * Arg_1, 4) + max(12, 8 + 2 * Arg_1)). (0) CpxIntTrs (1) Koat Proof [FINISHED, 243 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 420 ms] (4) BOUNDS(1, INF) (5) Koat2 Proof [FINISHED, 832 ms] (6) BOUNDS(1, 2 + max(5, 1 + 2 * Arg_1) * nat(Arg_0) + max(2 * Arg_1, 4) + max(12, 8 + 2 * Arg_1)) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedpldi4_start(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_bb0_in(v_i_0, v_m, v_n)) :|: TRUE eval_speedpldi4_bb0_in(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_0(v_i_0, v_m, v_n)) :|: TRUE eval_speedpldi4_0(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_1(v_i_0, v_m, v_n)) :|: TRUE eval_speedpldi4_1(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_2(v_i_0, v_m, v_n)) :|: TRUE eval_speedpldi4_2(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_bb3_in(v_i_0, v_m, v_n)) :|: v_m <= 0 eval_speedpldi4_2(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_bb3_in(v_i_0, v_m, v_n)) :|: v_n <= v_m eval_speedpldi4_2(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_bb1_in(v_n, v_m, v_n)) :|: v_m > 0 && v_n > v_m eval_speedpldi4_bb1_in(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_bb2_in(v_i_0, v_m, v_n)) :|: v_i_0 > 0 eval_speedpldi4_bb1_in(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_bb3_in(v_i_0, v_m, v_n)) :|: v_i_0 <= 0 eval_speedpldi4_bb2_in(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_bb1_in(v_i_0 - 1, v_m, v_n)) :|: v_i_0 < v_m eval_speedpldi4_bb2_in(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_bb1_in(v_i_0 - v_m, v_m, v_n)) :|: v_i_0 >= v_m eval_speedpldi4_bb3_in(v_i_0, v_m, v_n) -> Com_1(eval_speedpldi4_stop(v_i_0, v_m, v_n)) :|: TRUE The start-symbols are:[eval_speedpldi4_start_3] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 6*ar_1 + 11) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedpldi4start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb0in(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalspeedpldi4bb0in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi40(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalspeedpldi40(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi41(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalspeedpldi41(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi42(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalspeedpldi42(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedpldi42(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedpldi42(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb1in(ar_0, ar_1, ar_1)) [ ar_0 >= 1 /\ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi4bb1in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb2in(ar_0, ar_1, ar_2)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi4bb1in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalspeedpldi4bb2in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb1in(ar_0, ar_1, ar_2 - 1)) [ ar_0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi4bb2in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb1in(ar_0, ar_1, ar_2 - ar_0)) [ ar_2 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedpldi4bb3in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4stop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4start(ar_0, ar_1, ar_2)) [ 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) evalspeedpldi4start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb0in(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalspeedpldi4bb0in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi40(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalspeedpldi40(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi41(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalspeedpldi41(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi42(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalspeedpldi42(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 ] popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843