Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989306
details
property
value
status
complete
benchmark
Sequence.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n008.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
2.5211 seconds
cpu usage
2.3094
user time
2.12683
system time
0.182568
max virtual memory
1.8273644E7
max residence set size
186340.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(1))
output
2.14/2.49 WORST_CASE(?, O(1)) 2.14/2.50 proof of /export/starexec/sandbox2/output/output_files/bench.koat 2.14/2.50 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.14/2.50 2.14/2.50 2.14/2.50 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1). 2.14/2.50 2.14/2.50 (0) CpxIntTrs 2.14/2.50 (1) Koat Proof [FINISHED, 45 ms] 2.14/2.50 (2) BOUNDS(1, 1) 2.14/2.50 2.14/2.50 2.14/2.50 ---------------------------------------- 2.14/2.50 2.14/2.50 (0) 2.14/2.50 Obligation: 2.14/2.50 Complexity Int TRS consisting of the following rules: 2.14/2.50 eval_foo_start(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_i, v_j)) :|: TRUE 2.14/2.50 eval_foo_bb0_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb1_in(0, v_.01, v_i, v_j)) :|: TRUE 2.14/2.50 eval_foo_bb1_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_i, v_j)) :|: v_.0 < 100 2.14/2.50 eval_foo_bb1_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb3_in(v_.0, 5, v_i, v_j)) :|: v_.0 >= 100 2.14/2.50 eval_foo_bb2_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_.01, v_i, v_j)) :|: TRUE 2.14/2.50 eval_foo_bb3_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_i, v_j)) :|: v_.01 < 21 2.14/2.50 eval_foo_bb3_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_i, v_j)) :|: v_.01 >= 21 2.14/2.50 eval_foo_bb4_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb3_in(v_.0, v_.01 + 3, v_i, v_j)) :|: TRUE 2.14/2.50 eval_foo_bb5_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_stop(v_.0, v_.01, v_i, v_j)) :|: TRUE 2.14/2.50 2.14/2.50 The start-symbols are:[eval_foo_start_4] 2.14/2.50 2.14/2.50 2.14/2.50 ---------------------------------------- 2.14/2.50 2.14/2.50 (1) Koat Proof (FINISHED) 2.14/2.50 YES(?, 243) 2.14/2.50 2.14/2.50 2.14/2.50 2.14/2.50 Initial complexity problem: 2.14/2.50 2.14/2.50 1: T: 2.14/2.50 2.14/2.50 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1) -> Com_1(evalfoobb0in(ar_0, ar_1)) 2.14/2.50 2.14/2.50 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1) -> Com_1(evalfoobb1in(0, ar_1)) 2.14/2.50 2.14/2.50 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1) -> Com_1(evalfoobb2in(ar_0, ar_1)) [ 99 >= ar_0 ] 2.14/2.50 2.14/2.50 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1) -> Com_1(evalfoobb3in(ar_0, 5)) [ ar_0 >= 100 ] 2.14/2.50 2.14/2.50 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1)) 2.14/2.50 2.14/2.50 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1) -> Com_1(evalfoobb4in(ar_0, ar_1)) [ 20 >= ar_1 ] 2.14/2.50 2.14/2.50 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1) -> Com_1(evalfoobb5in(ar_0, ar_1)) [ ar_1 >= 21 ] 2.25/2.50 2.25/2.50 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1) -> Com_1(evalfoobb3in(ar_0, ar_1 + 3)) 2.25/2.50 2.25/2.50 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1) -> Com_1(evalfoostop(ar_0, ar_1)) 2.25/2.50 2.25/2.50 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1) -> Com_1(evalfoostart(ar_0, ar_1)) [ 0 <= 0 ] 2.25/2.50 2.25/2.50 start location: koat_start 2.25/2.50 2.25/2.50 leaf cost: 0 2.25/2.50 2.25/2.50 2.25/2.50 2.25/2.50 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.25/2.50 2.25/2.50 2: T: 2.25/2.50 2.25/2.50 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1) -> Com_1(evalfoobb0in(ar_0, ar_1)) 2.25/2.50 2.25/2.50 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1) -> Com_1(evalfoobb1in(0, ar_1)) 2.25/2.50 2.25/2.50 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1) -> Com_1(evalfoobb2in(ar_0, ar_1)) [ 99 >= ar_0 ] 2.25/2.50 2.25/2.50 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1) -> Com_1(evalfoobb3in(ar_0, 5)) [ ar_0 >= 100 ] 2.25/2.50 2.25/2.50 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1)) 2.25/2.50 2.25/2.50 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1) -> Com_1(evalfoobb4in(ar_0, ar_1)) [ 20 >= ar_1 ] 2.25/2.50 2.25/2.50 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1) -> Com_1(evalfoobb5in(ar_0, ar_1)) [ ar_1 >= 21 ] 2.25/2.50 2.25/2.50 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1) -> Com_1(evalfoobb3in(ar_0, ar_1 + 3)) 2.25/2.50 2.25/2.50 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1) -> Com_1(evalfoostop(ar_0, ar_1)) 2.25/2.50 2.25/2.50 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1) -> Com_1(evalfoostart(ar_0, ar_1)) [ 0 <= 0 ] 2.25/2.50 2.25/2.50 start location: koat_start 2.25/2.50 2.25/2.50 leaf cost: 0 2.25/2.50 2.25/2.50 2.25/2.50 2.25/2.50 A polynomial rank function with 2.25/2.50 2.25/2.50 Pol(evalfoostart) = 3
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