Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432274247
details
property
value
status
complete
benchmark
heidy8.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n063.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
3.12221 seconds
cpu usage
3.12187
user time
2.90096
system time
0.220912
max virtual memory
770200.0
max residence set size
97908.0
stage attributes
key
value
starexec-result
NO
output
3.10/3.11 NO 3.10/3.11 3.10/3.12 Solver Timeout: 4 3.10/3.12 Global Timeout: 300 3.10/3.12 No parsing errors! 3.10/3.12 Init Location: 0 3.10/3.12 Transitions: 3.10/3.12 <l0, l6, true> 3.10/3.12 <l1, l2, ((0 + ___rho_2^0) <= 0), par{p^0 -> 0}> 3.10/3.12 <l1, l2, (1 <= (0 + ___rho_2^0)), par{p^0 -> 1}> 3.10/3.12 <l2, l1, (undef12 = undef12), par{___rho_2^0 -> undef12}> 3.10/3.12 <l3, l4, ((0 + ___rho_1^0) <= 0), par{x^0 -> (~(2) + x^0)}> 3.10/3.12 <l3, l4, (1 <= (0 + ___rho_1^0)), par{x^0 -> (~(1) + x^0)}> 3.10/3.12 <l4, l2, ((0 + x^0) <= 0)> 3.10/3.12 <l4, l3, (1 <= (0 + x^0)) /\ (undef31 = undef31), par{___rho_1^0 -> undef31}> 3.10/3.12 <l5, l4, (undef41 = 0) /\ (undef42 = 1), par{p^0 -> 0, start^0 -> 0}> 3.10/3.12 <l6, l5, true> 3.10/3.12 3.10/3.12 Fresh variables: 3.10/3.12 undef12, undef31, undef41, undef42, 3.10/3.12 3.10/3.12 Undef variables: 3.10/3.12 undef12, undef31, undef41, undef42, 3.10/3.12 3.10/3.12 Abstraction variables: 3.10/3.12 3.10/3.12 Exit nodes: 3.10/3.12 3.10/3.12 Accepting locations: 3.10/3.12 3.10/3.12 Asserts: 3.10/3.12 3.10/3.12 Preprocessed LLVMGraph 3.10/3.12 Init Location: 0 3.10/3.12 Transitions: 3.10/3.12 <l0, l4, (undef41 = 0) /\ (undef42 = 1)> 3.10/3.12 <l2, l2, (undef12 = undef12) /\ ((0 + undef12) <= 0)> 3.10/3.12 <l2, l2, (undef12 = undef12) /\ (1 <= (0 + undef12))> 3.10/3.12 <l4, l2, ((0 + x^0) <= 0)> 3.10/3.12 <l4, l4, (1 <= (0 + x^0)) /\ (undef31 = undef31) /\ ((0 + undef31) <= 0), par{x^0 -> (~(2) + x^0)}> 3.10/3.12 <l4, l4, (1 <= (0 + x^0)) /\ (undef31 = undef31) /\ (1 <= (0 + undef31)), par{x^0 -> (~(1) + x^0)}> 3.10/3.12 3.10/3.12 Fresh variables: 3.10/3.12 undef12, undef31, undef41, undef42, 3.10/3.12 3.10/3.12 Undef variables: 3.10/3.12 undef12, undef31, undef41, undef42, 3.10/3.12 3.10/3.12 Abstraction variables: 3.10/3.12 3.10/3.12 Exit nodes: 3.10/3.12 3.10/3.12 Accepting locations: 3.10/3.12 3.10/3.12 Asserts: 3.10/3.12 3.10/3.12 ************************************************************* 3.10/3.12 ******************************************************************************************* 3.10/3.12 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 3.10/3.12 ******************************************************************************************* 3.10/3.12 3.10/3.12 Init Location: 0 3.10/3.12 Graph 0: 3.10/3.12 Transitions: 3.10/3.12 Variables: 3.10/3.12 3.10/3.12 Graph 1: 3.10/3.12 Transitions: 3.10/3.12 <l4, l4, undef31 <= 0 /\ 1 <= x^0, {x^0 -> -2 + x^0, rest remain the same}> 3.10/3.12 <l4, l4, 1 <= x^0 /\ 1 <= undef31, {x^0 -> -1 + x^0, rest remain the same}> 3.10/3.12 Variables: 3.10/3.12 x^0 3.10/3.12 3.10/3.12 Graph 2: 3.10/3.12 Transitions: 3.10/3.12 <l2, l2, undef12 <= 0, {all remain the same}> 3.10/3.12 <l2, l2, 1 <= undef12, {all remain the same}> 3.10/3.12 Variables: 3.10/3.12 3.10/3.12 Precedence: 3.10/3.12 Graph 0 3.10/3.12 3.10/3.12 Graph 1 3.10/3.12 <l0, l4, undef41 = 0 /\ undef42 = 1, {all remain the same}> 3.10/3.12 3.10/3.12 Graph 2 3.10/3.12 <l4, l2, x^0 <= 0, {all remain the same}> 3.10/3.12 3.10/3.12 Map Locations to Subgraph: 3.10/3.12 ( 0 , 0 ) 3.10/3.12 ( 2 , 2 ) 3.10/3.12 ( 4 , 1 ) 3.10/3.12 3.10/3.12 ******************************************************************************************* 3.10/3.12 ******************************** CHECKING ASSERTIONS ******************************** 3.10/3.12 ******************************************************************************************* 3.10/3.12 3.10/3.12 Proving termination of subgraph 0 3.10/3.12 Proving termination of subgraph 1 3.10/3.12 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