details

property	value
status	complete
benchmark	CPU2006_local_alloc.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n088.star.cs.uiowa.edu
space	Sinn_2016

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.34339213371 seconds
cpu usage	2.393952035
max memory	2.3820288E8

stage attributes

key	value
output-size	44388
starexec-result	WORST_CASE(?, O(n^2))

output

/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^2)) proof of /export/starexec/sandbox2/output/output_files/bench.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 178 ms] (2) BOUNDS(1, n^2) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_local_alloc_start(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_bb0_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0)) :|: TRUE eval_local_alloc_bb0_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_bb1_in(0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_max_qty)) :|: TRUE eval_local_alloc_bb1_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_bb2_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0)) :|: v_b.0 < v_n_basic_blocks eval_local_alloc_bb1_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_bb6_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0)) :|: v_b.0 >= v_n_basic_blocks eval_local_alloc_bb2_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_bb3_in(v_b.0, 0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0)) :|: v_next_qty.0 < v_limit eval_local_alloc_bb2_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_bb5_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0)) :|: v_next_qty.0 >= v_limit eval_local_alloc_bb3_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_bb4_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0)) :|: v_i.0 < v_next_qty.0 eval_local_alloc_bb3_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_bb5_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0)) :|: v_i.0 >= v_next_qty.0 eval_local_alloc_bb4_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_bb3_in(v_b.0, v_i.0 + 1, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0)) :|: TRUE eval_local_alloc_bb5_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_bb1_in(v_b.0 + 1, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, 0)) :|: TRUE eval_local_alloc_bb6_in(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0) -> Com_1(eval_local_alloc_stop(v_b.0, v_i.0, v_limit, v_max_qty, v_n_basic_blocks, v_next_qty.0)) :|: TRUE The start-symbols are:[eval_local_alloc_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 9*ar_3 + 2*ar_2*ar_3 + 2*ar_2 + 15) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evallocalallocstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evallocalallocbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb1in(0, ar_2, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evallocalallocbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_3 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evallocalallocbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= ar_3 ] (Comp: ?, Cost: 1) evallocalallocbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, 0)) [ ar_4 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evallocalallocbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= ar_4 ] (Comp: ?, Cost: 1) evallocalallocbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= ar_5 + 1 ] (Comp: ?, Cost: 1) evallocalallocbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_5 >= ar_1 ] (Comp: ?, Cost: 1) evallocalallocbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5 + 1)) (Comp: ?, Cost: 1) evallocalallocbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb1in(ar_0 + 1, 0, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evallocalallocbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocstop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 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) evallocalallocstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: 1, Cost: 1) evallocalallocbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb1in(0, ar_2, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evallocalallocbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_3 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evallocalallocbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= ar_3 ] (Comp: ?, Cost: 1) evallocalallocbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, 0)) [ ar_4 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evallocalallocbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= ar_4 ] (Comp: ?, Cost: 1) evallocalallocbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= ar_5 + 1 ] (Comp: ?, Cost: 1) evallocalallocbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_5 >= ar_1 ] (Comp: ?, Cost: 1) evallocalallocbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evallocalallocbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5 + 1)) popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445