details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.7084710598 seconds
cpu usage	3.703820688
max memory	2.99466752E8

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox/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, 131 ms] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: f0(A, B) -> Com_1(f1(A, B)) :|: A >= 1 && 0 >= B + 1 f1(A, B) -> Com_1(f1(A - B, B)) :|: A >= B + 1 && 0 >= B + 1 The start-symbols are:[f0_2] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: f0 0: f0 -> f1 : [ A>=1 && 0>=1+B ], cost: 1 1: f1 -> f1 : A'=A-B, [ A>=1+B && 0>=1+B ], cost: 1 ### Simplification by acceleration and chaining ### Accelerating simple loops of location 1. Accelerating the following rules: 1: f1 -> f1 : A'=A-B, [ A>=1+B && 0>=1+B ], cost: 1 Accelerated rule 1 with NONTERM, yielding the new rule 2. Removing the simple loops: 1. Accelerated all simple loops using metering functions (where possible): Start location: f0 0: f0 -> f1 : [ A>=1 && 0>=1+B ], cost: 1 2: f1 -> [2] : [ A>=1+B && 0>=1+B ], cost: INF Chained accelerated rules (with incoming rules): Start location: f0 0: f0 -> f1 : [ A>=1 && 0>=1+B ], cost: 1 3: f0 -> [2] : [ A>=1 && 0>=1+B && A>=1+B ], cost: INF Removed unreachable locations (and leaf rules with constant cost): Start location: f0 3: f0 -> [2] : [ A>=1 && 0>=1+B && A>=1+B ], cost: INF ### Computing asymptotic complexity ### Fully simplified ITS problem popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843