Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745956
details
property
value
status
complete
benchmark
NO_01.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.197779178619 seconds
cpu usage
0.116566532
max memory
8204288.0
stage attributes
key
value
output-size
2890
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb10_in/2,eval_foo_bb9_in/2] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb11_in/1] 3. non_recursive : [eval_foo_bb9_in_loop_cont/2] 4. non_recursive : [eval_foo_bb6_in/1] 5. non_recursive : [eval_foo_bb3_in/1] 6. non_recursive : [eval_foo_bb0_in/1] 7. non_recursive : [eval_foo_start/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb9_in/2 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is partially evaluated into eval_foo_bb6_in/1 5. SCC is completely evaluated into other SCCs 6. SCC is completely evaluated into other SCCs 7. SCC is partially evaluated into eval_foo_start/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb9_in/2 * CE 4 is discarded (unfeasible) * CE 3 is refined into CE [5] ### Cost equations --> "Loop" of eval_foo_bb9_in/2 * CEs [5] --> Loop 5 ### Ranking functions of CR eval_foo_bb9_in(V__3,B) #### Partial ranking functions of CR eval_foo_bb9_in(V__3,B) Warning: no base case found for predicate ### Specialization of cost equations eval_foo_bb6_in/1 * CE 2 is refined into CE [6] ### Cost equations --> "Loop" of eval_foo_bb6_in/1 * CEs [6] --> Loop 6 ### Ranking functions of CR eval_foo_bb6_in(B) #### Partial ranking functions of CR eval_foo_bb6_in(B) Warning: no base case found for predicate ### Specialization of cost equations eval_foo_start/3 * CE 1 is refined into CE [7] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [7] --> Loop 7 ### Ranking functions of CR eval_foo_start(V_c,V_i,B) #### Partial ranking functions of CR eval_foo_start(V_c,V_i,B) Warning: no base case found for predicate Computing Bounds ===================================== #### Cost of chains of eval_foo_bb9_in(V__3,B): * Chain [[5]]...: 1*it(5)+0 with precondition: [V__3=0,B=2] #### Cost of chains of eval_foo_bb6_in(B): * Chain [6]...: 1*s(1)+0 with precondition: [] #### Cost of chains of eval_foo_start(V_c,V_i,B): * Chain [7]...: 1*s(2)+0 with precondition: [] Closed-form bounds of eval_foo_start(V_c,V_i,B): ------------------------------------- * Chain [7]... with precondition: [] - Upper bound: inf - Complexity: infinity ### Maximum cost of eval_foo_start(V_c,V_i,B): inf Asymptotic class: infinity
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445