Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429988868
details
property
value
status
complete
benchmark
speed_pldi10_ex3.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
C4B_examples
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.84909 seconds
cpu usage
2.76526
user time
2.52802
system time
0.237244
max virtual memory
1.8471484E7
max residence set size
181244.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.68/1.80 WORST_CASE(?, O(n^1)) 2.68/1.82 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.68/1.82 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.68/1.82 2.68/1.82 2.68/1.82 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.68/1.82 2.68/1.82 (0) CpxIntTrs 2.68/1.82 (1) Koat Proof [FINISHED, 481 ms] 2.68/1.82 (2) BOUNDS(1, n^1) 2.68/1.82 2.68/1.82 2.68/1.82 ---------------------------------------- 2.68/1.82 2.68/1.82 (0) 2.68/1.82 Obligation: 2.68/1.82 Complexity Int TRS consisting of the following rules: 2.68/1.82 eval_speed_pldi10_ex3_start(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb0_in(v_.0, v_.1, v_3, v_n)) :|: TRUE 2.68/1.82 eval_speed_pldi10_ex3_bb0_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb1_in(v_n, v_.1, v_3, v_n)) :|: TRUE 2.68/1.82 eval_speed_pldi10_ex3_bb1_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb2_in(v_.0, v_.1, v_3, v_n)) :|: v_.0 > 0 2.68/1.82 eval_speed_pldi10_ex3_bb1_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb6_in(v_.0, v_.1, v_3, v_n)) :|: v_.0 <= 0 2.68/1.82 eval_speed_pldi10_ex3_bb2_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb3_in(v_.0, v_.0 - 1, v_3, v_n)) :|: TRUE 2.68/1.82 eval_speed_pldi10_ex3_bb3_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb4_in(v_.0, v_.1, v_3, v_n)) :|: v_.1 > 0 2.68/1.82 eval_speed_pldi10_ex3_bb3_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb1_in(v_.1, v_.1, v_3, v_n)) :|: v_.1 <= 0 2.68/1.82 eval_speed_pldi10_ex3_bb4_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_2(v_.0, v_.1, v_3, v_n)) :|: TRUE 2.68/1.82 eval_speed_pldi10_ex3_2(v_.0, v_.1, v_3, v_n) -> Com_2(eval_nondet_start(v_.0, v_.1, v_3, v_n), eval_speed_pldi10_ex3_3(v_.0, v_.1, nondef.0, v_n)) :|: TRUE 2.68/1.82 eval_speed_pldi10_ex3_3(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb1_in(v_.1, v_.1, v_3, v_n)) :|: v_3 > 0 2.68/1.82 eval_speed_pldi10_ex3_3(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb5_in(v_.0, v_.1, v_3, v_n)) :|: v_3 <= 0 2.68/1.82 eval_speed_pldi10_ex3_bb5_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb3_in(v_.0, v_.1 - 1, v_3, v_n)) :|: TRUE 2.68/1.82 eval_speed_pldi10_ex3_bb6_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_stop(v_.0, v_.1, v_3, v_n)) :|: TRUE 2.68/1.82 2.68/1.82 The start-symbols are:[eval_speed_pldi10_ex3_start_4] 2.68/1.82 2.68/1.82 2.68/1.82 ---------------------------------------- 2.68/1.82 2.68/1.82 (1) Koat Proof (FINISHED) 2.68/1.82 YES(?, 88*ar_1 + 6) 2.68/1.82 2.68/1.82 2.68/1.82 2.68/1.82 Initial complexity problem: 2.68/1.82 2.68/1.82 1: T: 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb1in(ar_1, ar_1, ar_2, ar_3, ar_4)) 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb2in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= 1 ] 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb6in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_0 ] 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_0 - 1, ar_3, ar_4)) 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_2 >= 1 ] 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb1in(ar_2, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_2 ] 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex32(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex320(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex321(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex33(ar_0, ar_1, ar_2, ar_4, ar_4)) 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex32(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_2(evalspeedpldi10ex320(ar_0, ar_1, ar_2, ar_3, f), evalspeedpldi10ex321(ar_0, ar_1, ar_2, ar_3, f)) 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex33(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb1in(ar_2, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= 1 ] 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex33(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_3 ] 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb5in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_2 - 1, ar_3, ar_4)) 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb6in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3stop(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.68/1.82 2.68/1.82 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3start(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ] 2.68/1.82 2.68/1.82 start location: koat_start 2.68/1.82 2.68/1.82 leaf cost: 0 2.68/1.82 2.68/1.82 2.68/1.82 2.68/1.82 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.68/1.82 2.68/1.82 2: T: 2.68/1.82 2.68/1.82 (Comp: 1, Cost: 1) evalspeedpldi10ex3start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.68/1.82 2.68/1.82 (Comp: 1, Cost: 1) evalspeedpldi10ex3bb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb1in(ar_1, ar_1, ar_2, ar_3, ar_4)) 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb2in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= 1 ] 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb6in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_0 ] 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_0 - 1, ar_3, ar_4)) 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_2 >= 1 ] 2.68/1.82 2.68/1.82 (Comp: ?, Cost: 1) evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb1in(ar_2, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_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