Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429988860
details
property
value
status
complete
benchmark
speed_pldi09_fig1.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n005.star.cs.uiowa.edu
space
C4B_examples
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.55813 seconds
cpu usage
2.63167
user time
2.4235
system time
0.208163
max virtual memory
1.8456828E7
max residence set size
184624.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^2))
output
2.53/1.51 WORST_CASE(?, O(n^2)) 2.53/1.52 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.53/1.52 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.53/1.52 2.53/1.52 2.53/1.52 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^2). 2.53/1.52 2.53/1.52 (0) CpxIntTrs 2.53/1.52 (1) Koat Proof [FINISHED, 276 ms] 2.53/1.52 (2) BOUNDS(1, n^2) 2.53/1.52 2.53/1.52 2.53/1.52 ---------------------------------------- 2.53/1.52 2.53/1.52 (0) 2.53/1.52 Obligation: 2.53/1.52 Complexity Int TRS consisting of the following rules: 2.53/1.52 eval_speed_pldi09_fig1_start(v_n, v_x.0, v_y.0) -> Com_1(eval_speed_pldi09_fig1_bb0_in(v_n, v_x.0, v_y.0)) :|: TRUE 2.53/1.52 eval_speed_pldi09_fig1_bb0_in(v_n, v_x.0, v_y.0) -> Com_1(eval_speed_pldi09_fig1_bb1_in(v_n, 0, 0)) :|: TRUE 2.53/1.52 eval_speed_pldi09_fig1_bb1_in(v_n, v_x.0, v_y.0) -> Com_1(eval_speed_pldi09_fig1_bb2_in(v_n, v_x.0, v_y.0)) :|: v_x.0 < v_n 2.53/1.52 eval_speed_pldi09_fig1_bb1_in(v_n, v_x.0, v_y.0) -> Com_1(eval_speed_pldi09_fig1_bb3_in(v_n, v_x.0, v_y.0)) :|: v_x.0 >= v_n 2.53/1.52 eval_speed_pldi09_fig1_bb2_in(v_n, v_x.0, v_y.0) -> Com_1(eval_speed_pldi09_fig1_bb1_in(v_n, v_x.0 + 1, v_y.0 + 1)) :|: TRUE 2.53/1.52 eval_speed_pldi09_fig1_bb3_in(v_n, v_x.0, v_y.0) -> Com_1(eval_speed_pldi09_fig1_bb4_in(v_n, v_x.0, v_y.0)) :|: v_y.0 > 0 2.53/1.52 eval_speed_pldi09_fig1_bb3_in(v_n, v_x.0, v_y.0) -> Com_1(eval_speed_pldi09_fig1_bb5_in(v_n, v_x.0, v_y.0)) :|: v_y.0 <= 0 2.53/1.52 eval_speed_pldi09_fig1_bb4_in(v_n, v_x.0, v_y.0) -> Com_1(eval_speed_pldi09_fig1_bb1_in(v_n, v_x.0, v_y.0 - 1)) :|: TRUE 2.53/1.52 eval_speed_pldi09_fig1_bb5_in(v_n, v_x.0, v_y.0) -> Com_1(eval_speed_pldi09_fig1_stop(v_n, v_x.0, v_y.0)) :|: TRUE 2.53/1.52 2.53/1.52 The start-symbols are:[eval_speed_pldi09_fig1_start_3] 2.53/1.52 2.53/1.52 2.53/1.52 ---------------------------------------- 2.53/1.52 2.53/1.52 (1) Koat Proof (FINISHED) 2.53/1.52 YES(?, 9*ar_2^2 + 8*ar_2 + 12) 2.53/1.52 2.53/1.52 2.53/1.52 2.53/1.52 Initial complexity problem: 2.53/1.52 2.53/1.52 1: T: 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb0in(ar_0, ar_1, ar_2)) 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb0in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb1in(0, 0, ar_2)) 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb1in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb2in(ar_0, ar_1, ar_2)) [ ar_2 >= ar_0 + 1 ] 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb1in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_2 ] 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb2in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb1in(ar_0 + 1, ar_1 + 1, ar_2)) 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb3in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb4in(ar_0, ar_1, ar_2)) [ ar_1 >= 1 ] 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb3in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb5in(ar_0, ar_1, ar_2)) [ 0 >= ar_1 ] 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb4in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb1in(ar_0, ar_1 - 1, ar_2)) 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb5in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1stop(ar_0, ar_1, ar_2)) 2.53/1.52 2.53/1.52 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1start(ar_0, ar_1, ar_2)) [ 0 <= 0 ] 2.53/1.52 2.53/1.52 start location: koat_start 2.53/1.52 2.53/1.52 leaf cost: 0 2.53/1.52 2.53/1.52 2.53/1.52 2.53/1.52 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.53/1.52 2.53/1.52 2: T: 2.53/1.52 2.53/1.52 (Comp: 1, Cost: 1) evalspeedpldi09fig1start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb0in(ar_0, ar_1, ar_2)) 2.53/1.52 2.53/1.52 (Comp: 1, Cost: 1) evalspeedpldi09fig1bb0in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb1in(0, 0, ar_2)) 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb1in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb2in(ar_0, ar_1, ar_2)) [ ar_2 >= ar_0 + 1 ] 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb1in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_2 ] 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb2in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb1in(ar_0 + 1, ar_1 + 1, ar_2)) 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb3in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb4in(ar_0, ar_1, ar_2)) [ ar_1 >= 1 ] 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb3in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb5in(ar_0, ar_1, ar_2)) [ 0 >= ar_1 ] 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb4in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1bb1in(ar_0, ar_1 - 1, ar_2)) 2.53/1.52 2.53/1.52 (Comp: ?, Cost: 1) evalspeedpldi09fig1bb5in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1stop(ar_0, ar_1, ar_2)) 2.53/1.52 2.53/1.52 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi09fig1start(ar_0, ar_1, ar_2)) [ 0 <= 0 ] 2.53/1.52 2.53/1.52 start location: koat_start 2.53/1.52 2.53/1.52 leaf cost: 0 2.53/1.52 2.53/1.52 2.53/1.52 2.53/1.52 A polynomial rank function with 2.53/1.52 2.53/1.52 Pol(evalspeedpldi09fig1start) = 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_C_Integer 2019-03-21 04.38