Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989328
details
property
value
status
complete
benchmark
PodelskiRybalchenko-VMCAI2004-Ex2_true-termination.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)
1.70056 seconds
cpu usage
2.49273
user time
2.20639
system time
0.286341
max virtual memory
1.8575632E7
max residence set size
226488.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(1))
output
2.36/1.67 WORST_CASE(?, O(1)) 2.36/1.68 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.36/1.68 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.36/1.68 2.36/1.68 2.36/1.68 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1). 2.36/1.68 2.36/1.68 (0) CpxIntTrs 2.36/1.68 (1) Koat Proof [FINISHED, 481 ms] 2.36/1.68 (2) BOUNDS(1, 1) 2.36/1.68 2.36/1.68 2.36/1.68 ---------------------------------------- 2.36/1.68 2.36/1.68 (0) 2.36/1.68 Obligation: 2.36/1.68 Complexity Int TRS consisting of the following rules: 2.36/1.68 eval_foo_start(v_.0, v_x) -> Com_1(eval_foo_bb0_in(v_.0, v_x)) :|: TRUE 2.36/1.68 eval_foo_bb0_in(v_.0, v_x) -> Com_1(eval_foo_bb1_in(v_x, v_x)) :|: TRUE 2.36/1.68 eval_foo_bb1_in(v_.0, v_x) -> Com_1(eval_foo_bb2_in(v_.0, v_x)) :|: v_.0 >= 0 2.36/1.68 eval_foo_bb1_in(v_.0, v_x) -> Com_1(eval_foo_bb3_in(v_.0, v_x)) :|: v_.0 < 0 2.36/1.68 eval_foo_bb2_in(v_.0, v_x) -> Com_1(eval_foo_bb1_in(-(2) * v_.0 + 10, v_x)) :|: TRUE 2.36/1.68 eval_foo_bb3_in(v_.0, v_x) -> Com_1(eval_foo_stop(v_.0, v_x)) :|: TRUE 2.36/1.68 2.36/1.68 The start-symbols are:[eval_foo_start_2] 2.36/1.68 2.36/1.68 2.36/1.68 ---------------------------------------- 2.36/1.68 2.36/1.68 (1) Koat Proof (FINISHED) 2.36/1.68 YES(?, 42) 2.36/1.68 2.36/1.68 2.36/1.68 2.36/1.68 Initial complexity problem: 2.36/1.68 2.36/1.68 1: T: 2.36/1.68 2.36/1.68 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1) -> Com_1(evalfoobb0in(ar_0, ar_1)) 2.36/1.68 2.36/1.68 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1) -> Com_1(evalfoobb1in(ar_1, ar_1)) 2.36/1.68 2.36/1.68 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1) -> Com_1(evalfoobb2in(ar_0, ar_1)) [ ar_0 >= 0 ] 2.36/1.68 2.36/1.68 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1) -> Com_1(evalfoobb3in(ar_0, ar_1)) [ 0 >= ar_0 + 1 ] 2.36/1.68 2.36/1.68 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1) -> Com_1(evalfoobb1in(-2*ar_0 + 10, ar_1)) 2.36/1.68 2.36/1.68 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1) -> Com_1(evalfoostop(ar_0, ar_1)) 2.36/1.68 2.36/1.68 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1) -> Com_1(evalfoostart(ar_0, ar_1)) [ 0 <= 0 ] 2.36/1.68 2.36/1.68 start location: koat_start 2.36/1.68 2.36/1.68 leaf cost: 0 2.36/1.68 2.36/1.68 2.36/1.68 2.36/1.68 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.36/1.68 2.36/1.68 2: T: 2.36/1.68 2.36/1.68 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1) -> Com_1(evalfoobb0in(ar_0, ar_1)) 2.36/1.68 2.36/1.68 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1) -> Com_1(evalfoobb1in(ar_1, ar_1)) 2.36/1.68 2.36/1.68 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1) -> Com_1(evalfoobb2in(ar_0, ar_1)) [ ar_0 >= 0 ] 2.36/1.68 2.36/1.68 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1) -> Com_1(evalfoobb3in(ar_0, ar_1)) [ 0 >= ar_0 + 1 ] 2.36/1.68 2.36/1.68 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1) -> Com_1(evalfoobb1in(-2*ar_0 + 10, ar_1)) 2.36/1.68 2.36/1.68 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1) -> Com_1(evalfoostop(ar_0, ar_1)) 2.36/1.68 2.36/1.68 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1) -> Com_1(evalfoostart(ar_0, ar_1)) [ 0 <= 0 ] 2.36/1.68 2.36/1.68 start location: koat_start 2.36/1.68 2.36/1.68 leaf cost: 0 2.36/1.68 2.36/1.68 2.36/1.68 2.36/1.68 A polynomial rank function with 2.36/1.68 2.36/1.68 Pol(evalfoostart) = 2 2.36/1.68 2.36/1.68 Pol(evalfoobb0in) = 2 2.36/1.68 2.36/1.68 Pol(evalfoobb1in) = 2 2.36/1.68 2.36/1.68 Pol(evalfoobb2in) = 2 2.36/1.68 2.36/1.68 Pol(evalfoobb3in) = 1 2.36/1.68 2.36/1.68 Pol(evalfoostop) = 0 2.36/1.68 2.36/1.68 Pol(koat_start) = 2 2.36/1.68 2.36/1.68 orients all transitions weakly and the transitions 2.36/1.68
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