details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0437569618225 seconds
cpu usage	0.040877862
max memory	6709248.0

stage attributes

key	value
output-size	5086
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_i -> 0, main_c -> 0}> <l1, l2, true> <l2, l9, not((main_i < 20))> <l2, l3, (main_i < 20)> <l3, l4, true, seq{main_i -> (main_i + 1)}> <l4, l5, (main_i <= 10)> <l4, l6, not((main_i <= 10))> <l5, l8, true> <l6, l7, true, seq{main_c -> (main_c + 1)}> <l7, l8, true> <l8, l2, true> <l9, l10, 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, main_c -> 0}> <l1, l2, true> <l2, l3, (main_i < 20)> <l2, l9, not((main_i < 20))> <l3, l4, true, seq{main_i -> (main_i + 1)}> <l4, l5, (main_i <= 10)> <l4, l6, not((main_i <= 10))> <l5, l8, true> <l6, l7, true, seq{main_c -> (main_c + 1)}> <l7, l8, true> <l8, l2, true> <l9, l10, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 10, 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 [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> main | function | [integer, ()] | <line: 5, col: 1> i | local variable | integer | <line: 6, col: 2> | <line: 8, col: 2> <line: 10, col: 9> <line: 11, col: 6> <line: 11, col: 10> <line: 12, col: 10> c | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 14, col: 13> <line: 14, col: 17> Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (main_i = 0) /\ (main_c = 0)> popout

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

job log

popout

actions

all output return to C Integ Progr 58257