details

property	value
status	complete
benchmark	aaron2.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n054.star.cs.uiowa.edu
space	WTC_V2

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	2.13317 seconds
cpu usage	3.09805
user time	2.83361
system time	0.264439
max virtual memory	1.850456E7
max residence set size	185272.0

stage attributes

key	value
starexec-result	WORST_CASE(?, O(n^1))

output

2.95/2.08 WORST_CASE(?, O(n^1)) 2.95/2.09 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.95/2.09 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.95/2.09 2.95/2.09 2.95/2.09 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.95/2.09 2.95/2.09 (0) CpxIntTrs 2.95/2.09 (1) Koat Proof [FINISHED, 783 ms] 2.95/2.09 (2) BOUNDS(1, n^1) 2.95/2.09 2.95/2.09 2.95/2.09 ---------------------------------------- 2.95/2.09 2.95/2.09 (0) 2.95/2.09 Obligation: 2.95/2.09 Complexity Int TRS consisting of the following rules: 2.95/2.09 eval_aaron2_start(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb0_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: TRUE 2.95/2.09 eval_aaron2_bb0_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb1_in(v_x, v_y, v_3, v_tx, v_x, v_y)) :|: v_tx >= 0 2.95/2.09 eval_aaron2_bb0_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb5_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_tx < 0 2.95/2.09 eval_aaron2_bb1_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb5_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_.01 < v_.02 2.95/2.09 eval_aaron2_bb1_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb5_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_tx < 0 2.95/2.09 eval_aaron2_bb1_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb2_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_.01 >= v_.02 && v_tx >= 0 2.95/2.09 eval_aaron2_bb2_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_0(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: TRUE 2.95/2.09 eval_aaron2_0(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_2(eval_nondet_start(v_.01, v_.02, v_3, v_tx, v_x, v_y), eval_aaron2_1(v_.01, v_.02, nondef.0, v_tx, v_x, v_y)) :|: TRUE 2.95/2.09 eval_aaron2_1(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb3_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_3 > 0 2.95/2.09 eval_aaron2_1(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb4_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_3 <= 0 2.95/2.09 eval_aaron2_bb3_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb1_in(v_.01 - v_tx - 1, v_.02, v_3, v_tx, v_x, v_y)) :|: TRUE 2.95/2.09 eval_aaron2_bb4_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb1_in(v_.01, v_.02 + v_tx + 1, v_3, v_tx, v_x, v_y)) :|: TRUE 2.95/2.09 eval_aaron2_bb5_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_stop(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: TRUE 2.95/2.09 2.95/2.09 The start-symbols are:[eval_aaron2_start_6] 2.95/2.09 2.95/2.09 2.95/2.09 ---------------------------------------- 2.95/2.09 2.95/2.09 (1) Koat Proof (FINISHED) 2.95/2.09 YES(?, 63*ar_2 + 63*ar_4 + 70) 2.95/2.09 2.95/2.09 2.95/2.09 2.95/2.09 Initial complexity problem: 2.95/2.09 2.95/2.09 1: T: 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb1in(ar_0, ar_2, ar_2, ar_4, ar_4, ar_5, ar_6)) [ ar_0 >= 0 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_0 + 1 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_3 >= ar_1 + 1 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_0 + 1 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_1 >= ar_3 /\ ar_0 >= 0 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron200(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron201(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_6, ar_6)) 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_2(evalaaron200(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, h), evalaaron201(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, h)) 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_5 >= 1 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_5 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb1in(ar_0, ar_1 - ar_0 - 1, ar_2, ar_3, ar_4, ar_5, ar_6)) 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3 + ar_0 + 1, ar_4, ar_5, ar_6)) 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 2.95/2.09 2.95/2.09 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 <= 0 ] 2.95/2.09 2.95/2.09 start location: koat_start 2.95/2.09 2.95/2.09 leaf cost: 0 2.95/2.09 2.95/2.09 2.95/2.09 2.95/2.09 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.95/2.09 2.95/2.09 2: T: 2.95/2.09 2.95/2.09 (Comp: 1, Cost: 1) evalaaron2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 2.95/2.09 2.95/2.09 (Comp: 1, Cost: 1) evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb1in(ar_0, ar_2, ar_2, ar_4, ar_4, ar_5, ar_6)) [ ar_0 >= 0 ] 2.95/2.09 2.95/2.09 (Comp: 1, Cost: 1) evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_0 + 1 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_3 >= ar_1 + 1 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_0 + 1 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_1 >= ar_3 /\ ar_0 >= 0 ] 2.95/2.09 2.95/2.09 (Comp: ?, Cost: 1) evalaaron2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 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