Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736818
details
property
value
status
complete
benchmark
svcomp_fermat.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
4.1716439724 seconds
cpu usage
4.167753573
max memory
2.4670208E8
stage attributes
key
value
output-size
7688
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES 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_MAX -> 1000, main_a -> 1, main_b -> 1, main_c -> 1}> <l1, l2, true> <l2, l12, (((main_a * main_a) * main_a) = (((main_b * main_b) * main_b) + ((main_c * main_c) * main_c)))> <l2, l3, not((((main_a * main_a) * main_a) = (((main_b * main_b) * main_b) + ((main_c * main_c) * main_c))))> <l3, l12, not((main_c <= main_MAX))> <l3, l4, (main_c <= main_MAX)> <l4, l5, true, seq{main_a -> (main_a + 1)}> <l5, l6, (main_a > main_MAX)> <l5, l8, not((main_a > main_MAX))> <l6, l7, true, seq{main_a -> 1, main_b -> (main_b + 1)}> <l7, l8, true> <l8, l9, (main_b > main_MAX)> <l8, l11, not((main_b > main_MAX))> <l9, l10, true, seq{main_b -> 1, main_c -> (main_c + 1)}> <l10, l11, true> <l11, l2, true> <l12, l13, 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_MAX -> 1000, main_a -> 1, main_b -> 1, main_c -> 1}> <l1, l2, true> <l2, l12, (((main_a * main_a) * main_a) = (((main_b * main_b) * main_b) + ((main_c * main_c) * main_c)))> <l2, l3, not((((main_a * main_a) * main_a) = (((main_b * main_b) * main_b) + ((main_c * main_c) * main_c))))> <l3, l4, (main_c <= main_MAX)> <l3, l12, not((main_c <= main_MAX))> <l4, l5, true, seq{main_a -> (main_a + 1)}> <l5, l6, (main_a > main_MAX)> <l5, l8, not((main_a > main_MAX))> <l6, l7, true, seq{main_a -> 1, main_b -> (main_b + 1)}> <l7, l8, true> <l8, l9, (main_b > main_MAX)> <l8, l11, not((main_b > main_MAX))> <l9, l10, true, seq{main_b -> 1, main_c -> (main_c + 1)}> <l10, l11, true> <l11, l2, true> <l12, l13, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 13, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [1 functions]: function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [6 idents]:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257