details

property	value
status	complete
benchmark	cousot9.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n192.star.cs.uiowa.edu
space	WTC

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.26775097847 seconds
cpu usage	5.545148414
max memory	3.2602112E8

stage attributes

key	value
output-size	6905
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, 613 ms] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalcousot9start(A, B, C) -> Com_1(evalcousot9entryin(A, B, C)) :|: TRUE evalcousot9entryin(A, B, C) -> Com_1(evalcousot9bb3in(D, C, C)) :|: TRUE evalcousot9bb3in(A, B, C) -> Com_1(evalcousot9bbin(A, B, C)) :|: B >= 1 evalcousot9bb3in(A, B, C) -> Com_1(evalcousot9returnin(A, B, C)) :|: 0 >= B evalcousot9bbin(A, B, C) -> Com_1(evalcousot9bb1in(A, B, C)) :|: A >= 1 evalcousot9bbin(A, B, C) -> Com_1(evalcousot9bb2in(A, B, C)) :|: 0 >= A evalcousot9bb1in(A, B, C) -> Com_1(evalcousot9bb3in(A - 1, B, C)) :|: TRUE evalcousot9bb2in(A, B, C) -> Com_1(evalcousot9bb3in(C, B - 1, C)) :|: TRUE evalcousot9returnin(A, B, C) -> Com_1(evalcousot9stop(A, B, C)) :|: TRUE The start-symbols are:[evalcousot9start_3] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalcousot9start 0: evalcousot9start -> evalcousot9entryin : [], cost: 1 1: evalcousot9entryin -> evalcousot9bb3in : A'=free, B'=C, [], cost: 1 2: evalcousot9bb3in -> evalcousot9bbin : [ B>=1 ], cost: 1 3: evalcousot9bb3in -> evalcousot9returnin : [ 0>=B ], cost: 1 4: evalcousot9bbin -> evalcousot9bb1in : [ A>=1 ], cost: 1 5: evalcousot9bbin -> evalcousot9bb2in : [ 0>=A ], cost: 1 6: evalcousot9bb1in -> evalcousot9bb3in : A'=-1+A, [], cost: 1 7: evalcousot9bb2in -> evalcousot9bb3in : A'=C, B'=-1+B, [], cost: 1 8: evalcousot9returnin -> evalcousot9stop : [], cost: 1 Removed unreachable and leaf rules: Start location: evalcousot9start 0: evalcousot9start -> evalcousot9entryin : [], cost: 1 1: evalcousot9entryin -> evalcousot9bb3in : A'=free, B'=C, [], cost: 1 2: evalcousot9bb3in -> evalcousot9bbin : [ B>=1 ], cost: 1 4: evalcousot9bbin -> evalcousot9bb1in : [ A>=1 ], cost: 1 5: evalcousot9bbin -> evalcousot9bb2in : [ 0>=A ], cost: 1 6: evalcousot9bb1in -> evalcousot9bb3in : A'=-1+A, [], cost: 1 7: evalcousot9bb2in -> evalcousot9bb3in : A'=C, B'=-1+B, [], cost: 1 ### Simplification by acceleration and chaining ### Eliminated locations (on linear paths): Start location: evalcousot9start 9: evalcousot9start -> evalcousot9bb3in : A'=free, B'=C, [], cost: 2 2: evalcousot9bb3in -> evalcousot9bbin : [ B>=1 ], 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