details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	1.23666191101 seconds
cpu usage	3.566615509
max memory	1.69181184E8

stage attributes

key	value
output-size	9855
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, l7, true> <l1, l2, (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef4, oldX4^0 -> undef5, oldX5^0 -> undef6, x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}> <l3, l4, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)), par{oldX0^0 -> undef10, oldX1^0 -> undef11, oldX2^0 -> undef12, x0^0 -> (1 + undef10), x1^0 -> (0 + undef12), x2^0 -> (~(1) + undef11)}> <l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ ((0 + undef20) <= 0), par{oldX0^0 -> undef19, oldX1^0 -> undef20, oldX2^0 -> undef21, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20), x2^0 -> (0 + undef21)}> <l4, l3, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ (1 <= (0 + undef29)), par{oldX0^0 -> undef28, oldX1^0 -> undef29, oldX2^0 -> undef30, x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> <l5, l4, (undef40 = undef40) /\ (undef41 = undef41), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef40, oldX4^0 -> undef41, x0^0 -> 0, x1^0 -> (0 + undef40), x2^0 -> (0 + undef41)}> <l6, l5, (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef49, oldX4^0 -> undef50, oldX5^0 -> undef51, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}> <l6, l2, true> <l6, l1, true> <l6, l3, true> <l6, l4, true> <l6, l5, true> <l7, l6, true> Fresh variables: undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, Undef variables: undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef19 = (0 + 0)) /\ (undef20 = (0 + (0 + undef40))) /\ (undef21 = (0 + (0 + undef41))) /\ ((0 + undef20) <= 0) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}> <l0, l3, (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef28 = (0 + 0)) /\ (undef29 = (0 + (0 + undef40))) /\ (undef30 = (0 + (0 + undef41))) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> <l0, l2, true> <l0, l2, (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}> <l0, l3, true> <l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ ((0 + undef20) <= 0) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}> <l0, l3, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> <l0, l2, (undef40 = undef40) /\ (undef41 = undef41) /\ (undef19 = (0 + 0)) /\ (undef20 = (0 + (0 + undef40))) /\ (undef21 = (0 + (0 + undef41))) /\ ((0 + undef20) <= 0) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}> <l0, l3, (undef40 = undef40) /\ (undef41 = undef41) /\ (undef28 = (0 + 0)) /\ (undef29 = (0 + (0 + undef40))) /\ (undef30 = (0 + (0 + undef41))) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> <l3, l2, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)) /\ (undef19 = (0 + (1 + undef10))) /\ (undef20 = (0 + (0 + undef12))) /\ (undef21 = (0 + (~(1) + undef11))) /\ ((0 + undef20) <= 0) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}> <l3, l3, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)) /\ (undef28 = (0 + (1 + undef10))) /\ (undef29 = (0 + (0 + undef12))) /\ (undef30 = (0 + (~(1) + undef11))) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> Fresh variables: undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, Undef variables: undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 1 <= undef29 /\ x0^0 = undef10 /\ x1^0 = undef11 /\ x2^0 = undef12 /\ undef12 = undef29 /\ 1 + undef10 = undef28 /\ undef11 = 1 + undef30, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}> Variables: x0^0, x1^0, x2^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l3, 1 <= undef29 /\ undef28 = 0 /\ undef29 = undef40 /\ undef30 = undef41, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}> <l0, l3, true, {all remain the same}> <l0, l3, 1 <= undef29 /\ x0^0 = undef28 /\ x1^0 = undef29 /\ x2^0 = undef30, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}> <l0, l3, 1 <= undef29 /\ undef28 = 0 /\ undef29 = undef40 /\ undef30 = undef41, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, 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