details

property	value
status	complete
benchmark	java_Break.c.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n026.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0408599376678 seconds
cpu usage	0.031188826
max memory	4272128.0

stage attributes

key	value
output-size	4764
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l7, true> <l1, l2, (undef2 = (0 + x0^0)), par{oldX0^0 -> undef2, x0^0 -> (1 + undef2)}> <l3, l4, (undef7 = undef7), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef7, x0^0 -> (0 + undef7)}> <l2, l1, (undef10 = (0 + x0^0)) /\ ((0 + undef10) <= (0 + __const_10^0)), par{oldX0^0 -> undef10, x0^0 -> (0 + undef10)}> <l2, l3, (undef14 = (0 + x0^0)) /\ ((1 + __const_10^0) <= (0 + undef14)), par{oldX0^0 -> undef14, x0^0 -> (0 + undef14)}> <l5, l2, true, par{oldX0^0 -> (0 + x0^0), x0^0 -> 0}> <l6, l5, (undef23 = undef23), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef23, x0^0 -> (0 + undef23)}> <l6, l4, true> <l6, l1, true> <l6, l3, true> <l6, l2, true> <l6, l5, true> <l7, l6, true> Fresh variables: undef2, undef7, undef10, undef14, undef23, Undef variables: undef2, undef7, undef10, undef14, undef23, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (undef23 = undef23) /\ (undef10 = (0 + 0)) /\ ((0 + undef10) <= (0 + __const_10^0)), par{x0^0 -> (0 + undef10)}> <l0, l4, (undef23 = undef23) /\ (undef14 = (0 + 0)) /\ ((1 + __const_10^0) <= (0 + undef14)) /\ (undef7 = undef7), par{x0^0 -> (0 + undef7)}> <l0, l4, true> <l0, l1, true> <l0, l4, (undef7 = undef7), par{x0^0 -> (0 + undef7)}> <l0, l1, (undef10 = (0 + x0^0)) /\ ((0 + undef10) <= (0 + __const_10^0)), par{x0^0 -> (0 + undef10)}> <l0, l4, (undef14 = (0 + x0^0)) /\ ((1 + __const_10^0) <= (0 + undef14)) /\ (undef7 = undef7), par{x0^0 -> (0 + undef7)}> <l0, l1, (undef10 = (0 + 0)) /\ ((0 + undef10) <= (0 + __const_10^0)), par{x0^0 -> (0 + undef10)}> <l0, l4, (undef14 = (0 + 0)) /\ ((1 + __const_10^0) <= (0 + undef14)) /\ (undef7 = undef7), par{x0^0 -> (0 + undef7)}> <l1, l1, (undef2 = (0 + x0^0)) /\ (undef10 = (0 + (1 + undef2))) /\ ((0 + undef10) <= (0 + __const_10^0)), par{x0^0 -> (0 + undef10)}> <l1, l4, (undef2 = (0 + x0^0)) /\ (undef14 = (0 + (1 + undef2))) /\ ((1 + __const_10^0) <= (0 + undef14)) /\ (undef7 = undef7), par{x0^0 -> (0 + undef7)}> Fresh variables: undef2, undef7, undef10, undef14, undef23, Undef variables: undef2, undef7, undef10, undef14, undef23, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, undef10 <= __const_10^0 /\ x0^0 = undef2 /\ 1 + undef2 = undef10, {x0^0 -> undef10, rest remain the same}> Variables: __const_10^0, x0^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l1, undef10 <= __const_10^0 /\ undef10 = 0, {x0^0 -> undef10, rest remain the same}> <l0, l1, true, {all remain the same}> <l0, l1, undef10 <= __const_10^0 /\ x0^0 = undef10, {x0^0 -> undef10, rest remain the same}> <l0, l1, undef10 <= __const_10^0 /\ undef10 = 0, {x0^0 -> undef10, rest remain the same}> popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634