Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745754
details
property
value
status
complete
benchmark
cBench_render_ht.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
Sinn_2016
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.63949084282 seconds
cpu usage
2.734448842
max memory
3.20008192E8
stage attributes
key
value
output-size
25755
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, 485 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_render_ht_start(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb0_in(v_.0, v_0, v_level, v_old_level)) :|: TRUE eval_render_ht_bb0_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb1_in(v_old_level, v_0, v_level, v_old_level)) :|: TRUE eval_render_ht_bb1_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_LeafBlock_in(v_.0, v_level - v_.0, v_level, v_old_level)) :|: TRUE eval_render_ht_LeafBlock_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb2_in(v_.0, v_0, v_level, v_old_level)) :|: v_0 + 7 <= 14 eval_render_ht_LeafBlock_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_NewDefault_in(v_.0, v_0, v_level, v_old_level)) :|: v_0 + 7 > 14 eval_render_ht_bb2_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_stop(v_.0, v_0, v_level, v_old_level)) :|: TRUE eval_render_ht_NewDefault_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb3_in(v_.0, v_0, v_level, v_old_level)) :|: TRUE eval_render_ht_bb3_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb1_in(v_.0 + 4, v_0, v_level, v_old_level)) :|: v_level > v_.0 eval_render_ht_bb3_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb1_in(v_.0 - 4, v_0, v_level, v_old_level)) :|: v_level <= v_.0 The start-symbols are:[eval_render_ht_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 6*ar_1 + 6*ar_3 + 11) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalrenderhtstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrenderhtbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrenderhtbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtLeafBlockin(ar_0, ar_1, ar_3 - ar_0, ar_3)) (Comp: ?, Cost: 1) evalrenderhtLeafBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb2in(ar_0, ar_1, ar_2, ar_3)) [ 7 >= ar_2 ] (Comp: ?, Cost: 1) evalrenderhtLeafBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtNewDefaultin(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 8 ] (Comp: ?, Cost: 1) evalrenderhtbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtstop(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrenderhtNewDefaultin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_0 + 4, ar_1, ar_2, ar_3)) [ ar_3 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_0 - 4, ar_1, ar_2, ar_3)) [ ar_0 >= ar_3 ] (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtstart(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: (Comp: 1, Cost: 1) evalrenderhtstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalrenderhtbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrenderhtbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtLeafBlockin(ar_0, ar_1, ar_3 - ar_0, ar_3)) (Comp: ?, Cost: 1) evalrenderhtLeafBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb2in(ar_0, ar_1, ar_2, ar_3)) [ 7 >= ar_2 ] (Comp: ?, Cost: 1) evalrenderhtLeafBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtNewDefaultin(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 8 ] (Comp: ?, Cost: 1) evalrenderhtbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtstop(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrenderhtNewDefaultin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_0 + 4, ar_1, ar_2, ar_3)) [ ar_3 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_0 - 4, ar_1, ar_2, ar_3)) [ ar_0 >= ar_3 ] (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtstart(ar_0, ar_1, ar_2, ar_3)) [ 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