details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0642640590668 seconds
cpu usage	0.060933914
max memory	7110656.0

stage attributes

key	value
output-size	14357
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, (undef1 = (0 + x0^0)) /\ (undef2 = (0 + x1^0)) /\ (undef3 = (0 + x2^0)), par{oldX0^0 -> undef1, oldX1^0 -> undef2, oldX2^0 -> undef3, x0^0 -> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> ((0 + (~(1) * undef2)) + undef3)}> <l2, l3, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0), par{oldX0^0 -> undef10, oldX1^0 -> undef11, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef13, x0^0 -> (0 + undef10), x1^0 -> (0 + undef11), x2^0 -> (0 + undef13)}> <l2, l3, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0), par{oldX0^0 -> undef19, oldX1^0 -> undef20, oldX2^0 -> undef21, oldX3^0 -> undef22, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20), x2^0 -> (0 + undef22)}> <l2, l1, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ (1 <= (0 + undef30)) /\ (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)}> <l3, l4, (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef40, oldX4^0 -> undef41, oldX5^0 -> undef42, x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l5, l2, (undef46 = (0 + x0^0)) /\ (undef47 = (0 + x1^0)) /\ (1 <= (0 + undef46)), par{oldX0^0 -> undef46, oldX1^0 -> undef47, oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef46), x1^0 -> (0 + undef47), x2^0 -> (0 + undef46)}> <l5, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ ((1 + undef55) <= 0), par{oldX0^0 -> undef55, oldX1^0 -> undef56, oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef55), x1^0 -> (0 + undef56), x2^0 -> (0 + undef55)}> <l5, l3, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (undef67 = undef67) /\ ((0 + undef64) <= 0) /\ (0 <= (0 + undef64)), par{oldX0^0 -> undef64, oldX1^0 -> undef65, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef67, x0^0 -> (0 + undef64), x1^0 -> (0 + undef65), x2^0 -> (0 + undef67)}> <l6, l5, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76), par{oldX0^0 -> undef73, oldX1^0 -> undef74, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef76, x0^0 -> (0 + undef73), x1^0 -> (0 + undef74), x2^0 -> (0 + undef76)}> <l6, l4, true> <l6, l1, true> <l6, l2, true> <l6, l3, true> <l6, l5, true> <l7, l6, true> Fresh variables: undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, Undef variables: undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l4, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ (undef46 = (0 + (0 + undef73))) /\ (undef47 = (0 + (0 + undef74))) /\ (1 <= (0 + undef46)) /\ (undef10 = (0 + (0 + undef46))) /\ (undef11 = (0 + (0 + undef47))) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l0, l1, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ (undef46 = (0 + (0 + undef73))) /\ (undef47 = (0 + (0 + undef74))) /\ (1 <= (0 + undef46)) /\ (undef28 = (0 + (0 + undef46))) /\ (undef29 = (0 + (0 + undef47))) /\ (undef30 = (0 + (0 + undef46))) /\ (1 <= (0 + undef30)) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> <l0, l4, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ (undef55 = (0 + (0 + undef73))) /\ (undef56 = (0 + (0 + undef74))) /\ ((1 + undef55) <= 0) /\ (undef10 = (0 + (0 + undef55))) /\ (undef11 = (0 + (0 + undef56))) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l0, l4, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ (undef55 = (0 + (0 + undef73))) /\ (undef56 = (0 + (0 + undef74))) /\ ((1 + undef55) <= 0) /\ (undef19 = (0 + (0 + undef55))) /\ (undef20 = (0 + (0 + undef56))) /\ (undef21 = (0 + (0 + undef55))) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l0, l4, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ (undef64 = (0 + (0 + undef73))) /\ (undef65 = (0 + (0 + undef74))) /\ (undef67 = undef67) /\ ((0 + undef64) <= 0) /\ (0 <= (0 + undef64)) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l0, l4, true> <l0, l1, true> <l0, l4, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l0, l4, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l0, l1, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ (1 <= (0 + undef30)) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> <l0, l4, (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l0, l4, (undef46 = (0 + x0^0)) /\ (undef47 = (0 + x1^0)) /\ (1 <= (0 + undef46)) /\ (undef10 = (0 + (0 + undef46))) /\ (undef11 = (0 + (0 + undef47))) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l0, l1, (undef46 = (0 + x0^0)) /\ (undef47 = (0 + x1^0)) /\ (1 <= (0 + undef46)) /\ (undef28 = (0 + (0 + undef46))) /\ (undef29 = (0 + (0 + undef47))) /\ (undef30 = (0 + (0 + undef46))) /\ (1 <= (0 + undef30)) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> <l0, l4, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ ((1 + undef55) <= 0) /\ (undef10 = (0 + (0 + undef55))) /\ (undef11 = (0 + (0 + undef56))) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l0, l4, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ ((1 + undef55) <= 0) /\ (undef19 = (0 + (0 + undef55))) /\ (undef20 = (0 + (0 + undef56))) /\ (undef21 = (0 + (0 + undef55))) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l0, l4, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (undef67 = undef67) /\ ((0 + undef64) <= 0) /\ (0 <= (0 + undef64)) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l1, l4, (undef1 = (0 + x0^0)) /\ (undef2 = (0 + x1^0)) /\ (undef3 = (0 + x2^0)) /\ (undef10 = (0 + (0 + undef1))) /\ (undef11 = (0 + (0 + undef2))) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l1, l4, (undef1 = (0 + x0^0)) /\ (undef2 = (0 + x1^0)) /\ (undef3 = (0 + x2^0)) /\ (undef19 = (0 + (0 + undef1))) /\ (undef20 = (0 + (0 + undef2))) /\ (undef21 = (0 + ((0 + (~(1) * undef2)) + undef3))) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}> <l1, l1, (undef1 = (0 + x0^0)) /\ (undef2 = (0 + x1^0)) /\ (undef3 = (0 + x2^0)) /\ (undef28 = (0 + (0 + undef1))) /\ (undef29 = (0 + (0 + undef2))) /\ (undef30 = (0 + ((0 + (~(1) * undef2)) + undef3))) /\ (1 <= (0 + undef30)) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}> Fresh variables: undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, Undef variables: undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, 1 <= undef29 /\ 1 <= undef30 /\ x0^0 = undef1 /\ x1^0 = undef2 /\ x2^0 = undef3 /\ undef1 = undef28 /\ undef2 + undef30 = undef3 /\ undef2 = undef29, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}> Variables: x0^0, x1^0, x2^0 Graph 2: Transitions: popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634