Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275513
details
property
value
status
complete
benchmark
neg-e-pgarch-succeed.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n119.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0598399 seconds
cpu usage
0.059972
user time
0.045256
system time
0.014716
max virtual memory
113176.0
max residence set size
23596.0
stage attributes
key
value
starexec-result
NO
output
0.00/0.05 NO 0.00/0.05 0.00/0.05 Solver Timeout: 4 0.00/0.05 Global Timeout: 300 0.00/0.05 No parsing errors! 0.00/0.05 Init Location: 0 0.00/0.05 Transitions: 0.00/0.05 <l0, l13, true> 0.00/0.05 <l1, l2, ((0 + got_SIGHUP^0) <= 0)> 0.00/0.05 <l1, l3, (1 <= (0 + got_SIGHUP^0)) /\ (undef14 = undef14), par{__rho_3_^0 -> undef14, a22^0 -> 1, got_SIGHUP^0 -> 0, tt1^0 -> (0 + undef14)}> 0.00/0.05 <l4, l5, true> 0.00/0.05 <l6, l7, true> 0.00/0.05 <l8, l6, (undef49 = undef49), par{__rho_5_^0 -> undef49}> 0.00/0.05 <l9, l8, (((1 + curtime^0) + (~(1) * last_copy_time^0)) <= (0 + __const_1000^0))> 0.00/0.05 <l9, l8, ((0 + __const_1000^0) <= ((0 + curtime^0) + (~(1) * last_copy_time^0))), par{wakend^0 -> 1}> 0.00/0.05 <l10, l8, (1 <= (0 + wakend^0))> 0.00/0.05 <l10, l9, ((0 + wakend^0) <= 0) /\ (undef95 = undef95), par{curtime^0 -> undef95}> 0.00/0.05 <l7, l11, true> 0.00/0.05 <l11, l7, true> 0.00/0.05 <l2, l10, ((0 + wakend^0) <= 0)> 0.00/0.05 <l2, l10, (1 <= (0 + wakend^0)) /\ (undef136 = undef136), par{__rho_4_^0 -> undef136, last_copy_time^0 -> (0 + undef136), wakend^0 -> 0}> 0.00/0.05 <l3, l2, (1 <= (0 + tt1^0))> 0.00/0.05 <l3, l6, ((0 + tt1^0) <= 0)> 0.00/0.05 <l12, l1, (undef177 = 1) /\ (undef167 = undef167), par{__rho_2_^0 -> undef167, got_SIGHUP^0 -> (0 + undef167), wakend^0 -> 1}> 0.00/0.05 <l13, l12, true> 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef14, undef49, undef95, undef136, undef167, undef177, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef14, undef49, undef95, undef136, undef167, undef177, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 Preprocessed LLVMGraph 0.00/0.05 Init Location: 0 0.00/0.05 Transitions: 0.00/0.05 <l0, l7, (undef177 = 1) /\ (undef167 = undef167) /\ ((0 + (0 + undef167)) <= 0) /\ (1 <= (0 + 1)) /\ (undef136 = undef136) /\ ((0 + 0) <= 0) /\ (undef95 = undef95) /\ (((1 + undef95) + (~(1) * (0 + undef136))) <= (0 + __const_1000^0)) /\ (undef49 = undef49), par{last_copy_time^0 -> (0 + undef136)}> 0.00/0.05 <l0, l7, (undef177 = 1) /\ (undef167 = undef167) /\ ((0 + (0 + undef167)) <= 0) /\ (1 <= (0 + 1)) /\ (undef136 = undef136) /\ ((0 + 0) <= 0) /\ (undef95 = undef95) /\ ((0 + __const_1000^0) <= ((0 + undef95) + (~(1) * (0 + undef136)))) /\ (undef49 = undef49), par{last_copy_time^0 -> (0 + undef136)}> 0.00/0.05 <l0, l7, (undef177 = 1) /\ (undef167 = undef167) /\ (1 <= (0 + (0 + undef167))) /\ (undef14 = undef14) /\ (1 <= (0 + (0 + undef14))) /\ (1 <= (0 + 1)) /\ (undef136 = undef136) /\ ((0 + 0) <= 0) /\ (undef95 = undef95) /\ (((1 + undef95) + (~(1) * (0 + undef136))) <= (0 + __const_1000^0)) /\ (undef49 = undef49), par{last_copy_time^0 -> (0 + undef136)}> 0.00/0.05 <l0, l7, (undef177 = 1) /\ (undef167 = undef167) /\ (1 <= (0 + (0 + undef167))) /\ (undef14 = undef14) /\ (1 <= (0 + (0 + undef14))) /\ (1 <= (0 + 1)) /\ (undef136 = undef136) /\ ((0 + 0) <= 0) /\ (undef95 = undef95) /\ ((0 + __const_1000^0) <= ((0 + undef95) + (~(1) * (0 + undef136)))) /\ (undef49 = undef49), par{last_copy_time^0 -> (0 + undef136)}> 0.00/0.05 <l0, l7, (undef177 = 1) /\ (undef167 = undef167) /\ (1 <= (0 + (0 + undef167))) /\ (undef14 = undef14) /\ ((0 + (0 + undef14)) <= 0)> 0.00/0.05 <l7, l7, true> 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef14, undef49, undef95, undef136, undef167, undef177, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef14, undef49, undef95, undef136, undef167, undef177, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 ************************************************************* 0.00/0.05 ******************************************************************************************* 0.00/0.05 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.05 ******************************************************************************************* 0.00/0.05 0.00/0.05 Init Location: 0 0.00/0.05 Graph 0: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 1: 0.00/0.05 Transitions: 0.00/0.05 <l7, l7, true, {all remain the same}> 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Precedence: 0.00/0.05 Graph 0 0.00/0.05 0.00/0.05 Graph 1 0.00/0.05 <l0, l7, undef167 <= 0 /\ 1 + undef95 <= __const_1000^0 + undef136 /\ undef177 = 1, {last_copy_time^0 -> undef136, rest remain the same}> 0.00/0.05 <l0, l7, __const_1000^0 + undef136 <= undef95 /\ undef167 <= 0 /\ undef177 = 1, {last_copy_time^0 -> undef136, rest remain the same}> 0.00/0.05 <l0, l7, 1 + undef95 <= __const_1000^0 + undef136 /\ 1 <= undef14 /\ 1 <= undef167 /\ undef177 = 1, {last_copy_time^0 -> undef136, rest remain the same}> 0.00/0.05 <l0, l7, __const_1000^0 + undef136 <= undef95 /\ 1 <= undef14 /\ 1 <= undef167 /\ undef177 = 1, {last_copy_time^0 -> undef136, rest remain the same}> 0.00/0.05 <l0, l7, undef14 <= 0 /\ 1 <= undef167 /\ undef177 = 1, {all remain the same}> 0.00/0.05 0.00/0.05 Map Locations to Subgraph: 0.00/0.05 ( 0 , 0 ) 0.00/0.05 ( 7 , 1 ) 0.00/0.05 0.00/0.05 ******************************************************************************************* 0.00/0.05 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.05 ******************************************************************************************* 0.00/0.05 0.00/0.05 Proving termination of subgraph 0 0.00/0.05 Proving termination of subgraph 1 0.00/0.05 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