details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	25.2071778774 seconds
cpu usage	56.130263046
max memory	4.3900928E8

stage attributes

key	value
output-size	10506
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 -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int)}> <l1, l2, true> <l2, l3, (main_i < main_j)> <l2, l5, not((main_i < main_j))> <l3, l4, true, seq{main_i -> (main_i + 4)}> <l4, l7, true> <l5, l6, true, seq{main_j -> (main_j + 1), main_i -> (main_i + 2)}> <l6, l7, true> <l7, l2, true> 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, l8, true, seq{main__func_return_ -> 0}> <l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l9, l10, true, seq{main_i -> varCall_1}> <l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> <l11, l1, true, seq{main_j -> varCall_2}> <l1, l2, true> <l2, l3, (main_i < main_j)> <l2, l5, not((main_i < main_j))> <l3, l4, true, seq{main_i -> (main_i + 4)}> <l4, l7, true> <l5, l6, true, seq{main_j -> (main_j + 1), main_i -> (main_i + 2)}> <l6, l7, true> <l7, l2, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int 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> | <line: 8, col: 9> <line: 9, col: 9> main | function | [integer, ()] | <line: 5, col: 1> i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 12, col: 13> <line: 13, col: 13> <line: 13, col: 17> <line: 16, col: 13> <line: 16, col: 17> j | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 12, col: 17> <line: 15, col: 13> <line: 15, col: 17> Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (main_i = undef3) /\ (main_j = undef4)> popout

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

job log

popout

actions

all output return to C Integ Progr 58257