Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736524
details
property
value
status
complete
benchmark
NO_04.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n071.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
13.8094120026 seconds
cpu usage
16.024212433
max memory
1.65851136E8
stage attributes
key
value
output-size
18733
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: <l0, l1, true, seq{main__func_return_ -> 0, main_i -> 0}> <l1, l2, true> <l2, l25, not((main_i < 100))> <l2, l3, (main_i < 100)> <l3, l4, true, seq{main_a -> (main_i + 2), main_j -> 0}> <l4, l5, true> <l5, l23, not((main_j < main_a))> <l5, l6, (main_j < main_a)> <l6, l7, true, seq{main_k -> ((main_i + main_j) + 3)}> <l7, l8, true> <l8, l21, not((main_k >= 0))> <l8, l9, (main_k >= 0)> <l9, l10, true, seq{main_b -> (((main_i + main_j) + main_k) + 4), main_l -> 0}> <l10, l11, true> <l11, l19, not((main_l < main_b))> <l11, l12, (main_l < main_b)> <l12, l13, true, seq{main_m -> ((((main_i + main_j) + main_k) + main_l) + 1000)}> <l13, l14, true> <l14, l17, not((main_m >= 0))> <l14, l15, (main_m >= 0)> <l15, l16, true, seq{main_m -> (main_m - 0)}> <l16, l14, true> <l17, l18, true, seq{main_l -> (main_l + 1)}> <l18, l11, true> <l19, l20, true, seq{main_k -> (main_k - 1)}> <l20, l8, true> <l21, l22, true, seq{main_j -> (main_j + 1)}> <l22, l5, true> <l23, l24, true, seq{main_i -> (main_i + 1)}> <l24, l2, true> <l25, l26, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: <l0, l1, true, seq{main__func_return_ -> 0, main_i -> 0}> <l1, l2, true> <l2, l3, (main_i < 100)> <l2, l25, not((main_i < 100))> <l3, l4, true, seq{main_a -> (main_i + 2), main_j -> 0}> <l4, l5, true> <l5, l6, (main_j < main_a)> <l5, l23, not((main_j < main_a))> <l6, l7, true, seq{main_k -> ((main_i + main_j) + 3)}> <l7, l8, true> <l8, l9, (main_k >= 0)> <l8, l21, not((main_k >= 0))> <l9, l10, true, seq{main_b -> (((main_i + main_j) + main_k) + 4), main_l -> 0}> <l10, l11, true> <l11, l12, (main_l < main_b)> <l11, l19, not((main_l < main_b))> <l12, l13, true, seq{main_m -> ((((main_i + main_j) + main_k) + main_l) + 1000)}> <l13, l14, true> <l14, l15, (main_m >= 0)> <l14, l17, not((main_m >= 0))> <l15, l16, true, seq{main_m -> (main_m - 0)}> <l16, l14, true> <l17, l18, true, seq{main_l -> (main_l + 1)}> <l18, l11, true> <l19, l20, true, seq{main_k -> (main_k - 1)}> <l20, l8, true>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257