Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381745355
details
property
value
status
complete
benchmark
heidy10.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n092.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.204725027084 seconds
cpu usage
0.117259349
max memory
8433664.0
stage attributes
key
value
output-size
2086
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f2/3] 1. non_recursive : [exit_location/1] 2. non_recursive : [f2_loop_cont/2] 3. non_recursive : [f0/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f2/3 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into f0/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f2/3 * CE 4 is refined into CE [5] * CE 3 is refined into CE [6] * CE 2 is refined into CE [7] ### Cost equations --> "Loop" of f2/3 * CEs [6] --> Loop 5 * CEs [7] --> Loop 6 * CEs [5] --> Loop 7 ### Ranking functions of CR f2(A,B,D) #### Partial ranking functions of CR f2(A,B,D) * Partial RF of phase [5,6]: - RF of loop [5:1]: B - RF of loop [6:1]: A depends on loops [5:1] ### Specialization of cost equations f0/3 * CE 1 is refined into CE [8] ### Cost equations --> "Loop" of f0/3 * CEs [8] --> Loop 8 ### Ranking functions of CR f0(A,B,D) #### Partial ranking functions of CR f0(A,B,D) Computing Bounds ===================================== #### Cost of chains of f2(A,B,D): * Chain [[5,6],7]: 1*it(5)+1*it(6)+0 Such that:it(5) =< B with precondition: [D=2,B>=0] * Chain [7]: 0 with precondition: [D=2,B>=0] #### Cost of chains of f0(A,B,D): * Chain [8]: 1*s(3)+1*s(4)+0 Such that:s(3) =< B with precondition: [B>=1] Closed-form bounds of f0(A,B,D): ------------------------------------- * Chain [8] with precondition: [B>=1] - Upper bound: inf - Complexity: infinity ### Maximum cost of f0(A,B,D): inf Asymptotic class: infinity * Total analysis performed in 41 ms.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843