details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.337886095047 seconds
cpu usage	0.687574124
max memory	1.96358144E8

stage attributes

key	value
output-size	10075
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, l12, true> <l1, l2, ((0 + a^0) <= 0)> <l1, l3, (1 <= (0 + a^0)), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0)}> <l4, l1, true> <l3, l5, true> <l6, l7, true, par{i^0 -> (~(1) + i^0)}> <l7, l8, true> <l9, l6, true, par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0)}> <l10, l6, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0))> <l10, l9, (1 <= (0 + tmp^0))> <l10, l9, ((1 + tmp^0) <= 0)> <l8, l3, ((0 + i^0) <= 0)> <l8, l10, (1 <= (0 + i^0)) /\ (undef60 = undef60), par{tmp^0 -> undef60}> <l5, l4, ((0 + b^0) <= 0)> <l5, l7, (1 <= (0 + b^0)), par{b^0 -> (~(1) + b^0), i^0 -> (~(1) + a^0)}> <l11, l4, true, par{a^0 -> (0 + n^0), b^0 -> 0}> <l12, l11, true> Fresh variables: undef60, Undef variables: undef60, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l4, (a^0 = (0 + n^0)) /\ (b^0 = 0)> <l4, l2, ((0 + a^0) <= 0)> <l4, l4, (1 <= (0 + a^0)) /\ ((0 + (1 + b^0)) <= 0), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0)}> <l4, l7, (1 <= (0 + a^0)) /\ (1 <= (0 + (1 + b^0))), par{a^0 -> (~(1) + a^0), b^0 -> (~(1) + (1 + b^0)), i^0 -> (~(1) + (~(1) + a^0))}> <l7, l4, ((0 + i^0) <= 0) /\ ((0 + b^0) <= 0)> <l7, l7, ((0 + i^0) <= 0) /\ (1 <= (0 + b^0)), par{b^0 -> (~(1) + b^0), i^0 -> (~(1) + a^0)}> <l7, l7, (1 <= (0 + i^0)) /\ (undef60 = undef60) /\ ((0 + undef60) <= 0) /\ (0 <= (0 + undef60)), par{i^0 -> (~(1) + i^0)}> <l7, l7, (1 <= (0 + i^0)) /\ (undef60 = undef60) /\ (1 <= (0 + undef60)), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0), i^0 -> (~(1) + i^0)}> <l7, l7, (1 <= (0 + i^0)) /\ (undef60 = undef60) /\ ((1 + undef60) <= 0), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0), i^0 -> (~(1) + i^0)}> Fresh variables: undef60, Undef variables: undef60, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l4, l4, 1 <= a^0 /\ 1 + b^0 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, rest remain the same}> <l4, l7, 0 <= b^0 /\ 1 <= a^0, {a^0 -> -1 + a^0, i^0 -> -2 + a^0, rest remain the same}> <l7, l4, b^0 <= 0 /\ i^0 <= 0, {all remain the same}> <l7, l7, i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}> <l7, l7, 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}> <l7, l7, 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}> <l7, l7, 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}> Variables: a^0, b^0, i^0 Graph 2: Transitions: Variables: Precedence: popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634