details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	2.60487818718 seconds
cpu usage	2.541491524
max memory	1.4237696E7

stage attributes

key	value
output-size	28369
starexec-result	WORST_CASE(?,O(n^4))

output

/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^4)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_ApplyBndRobin_bb12_in/4,eval_ApplyBndRobin_bb13_in/4] 1. recursive : [eval_ApplyBndRobin_10/7,eval_ApplyBndRobin_7/6,eval_ApplyBndRobin_8/7,eval_ApplyBndRobin_9/6,eval_ApplyBndRobin_bb10_in/6,eval_ApplyBndRobin_bb11_in/9,eval_ApplyBndRobin_bb12_in_loop_cont/11,eval_ApplyBndRobin_bb14_in/10,eval_ApplyBndRobin_bb7_in/6,eval_ApplyBndRobin_bb8_in/6,eval_ApplyBndRobin_bb9_in/6] 2. recursive : [eval_ApplyBndRobin_2/6,eval_ApplyBndRobin_3/7,eval_ApplyBndRobin_4/6,eval_ApplyBndRobin_5/7,eval_ApplyBndRobin_bb15_in/10,eval_ApplyBndRobin_bb2_in/6,eval_ApplyBndRobin_bb3_in/6,eval_ApplyBndRobin_bb4_in/6,eval_ApplyBndRobin_bb5_in/6,eval_ApplyBndRobin_bb6_in/9,eval_ApplyBndRobin_bb7_in_loop_cont/11] 3. recursive : [eval_ApplyBndRobin_bb16_in/8,eval_ApplyBndRobin_bb1_in/7,eval_ApplyBndRobin_bb2_in_loop_cont/9] 4. non_recursive : [eval_ApplyBndRobin_stop/1] 5. non_recursive : [eval_ApplyBndRobin_bb17_in/1] 6. non_recursive : [eval_ApplyBndRobin_bb1_in_loop_cont/2] 7. non_recursive : [eval_ApplyBndRobin_bb0_in/6] 8. non_recursive : [eval_ApplyBndRobin_start/6] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_ApplyBndRobin_bb12_in/4 1. SCC is partially evaluated into eval_ApplyBndRobin_bb7_in/6 2. SCC is partially evaluated into eval_ApplyBndRobin_bb2_in/6 3. SCC is partially evaluated into eval_ApplyBndRobin_bb1_in/7 4. SCC is completely evaluated into other SCCs 5. SCC is completely evaluated into other SCCs 6. SCC is completely evaluated into other SCCs 7. SCC is partially evaluated into eval_ApplyBndRobin_bb0_in/6 8. SCC is partially evaluated into eval_ApplyBndRobin_start/6 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_ApplyBndRobin_bb12_in/4 * CE 21 is refined into CE [22] * CE 20 is refined into CE [23] ### Cost equations --> "Loop" of eval_ApplyBndRobin_bb12_in/4 * CEs [23] --> Loop 18 * CEs [22] --> Loop 19 ### Ranking functions of CR eval_ApplyBndRobin_bb12_in(V_GH_cctk_lsh_0,V_i_0,B,C) * RF of phase [18]: [V_GH_cctk_lsh_0-V_i_0-1] #### Partial ranking functions of CR eval_ApplyBndRobin_bb12_in(V_GH_cctk_lsh_0,V_i_0,B,C) * Partial RF of phase [18]: - RF of loop [18:1]: V_GH_cctk_lsh_0-V_i_0-1 ### Specialization of cost equations eval_ApplyBndRobin_bb7_in/6 * CE 19 is refined into CE [24] * CE 17 is refined into CE [25,26] * CE 18 is discarded (unfeasible) * CE 16 is refined into CE [27,28] * CE 14 is refined into CE [29] * CE 15 is discarded (unfeasible) * CE 13 is refined into CE [30] ### Cost equations --> "Loop" of eval_ApplyBndRobin_bb7_in/6 * CEs [25] --> Loop 20 * CEs [26] --> Loop 21 * CEs [27] --> Loop 22 * CEs [28] --> Loop 23 * CEs [29] --> Loop 24 * CEs [30] --> Loop 25 * CEs [24] --> Loop 26 ### Ranking functions of CR eval_ApplyBndRobin_bb7_in(V_GH_cctk_lsh_0,V_GH_cctk_lsh_1,V_dz_1,V_j_0,B,C) * RF of phase [20,21,24]: [V_GH_cctk_lsh_1-V_j_0] #### Partial ranking functions of CR eval_ApplyBndRobin_bb7_in(V_GH_cctk_lsh_0,V_GH_cctk_lsh_1,V_dz_1,V_j_0,B,C) * Partial RF of phase [20,21,24]: - RF of loop [20:1,21:1,24:1]: V_GH_cctk_lsh_1-V_j_0 ### Specialization of cost equations eval_ApplyBndRobin_bb2_in/6 * CE 12 is refined into CE [31] * CE 7 is refined into CE [32,33,34,35,36,37,38] * CE 10 is refined into CE [39,40,41,42,43] * CE 6 is discarded (unfeasible) * CE 9 is discarded (unfeasible) * CE 5 is refined into CE [44,45,46,47,48] * CE 8 is refined into CE [49,50,51,52,53,54,55] * CE 11 is refined into CE [56,57,58,59,60] ### Cost equations --> "Loop" of eval_ApplyBndRobin_bb2_in/6 * CEs [35] --> Loop 27 * CEs [37,42] --> Loop 28 * CEs [38,43] --> Loop 29 * CEs [36,41] --> Loop 30 * CEs [52] --> Loop 31 * CEs [47,54,59] --> Loop 32 popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445