Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745976
details
property
value
status
complete
benchmark
NoriSharma-FSE2013-Fig8_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n087.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.311652898788 seconds
cpu usage
0.232463597
max memory
8900608.0
stage attributes
key
value
output-size
4872
starexec-result
WORST_CASE(?,O(n^2))
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^2)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/4,eval_foo_bb2_in/4,eval_foo_bb3_in/4,eval_foo_bb4_in/4] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb5_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/4] 5. non_recursive : [eval_foo_start/8] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/4 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_bb0_in/4 5. SCC is partially evaluated into eval_foo_start/8 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/4 * CE 5 is refined into CE [6] * CE 3 is refined into CE [7] * CE 4 is refined into CE [8] ### Cost equations --> "Loop" of eval_foo_bb1_in/4 * CEs [7] --> Loop 6 * CEs [8] --> Loop 7 * CEs [6] --> Loop 8 ### Ranking functions of CR eval_foo_bb1_in(V__04,V__02,V__01,B) * RF of phase [6]: [V__01-1] * RF of phase [7]: [V__04-V__02+1] #### Partial ranking functions of CR eval_foo_bb1_in(V__04,V__02,V__01,B) * Partial RF of phase [6]: - RF of loop [6:1]: V__01-1 * Partial RF of phase [7]: - RF of loop [7:1]: V__04-V__02+1 ### Specialization of cost equations eval_foo_bb0_in/4 * CE 2 is refined into CE [9,10,11] ### Cost equations --> "Loop" of eval_foo_bb0_in/4 * CEs [11] --> Loop 9 * CEs [10] --> Loop 10 * CEs [9] --> Loop 11 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_z,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_z,B) ### Specialization of cost equations eval_foo_start/8 * CE 1 is refined into CE [12,13,14] ### Cost equations --> "Loop" of eval_foo_start/8 * CEs [14] --> Loop 12 * CEs [13] --> Loop 13 * CEs [12] --> Loop 14 ### Ranking functions of CR eval_foo_start(V_c,V_u,V_v,V_w,V_x,V_y,V_z,B) #### Partial ranking functions of CR eval_foo_start(V_c,V_u,V_v,V_w,V_x,V_y,V_z,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__04,V__02,V__01,B): * Chain [[7],8]: 1*it(7)+0 Such that:it(7) =< V__04-V__02+1 with precondition: [B=2,1>=V__01,V__04>=V__02] * Chain [[6],[7],8]: 1*it(6)+1*s(1)+0 Such that:it([[7],8]) =< 1 aux(14) =< V__04-V__02+1 aux(15) =< V__01 it(6) =< aux(15) aux(10) =< aux(15) aux(9) =< it(6)*aux(15) aux(1) =< it(6)*aux(15) aux(11) =< it(6)*aux(10)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445