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