Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745559
details
property
value
status
complete
benchmark
exclusive_phases.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n092.star.cs.uiowa.edu
space
Other
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.59148001671 seconds
cpu usage
2.572304477
max memory
2.82927104E8
stage attributes
key
value
output-size
36749
starexec-result
WORST_CASE(?, O(n^2))
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^2)) 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^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 484 ms] (2) BOUNDS(1, n^2) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_ex_paper1_start(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb0_in(v_.0, v_fwd, v_i, v_n)) :|: TRUE eval_ex_paper1_bb0_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb1_in(v_i, v_fwd, v_i, v_n)) :|: TRUE eval_ex_paper1_bb1_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb2_in(v_.0, v_fwd, v_i, v_n)) :|: 0 < v_.0 && v_.0 < v_n eval_ex_paper1_bb1_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb3_in(v_.0, v_fwd, v_i, v_n)) :|: 0 >= v_.0 eval_ex_paper1_bb1_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb3_in(v_.0, v_fwd, v_i, v_n)) :|: v_.0 >= v_n eval_ex_paper1_bb2_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb1_in(v_.0 + 1, v_fwd, v_i, v_n)) :|: v_fwd > 0 eval_ex_paper1_bb2_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_bb1_in(v_.0 - 1, v_fwd, v_i, v_n)) :|: v_fwd <= 0 eval_ex_paper1_bb3_in(v_.0, v_fwd, v_i, v_n) -> Com_1(eval_ex_paper1_stop(v_.0, v_fwd, v_i, v_n)) :|: TRUE The start-symbols are:[eval_ex_paper1_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 4*ar_1^2 + 4*ar_1*ar_2 + 4*ar_1 + 13) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalexpaper1start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalexpaper1bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 /\ ar_2 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_2 ] (Comp: ?, Cost: 1) evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_0 - 1, ar_1, ar_2, ar_3)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1start(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) evalexpaper1start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalexpaper1bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 /\ ar_2 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalexpaper1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_2 ] (Comp: ?, Cost: 1) evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalexpaper1bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1bb1in(ar_0 - 1, ar_1, ar_2, ar_3)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalexpaper1bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalexpaper1start(ar_0, ar_1, ar_2, ar_3)) [ 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