details

property	value
status	complete
benchmark	Marbie2.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n034.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.123355150223 seconds
cpu usage	0.092983998
max memory	8081408.0

stage attributes

key	value
output-size	2016
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 Warning: Ignored call to eval_foo_bb1_in_loop_cont/2 in equation eval_foo_bb0_in/1 Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/1] 1. non_recursive : [eval_foo_bb0_in/1] 2. non_recursive : [eval_foo_start/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/1 1. SCC is completely evaluated into other SCCs 2. SCC is partially evaluated into eval_foo_start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/1 * CE 2 is refined into CE [3] ### Cost equations --> "Loop" of eval_foo_bb1_in/1 * CEs [3] --> Loop 3 ### Ranking functions of CR eval_foo_bb1_in(B) #### Partial ranking functions of CR eval_foo_bb1_in(B) Warning: no base case found for predicate ### Specialization of cost equations eval_foo_start/2 * CE 1 is refined into CE [4] ### Cost equations --> "Loop" of eval_foo_start/2 * CEs [4] --> Loop 4 ### Ranking functions of CR eval_foo_start(V_i,B) #### Partial ranking functions of CR eval_foo_start(V_i,B) Warning: no base case found for predicate Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(B): * Chain [[3]]...: 1*it(3)+0 with precondition: [] #### Cost of chains of eval_foo_start(V_i,B): * Chain [4]...: 1*s(1)+0 with precondition: [] Closed-form bounds of eval_foo_start(V_i,B): ------------------------------------- * Chain [4]... with precondition: [] - Upper bound: inf - Complexity: infinity ### Maximum cost of eval_foo_start(V_i,B): inf Asymptotic class: infinity * Total analysis performed in 8 ms. popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445