details

property	value
status	complete
benchmark	Loopus2015_original.c.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n103.star.cs.uiowa.edu
space	Flores-Montoya_16

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	32.7216 seconds
cpu usage	38.2783
user time	36.0641
system time	2.21422
max virtual memory	1.8826588E7
max residence set size	253204.0

stage attributes

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

output

38.11/32.52 WORST_CASE(Omega(n^1), O(n^2)) 38.11/32.54 proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat 38.11/32.54 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 38.11/32.54 38.11/32.54 38.11/32.54 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, max(11 + 2 * Arg_3, 11) + nat(4 * Arg_3^2) + nat(3 * Arg_3) + max(2, 2 + Arg_3) + nat(21 * Arg_3) + nat(12 * Arg_3) + nat(1 + 7 * Arg_3) + nat(13 * Arg_3) + nat(4 * Arg_3^2) * nat(Arg_3) + nat(Arg_3)^2 + 2 * nat(4 * Arg_3^2) * nat(Arg_3) + 2 * nat(Arg_3)^2 + nat(4 * Arg_3)). 38.11/32.54 38.11/32.54 (0) CpxIntTrs 38.11/32.54 (1) Loat Proof [FINISHED, 2229 ms] 38.11/32.54 (2) BOUNDS(n^1, INF) 38.11/32.54 38.11/32.54 38.11/32.54 ---------------------------------------- 38.11/32.54 38.11/32.54 (0) 38.11/32.54 Obligation: 38.11/32.54 Complexity Int TRS consisting of the following rules: 38.11/32.54 eval_xnu_start(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_bb0_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_bb0_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_0(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_0(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_1(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_1(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_2(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_2(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_3(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_3(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_4(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_4(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_5(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_5(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_6(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_6(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_7(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_7(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_8(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_8(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_bb1_in(v__end_0, v_1, v_2, v_4, v_7, 0, 0, 0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_bb1_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_bb2_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: v_i_0 < v_len 38.11/32.54 eval_xnu_bb1_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_bb5_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: v_i_0 >= v_len 38.11/32.54 eval_xnu_bb2_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_10(v__end_0, v_i_0 + 1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_10(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_11(v__end_0, v_1, nondef_0, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_11(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_12(v_1, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: v_2 > 0 38.11/32.54 eval_xnu_11(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_12(v_end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: v_2 <= 0 38.11/32.54 eval_xnu_12(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_13(v__end_0, v_1, v_2, nondef_1, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_13(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_bb3_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_beg_0, v_len)) :|: v_4 > 0 38.11/32.54 eval_xnu_13(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_bb1_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v__end_0, v_1, v_k_0, v_len)) :|: v_4 <= 0 38.11/32.54 eval_xnu_bb3_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_bb4_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: v_k_0 < v__end_0 38.11/32.54 eval_xnu_bb3_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_bb1_in(v__end_0, v_1, v_2, v_4, v_7, v_1, v_1, v_1, v_k_0, v_len)) :|: v_k_0 >= v__end_0 38.11/32.54 eval_xnu_bb4_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_15(v__end_0, v_1, v_2, v_4, v_k_0 + 1, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_15(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_16(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 eval_xnu_16(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_bb3_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_7, v_len)) :|: TRUE 38.11/32.54 eval_xnu_bb5_in(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len) -> Com_1(eval_xnu_stop(v__end_0, v_1, v_2, v_4, v_7, v_beg_0, v_end_0, v_i_0, v_k_0, v_len)) :|: TRUE 38.11/32.54 38.11/32.54 The start-symbols are:[eval_xnu_start_10] 38.11/32.54 38.11/32.54 38.11/32.54 ---------------------------------------- 38.11/32.54 38.11/32.54 (1) Loat Proof (FINISHED) 38.11/32.54 38.11/32.54 38.11/32.54 ### Pre-processing the ITS problem ### 38.11/32.54 38.11/32.54 38.11/32.54 38.11/32.54 Initial linear ITS problem 38.11/32.54 38.11/32.54 Start location: evalxnustart 38.11/32.54 38.11/32.54 0: evalxnustart -> evalxnubb0in : [], cost: 1 38.11/32.54 38.11/32.54 1: evalxnubb0in -> evalxnu0 : [], cost: 1 38.11/32.54 38.11/32.54 2: evalxnu0 -> evalxnu1 : [], cost: 1 38.11/32.54 38.11/32.54 3: evalxnu1 -> evalxnu2 : [], cost: 1 38.11/32.54 38.11/32.54 4: evalxnu2 -> evalxnu3 : [], cost: 1 38.11/32.54 38.11/32.54 5: evalxnu3 -> evalxnu4 : [], cost: 1 38.11/32.54 38.11/32.54 6: evalxnu4 -> evalxnu5 : [], cost: 1 38.11/32.54 38.11/32.54 7: evalxnu5 -> evalxnu6 : [], cost: 1 38.11/32.54 38.11/32.54 8: evalxnu6 -> evalxnu7 : [], cost: 1 38.11/32.54 38.11/32.54 9: evalxnu7 -> evalxnu8 : [], cost: 1 38.11/32.54 38.11/32.54 10: evalxnu8 -> evalxnubb1in : A'=0, B'=0, C'=0, [], cost: 1 38.11/32.54 38.11/32.54 11: evalxnubb1in -> evalxnubb2in : [ D>=1+C ], cost: 1 38.11/32.54 38.11/32.54 12: evalxnubb1in -> evalxnubb5in : [ C>=D ], cost: 1 38.11/32.54 38.11/32.54 13: evalxnubb2in -> evalxnu10 : E'=1+C, [], cost: 1 38.11/32.54 38.11/32.54 14: evalxnu10 -> evalxnu11 : F'=free, [], cost: 1 38.11/32.54 38.11/32.54 15: evalxnu11 -> evalxnu12 : G'=E, [ F>=1 ], cost: 1 38.11/32.54 38.11/32.54 16: evalxnu11 -> evalxnu12 : G'=B, [ 0>=F ], cost: 1 38.11/32.54 38.11/32.54 17: evalxnu12 -> evalxnu13 : H'=free_1, [], cost: 1 38.11/32.54 38.11/32.54 18: evalxnu13 -> evalxnubb3in : Q'=A, [ H>=1 ], cost: 1 38.11/32.54 38.11/32.54 19: evalxnu13 -> evalxnubb1in : B'=G, C'=E, [ 0>=H ], cost: 1 38.11/32.54 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Complexity_ITS 2019-03-21 04.46