details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.54065799713 seconds
cpu usage	6.216325621
max memory	4.31099904E8

stage attributes

key	value
output-size	83587
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, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 835 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 933 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_rsd_start(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_bb0_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_bb0_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_0(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_0(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_1(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_1(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_2(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_2(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_bb1_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: v_r >= 0 eval_rsd_2(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_bb4_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: v_r < 0 eval_rsd_bb1_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_4(2 * v_r, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_4(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_5(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_5(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_6(v_1, 2 * v_r, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_6(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_7(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_7(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_8(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_8(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_9(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_9(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_10(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_10(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_11(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_11(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_12(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_12(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_bb2_in(v_1, v_2, v_4, v_1, v_2, v_r)) :|: TRUE eval_rsd_bb2_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_bb3_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: v_da_0 >= v_r eval_rsd_bb2_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_bb4_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: v_da_0 < v_r eval_rsd_bb3_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_13(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_13(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_14(v_1, v_2, nondef_0, v_da_0, v_db_0, v_r)) :|: TRUE eval_rsd_14(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_bb2_in(v_1, v_2, v_4, v_da_0 - 1, v_db_0, v_r)) :|: v_4 > 0 eval_rsd_14(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_bb2_in(v_1, v_2, v_4, v_db_0 - 1, v_db_0, v_r)) :|: v_4 > 0 && v_4 <= 0 eval_rsd_14(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_bb2_in(v_1, v_2, v_4, v_da_0 - 1, v_da_0, v_r)) :|: v_4 <= 0 && v_4 > 0 eval_rsd_14(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_bb2_in(v_1, v_2, v_4, v_db_0 - 1, v_da_0, v_r)) :|: v_4 <= 0 eval_rsd_bb4_in(v_1, v_2, v_4, v_da_0, v_db_0, v_r) -> Com_1(eval_rsd_stop(v_1, v_2, v_4, v_da_0, v_db_0, v_r)) :|: TRUE The start-symbols are:[eval_rsd_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 100*ar_0 + 40) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalrsdstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsdbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsdbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsdbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 0 ] (Comp: ?, Cost: 1) evalrsd2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsdbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalrsdbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd4(ar_0, 2*ar_0, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd6(ar_0, ar_1, 2*ar_0, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd6(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd7(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd7(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd8(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd8(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd9(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd9(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd10(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd10(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsd12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalrsd12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsdbb2in(ar_0, ar_1, ar_2, ar_1, ar_2, ar_5)) (Comp: ?, Cost: 1) evalrsdbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsdbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_3 >= ar_0 ] (Comp: ?, Cost: 1) evalrsdbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalrsdbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= ar_3 + 1 ] popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843