Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736029
details
property
value
status
complete
benchmark
ComplxStruc.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n005.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
27.2575950623 seconds
cpu usage
60.669383326
max memory
7.22866176E8
stage attributes
key
value
output-size
29604
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/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 -> ¿functionCall(__VERIFIER_nondet_int), main_j -> main_i}> <l1, l2, true> <l2, l34, not((main_i > 0))> <l2, l3, (main_i > 0)> <l3, l4, (main_i >= main_j)> <l3, l16, not((main_i >= main_j))> <l4, l5, true, seq{main_i -> (main_i + 1)}> <l5, l6, (main_j < 5)> <l5, l13, not((main_j < 5))> <l6, l7, true, seq{main_j -> (main_j + 1)}> <l7, l8, ((main_i - main_j) > 2)> <l7, l10, not(((main_i - main_j) > 2))> <l8, l9, true, seq{main_i -> (main_i + 1)}> <l9, l12, true> <l10, l11, true, seq{main_j -> (main_j + 1)}> <l11, l12, true> <l12, l15, true> <l13, l14, true, seq{main_j -> (main_j - 1)}> <l14, l15, true> <l15, l33, true> <l16, l25, not((main_i > 0))> <l16, l17, (main_i > 0)> <l17, l18, (main_j < 0)> <l17, l25, not((main_j < 0))> <l18, l19, true, seq{main_i -> (main_i - 1)}> <l19, l20, (main_j < ~(1))> <l19, l22, not((main_j < ~(1)))> <l20, l21, true, seq{main_j -> (main_j + 1)}> <l21, l24, true> <l22, l23, true, seq{main_i -> (main_i + 1)}> <l23, l24, true> <l24, l32, true> <l25, l26, true, seq{main_i -> (main_i + 1)}> <l26, l27, ((main_j * 2) > main_i)> <l26, l29, not(((main_j * 2) > main_i))> <l27, l28, true, seq{main_j -> (main_j - 1)}> <l28, l31, true> <l29, l30, true, seq{main_j -> (main_j + 1)}> <l30, l31, true> <l31, l32, true> <l32, l33, true> <l33, l2, true> <l34, l35, 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, l36, true, seq{main__func_return_ -> 0}> <l36, l37, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l37, l1, true, seq{main_i -> varCall_1, main_j -> main_i}> <l1, l2, true> <l2, l3, (main_i > 0)> <l2, l34, not((main_i > 0))> <l3, l4, (main_i >= main_j)> <l3, l16, not((main_i >= main_j))> <l4, l5, true, seq{main_i -> (main_i + 1)}> <l5, l6, (main_j < 5)> <l5, l13, not((main_j < 5))> <l6, l7, true, seq{main_j -> (main_j + 1)}> <l7, l8, ((main_i - main_j) > 2)> <l7, l10, not(((main_i - main_j) > 2))>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257