Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745624
details
property
value
status
complete
benchmark
terminate.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.22845196724 seconds
cpu usage
2.23267245
max memory
2.17055232E8
stage attributes
key
value
output-size
10347
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, 84 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_terminate_start(v_.0, v_.01, v_.02, v_i, v_j, v_k) -> Com_1(eval_terminate_bb0_in(v_.0, v_.01, v_.02, v_i, v_j, v_k)) :|: TRUE eval_terminate_bb0_in(v_.0, v_.01, v_.02, v_i, v_j, v_k) -> Com_1(eval_terminate_bb1_in(v_i, v_j, v_k, v_i, v_j, v_k)) :|: TRUE eval_terminate_bb1_in(v_.0, v_.01, v_.02, v_i, v_j, v_k) -> Com_1(eval_terminate_bb2_in(v_.0, v_.01, v_.02, v_i, v_j, v_k)) :|: v_.0 <= 100 && v_.01 <= v_.02 eval_terminate_bb1_in(v_.0, v_.01, v_.02, v_i, v_j, v_k) -> Com_1(eval_terminate_bb3_in(v_.0, v_.01, v_.02, v_i, v_j, v_k)) :|: v_.0 > 100 eval_terminate_bb1_in(v_.0, v_.01, v_.02, v_i, v_j, v_k) -> Com_1(eval_terminate_bb3_in(v_.0, v_.01, v_.02, v_i, v_j, v_k)) :|: v_.01 > v_.02 eval_terminate_bb2_in(v_.0, v_.01, v_.02, v_i, v_j, v_k) -> Com_1(eval_terminate_bb1_in(v_.01, v_.0 + 1, v_.02 - 1, v_i, v_j, v_k)) :|: TRUE eval_terminate_bb3_in(v_.0, v_.01, v_.02, v_i, v_j, v_k) -> Com_1(eval_terminate_stop(v_.0, v_.01, v_.02, v_i, v_j, v_k)) :|: TRUE The start-symbols are:[eval_terminate_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2*ar_1 + 2*ar_3 + 2*ar_5 + 210) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalterminatestart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalterminatebb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5)) (Comp: ?, Cost: 1) evalterminatebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 100 >= ar_0 /\ ar_4 >= ar_2 ] (Comp: ?, Cost: 1) evalterminatebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 101 ] (Comp: ?, Cost: 1) evalterminatebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_4 + 1 ] (Comp: ?, Cost: 1) evalterminatebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb1in(ar_2, ar_1, ar_0 + 1, ar_3, ar_4 - 1, ar_5)) (Comp: ?, Cost: 1) evalterminatebb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatestop(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(evalterminatestart(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) evalterminatestart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: 1, Cost: 1) evalterminatebb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5)) (Comp: ?, Cost: 1) evalterminatebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 100 >= ar_0 /\ ar_4 >= ar_2 ] (Comp: ?, Cost: 1) evalterminatebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 101 ] (Comp: ?, Cost: 1) evalterminatebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_4 + 1 ] (Comp: ?, Cost: 1) evalterminatebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatebb1in(ar_2, ar_1, ar_0 + 1, ar_3, ar_4 - 1, ar_5)) (Comp: ?, Cost: 1) evalterminatebb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalterminatestop(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(evalterminatestart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evalterminatestart) = 2 Pol(evalterminatebb0in) = 2 Pol(evalterminatebb1in) = 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445