Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275894
details
property
value
status
complete
benchmark
pgarch-fail.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0788779 seconds
cpu usage
0.079011
user time
0.065789
system time
0.013222
max virtual memory
113176.0
max residence set size
23952.0
stage attributes
key
value
starexec-result
NO
output
0.00/0.07 NO 0.00/0.07 0.00/0.07 Solver Timeout: 4 0.00/0.07 Global Timeout: 300 0.00/0.07 No parsing errors! 0.00/0.07 Init Location: 0 0.00/0.07 Transitions: 0.00/0.07 <l0, l13, true> 0.00/0.07 <l1, l2, ((0 + got_SIGHUP^0) <= 0)> 0.00/0.07 <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)}> 0.00/0.07 <l4, l5, true> 0.00/0.07 <l6, l7, true> 0.00/0.07 <l8, l6, true> 0.00/0.07 <l9, l8, (((1 + curtime^0) + (~(1) * last_copy_time^0)) <= 1000)> 0.00/0.07 <l9, l8, (1000 <= ((0 + curtime^0) + (~(1) * last_copy_time^0))), par{wakend^0 -> 1}> 0.00/0.07 <l10, l8, (1 <= (0 + wakend^0))> 0.00/0.07 <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}> 0.00/0.07 <l2, l10, ((0 + wakend^0) <= 0)> 0.00/0.07 <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}> 0.00/0.07 <l7, l11, true> 0.00/0.07 <l11, l7, true> 0.00/0.07 <l3, l2, (1 <= (0 + tt1^0))> 0.00/0.07 <l3, l6, ((0 + tt1^0) <= 0)> 0.00/0.07 <l12, l1, (undef241 = 1) /\ (undef231 = undef231), par{got_SIGHUP^0 -> undef231, wakend^0 -> 1}> 0.00/0.07 <l13, l12, true> 0.00/0.07 0.00/0.07 Fresh variables: 0.00/0.07 undef16, undef23, undef26, undef129, undef133, undef160, undef162, undef231, undef241, 0.00/0.07 0.00/0.07 Undef variables: 0.00/0.07 undef16, undef23, undef26, undef129, undef133, undef160, undef162, undef231, undef241, 0.00/0.07 0.00/0.07 Abstraction variables: 0.00/0.07 0.00/0.07 Exit nodes: 0.00/0.07 0.00/0.07 Accepting locations: 0.00/0.07 0.00/0.07 Asserts: 0.00/0.07 0.00/0.07 Preprocessed LLVMGraph 0.00/0.07 Init Location: 0 0.00/0.07 Transitions: 0.00/0.07 <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)}> 0.00/0.07 <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)}> 0.00/0.07 <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)}> 0.00/0.07 <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)}> 0.00/0.07 <l0, l7, (undef241 = 1) /\ (undef231 = undef231) /\ (1 <= (0 + undef231)) /\ (undef16 = undef16) /\ (undef23 = (0 + undef16)) /\ (undef26 = (0 + undef23)) /\ ((0 + (0 + undef26)) <= 0)> 0.00/0.07 <l7, l7, true> 0.00/0.07 0.00/0.07 Fresh variables: 0.00/0.07 undef16, undef23, undef26, undef129, undef133, undef160, undef162, undef231, undef241, 0.00/0.07 0.00/0.07 Undef variables: 0.00/0.07 undef16, undef23, undef26, undef129, undef133, undef160, undef162, undef231, undef241, 0.00/0.07 0.00/0.07 Abstraction variables: 0.00/0.07 0.00/0.07 Exit nodes: 0.00/0.07 0.00/0.07 Accepting locations: 0.00/0.07 0.00/0.07 Asserts: 0.00/0.07 0.00/0.07 ************************************************************* 0.00/0.07 ******************************************************************************************* 0.00/0.07 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.07 ******************************************************************************************* 0.00/0.07 0.00/0.07 Init Location: 0 0.00/0.07 Graph 0: 0.00/0.07 Transitions: 0.00/0.07 Variables: 0.00/0.07 0.00/0.07 Graph 1: 0.00/0.07 Transitions: 0.00/0.07 <l7, l7, true, {all remain the same}> 0.00/0.07 Variables: 0.00/0.07 0.00/0.07 Precedence: 0.00/0.07 Graph 0 0.00/0.07 0.00/0.07 Graph 1 0.00/0.07 <l0, l7, undef231 <= 0 /\ undef129 <= 999 + undef160 /\ undef129 = undef133 /\ undef160 = undef162 /\ undef241 = 1, {last_copy_time^0 -> undef160, rest remain the same}> 0.00/0.07 <l0, l7, undef231 <= 0 /\ 1000 + undef160 <= undef129 /\ undef129 = undef133 /\ undef160 = undef162 /\ undef241 = 1, {last_copy_time^0 -> undef160, rest remain the same}> 0.00/0.07 <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}> 0.00/0.07 <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}> 0.00/0.07 <l0, l7, undef26 <= 0 /\ 1 <= undef231 /\ undef16 = undef23 /\ undef23 = undef26 /\ undef241 = 1, {all remain the same}> 0.00/0.07 0.00/0.07 Map Locations to Subgraph: 0.00/0.07 ( 0 , 0 ) 0.00/0.07 ( 7 , 1 ) 0.00/0.07 0.00/0.07 ******************************************************************************************* 0.00/0.07 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.07 ******************************************************************************************* 0.00/0.07 0.00/0.07 Proving termination of subgraph 0 0.00/0.07 Proving termination of subgraph 1 0.00/0.07 Checking unfeasibility...
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer_Transition_Systems 2019-03-29 01.54