details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	4.31781888008 seconds
cpu usage	4.828059124
max memory	1.74718976E8

stage attributes

key	value
output-size	22509
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, l30, true> <l1, l2, true> <l3, l4, ((1 + n8^0) <= (0 + j10^0)), par{i9^0 -> (~(1) + i9^0)}> <l3, l5, ((0 + j10^0) <= (0 + n8^0)) /\ (undef44 = undef44), par{j10^0 -> (1 + j10^0), w12^0 -> undef44}> <l6, l7, ((1 + i9^0) <= 0) /\ (undef58 = 0), par{chkerr^0 -> (0 + undef58), ret_ludcmp14^0 -> undef58}> <l6, l5, (0 <= (0 + i9^0)) /\ (undef74 = undef74), par{j10^0 -> (1 + i9^0), w12^0 -> undef74}> <l8, l9, true> <l10, l11, ((0 + i9^0) <= (0 + j10^0)), par{i9^0 -> (1 + i9^0)}> <l10, l12, ((1 + j10^0) <= (0 + i9^0)) /\ (undef119 = undef119), par{j10^0 -> (1 + j10^0), w12^0 -> undef119}> <l13, l14, true> <l15, l4, ((1 + n8^0) <= (0 + i9^0)), par{i9^0 -> (~(1) + n8^0)}> <l15, l12, ((0 + i9^0) <= (0 + n8^0)) /\ (undef164 = undef164), par{j10^0 -> 0, w12^0 -> undef164}> <l16, l17, true> <l17, l13, ((1 + i9^0) <= (0 + k11^0)), par{j10^0 -> (1 + j10^0)}> <l17, l16, ((0 + k11^0) <= (0 + i9^0)) /\ (undef209 = undef209), par{k11^0 -> (1 + k11^0), w12^0 -> undef209}> <l14, l18, ((1 + n8^0) <= (0 + j10^0)), par{i9^0 -> (1 + i9^0)}> <l14, l16, ((0 + j10^0) <= (0 + n8^0)) /\ (undef239 = undef239), par{k11^0 -> 0, w12^0 -> undef239}> <l11, l15, true> <l19, l1, true, par{j10^0 -> (1 + j10^0)}> <l9, l19, ((0 + i9^0) <= (0 + k11^0))> <l9, l8, ((1 + k11^0) <= (0 + i9^0)) /\ (undef299 = undef299), par{k11^0 -> (1 + k11^0), w12^0 -> undef299}> <l20, l8, true, par{k11^0 -> 0}> <l12, l10, true> <l21, l19, ((0 + i9^0) <= 0) /\ (0 <= (0 + i9^0))> <l21, l20, (1 <= (0 + i9^0))> <l21, l20, ((1 + i9^0) <= 0)> <l2, l13, ((1 + n8^0) <= (0 + j10^0)), par{j10^0 -> (1 + i9^0)}> <l2, l21, ((0 + j10^0) <= (0 + n8^0)) /\ (undef404 = undef404), par{w12^0 -> undef404}> <l22, l11, ((0 + n8^0) <= (0 + i9^0)), par{i9^0 -> 1}> <l22, l1, ((1 + i9^0) <= (0 + n8^0)), par{j10^0 -> (1 + i9^0)}> <l4, l6, true> <l23, l24, (undef465 = undef465), par{j^0 -> (1 + j^0), w^0 -> undef465}> <l25, l23, ((1 + j^0) <= (0 + i^0))> <l25, l23, ((1 + i^0) <= (0 + j^0))> <l25, l23, ((0 + i^0) <= (0 + j^0)) /\ ((0 + j^0) <= (0 + i^0))> <l5, l3, true> <l26, l27, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> <l26, l25, ((0 + j^0) <= (0 + n^0))> <l28, l18, ((1 + n^0) <= (0 + i^0)), par{i9^0 -> 0, n8^0 -> (0 + n^0), nmax7^0 -> (0 + nmax^0)}> <l28, l24, ((0 + i^0) <= (0 + n^0)), par{j^0 -> 0, w^0 -> 0}> <l27, l28, true> <l24, l26, true> <l18, l22, true> <l29, l27, true, par{i^0 -> 0, n^0 -> (0 + __const_5^0), nmax^0 -> (0 + __const_50^0)}> <l30, l29, true> Fresh variables: undef44, undef58, undef74, undef119, undef164, undef209, undef239, undef299, undef404, undef465, Undef variables: undef44, undef58, undef74, undef119, undef164, undef209, undef239, undef299, undef404, undef465, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l7, (i^0 = 0) /\ (n^0 = (0 + n^0)) /\ (nmax^0 = (0 + nmax^0)) /\ ((1 + (0 + n^0)) <= (0 + 0)) /\ ((0 + (0 + (0 + n^0))) <= (0 + 0)) /\ ((1 + (0 + (0 + n^0))) <= (0 + 1)) /\ ((1 + (~(1) + (0 + (0 + n^0)))) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + (0 + (0 + n^0))), n8^0 -> (0 + (0 + n^0))}> <l0, l24, (i^0 = 0) /\ (n^0 = (0 + n^0)) /\ (nmax^0 = (0 + nmax^0)) /\ ((0 + 0) <= (0 + (0 + n^0))), par{j^0 -> 0}> <l1, l7, ((1 + n8^0) <= (0 + j10^0)) /\ ((1 + n8^0) <= (0 + (1 + i9^0))) /\ ((0 + n8^0) <= (0 + (1 + i9^0))) /\ ((1 + n8^0) <= (0 + 1)) /\ ((1 + (~(1) + n8^0)) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + n8^0), j10^0 -> (1 + i9^0)}> <l1, l12, ((1 + n8^0) <= (0 + j10^0)) /\ ((1 + n8^0) <= (0 + (1 + i9^0))) /\ ((0 + n8^0) <= (0 + (1 + i9^0))) /\ ((0 + 1) <= (0 + n8^0)) /\ (undef164 = undef164), par{i9^0 -> 1, j10^0 -> 0}> <l1, l16, ((1 + n8^0) <= (0 + j10^0)) /\ ((0 + (1 + i9^0)) <= (0 + n8^0)) /\ (undef239 = undef239), par{j10^0 -> (1 + i9^0), k11^0 -> 0}> <l1, l1, ((0 + j10^0) <= (0 + n8^0)) /\ (undef404 = undef404) /\ ((0 + i9^0) <= 0) /\ (0 <= (0 + i9^0)), par{j10^0 -> (1 + j10^0)}> <l1, l8, ((0 + j10^0) <= (0 + n8^0)) /\ (undef404 = undef404) /\ (1 <= (0 + i9^0)), par{k11^0 -> 0}> <l1, l8, ((0 + j10^0) <= (0 + n8^0)) /\ (undef404 = undef404) /\ ((1 + i9^0) <= 0), par{k11^0 -> 0}> <l5, l7, ((1 + n8^0) <= (0 + j10^0)) /\ ((1 + (~(1) + i9^0)) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + i9^0)}> <l5, l5, ((1 + n8^0) <= (0 + j10^0)) /\ (0 <= (0 + (~(1) + i9^0))) /\ (undef74 = undef74), par{i9^0 -> (~(1) + i9^0), j10^0 -> (1 + (~(1) + i9^0))}> <l5, l5, ((0 + j10^0) <= (0 + n8^0)) /\ (undef44 = undef44), par{j10^0 -> (1 + j10^0)}> <l8, l1, ((0 + i9^0) <= (0 + k11^0)), par{j10^0 -> (1 + j10^0)}> <l8, l8, ((1 + k11^0) <= (0 + i9^0)) /\ (undef299 = undef299), par{k11^0 -> (1 + k11^0)}> <l12, l7, ((0 + i9^0) <= (0 + j10^0)) /\ ((1 + n8^0) <= (0 + (1 + i9^0))) /\ ((1 + (~(1) + n8^0)) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + n8^0)}> <l12, l5, ((0 + i9^0) <= (0 + j10^0)) /\ ((1 + n8^0) <= (0 + (1 + i9^0))) /\ (0 <= (0 + (~(1) + n8^0))) /\ (undef74 = undef74), par{i9^0 -> (~(1) + n8^0), j10^0 -> (1 + (~(1) + n8^0))}> <l12, l12, ((0 + i9^0) <= (0 + j10^0)) /\ ((0 + (1 + i9^0)) <= (0 + n8^0)) /\ (undef164 = undef164), par{i9^0 -> (1 + i9^0), j10^0 -> 0}> <l12, l12, ((1 + j10^0) <= (0 + i9^0)) /\ (undef119 = undef119), par{j10^0 -> (1 + j10^0)}> <l16, l7, ((1 + i9^0) <= (0 + k11^0)) /\ ((1 + n8^0) <= (0 + (1 + j10^0))) /\ ((0 + n8^0) <= (0 + (1 + i9^0))) /\ ((1 + n8^0) <= (0 + 1)) /\ ((1 + (~(1) + n8^0)) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + n8^0), j10^0 -> (1 + j10^0)}> <l16, l12, ((1 + i9^0) <= (0 + k11^0)) /\ ((1 + n8^0) <= (0 + (1 + j10^0))) /\ ((0 + n8^0) <= (0 + (1 + i9^0))) /\ ((0 + 1) <= (0 + n8^0)) /\ (undef164 = undef164), par{i9^0 -> 1, j10^0 -> 0}> <l16, l1, ((1 + i9^0) <= (0 + k11^0)) /\ ((1 + n8^0) <= (0 + (1 + j10^0))) /\ ((1 + (1 + i9^0)) <= (0 + n8^0)), par{i9^0 -> (1 + i9^0), j10^0 -> (1 + (1 + i9^0))}> <l16, l16, ((1 + i9^0) <= (0 + k11^0)) /\ ((0 + (1 + j10^0)) <= (0 + n8^0)) /\ (undef239 = undef239), par{j10^0 -> (1 + j10^0), k11^0 -> 0}> <l16, l16, ((0 + k11^0) <= (0 + i9^0)) /\ (undef209 = undef209), par{k11^0 -> (1 + k11^0)}> <l24, l7, ((1 + n^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((0 + (0 + n^0)) <= (0 + 0)) /\ ((1 + (0 + n^0)) <= (0 + 1)) /\ ((1 + (~(1) + (0 + n^0))) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + (0 + n^0)), i^0 -> (1 + i^0), n8^0 -> (0 + n^0)}> popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634