Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429988854
details
property
value
status
complete
benchmark
speed_pldi09_fig4_2.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
C4B_examples
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.88264 seconds
cpu usage
2.6405
user time
2.42282
system time
0.217683
max virtual memory
1.8449932E7
max residence set size
184796.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.53/1.84 WORST_CASE(?, O(n^1)) 2.53/1.85 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.53/1.85 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.53/1.85 2.53/1.85 2.53/1.85 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.53/1.85 2.53/1.85 (0) CpxIntTrs 2.53/1.85 (1) Koat Proof [FINISHED, 287 ms] 2.53/1.85 (2) BOUNDS(1, n^1) 2.53/1.85 2.53/1.85 2.53/1.85 ---------------------------------------- 2.53/1.85 2.53/1.85 (0) 2.53/1.85 Obligation: 2.53/1.85 Complexity Int TRS consisting of the following rules: 2.53/1.85 eval_peed_pldi09_fig4_2_start(v_m, v_n, v_va.0, v_vb.0) -> Com_1(eval_peed_pldi09_fig4_2_bb0_in(v_m, v_n, v_va.0, v_vb.0)) :|: TRUE 2.53/1.85 eval_peed_pldi09_fig4_2_bb0_in(v_m, v_n, v_va.0, v_vb.0) -> Com_1(eval_peed_pldi09_fig4_2_bb4_in(v_m, v_n, v_va.0, v_vb.0)) :|: v_m <= 0 2.53/1.85 eval_peed_pldi09_fig4_2_bb0_in(v_m, v_n, v_va.0, v_vb.0) -> Com_1(eval_peed_pldi09_fig4_2_bb1_in(v_m, v_n, v_n, 0)) :|: v_m > 0 2.53/1.85 eval_peed_pldi09_fig4_2_bb1_in(v_m, v_n, v_va.0, v_vb.0) -> Com_1(eval_peed_pldi09_fig4_2_bb2_in(v_m, v_n, v_va.0, v_vb.0)) :|: v_va.0 > 0 2.53/1.85 eval_peed_pldi09_fig4_2_bb1_in(v_m, v_n, v_va.0, v_vb.0) -> Com_1(eval_peed_pldi09_fig4_2_bb4_in(v_m, v_n, v_va.0, v_vb.0)) :|: v_va.0 <= 0 2.53/1.85 eval_peed_pldi09_fig4_2_bb2_in(v_m, v_n, v_va.0, v_vb.0) -> Com_1(eval_peed_pldi09_fig4_2_bb3_in(v_m, v_n, v_va.0, v_vb.0)) :|: v_vb.0 < v_m 2.53/1.85 eval_peed_pldi09_fig4_2_bb2_in(v_m, v_n, v_va.0, v_vb.0) -> Com_1(eval_peed_pldi09_fig4_2_bb1_in(v_m, v_n, v_va.0, 0)) :|: v_vb.0 >= v_m 2.53/1.85 eval_peed_pldi09_fig4_2_bb3_in(v_m, v_n, v_va.0, v_vb.0) -> Com_1(eval_peed_pldi09_fig4_2_bb1_in(v_m, v_n, v_va.0 - 1, v_vb.0 + 1)) :|: TRUE 2.53/1.85 eval_peed_pldi09_fig4_2_bb4_in(v_m, v_n, v_va.0, v_vb.0) -> Com_1(eval_peed_pldi09_fig4_2_stop(v_m, v_n, v_va.0, v_vb.0)) :|: TRUE 2.53/1.85 2.53/1.85 The start-symbols are:[eval_peed_pldi09_fig4_2_start_4] 2.53/1.85 2.53/1.85 2.53/1.85 ---------------------------------------- 2.53/1.85 2.53/1.85 (1) Koat Proof (FINISHED) 2.53/1.85 YES(?, 28*ar_2 + 11) 2.53/1.85 2.53/1.85 2.53/1.85 2.53/1.85 Initial complexity problem: 2.53/1.85 2.53/1.85 1: T: 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb0in(ar_0, ar_1, ar_2, ar_3)) 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb1in(ar_0, ar_2, ar_2, 0)) [ ar_0 >= 1 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 1 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_1 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_3 + 1 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb1in(ar_0, ar_1, ar_2, 0)) [ ar_3 >= ar_0 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb1in(ar_0, ar_1 - 1, ar_2, ar_3 + 1)) 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42stop(ar_0, ar_1, ar_2, ar_3)) 2.53/1.85 2.53/1.85 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 2.53/1.85 2.53/1.85 start location: koat_start 2.53/1.85 2.53/1.85 leaf cost: 0 2.53/1.85 2.53/1.85 2.53/1.85 2.53/1.85 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.53/1.85 2.53/1.85 2: T: 2.53/1.85 2.53/1.85 (Comp: 1, Cost: 1) evalpeedpldi09fig42start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb0in(ar_0, ar_1, ar_2, ar_3)) 2.53/1.85 2.53/1.85 (Comp: 1, Cost: 1) evalpeedpldi09fig42bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] 2.53/1.85 2.53/1.85 (Comp: 1, Cost: 1) evalpeedpldi09fig42bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb1in(ar_0, ar_2, ar_2, 0)) [ ar_0 >= 1 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 1 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_1 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_3 + 1 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb1in(ar_0, ar_1, ar_2, 0)) [ ar_3 >= ar_0 ] 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42bb1in(ar_0, ar_1 - 1, ar_2, ar_3 + 1)) 2.53/1.85 2.53/1.85 (Comp: ?, Cost: 1) evalpeedpldi09fig42bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42stop(ar_0, ar_1, ar_2, ar_3)) 2.53/1.85 2.53/1.85 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalpeedpldi09fig42start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 2.53/1.85 2.53/1.85 start location: koat_start 2.53/1.85 2.53/1.85 leaf cost: 0 2.53/1.85 2.53/1.85 2.53/1.85 2.53/1.85 A polynomial rank function with 2.53/1.85 2.53/1.85 Pol(evalpeedpldi09fig42start) = 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