Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273950
details
property
value
status
complete
benchmark
e-pgarch-succeed.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n109.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.077832 seconds
cpu usage
0.07796
user time
0.062095
system time
0.015865
max virtual memory
113176.0
max residence set size
24048.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)) /\ (undef21 = undef21) /\ (undef29 = (0 + undef21)) /\ (undef32 = (0 + undef29)), par{__rho_2_^0 -> undef21, a33^0 -> 1, got_SIGHUP^0 -> 0, ret_XLogArchivingActive44^0 -> undef29, tmp2^0 -> undef32, tt1^0 -> (0 + undef32)}> 0.00/0.07 <l4, l5, true> 0.00/0.07 <l6, l7, true> 0.00/0.07 <l8, l6, (undef76 = undef76), par{__rho_4_^0 -> undef76}> 0.00/0.07 <l9, l8, (((1 + curtime^0) + (~(1) * last_copy_time^0)) <= (0 + __const_1000^0))> 0.00/0.07 <l9, l8, ((0 + __const_1000^0) <= ((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) /\ (undef160 = undef160) /\ (undef156 = (0 + undef160)), par{a88^0 -> 0, curtime^0 -> (0 + undef156), ret_time1010^0 -> undef156, tmp99^0 -> undef160}> 0.00/0.07 <l2, l10, ((0 + wakend^0) <= 0)> 0.00/0.07 <l2, l10, (1 <= (0 + wakend^0)) /\ (undef195 = undef195) /\ (undef193 = (0 + undef195)), par{a55^0 -> 0, last_copy_time^0 -> (0 + undef193), ret_time77^0 -> undef193, tmp66^0 -> undef195, 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, (undef289 = 1) /\ (undef272 = undef272), par{__rho_1_^0 -> undef272, got_SIGHUP^0 -> (0 + __rho_2_^0), wakend^0 -> 1}> 0.00/0.07 <l13, l12, true> 0.00/0.07 0.00/0.07 Fresh variables: 0.00/0.07 undef21, undef29, undef32, undef76, undef156, undef160, undef193, undef195, undef272, undef289, 0.00/0.07 0.00/0.07 Undef variables: 0.00/0.07 undef21, undef29, undef32, undef76, undef156, undef160, undef193, undef195, undef272, undef289, 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, (undef289 = 1) /\ (undef272 = undef272) /\ ((0 + (0 + __rho_2_^0)) <= 0) /\ (1 <= (0 + 1)) /\ (undef195 = undef195) /\ (undef193 = (0 + undef195)) /\ ((0 + 0) <= 0) /\ (undef160 = undef160) /\ (undef156 = (0 + undef160)) /\ (((1 + (0 + undef156)) + (~(1) * (0 + undef193))) <= (0 + __const_1000^0)) /\ (undef76 = undef76), par{last_copy_time^0 -> (0 + undef193)}> 0.00/0.07 <l0, l7, (undef289 = 1) /\ (undef272 = undef272) /\ ((0 + (0 + __rho_2_^0)) <= 0) /\ (1 <= (0 + 1)) /\ (undef195 = undef195) /\ (undef193 = (0 + undef195)) /\ ((0 + 0) <= 0) /\ (undef160 = undef160) /\ (undef156 = (0 + undef160)) /\ ((0 + __const_1000^0) <= ((0 + (0 + undef156)) + (~(1) * (0 + undef193)))) /\ (undef76 = undef76), par{last_copy_time^0 -> (0 + undef193)}> 0.00/0.07 <l0, l7, (undef289 = 1) /\ (undef272 = undef272) /\ (1 <= (0 + (0 + __rho_2_^0))) /\ (undef21 = undef21) /\ (undef29 = (0 + undef21)) /\ (undef32 = (0 + undef29)) /\ (1 <= (0 + (0 + undef32))) /\ (1 <= (0 + 1)) /\ (undef195 = undef195) /\ (undef193 = (0 + undef195)) /\ ((0 + 0) <= 0) /\ (undef160 = undef160) /\ (undef156 = (0 + undef160)) /\ (((1 + (0 + undef156)) + (~(1) * (0 + undef193))) <= (0 + __const_1000^0)) /\ (undef76 = undef76), par{__rho_2_^0 -> undef21, last_copy_time^0 -> (0 + undef193)}> 0.00/0.07 <l0, l7, (undef289 = 1) /\ (undef272 = undef272) /\ (1 <= (0 + (0 + __rho_2_^0))) /\ (undef21 = undef21) /\ (undef29 = (0 + undef21)) /\ (undef32 = (0 + undef29)) /\ (1 <= (0 + (0 + undef32))) /\ (1 <= (0 + 1)) /\ (undef195 = undef195) /\ (undef193 = (0 + undef195)) /\ ((0 + 0) <= 0) /\ (undef160 = undef160) /\ (undef156 = (0 + undef160)) /\ ((0 + __const_1000^0) <= ((0 + (0 + undef156)) + (~(1) * (0 + undef193)))) /\ (undef76 = undef76), par{__rho_2_^0 -> undef21, last_copy_time^0 -> (0 + undef193)}> 0.00/0.07 <l0, l7, (undef289 = 1) /\ (undef272 = undef272) /\ (1 <= (0 + (0 + __rho_2_^0))) /\ (undef21 = undef21) /\ (undef29 = (0 + undef21)) /\ (undef32 = (0 + undef29)) /\ ((0 + (0 + undef32)) <= 0), par{__rho_2_^0 -> undef21}> 0.00/0.07 <l7, l7, true> 0.00/0.07 0.00/0.07 Fresh variables: 0.00/0.07 undef21, undef29, undef32, undef76, undef156, undef160, undef193, undef195, undef272, undef289, 0.00/0.07 0.00/0.07 Undef variables: 0.00/0.07 undef21, undef29, undef32, undef76, undef156, undef160, undef193, undef195, undef272, undef289, 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, __rho_2_^0 <= 0 /\ 1 + undef156 <= __const_1000^0 + undef193 /\ undef156 = undef160 /\ undef193 = undef195 /\ undef289 = 1, {last_copy_time^0 -> undef193, rest remain the same}> 0.00/0.07 <l0, l7, __const_1000^0 + undef193 <= undef156 /\ __rho_2_^0 <= 0 /\ undef156 = undef160 /\ undef193 = undef195 /\ undef289 = 1, {last_copy_time^0 -> undef193, rest remain the same}> 0.00/0.07 <l0, l7, 1 + undef156 <= __const_1000^0 + undef193 /\ 1 <= __rho_2_^0 /\ 1 <= undef32 /\ undef21 = undef29 /\ undef29 = undef32 /\ undef156 = undef160 /\ undef193 = undef195 /\ undef289 = 1, {__rho_2_^0 -> undef21, last_copy_time^0 -> undef193, rest remain the same}> 0.00/0.07 <l0, l7, __const_1000^0 + undef193 <= undef156 /\ 1 <= __rho_2_^0 /\ 1 <= undef32 /\ undef21 = undef29 /\ undef29 = undef32 /\ undef156 = undef160 /\ undef193 = undef195 /\ undef289 = 1, {__rho_2_^0 -> undef21, last_copy_time^0 -> undef193, rest remain the same}> 0.00/0.07 <l0, l7, undef32 <= 0 /\ 1 <= __rho_2_^0 /\ undef21 = undef29 /\ undef29 = undef32 /\ undef289 = 1, {__rho_2_^0 -> undef21, rest 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