details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	49.7724840641 seconds
cpu usage	93.983474657
max memory	6.95312384E8

stage attributes

key	value
output-size	68816
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, l18, true> <l1, l2, ((0 + n^0) <= (0 + r^0))> <l1, l3, ((1 + r^0) <= (0 + n^0))> <l4, l1, true, par{c^0 -> (~(1) + c^0)}> <l5, l1, ((0 + f^0) <= 0) /\ (0 <= (0 + f^0))> <l5, l4, (1 <= (0 + f^0))> <l5, l4, ((1 + f^0) <= 0)> <l6, l5, (2 <= (0 + c^0))> <l6, l5, ((1 + c^0) <= 1)> <l6, l7, ((0 + c^0) <= 1) /\ (1 <= (0 + c^0))> <l7, l8, true> <l9, l10, (0 <= (0 + s^0))> <l9, l7, ((1 + s^0) <= 0)> <l11, l9, true, par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}> <l12, l11, (1 <= (0 + f^0))> <l12, l11, ((1 + f^0) <= 0)> <l12, l11, ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)), par{c^0 -> (~(1) + c^0), f^0 -> 1}> <l10, l6, (undef100 = undef100), par{n^0 -> undef100}> <l13, l11, (3 <= (0 + d^0))> <l13, l11, ((1 + d^0) <= 2)> <l13, l12, ((0 + d^0) <= 2) /\ (2 <= (0 + d^0))> <l2, l7, ((0 + r^0) <= (0 + n^0))> <l2, l13, ((1 + n^0) <= (0 + r^0))> <l14, l10, ((0 + s^0) <= 255)> <l14, l7, (256 <= (0 + s^0))> <l15, l14, true, par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}> <l16, l15, (1 <= (0 + f^0))> <l16, l15, ((1 + f^0) <= 0)> <l16, l15, ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)), par{c^0 -> (~(1) + c^0), f^0 -> 1}> <l3, l15, (2 <= (0 + d^0))> <l3, l15, ((1 + d^0) <= 1)> <l3, l16, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0))> <l17, l10, true, par{c^0 -> 4, d^0 -> 0, f^0 -> 0}> <l18, l17, true> Fresh variables: undef100, Undef variables: undef100, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l10, (c^0 = 4) /\ (d^0 = 0) /\ (f^0 = 0)> <l3, l10, (2 <= (0 + d^0)) /\ ((0 + ((0 + c^0) + s^0)) <= 255), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}> <l3, l8, (2 <= (0 + d^0)) /\ (256 <= (0 + ((0 + c^0) + s^0))), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}> <l3, l10, ((1 + d^0) <= 1) /\ ((0 + ((0 + c^0) + s^0)) <= 255), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}> <l3, l8, ((1 + d^0) <= 1) /\ (256 <= (0 + ((0 + c^0) + s^0))), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}> <l3, l10, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ (1 <= (0 + f^0)) /\ ((0 + ((0 + c^0) + s^0)) <= 255), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}> <l3, l8, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ (1 <= (0 + f^0)) /\ (256 <= (0 + ((0 + c^0) + s^0))), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}> <l3, l10, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ ((1 + f^0) <= 0) /\ ((0 + ((0 + c^0) + s^0)) <= 255), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}> <l3, l8, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ ((1 + f^0) <= 0) /\ (256 <= (0 + ((0 + c^0) + s^0))), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}> <l3, l10, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((0 + ((0 + (~(1) + c^0)) + s^0)) <= 255), par{c^0 -> (~(1) + c^0), d^0 -> 2, f^0 -> 1, s^0 -> ((0 + (~(1) + c^0)) + s^0)}> <l3, l8, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ (256 <= (0 + ((0 + (~(1) + c^0)) + s^0))), par{c^0 -> (~(1) + c^0), d^0 -> 2, f^0 -> 1, s^0 -> ((0 + (~(1) + c^0)) + s^0)}> <l10, l8, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100))> <l10, l13, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0))> <l10, l3, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((1 + r^0) <= (0 + undef100))> <l10, l8, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ (1 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}> <l10, l13, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ (1 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0)), par{c^0 -> (~(1) + c^0)}> <l10, l3, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ (1 <= (0 + f^0)) /\ ((1 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}> <l10, l8, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((1 + f^0) <= 0) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}> <l10, l13, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((1 + f^0) <= 0) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0)), par{c^0 -> (~(1) + c^0)}> <l10, l3, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((1 + f^0) <= 0) /\ ((1 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}> <l10, l8, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100))> <l10, l13, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0))> <l10, l3, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((1 + r^0) <= (0 + undef100))> <l10, l8, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ (1 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}> <l10, l13, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ (1 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0)), par{c^0 -> (~(1) + c^0)}> <l10, l3, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ (1 <= (0 + f^0)) /\ ((1 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}> <l10, l8, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((1 + f^0) <= 0) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}> <l10, l13, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((1 + f^0) <= 0) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0)), par{c^0 -> (~(1) + c^0)}> <l10, l3, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((1 + f^0) <= 0) /\ ((1 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}> <l10, l8, (undef100 = undef100) /\ ((0 + c^0) <= 1) /\ (1 <= (0 + c^0))> <l13, l10, (3 <= (0 + d^0)) /\ (0 <= (0 + ((0 + (~(1) * c^0)) + s^0))), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}> <l13, l8, (3 <= (0 + d^0)) /\ ((1 + ((0 + (~(1) * c^0)) + s^0)) <= 0), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}> <l13, l10, ((1 + d^0) <= 2) /\ (0 <= (0 + ((0 + (~(1) * c^0)) + s^0))), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}> <l13, l8, ((1 + d^0) <= 2) /\ ((1 + ((0 + (~(1) * c^0)) + s^0)) <= 0), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}> popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634