Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989430
details
property
value
status
complete
benchmark
ChenFlurMukhopadhyay-SAS2012-Ex1.05_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n036.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.54376 seconds
cpu usage
2.674
user time
2.45609
system time
0.217908
max virtual memory
1.8273644E7
max residence set size
186252.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.61/1.49 WORST_CASE(?, O(n^1)) 2.61/1.50 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.61/1.50 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.61/1.50 2.61/1.50 2.61/1.50 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.61/1.50 2.61/1.50 (0) CpxIntTrs 2.61/1.50 (1) Koat Proof [FINISHED, 378 ms] 2.61/1.50 (2) BOUNDS(1, n^1) 2.61/1.50 2.61/1.50 2.61/1.50 ---------------------------------------- 2.61/1.50 2.61/1.50 (0) 2.61/1.50 Obligation: 2.61/1.50 Complexity Int TRS consisting of the following rules: 2.61/1.50 eval_foo_start(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_3, v_oldx, v_x)) :|: TRUE 2.61/1.50 eval_foo_bb0_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_bb1_in(v_x, v_oldx, v_3, v_oldx, v_x)) :|: TRUE 2.61/1.50 eval_foo_bb1_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_3, v_oldx, v_x)) :|: v_.0 > 0 && 2 * v_.0 <= v_.01 2.61/1.50 eval_foo_bb1_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_3, v_oldx, v_x)) :|: v_.0 <= 0 2.61/1.50 eval_foo_bb1_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_3, v_oldx, v_x)) :|: 2 * v_.0 > v_.01 2.62/1.51 eval_foo_bb2_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_2(v_.0, v_.01, v_3, v_oldx, v_x)) :|: TRUE 2.62/1.51 eval_foo_2(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_3, v_oldx, v_x), eval_foo_3(v_.0, v_.01, nondef.0, v_oldx, v_x)) :|: TRUE 2.62/1.51 eval_foo_3(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_bb1_in(v_3, v_.0, v_3, v_oldx, v_x)) :|: TRUE 2.62/1.51 eval_foo_.critedge_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_stop(v_.0, v_.01, v_3, v_oldx, v_x)) :|: TRUE 2.62/1.51 2.62/1.51 The start-symbols are:[eval_foo_start_5] 2.62/1.51 2.62/1.51 2.62/1.51 ---------------------------------------- 2.62/1.51 2.62/1.51 (1) Koat Proof (FINISHED) 2.62/1.51 YES(?, 36*ar_3 + 8) 2.62/1.51 2.62/1.51 2.62/1.51 2.62/1.51 Initial complexity problem: 2.62/1.51 2.62/1.51 1: T: 2.62/1.51 2.62/1.51 (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.62/1.51 2.62/1.51 (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.62/1.51 2.62/1.51 (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_5)) [ ar_0 >= 1 /\ ar_2 >= 2*ar_0 ] 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ] 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 2*ar_0 >= ar_2 + 1 ] 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5)) 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, g)) 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_4, ar_1, ar_0, ar_3, ar_4, ar_5)) 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoocritedgein(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.62/1.51 2.62/1.51 (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.62/1.51 2.62/1.51 start location: koat_start 2.62/1.51 2.62/1.51 leaf cost: 0 2.62/1.51 2.62/1.51 2.62/1.51 2.62/1.51 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.62/1.51 2.62/1.51 2: T: 2.62/1.51 2.62/1.51 (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.62/1.51 2.62/1.51 (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.62/1.51 2.62/1.51 (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_5)) [ ar_0 >= 1 /\ ar_2 >= 2*ar_0 ] 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ] 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 2*ar_0 >= ar_2 + 1 ] 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5)) 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, g)) 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_4, ar_1, ar_0, ar_3, ar_4, ar_5)) 2.62/1.51 2.62/1.51 (Comp: ?, Cost: 1) evalfoocritedgein(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.62/1.51 2.62/1.51 (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.62/1.51 2.62/1.51 start location: koat_start
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