details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	19.4409 seconds
cpu usage	33.1673
user time	31.3384
system time	1.82894
max virtual memory	1.8909728E7
max residence set size	307348.0

stage attributes

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

output

33.05/19.40 WORST_CASE(Omega(n^1), ?) 33.05/19.41 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 33.05/19.41 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 33.05/19.41 33.05/19.41 33.05/19.41 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF). 33.05/19.41 33.05/19.41 (0) CpxIntTrs 33.05/19.41 (1) Loat Proof [FINISHED, 2422 ms] 33.05/19.41 (2) BOUNDS(n^1, INF) 33.05/19.41 33.05/19.41 33.05/19.41 ---------------------------------------- 33.05/19.41 33.05/19.41 (0) 33.05/19.41 Obligation: 33.05/19.41 Complexity Int TRS consisting of the following rules: 33.05/19.41 eval_counterex1a_start(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb0_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_bb0_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_0(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_0(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_1(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_1(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_2(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_2(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_3(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_3(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_4(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_4(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_5(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_5(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_6(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_6(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_7(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_7(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_8(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_8(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_9(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_9(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb1_in(v_b, v_x, v_y, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_bb1_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb2_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v__01 >= 0 && 0 <= v__04 && v__04 <= v_n 33.05/19.41 eval_counterex1a_bb1_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a__critedge_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v__01 < 0 33.05/19.41 eval_counterex1a_bb1_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a__critedge_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: 0 > v__04 33.05/19.41 eval_counterex1a_bb1_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a__critedge_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v__04 > v_n 33.05/19.41 eval_counterex1a_bb2_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb3_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v__0 >= 0 && v__0 <= 0 33.05/19.41 eval_counterex1a_bb2_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb4_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v__0 < 0 33.05/19.41 eval_counterex1a_bb2_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb4_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v__0 > 0 33.05/19.41 eval_counterex1a_bb3_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_11(v__0, v__01, v__04, v__04 + 1, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_11(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_12(v__0, v__01, v__04, v_4, nondef_0, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_12(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb1_in(1, v__01, v_4, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v_5 > 0 33.05/19.41 eval_counterex1a_12(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb1_in(v__0, v__01, v_4, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v_5 <= 0 33.05/19.41 eval_counterex1a_bb4_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_15(v__0, v__01, v__04, v_4, v_5, v__04 - 1, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_15(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_16(v__0, v__01, v__04, v_4, v_5, v_7, nondef_1, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 eval_counterex1a_16(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb1_in(0, v__01 - 1, v_7, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v_8 > 0 33.05/19.41 eval_counterex1a_16(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb1_in(v__0, v__01 - 1, v_7, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v_8 > 0 && v_8 <= 0 33.05/19.41 eval_counterex1a_16(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb1_in(0, v__01, v_7, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v_8 <= 0 && v_8 > 0 33.05/19.41 eval_counterex1a_16(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_bb1_in(v__0, v__01, v_7, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: v_8 <= 0 33.05/19.41 eval_counterex1a__critedge_in(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y) -> Com_1(eval_counterex1a_stop(v__0, v__01, v__04, v_4, v_5, v_7, v_8, v_b, v_n, v_x, v_y)) :|: TRUE 33.05/19.41 33.05/19.41 The start-symbols are:[eval_counterex1a_start_11] 33.05/19.41 33.05/19.41 33.05/19.41 ---------------------------------------- 33.05/19.41 33.05/19.41 (1) Loat Proof (FINISHED) 33.05/19.41 33.05/19.41 33.05/19.41 ### Pre-processing the ITS problem ### 33.05/19.41 33.05/19.41 33.05/19.41 33.05/19.41 Initial linear ITS problem 33.05/19.41 33.05/19.41 Start location: evalcounterex1astart 33.05/19.41 33.05/19.41 0: evalcounterex1astart -> evalcounterex1abb0in : [], cost: 1 33.05/19.41 33.05/19.41 1: evalcounterex1abb0in -> evalcounterex1a0 : [], cost: 1 33.05/19.41 33.05/19.41 2: evalcounterex1a0 -> evalcounterex1a1 : [], cost: 1 33.05/19.41 33.05/19.41 3: evalcounterex1a1 -> evalcounterex1a2 : [], cost: 1 33.05/19.41 33.05/19.41 4: evalcounterex1a2 -> evalcounterex1a3 : [], cost: 1 33.05/19.41 33.05/19.41 5: evalcounterex1a3 -> evalcounterex1a4 : [], cost: 1 33.05/19.41 33.05/19.41 6: evalcounterex1a4 -> evalcounterex1a5 : [], cost: 1 33.05/19.41 33.05/19.41 7: evalcounterex1a5 -> evalcounterex1a6 : [], cost: 1 33.05/19.41 33.05/19.41 8: evalcounterex1a6 -> evalcounterex1a7 : [], cost: 1 33.05/19.41 33.05/19.41 9: evalcounterex1a7 -> evalcounterex1a8 : [], cost: 1 33.05/19.41 33.05/19.41 10: evalcounterex1a8 -> evalcounterex1a9 : [], cost: 1 33.05/19.41 33.05/19.41 11: evalcounterex1a9 -> evalcounterex1abb1in : A'=B, C'=D, E'=F, [], cost: 1 33.05/19.41 33.05/19.41 12: evalcounterex1abb1in -> evalcounterex1abb2in : [ C>=0 && E>=0 && G>=E ], cost: 1 33.05/19.41 33.05/19.41 13: evalcounterex1abb1in -> evalcounterex1acritedgein : [ 0>=1+C ], cost: 1 33.05/19.41 33.05/19.41 14: evalcounterex1abb1in -> evalcounterex1acritedgein : [ 0>=1+E ], cost: 1 33.05/19.41 33.05/19.41 15: evalcounterex1abb1in -> evalcounterex1acritedgein : [ E>=1+G ], cost: 1 33.05/19.41 33.05/19.41 16: evalcounterex1abb2in -> evalcounterex1abb3in : [ A==0 ], cost: 1 33.05/19.41 33.05/19.41 17: evalcounterex1abb2in -> evalcounterex1abb4in : [ 0>=1+A ], cost: 1 33.05/19.41 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