Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432274946
details
property
value
status
complete
benchmark
neg-pgarch-succeed.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.0760849 seconds
cpu usage
0.076199
user time
0.064531
system time
0.011668
max virtual memory
113176.0
max residence set size
23732.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)) /\ (undef18 = undef18) /\ (undef27 = (0 + undef18)) /\ (undef30 = (0 + undef27)), par{__rho_1_^0 -> undef18, a33^0 -> 1, got_SIGHUP^0 -> 0, ret_XLogArchivingActive44^0 -> undef27, tmp2^0 -> undef30, tt1^0 -> (0 + undef30)}> 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)) <= (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) /\ (undef132 = undef132) /\ (undef141 = (0 + undef132)), par{__rho_3_^0 -> undef132, a77^0 -> 0, curtime^0 -> (0 + undef141), ret_time88^0 -> undef141}> 0.00/0.07 <l2, l10, ((0 + wakend^0) <= 0)> 0.00/0.07 <l2, l10, (1 <= (0 + wakend^0)) /\ (undef164 = undef164) /\ (undef172 = (0 + undef164)), par{__rho_3_^0 -> undef164, a55^0 -> 0, last_copy_time^0 -> (0 + undef172), ret_time66^0 -> undef172, 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, (undef243 = undef243) /\ (undef257 = 1), par{__rho_2_^0 -> undef243, got_SIGHUP^0 -> (0 + undef243), wakend^0 -> 1}> 0.00/0.07 <l13, l12, true> 0.00/0.07 0.00/0.07 Fresh variables: 0.00/0.07 undef18, undef27, undef30, undef132, undef141, undef164, undef172, undef243, undef257, 0.00/0.07 0.00/0.07 Undef variables: 0.00/0.07 undef18, undef27, undef30, undef132, undef141, undef164, undef172, undef243, undef257, 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, (undef243 = undef243) /\ (undef257 = 1) /\ ((0 + (0 + undef243)) <= 0) /\ (1 <= (0 + 1)) /\ (undef164 = undef164) /\ (undef172 = (0 + undef164)) /\ ((0 + 0) <= 0) /\ (undef132 = undef132) /\ (undef141 = (0 + undef132)) /\ (((1 + (0 + undef141)) + (~(1) * (0 + undef172))) <= (0 + __const_1000^0)), par{last_copy_time^0 -> (0 + undef172)}> 0.00/0.07 <l0, l7, (undef243 = undef243) /\ (undef257 = 1) /\ ((0 + (0 + undef243)) <= 0) /\ (1 <= (0 + 1)) /\ (undef164 = undef164) /\ (undef172 = (0 + undef164)) /\ ((0 + 0) <= 0) /\ (undef132 = undef132) /\ (undef141 = (0 + undef132)) /\ ((0 + __const_1000^0) <= ((0 + (0 + undef141)) + (~(1) * (0 + undef172)))), par{last_copy_time^0 -> (0 + undef172)}> 0.00/0.07 <l0, l7, (undef243 = undef243) /\ (undef257 = 1) /\ (1 <= (0 + (0 + undef243))) /\ (undef18 = undef18) /\ (undef27 = (0 + undef18)) /\ (undef30 = (0 + undef27)) /\ (1 <= (0 + (0 + undef30))) /\ (1 <= (0 + 1)) /\ (undef164 = undef164) /\ (undef172 = (0 + undef164)) /\ ((0 + 0) <= 0) /\ (undef132 = undef132) /\ (undef141 = (0 + undef132)) /\ (((1 + (0 + undef141)) + (~(1) * (0 + undef172))) <= (0 + __const_1000^0)), par{last_copy_time^0 -> (0 + undef172)}> 0.00/0.07 <l0, l7, (undef243 = undef243) /\ (undef257 = 1) /\ (1 <= (0 + (0 + undef243))) /\ (undef18 = undef18) /\ (undef27 = (0 + undef18)) /\ (undef30 = (0 + undef27)) /\ (1 <= (0 + (0 + undef30))) /\ (1 <= (0 + 1)) /\ (undef164 = undef164) /\ (undef172 = (0 + undef164)) /\ ((0 + 0) <= 0) /\ (undef132 = undef132) /\ (undef141 = (0 + undef132)) /\ ((0 + __const_1000^0) <= ((0 + (0 + undef141)) + (~(1) * (0 + undef172)))), par{last_copy_time^0 -> (0 + undef172)}> 0.00/0.07 <l0, l7, (undef243 = undef243) /\ (undef257 = 1) /\ (1 <= (0 + (0 + undef243))) /\ (undef18 = undef18) /\ (undef27 = (0 + undef18)) /\ (undef30 = (0 + undef27)) /\ ((0 + (0 + undef30)) <= 0)> 0.00/0.07 <l7, l7, true> 0.00/0.07 0.00/0.07 Fresh variables: 0.00/0.07 undef18, undef27, undef30, undef132, undef141, undef164, undef172, undef243, undef257, 0.00/0.07 0.00/0.07 Undef variables: 0.00/0.07 undef18, undef27, undef30, undef132, undef141, undef164, undef172, undef243, undef257, 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, undef243 <= 0 /\ 1 + undef141 <= __const_1000^0 + undef172 /\ undef132 = undef141 /\ undef164 = undef172 /\ undef257 = 1, {last_copy_time^0 -> undef172, rest remain the same}> 0.00/0.07 <l0, l7, __const_1000^0 + undef172 <= undef141 /\ undef243 <= 0 /\ undef132 = undef141 /\ undef164 = undef172 /\ undef257 = 1, {last_copy_time^0 -> undef172, rest remain the same}> 0.00/0.07 <l0, l7, 1 + undef141 <= __const_1000^0 + undef172 /\ 1 <= undef30 /\ 1 <= undef243 /\ undef18 = undef27 /\ undef27 = undef30 /\ undef132 = undef141 /\ undef164 = undef172 /\ undef257 = 1, {last_copy_time^0 -> undef172, rest remain the same}> 0.00/0.07 <l0, l7, __const_1000^0 + undef172 <= undef141 /\ 1 <= undef30 /\ 1 <= undef243 /\ undef18 = undef27 /\ undef27 = undef30 /\ undef132 = undef141 /\ undef164 = undef172 /\ undef257 = 1, {last_copy_time^0 -> undef172, rest remain the same}> 0.00/0.07 <l0, l7, undef30 <= 0 /\ 1 <= undef243 /\ undef18 = undef27 /\ undef27 = undef30 /\ undef257 = 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