details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.25803303719 seconds
cpu usage	8.24601905
max memory	3.951616E8

stage attributes

key	value
output-size	16042
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 1559 ms] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_real2_start(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb0_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_bb0_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_0(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_0(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_1(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_1(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_2(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_2(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_3(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_3(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_4(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_4(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_5(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_5(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_6(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_6(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_7(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_7(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_8(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_8(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb1_in(1, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE eval_real2_bb1_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb2_in(v_again_0, 0, v_again_2, 0, v_len)) :|: v_again_0 < 0 eval_real2_bb1_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb2_in(v_again_0, 0, v_again_2, 0, v_len)) :|: v_again_0 > 0 eval_real2_bb1_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb6_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: v_again_0 >= 0 && v_again_0 <= 0 eval_real2_bb2_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb3_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: v_i_0 < v_len - 1 eval_real2_bb2_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb1_in(v_again_1, v_again_1, v_again_2, v_i_0, v_len)) :|: v_i_0 >= v_len - 1 eval_real2_bb3_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb4_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: nondef_0 > nondef_1 eval_real2_bb3_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb5_in(v_again_0, v_again_1, v_again_1, v_i_0, v_len)) :|: nondef_0 <= nondef_1 eval_real2_bb4_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb5_in(v_again_0, v_again_1, 1, v_i_0, v_len)) :|: TRUE eval_real2_bb5_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_bb2_in(v_again_0, v_again_2, v_again_2, v_i_0 + 1, v_len)) :|: TRUE eval_real2_bb6_in(v_again_0, v_again_1, v_again_2, v_i_0, v_len) -> Com_1(eval_real2_stop(v_again_0, v_again_1, v_again_2, v_i_0, v_len)) :|: TRUE The start-symbols are:[eval_real2_start_5] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalreal2start 0: evalreal2start -> evalreal2bb0in : [], cost: 1 1: evalreal2bb0in -> evalreal20 : [], cost: 1 2: evalreal20 -> evalreal21 : [], cost: 1 3: evalreal21 -> evalreal22 : [], cost: 1 4: evalreal22 -> evalreal23 : [], cost: 1 5: evalreal23 -> evalreal24 : [], cost: 1 6: evalreal24 -> evalreal25 : [], cost: 1 7: evalreal25 -> evalreal26 : [], cost: 1 8: evalreal26 -> evalreal27 : [], cost: 1 9: evalreal27 -> evalreal28 : [], cost: 1 10: evalreal28 -> evalreal2bb1in : A'=1, [], cost: 1 11: evalreal2bb1in -> evalreal2bb2in : B'=0, C'=0, [ 0>=1+A ], cost: 1 12: evalreal2bb1in -> evalreal2bb2in : B'=0, C'=0, [ A>=1 ], cost: 1 13: evalreal2bb1in -> evalreal2bb6in : [ A==0 ], cost: 1 14: evalreal2bb2in -> evalreal2bb3in : [ D>=2+C ], cost: 1 15: evalreal2bb2in -> evalreal2bb1in : A'=B, [ 1+C>=D ], cost: 1 16: evalreal2bb3in -> evalreal2bb4in : [ free>=1+free_1 ], cost: 1 17: evalreal2bb3in -> evalreal2bb5in : E'=B, [ free_3>=free_2 ], cost: 1 18: evalreal2bb4in -> evalreal2bb5in : E'=1, [], cost: 1 19: evalreal2bb5in -> evalreal2bb2in : B'=E, C'=1+C, [], cost: 1 popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843