details

property	value
status	complete
benchmark	neg-popl07-fail.t2_fixed.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n069.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.180850028992 seconds
cpu usage	0.28491353
max memory	6.326272E7

stage attributes

key	value
output-size	9206
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l14, true> <l1, l2, true> <l3, l4, (undef51 = 1), par{num^0 -> 0, unset^0 -> 0}> <l5, l3, true> <l6, l5, ((1 + status^0) <= 2)> <l6, l5, (3 <= (0 + status^0))> <l6, l5, (2 <= (0 + status^0)) /\ ((0 + status^0) <= 2), par{a1111^0 -> (0 + DName^0), num^0 -> (1 + num^0)}> <l7, l6, true, par{Pdoi^0 -> 0}> <l8, l9, (1 <= (0 + status^0)) /\ ((0 + status^0) <= 1), par{i^0 -> (1 + i^0)}> <l8, l7, ((1 + status^0) <= 1)> <l8, l7, (2 <= (0 + status^0))> <l9, l10, true> <l11, l8, ((0 + DName^0) <= 0) /\ (undef300 = undef300) /\ (undef295 = (0 + undef300)) /\ (undef282 = (0 + undef295)) /\ (undef302 = 1), par{___rho_3_^0 -> undef282, a77^0 -> (0 + DName^0), a88^0 -> (0 + Pdoi^0), pc^0 -> 0, ret_IoCreateDevice1010^0 -> undef295, status^0 -> (0 + undef282), tmp99^0 -> undef300}> <l11, l3, (1 <= (0 + DName^0))> <l4, l12, true> <l12, l4, true> <l10, l11, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef400 = undef400) /\ (undef397 = (0 + undef400)) /\ (undef382 = (0 + undef397)), par{DName^0 -> (0 + undef382), ___rho_2_^0 -> undef382, a11^0 -> (0 + lptNamei^0), b22^0 -> (0 + PdoType^0), c33^0 -> (0 + dcIdi^0), d44^0 -> (0 + num^0), ret_PPMakeDeviceName66^0 -> undef397, tmp55^0 -> undef400}> <l10, l3, ((0 + Pdolen^0) <= (0 + i^0))> <l13, l9, (undef452 = 0) /\ (undef453 = (0 + undef452)) /\ (undef454 = 1), par{set^0 -> 0, unset^0 -> undef452}> <l14, l13, true> Fresh variables: undef51, undef282, undef295, undef300, undef302, undef382, undef397, undef400, undef452, undef453, undef454, Undef variables: undef51, undef282, undef295, undef300, undef302, undef382, undef397, undef400, undef452, undef453, undef454, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l9, (undef452 = 0) /\ (undef453 = (0 + undef452)) /\ (undef454 = 1)> <l4, l4, true> <l9, l9, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef400 = undef400) /\ (undef397 = (0 + undef400)) /\ (undef382 = (0 + undef397)) /\ ((0 + (0 + undef382)) <= 0) /\ (undef300 = undef300) /\ (undef295 = (0 + undef300)) /\ (undef282 = (0 + undef295)) /\ (undef302 = 1) /\ (1 <= (0 + (0 + undef282))) /\ ((0 + (0 + undef282)) <= 1), par{i^0 -> (1 + i^0)}> <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef400 = undef400) /\ (undef397 = (0 + undef400)) /\ (undef382 = (0 + undef397)) /\ ((0 + (0 + undef382)) <= 0) /\ (undef300 = undef300) /\ (undef295 = (0 + undef300)) /\ (undef282 = (0 + undef295)) /\ (undef302 = 1) /\ ((1 + (0 + undef282)) <= 1) /\ ((1 + (0 + undef282)) <= 2) /\ (undef51 = 1), par{Pdoi^0 -> 0, num^0 -> 0}> <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef400 = undef400) /\ (undef397 = (0 + undef400)) /\ (undef382 = (0 + undef397)) /\ ((0 + (0 + undef382)) <= 0) /\ (undef300 = undef300) /\ (undef295 = (0 + undef300)) /\ (undef282 = (0 + undef295)) /\ (undef302 = 1) /\ (2 <= (0 + (0 + undef282))) /\ (3 <= (0 + (0 + undef282))) /\ (undef51 = 1), par{Pdoi^0 -> 0, num^0 -> 0}> <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef400 = undef400) /\ (undef397 = (0 + undef400)) /\ (undef382 = (0 + undef397)) /\ ((0 + (0 + undef382)) <= 0) /\ (undef300 = undef300) /\ (undef295 = (0 + undef300)) /\ (undef282 = (0 + undef295)) /\ (undef302 = 1) /\ (2 <= (0 + (0 + undef282))) /\ (2 <= (0 + (0 + undef282))) /\ ((0 + (0 + undef282)) <= 2) /\ (undef51 = 1), par{Pdoi^0 -> 0, num^0 -> 0}> <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef400 = undef400) /\ (undef397 = (0 + undef400)) /\ (undef382 = (0 + undef397)) /\ (1 <= (0 + (0 + undef382))) /\ (undef51 = 1), par{num^0 -> 0}> <l9, l4, ((0 + Pdolen^0) <= (0 + i^0)) /\ (undef51 = 1), par{num^0 -> 0}> Fresh variables: undef51, undef282, undef295, undef300, undef302, undef382, undef397, undef400, undef452, undef453, undef454, Undef variables: undef51, undef282, undef295, undef300, undef302, undef382, undef397, undef400, undef452, undef453, undef454, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l9, l9, undef382 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef282 = undef295 /\ undef295 = undef300 /\ undef382 = undef397 /\ undef397 = undef400 /\ undef282 = 1 /\ undef302 = 1, {i^0 -> 1 + i^0, rest remain the same}> Variables: Pdolen^0, i^0 Graph 2: Transitions: <l4, l4, true, {all remain the same}> Variables: Precedence: Graph 0 Graph 1 popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634