details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.082859992981 seconds
cpu usage	0.111648553
max memory	4.3446272E7

stage attributes

key	value
output-size	6634
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, l13, true> <l1, l2, ((0 + got_SIGHUP^0) <= 0)> <l1, l3, (1 <= (0 + got_SIGHUP^0)) /\ (undef16 = undef16) /\ (undef23 = (0 + undef16)) /\ (undef26 = (0 + undef23)), par{___rho_1_^0 -> undef16, a33^0 -> 1, got_SIGHUP^0 -> 0, ret_XLogArchivingActive44^0 -> undef23, tmp2^0 -> undef26, tt1^0 -> (0 + undef26)}> <l4, l5, true> <l6, l7, true> <l8, l6, true> <l9, l8, (((1 + curtime^0) + (~(1) * last_copy_time^0)) <= 1000)> <l9, l8, (1000 <= ((0 + curtime^0) + (~(1) * last_copy_time^0))), par{wakend^0 -> 1}> <l10, l8, (1 <= (0 + wakend^0))> <l10, l9, ((0 + wakend^0) <= 0) /\ (undef133 = undef133) /\ (undef129 = (0 + undef133)), par{a88^0 -> 0, curtime^0 -> (0 + undef129), ret_time1010^0 -> undef129, tmp99^0 -> undef133}> <l2, l10, ((0 + wakend^0) <= 0)> <l2, l10, (1 <= (0 + wakend^0)) /\ (undef162 = undef162) /\ (undef160 = (0 + undef162)), par{a55^0 -> 0, last_copy_time^0 -> (0 + undef160), ret_time77^0 -> undef160, tmp66^0 -> undef162, wakend^0 -> 0}> <l7, l11, true, par{wakend^0 -> 1}> <l11, l7, true> <l3, l2, (1 <= (0 + tt1^0))> <l3, l6, ((0 + tt1^0) <= 0)> <l12, l1, (undef241 = 1) /\ (undef231 = undef231), par{got_SIGHUP^0 -> undef231, wakend^0 -> 1}> <l13, l12, true> Fresh variables: undef16, undef23, undef26, undef129, undef133, undef160, undef162, undef231, undef241, Undef variables: undef16, undef23, undef26, undef129, undef133, undef160, undef162, undef231, undef241, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l7, (undef241 = 1) /\ (undef231 = undef231) /\ ((0 + undef231) <= 0) /\ (1 <= (0 + 1)) /\ (undef162 = undef162) /\ (undef160 = (0 + undef162)) /\ ((0 + 0) <= 0) /\ (undef133 = undef133) /\ (undef129 = (0 + undef133)) /\ (((1 + (0 + undef129)) + (~(1) * (0 + undef160))) <= 1000), par{last_copy_time^0 -> (0 + undef160)}> <l0, l7, (undef241 = 1) /\ (undef231 = undef231) /\ ((0 + undef231) <= 0) /\ (1 <= (0 + 1)) /\ (undef162 = undef162) /\ (undef160 = (0 + undef162)) /\ ((0 + 0) <= 0) /\ (undef133 = undef133) /\ (undef129 = (0 + undef133)) /\ (1000 <= ((0 + (0 + undef129)) + (~(1) * (0 + undef160)))), par{last_copy_time^0 -> (0 + undef160)}> <l0, l7, (undef241 = 1) /\ (undef231 = undef231) /\ (1 <= (0 + undef231)) /\ (undef16 = undef16) /\ (undef23 = (0 + undef16)) /\ (undef26 = (0 + undef23)) /\ (1 <= (0 + (0 + undef26))) /\ (1 <= (0 + 1)) /\ (undef162 = undef162) /\ (undef160 = (0 + undef162)) /\ ((0 + 0) <= 0) /\ (undef133 = undef133) /\ (undef129 = (0 + undef133)) /\ (((1 + (0 + undef129)) + (~(1) * (0 + undef160))) <= 1000), par{last_copy_time^0 -> (0 + undef160)}> <l0, l7, (undef241 = 1) /\ (undef231 = undef231) /\ (1 <= (0 + undef231)) /\ (undef16 = undef16) /\ (undef23 = (0 + undef16)) /\ (undef26 = (0 + undef23)) /\ (1 <= (0 + (0 + undef26))) /\ (1 <= (0 + 1)) /\ (undef162 = undef162) /\ (undef160 = (0 + undef162)) /\ ((0 + 0) <= 0) /\ (undef133 = undef133) /\ (undef129 = (0 + undef133)) /\ (1000 <= ((0 + (0 + undef129)) + (~(1) * (0 + undef160)))), par{last_copy_time^0 -> (0 + undef160)}> <l0, l7, (undef241 = 1) /\ (undef231 = undef231) /\ (1 <= (0 + undef231)) /\ (undef16 = undef16) /\ (undef23 = (0 + undef16)) /\ (undef26 = (0 + undef23)) /\ ((0 + (0 + undef26)) <= 0)> <l7, l7, true> Fresh variables: undef16, undef23, undef26, undef129, undef133, undef160, undef162, undef231, undef241, Undef variables: undef16, undef23, undef26, undef129, undef133, undef160, undef162, undef231, undef241, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l7, l7, true, {all remain the same}> Variables: Precedence: Graph 0 Graph 1 <l0, l7, undef231 <= 0 /\ undef129 <= 999 + undef160 /\ undef129 = undef133 /\ undef160 = undef162 /\ undef241 = 1, {last_copy_time^0 -> undef160, rest remain the same}> <l0, l7, undef231 <= 0 /\ 1000 + undef160 <= undef129 /\ undef129 = undef133 /\ undef160 = undef162 /\ undef241 = 1, {last_copy_time^0 -> undef160, rest remain the same}> <l0, l7, 1 <= undef26 /\ 1 <= undef231 /\ undef129 <= 999 + undef160 /\ undef16 = undef23 /\ undef23 = undef26 /\ undef129 = undef133 /\ undef160 = undef162 /\ undef241 = 1, {last_copy_time^0 -> undef160, rest remain the same}> <l0, l7, 1 <= undef26 /\ 1 <= undef231 /\ 1000 + undef160 <= undef129 /\ undef16 = undef23 /\ undef23 = undef26 /\ undef129 = undef133 /\ undef160 = undef162 /\ undef241 = 1, {last_copy_time^0 -> undef160, rest remain the same}> <l0, l7, undef26 <= 0 /\ 1 <= undef231 /\ undef16 = undef23 /\ undef23 = undef26 /\ undef241 = 1, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 7 , 1 ) popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634