Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989222
details
property
value
status
complete
benchmark
KroeningSharyginaTsitovichWintersteiger-CAV2010-Ex_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.63907 seconds
cpu usage
2.68491
user time
2.44428
system time
0.240622
max virtual memory
1.8273644E7
max residence set size
184192.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.62/1.60 WORST_CASE(?, O(n^1)) 2.62/1.61 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.62/1.61 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.62/1.61 2.62/1.61 2.62/1.61 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.62/1.61 2.62/1.61 (0) CpxIntTrs 2.62/1.61 (1) Koat Proof [FINISHED, 379 ms] 2.62/1.61 (2) BOUNDS(1, n^1) 2.62/1.61 2.62/1.61 2.62/1.61 ---------------------------------------- 2.62/1.61 2.62/1.61 (0) 2.62/1.61 Obligation: 2.62/1.61 Complexity Int TRS consisting of the following rules: 2.62/1.61 eval_foo_start(v_.0, v_1, v_i) -> Com_1(eval_foo_bb0_in(v_.0, v_1, v_i)) :|: TRUE 2.62/1.61 eval_foo_bb0_in(v_.0, v_1, v_i) -> Com_1(eval_foo_bb1_in(v_i, v_1, v_i)) :|: TRUE 2.62/1.61 eval_foo_bb1_in(v_.0, v_1, v_i) -> Com_1(eval_foo_bb2_in(v_.0, v_1, v_i)) :|: v_.0 < 255 2.62/1.61 eval_foo_bb1_in(v_.0, v_1, v_i) -> Com_1(eval_foo_bb3_in(v_.0, v_1, v_i)) :|: v_.0 >= 255 2.62/1.61 eval_foo_bb2_in(v_.0, v_1, v_i) -> Com_1(eval_foo_0(v_.0, v_1, v_i)) :|: TRUE 2.62/1.61 eval_foo_0(v_.0, v_1, v_i) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_1, v_i), eval_foo_1(v_.0, nondef.0, v_i)) :|: TRUE 2.62/1.61 eval_foo_1(v_.0, v_1, v_i) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_1, v_i)) :|: v_1 < 0 2.62/1.61 eval_foo_1(v_.0, v_1, v_i) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_1, v_i)) :|: v_1 > 0 2.62/1.61 eval_foo_1(v_.0, v_1, v_i) -> Com_1(eval_foo_bb1_in(v_.0 + 2, v_1, v_i)) :|: v_1 >= 0 && v_1 <= 0 2.62/1.61 eval_foo_bb3_in(v_.0, v_1, v_i) -> Com_1(eval_foo_stop(v_.0, v_1, v_i)) :|: TRUE 2.62/1.61 2.62/1.61 The start-symbols are:[eval_foo_start_3] 2.62/1.61 2.62/1.61 2.62/1.61 ---------------------------------------- 2.62/1.61 2.62/1.61 (1) Koat Proof (FINISHED) 2.62/1.61 YES(?, 48*ar_1 + 12246) 2.62/1.61 2.62/1.61 2.62/1.61 2.62/1.61 Initial complexity problem: 2.62/1.61 2.62/1.61 1: T: 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_2, ar_3)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ 254 >= ar_0 ] 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 255 ] 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo0(ar_0, ar_1, ar_2, ar_3)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo00(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo01(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo1(ar_0, ar_1, ar_3, ar_3)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo0(ar_0, ar_1, ar_2, ar_3) -> Com_2(evalfoo00(ar_0, ar_1, ar_2, e), evalfoo01(ar_0, ar_1, ar_2, e)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ 0 >= ar_2 + 1 ] 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 >= 1 ] 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 2, ar_1, ar_2, ar_3)) [ ar_2 = 0 ] 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3)) 2.62/1.61 2.62/1.61 (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.62/1.61 2.62/1.61 start location: koat_start 2.62/1.61 2.62/1.61 leaf cost: 0 2.62/1.61 2.62/1.61 2.62/1.61 2.62/1.61 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.62/1.61 2.62/1.61 2: T: 2.62/1.61 2.62/1.61 (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.62/1.61 2.62/1.61 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_2, ar_3)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ 254 >= ar_0 ] 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 255 ] 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo0(ar_0, ar_1, ar_2, ar_3)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo00(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo01(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo1(ar_0, ar_1, ar_3, ar_3)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo0(ar_0, ar_1, ar_2, ar_3) -> Com_2(evalfoo00(ar_0, ar_1, ar_2, e), evalfoo01(ar_0, ar_1, ar_2, e)) 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ 0 >= ar_2 + 1 ] 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 >= 1 ] 2.62/1.61 2.62/1.61 (Comp: ?, Cost: 1) evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 2, ar_1, ar_2, ar_3)) [ ar_2 = 0 ] 2.62/1.61
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