Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989376
details
property
value
status
complete
benchmark
PastaB17.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n044.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.36188 seconds
cpu usage
2.34093
user time
2.15485
system time
0.186071
max virtual memory
1.8273644E7
max residence set size
181064.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.10/1.33 WORST_CASE(?, O(n^1)) 2.10/1.34 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.10/1.34 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.10/1.34 2.10/1.34 2.10/1.34 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.10/1.34 2.10/1.34 (0) CpxIntTrs 2.10/1.34 (1) Koat Proof [FINISHED, 175 ms] 2.10/1.34 (2) BOUNDS(1, n^1) 2.10/1.34 2.10/1.34 2.10/1.34 ---------------------------------------- 2.10/1.34 2.10/1.34 (0) 2.10/1.34 Obligation: 2.10/1.34 Complexity Int TRS consisting of the following rules: 2.10/1.34 eval_foo_start(v_.0, v_.01, v_.1, v_x, v_y, v_z) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_.1, v_x, v_y, v_z)) :|: TRUE 2.10/1.34 eval_foo_bb0_in(v_.0, v_.01, v_.1, v_x, v_y, v_z) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_.1, v_x, v_y, v_z)) :|: TRUE 2.10/1.34 eval_foo_bb1_in(v_.0, v_.01, v_.1, v_x, v_y, v_z) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_.01, v_x, v_y, v_z)) :|: v_.0 > v_z 2.10/1.34 eval_foo_bb1_in(v_.0, v_.01, v_.1, v_x, v_y, v_z) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_.1, v_x, v_y, v_z)) :|: v_.0 <= v_z 2.10/1.34 eval_foo_bb2_in(v_.0, v_.01, v_.1, v_x, v_y, v_z) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.1, v_x, v_y, v_z)) :|: v_.1 > v_z 2.10/1.34 eval_foo_bb2_in(v_.0, v_.01, v_.1, v_x, v_y, v_z) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_.1, v_x, v_y, v_z)) :|: v_.1 <= v_z 2.10/1.34 eval_foo_bb3_in(v_.0, v_.01, v_.1, v_x, v_y, v_z) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_.1 - 1, v_x, v_y, v_z)) :|: TRUE 2.10/1.34 eval_foo_bb4_in(v_.0, v_.01, v_.1, v_x, v_y, v_z) -> Com_1(eval_foo_bb1_in(v_.0 - 1, v_.1, v_.1, v_x, v_y, v_z)) :|: TRUE 2.10/1.34 eval_foo_bb5_in(v_.0, v_.01, v_.1, v_x, v_y, v_z) -> Com_1(eval_foo_stop(v_.0, v_.01, v_.1, v_x, v_y, v_z)) :|: TRUE 2.10/1.34 2.10/1.34 The start-symbols are:[eval_foo_start_6] 2.10/1.34 2.10/1.34 2.10/1.34 ---------------------------------------- 2.10/1.34 2.10/1.34 (1) Koat Proof (FINISHED) 2.10/1.34 YES(?, 5*ar_1 + 7*ar_4 + 2*ar_3 + 11) 2.10/1.34 2.10/1.34 2.10/1.34 2.10/1.34 Initial complexity problem: 2.10/1.34 2.10/1.34 1: T: 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5)) 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_2)) [ ar_0 >= ar_4 + 1 ] 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= ar_0 ] 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_5 >= ar_4 + 1 ] 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= ar_5 ] 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5 - 1)) 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_0 - 1, ar_1, ar_5, ar_3, ar_4, ar_5)) 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.10/1.34 2.10/1.34 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] 2.10/1.34 2.10/1.34 start location: koat_start 2.10/1.34 2.10/1.34 leaf cost: 0 2.10/1.34 2.10/1.34 2.10/1.34 2.10/1.34 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.10/1.34 2.10/1.34 2: T: 2.10/1.34 2.10/1.34 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.10/1.34 2.10/1.34 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5)) 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_2)) [ ar_0 >= ar_4 + 1 ] 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= ar_0 ] 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_5 >= ar_4 + 1 ] 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= ar_5 ] 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5 - 1)) 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_0 - 1, ar_1, ar_5, ar_3, ar_4, ar_5)) 2.10/1.34 2.10/1.34 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.10/1.34 2.10/1.34 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] 2.10/1.34 2.10/1.34 start location: koat_start 2.10/1.34 2.10/1.34 leaf cost: 0 2.10/1.34 2.10/1.34 2.10/1.34 2.10/1.34 A polynomial rank function with 2.10/1.34 2.10/1.34 Pol(evalfoostart) = 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