details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	3.79114508629 seconds
cpu usage	4.886524174
max memory	2.84893184E8

stage attributes

key	value
output-size	189101
starexec-result	WORST_CASE(?, O(n^1))

output

/export/starexec/sandbox/solver/bin/starexec_run_c_complexity /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox/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^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 2594 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedSingleSingle2_start(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb0_in(v_2, v_m, v_n, v_x.0, v_y.0)) :|: TRUE eval_speedSingleSingle2_bb0_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb6_in(v_2, v_m, v_n, v_x.0, v_y.0)) :|: v_n < 0 eval_speedSingleSingle2_bb0_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb6_in(v_2, v_m, v_n, v_x.0, v_y.0)) :|: v_m < 0 eval_speedSingleSingle2_bb0_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb1_in(v_2, v_m, v_n, 0, 0)) :|: v_n >= 0 && v_m >= 0 eval_speedSingleSingle2_bb1_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_0(v_2, v_m, v_n, v_x.0, v_y.0)) :|: TRUE eval_speedSingleSingle2_0(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_2(eval_nondet_start(v_2, v_m, v_n, v_x.0, v_y.0), eval_speedSingleSingle2_1(nondef.0, v_m, v_n, v_x.0, v_y.0)) :|: TRUE eval_speedSingleSingle2_1(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb2_in(v_2, v_m, v_n, v_x.0, v_y.0)) :|: v_2 > 0 eval_speedSingleSingle2_1(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb6_in(v_2, v_m, v_n, v_x.0, v_y.0)) :|: v_2 <= 0 eval_speedSingleSingle2_bb2_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb3_in(v_2, v_m, v_n, v_x.0, v_y.0)) :|: v_x.0 < v_n eval_speedSingleSingle2_bb2_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb4_in(v_2, v_m, v_n, v_x.0, v_y.0)) :|: v_x.0 >= v_n eval_speedSingleSingle2_bb3_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb1_in(v_2, v_m, v_n, v_x.0 + 1, v_y.0 + 1)) :|: TRUE eval_speedSingleSingle2_bb4_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb5_in(v_2, v_m, v_n, v_x.0, v_y.0)) :|: v_y.0 < v_m eval_speedSingleSingle2_bb4_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb6_in(v_2, v_m, v_n, v_x.0, v_y.0)) :|: v_y.0 >= v_m eval_speedSingleSingle2_bb5_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_bb1_in(v_2, v_m, v_n, v_x.0 + 1, v_y.0 + 1)) :|: TRUE eval_speedSingleSingle2_bb6_in(v_2, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSingleSingle2_stop(v_2, v_m, v_n, v_x.0, v_y.0)) :|: TRUE The start-symbols are:[eval_speedSingleSingle2_start_5] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 45*ar_0 + 45*ar_1 + 30) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedSingleSingle2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedSingleSingle2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedSingleSingle2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evalspeedSingleSingle2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb1in(ar_0, ar_1, 0, 0, ar_4, ar_5)) [ ar_0 >= 0 /\ ar_1 >= 0 ] (Comp: ?, Cost: 1) evalspeedSingleSingle2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedSingleSingle200(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedSingleSingle201(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle21(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5)) (Comp: ?, Cost: 1) evalspeedSingleSingle20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalspeedSingleSingle200(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalspeedSingleSingle201(ar_0, ar_1, ar_2, ar_3, ar_4, g)) (Comp: ?, Cost: 1) evalspeedSingleSingle21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= 1 ] (Comp: ?, Cost: 1) evalspeedSingleSingle21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_4 ] (Comp: ?, Cost: 1) evalspeedSingleSingle2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalspeedSingleSingle2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedSingleSingle2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb1in(ar_0, ar_1, ar_2 + 1, ar_3 + 1, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedSingleSingle2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalspeedSingleSingle2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_3 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedSingleSingle2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb1in(ar_0, ar_1, ar_2 + 1, ar_3 + 1, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedSingleSingle2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2stop(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(evalspeedSingleSingle2start(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) evalspeedSingleSingle2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedSingleSingle2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445