Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744658
details
property
value
status
complete
benchmark
refine_disj_problem.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
1.92285108566 seconds
cpu usage
4.336836627
max memory
3.17313024E8
stage attributes
key
value
output-size
2979
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, 165 ms] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: f1(A, B) -> Com_1(f0(A, B)) :|: TRUE f0(A, B) -> Com_1(f0(A + B, B)) :|: A >= 1 && B >= 1 f0(A, B) -> Com_1(f0(A + B, B)) :|: A >= 1 && 0 >= B + 1 The start-symbols are:[f1_2] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: f1 0: f1 -> f0 : [], cost: 1 1: f0 -> f0 : A'=A+B, [ A>=1 && B>=1 ], cost: 1 2: f0 -> f0 : A'=A+B, [ A>=1 && 0>=1+B ], cost: 1 ### Simplification by acceleration and chaining ### Accelerating simple loops of location 1. Accelerating the following rules: 1: f0 -> f0 : A'=A+B, [ A>=1 && B>=1 ], cost: 1 2: f0 -> f0 : A'=A+B, [ A>=1 && 0>=1+B ], cost: 1 Accelerated rule 1 with NONTERM, yielding the new rule 3. Accelerated rule 2 with backward acceleration, yielding the new rule 4. Removing the simple loops: 1 2. Accelerated all simple loops using metering functions (where possible): Start location: f1 0: f1 -> f0 : [], cost: 1 3: f0 -> [2] : [ A>=1 && B>=1 ], cost: INF 4: f0 -> f0 : A'=k*B+A, [ A>=1 && 0>=1+B && k>0 && (-1+k)*B+A>=1 ], cost: k Chained accelerated rules (with incoming rules): Start location: f1 0: f1 -> f0 : [], cost: 1 5: f1 -> [2] : [ A>=1 && B>=1 ], cost: INF 6: f1 -> f0 : A'=k*B+A, [ A>=1 && 0>=1+B && k>0 && (-1+k)*B+A>=1 ], cost: 1+k Removed unreachable locations (and leaf rules with constant cost): Start location: f1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843