details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.069137096405 seconds
cpu usage	0.065302496
max memory	5832704.0

stage attributes

key	value
output-size	8087
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l18, true> <l1, l2, ((0 + nodecount^0) <= (0 + i^0))> <l1, l3, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}> <l4, l5, true, par{i^0 -> (1 + i^0)}> <l4, l2, true> <l6, l3, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}> <l6, l4, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef53 = undef53) /\ (undef54 = undef54), par{x^0 -> undef53, y^0 -> undef54}> <l7, l8, true, par{j^0 -> (1 + j^0)}> <l9, l10, ((0 + edgecount^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> <l9, l7, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef80 = undef80) /\ (undef81 = undef81), par{x^0 -> undef80, y^0 -> undef81}> <l11, l5, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}> <l11, l8, ((1 + i^0) <= (0 + nodecount^0)), par{j^0 -> 0}> <l12, l13, true> <l14, l15, true> <l13, l14, true, par{i^0 -> (1 + i^0)}> <l16, l12, ((1 + source^0) <= (0 + i^0))> <l16, l12, ((1 + i^0) <= (0 + source^0))> <l16, l13, ((0 + i^0) <= (0 + source^0)) /\ ((0 + source^0) <= (0 + i^0))> <l15, l10, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}> <l15, l16, ((1 + i^0) <= (0 + nodecount^0))> <l10, l11, true> <l8, l9, true> <l5, l6, true> <l3, l1, true> <l17, l14, true, par{edgecount^0 -> (0 + __const_15^0), i^0 -> 0, nodecount^0 -> (0 + __const_5^0), source^0 -> 0}> <l18, l17, true> Fresh variables: undef53, undef54, undef80, undef81, Undef variables: undef53, undef54, undef80, undef81, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l14, (edgecount^0 = (0 + edgecount^0)) /\ (i^0 = 0) /\ (nodecount^0 = (0 + nodecount^0)) /\ (0 = 0)> <l3, l2, ((0 + nodecount^0) <= (0 + i^0))> <l3, l3, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}> <l5, l3, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}> <l5, l5, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef53 = undef53) /\ (undef54 = undef54), par{i^0 -> (1 + i^0)}> <l5, l2, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef53 = undef53) /\ (undef54 = undef54)> <l8, l5, ((0 + edgecount^0) <= (0 + j^0)) /\ ((0 + nodecount^0) <= (0 + (1 + i^0))), par{i^0 -> 0}> <l8, l8, ((0 + edgecount^0) <= (0 + j^0)) /\ ((1 + (1 + i^0)) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0), j^0 -> 0}> <l8, l8, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef80 = undef80) /\ (undef81 = undef81), par{j^0 -> (1 + j^0)}> <l14, l5, ((0 + nodecount^0) <= (0 + i^0)) /\ ((0 + nodecount^0) <= (0 + 0)), par{i^0 -> 0}> <l14, l8, ((0 + nodecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (0 + nodecount^0)), par{i^0 -> 0, j^0 -> 0}> <l14, l14, ((1 + i^0) <= (0 + nodecount^0)) /\ ((1 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}> <l14, l14, ((1 + i^0) <= (0 + nodecount^0)) /\ ((1 + i^0) <= (0 + 0)), par{i^0 -> (1 + i^0)}> <l14, l14, ((1 + i^0) <= (0 + nodecount^0)) /\ ((0 + i^0) <= (0 + 0)) /\ ((0 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}> Fresh variables: undef53, undef54, undef80, undef81, Undef variables: undef53, undef54, undef80, undef81, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l14, l14, 1 + i^0 <= nodecount^0 /\ 1 <= i^0, {i^0 -> 1 + i^0, 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