details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.45571708679 seconds
cpu usage	5.397212868
max memory	3.11840768E8

stage attributes

key	value
output-size	40930
starexec-result	WORST_CASE(Omega(n^2), O(n^2))

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^2), O(n^2)) 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^2, n^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 96 ms] (2) BOUNDS(1, n^2) (3) Loat Proof [FINISHED, 827 ms] (4) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_abc_start(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_bb0_in(v_4, v_i_0, v_j_0, v_n)) :|: TRUE eval_abc_bb0_in(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_0(v_4, v_i_0, v_j_0, v_n)) :|: TRUE eval_abc_0(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_1(v_4, v_i_0, v_j_0, v_n)) :|: TRUE eval_abc_1(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_2(v_4, v_i_0, v_j_0, v_n)) :|: TRUE eval_abc_2(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_3(v_4, v_i_0, v_j_0, v_n)) :|: TRUE eval_abc_3(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_4(v_4, v_i_0, v_j_0, v_n)) :|: TRUE eval_abc_4(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_bb1_in(v_4, 0, v_j_0, v_n)) :|: TRUE eval_abc_bb1_in(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_bb2_in(v_4, v_i_0, 0, v_n)) :|: v_i_0 <= v_n - 1 eval_abc_bb1_in(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_bb5_in(v_4, v_i_0, v_j_0, v_n)) :|: v_i_0 > v_n - 1 eval_abc_bb2_in(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_bb3_in(v_4, v_i_0, v_j_0, v_n)) :|: v_j_0 <= v_i_0 eval_abc_bb2_in(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_bb4_in(v_4, v_i_0, v_j_0, v_n)) :|: v_j_0 > v_i_0 eval_abc_bb3_in(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_bb2_in(v_4, v_i_0, v_j_0 + 1, v_n)) :|: TRUE eval_abc_bb4_in(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_10(v_i_0 + 1, v_i_0, v_j_0, v_n)) :|: TRUE eval_abc_10(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_11(v_4, v_i_0, v_j_0, v_n)) :|: TRUE eval_abc_11(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_bb1_in(v_4, v_4, v_j_0, v_n)) :|: TRUE eval_abc_bb5_in(v_4, v_i_0, v_j_0, v_n) -> Com_1(eval_abc_stop(v_4, v_i_0, v_j_0, v_n)) :|: TRUE The start-symbols are:[eval_abc_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 155*ar_1 + 8*ar_1^2 + 158) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalabcstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabcbb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalabcbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabc0(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalabc0(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabc1(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalabc1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabc2(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalabc2(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabc3(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalabc3(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabc4(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalabc4(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabcbb1in(0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalabcbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabcbb2in(ar_0, ar_1, 0, ar_3)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalabcbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabcbb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalabcbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabcbb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_2 ] (Comp: ?, Cost: 1) evalabcbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabcbb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalabcbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabcbb2in(ar_0, ar_1, ar_2 + 1, ar_3)) (Comp: ?, Cost: 1) evalabcbb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabc10(ar_0, ar_1, ar_2, ar_0 + 1)) (Comp: ?, Cost: 1) evalabc10(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabc11(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalabc11(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabcbb1in(ar_3, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalabcbb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabcstop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalabcstart(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: popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843