details

property	value
status	complete
benchmark	AliasDarteFeautrierGonnord-SAS2010-rsd_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n103.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	3.59925794601 seconds
cpu usage	4.850296715
max memory	3.54443264E8

stage attributes

key	value
output-size	134438
starexec-result	WORST_CASE(?, ?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, ?) 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, EXP). (0) CpxIntTrs (1) Koat Proof [FINISHED, 2380 ms] (2) BOUNDS(1, EXP) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_foo_start(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: TRUE eval_foo_bb0_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb1_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_r >= 0 eval_foo_bb0_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_r < 0 eval_foo_bb1_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(2 * v_r, 2 * v_r, v_4, v_da, v_db, v_r, v_temp)) :|: TRUE eval_foo_bb2_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_.0 >= v_r eval_foo_bb2_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_.0 < v_r eval_foo_bb3_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_3(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: TRUE eval_foo_3(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp), eval_foo_4(v_.0, v_.01, nondef.0, v_da, v_db, v_r, v_temp)) :|: TRUE eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.0 - 1, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 < 0 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.0 - 1, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 < 0 && v_4 > 0 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.0 - 1, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 > 0 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.01 - 1, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 < 0 && v_4 >= 0 && v_4 <= 0 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.01 - 1, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 > 0 && v_4 >= 0 && v_4 <= 0 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.0 - 1, v_.01 - 1, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 >= 0 && v_4 <= 0 && v_4 < 0 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.0 - 1, v_.01 - 1, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 >= 0 && v_4 <= 0 && v_4 > 0 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.01 - 1, v_.01 - 1, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 >= 0 && v_4 <= 0 eval_foo_bb4_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_stop(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: TRUE The start-symbols are:[eval_foo_start_7] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2 * pow(2, 2*ar_0 + 1) * (16*ar_0 + 4) + pow(2, 2*ar_0 + 1) * 4 + pow(2, 2*ar_0 + 1) * (4*ar_0 + 1) + 36*ar_0 + 31) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= 0 ] (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, 2*ar_0, 2*ar_0, ar_3, ar_4)) (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_1 >= ar_0 ] (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoo4(ar_0, ar_1, ar_2, ar_4, ar_4)) (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_2(evalfoo30(ar_0, ar_1, ar_2, ar_3, f), evalfoo31(ar_0, ar_1, ar_2, ar_3, f)) (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2, ar_3, ar_4)) [ 0 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2, ar_3, ar_4)) [ 0 >= ar_3 + 1 /\ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2, ar_3, ar_4)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_2 - 1, ar_2, ar_3, ar_4)) [ 0 >= 1 /\ ar_3 = 0 ] (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_2 - 1, ar_2, ar_3, ar_4)) [ 0 >= 1 /\ ar_3 = 0 ] (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2 - 1, ar_3, ar_4)) [ 0 >= 1 /\ ar_3 = 0 ] (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2 - 1, ar_3, ar_4)) [ 0 >= 1 /\ ar_3 = 0 ] (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_2 - 1, ar_2 - 1, ar_3, ar_4)) [ ar_3 = 0 ] (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445