Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745735
details
property
value
status
complete
benchmark
speedSingleSingle.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n090.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.35531902313 seconds
cpu usage
2.289808485
max memory
2.3539712E8
stage attributes
key
value
output-size
10623
starexec-result
WORST_CASE(?, O(n^1))
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^1)) 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^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 74 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedSingleSingle_start(v_n, v_x.0) -> Com_1(eval_speedSingleSingle_bb0_in(v_n, v_x.0)) :|: TRUE eval_speedSingleSingle_bb0_in(v_n, v_x.0) -> Com_1(eval_speedSingleSingle_bb1_in(v_n, 0)) :|: TRUE eval_speedSingleSingle_bb1_in(v_n, v_x.0) -> Com_1(eval_speedSingleSingle_bb2_in(v_n, v_x.0)) :|: v_x.0 < v_n eval_speedSingleSingle_bb1_in(v_n, v_x.0) -> Com_1(eval_speedSingleSingle_bb3_in(v_n, v_x.0)) :|: v_x.0 >= v_n eval_speedSingleSingle_bb2_in(v_n, v_x.0) -> Com_1(eval_speedSingleSingle_0(v_n, v_x.0)) :|: TRUE eval_speedSingleSingle_0(v_n, v_x.0) -> Com_2(eval_nondet_start(v_n, v_x.0), eval_speedSingleSingle_1(v_n, v_x.0)) :|: TRUE eval_speedSingleSingle_1(v_n, v_x.0) -> Com_1(eval_speedSingleSingle_bb1_in(v_n, v_x.0 + 1)) :|: TRUE eval_speedSingleSingle_bb3_in(v_n, v_x.0) -> Com_1(eval_speedSingleSingle_stop(v_n, v_x.0)) :|: TRUE The start-symbols are:[eval_speedSingleSingle_start_2] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 16*ar_1 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedSingleSinglestart(ar_0, ar_1) -> Com_1(evalspeedSingleSinglebb0in(ar_0, ar_1)) (Comp: ?, Cost: 1) evalspeedSingleSinglebb0in(ar_0, ar_1) -> Com_1(evalspeedSingleSinglebb1in(0, ar_1)) (Comp: ?, Cost: 1) evalspeedSingleSinglebb1in(ar_0, ar_1) -> Com_1(evalspeedSingleSinglebb2in(ar_0, ar_1)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedSingleSinglebb1in(ar_0, ar_1) -> Com_1(evalspeedSingleSinglebb3in(ar_0, ar_1)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedSingleSinglebb2in(ar_0, ar_1) -> Com_1(evalspeedSingleSingle0(ar_0, ar_1)) (Comp: ?, Cost: 1) evalspeedSingleSingle0(ar_0, ar_1) -> Com_2(evalnondetstart(ar_0, ar_1), evalspeedSingleSingle1(ar_0, ar_1)) (Comp: ?, Cost: 1) evalspeedSingleSingle1(ar_0, ar_1) -> Com_1(evalspeedSingleSinglebb1in(ar_0 + 1, ar_1)) (Comp: ?, Cost: 1) evalspeedSingleSinglebb3in(ar_0, ar_1) -> Com_1(evalspeedSingleSinglestop(ar_0, ar_1)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1) -> Com_1(evalspeedSingleSinglestart(ar_0, ar_1)) [ 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) evalspeedSingleSinglestart(ar_0, ar_1) -> Com_1(evalspeedSingleSinglebb0in(ar_0, ar_1)) (Comp: 1, Cost: 1) evalspeedSingleSinglebb0in(ar_0, ar_1) -> Com_1(evalspeedSingleSinglebb1in(0, ar_1)) (Comp: ?, Cost: 1) evalspeedSingleSinglebb1in(ar_0, ar_1) -> Com_1(evalspeedSingleSinglebb2in(ar_0, ar_1)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedSingleSinglebb1in(ar_0, ar_1) -> Com_1(evalspeedSingleSinglebb3in(ar_0, ar_1)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedSingleSinglebb2in(ar_0, ar_1) -> Com_1(evalspeedSingleSingle0(ar_0, ar_1)) (Comp: ?, Cost: 1) evalspeedSingleSingle0(ar_0, ar_1) -> Com_2(evalnondetstart(ar_0, ar_1), evalspeedSingleSingle1(ar_0, ar_1)) (Comp: ?, Cost: 1) evalspeedSingleSingle1(ar_0, ar_1) -> Com_1(evalspeedSingleSinglebb1in(ar_0 + 1, ar_1)) (Comp: ?, Cost: 1) evalspeedSingleSinglebb3in(ar_0, ar_1) -> Com_1(evalspeedSingleSinglestop(ar_0, ar_1)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1) -> Com_1(evalspeedSingleSinglestart(ar_0, ar_1)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445