Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273638
details
property
value
status
complete
benchmark
CyclicList.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n123.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.046042 seconds
cpu usage
0.046195
user time
0.034955
system time
0.01124
max virtual memory
113176.0
max residence set size
7416.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.04 YES 0.00/0.04 0.00/0.04 Solver Timeout: 4 0.00/0.04 Global Timeout: 300 0.00/0.04 No parsing errors! 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 <l0, l5, true> 0.00/0.04 <l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 - 1), arg3 -> 0, arg4 -> arg2}> 0.00/0.04 <l2, l3, (arg2 < 1) /\ (arg3 > 0) /\ (undef6 > arg3) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6, arg3 -> arg4, arg4 -> undef8}> 0.00/0.04 <l2, l3, (arg1 >= undef9) /\ (arg2 < 1) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> 1, arg3 -> arg4, arg4 -> undef12}> 0.00/0.04 <l2, l2, (undef13 <= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> (arg2 - 1), arg3 -> undef15}> 0.00/0.04 <l3, l4, (arg3 > 0) /\ (undef21 > ~(1)) /\ (arg1 > 0), par{arg1 -> (undef21 - 1), arg3 -> undef19, arg4 -> undef20}> 0.00/0.04 <l4, l4, (arg2 > ~(1)) /\ (undef26 > 0) /\ (undef26 < arg2) /\ (arg1 > 0) /\ (undef26 < undef23), par{arg1 -> (arg1 - 1), arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> 0.00/0.04 <l4, l4, (arg1 > 0) /\ (undef31 < arg2) /\ (arg2 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> 1, arg3 -> undef29, arg4 -> undef30}> 0.00/0.04 <l5, l1, true, par{arg1 -> undef32, arg2 -> undef33, arg3 -> undef34, arg4 -> undef35}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef1, undef5, undef6, undef8, undef9, undef12, undef13, undef15, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef1, undef5, undef6, undef8, undef9, undef12, undef13, undef15, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 Preprocessed LLVMGraph 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 <l0, l2, (arg1 = undef1) /\ (arg2 = (undef33 - 1)) /\ (arg3 = 0) /\ (arg4 = undef33) /\ (undef1 <= undef32) /\ (undef33 > ~(1)) /\ (undef32 > 0) /\ (undef1 > 0)> 0.00/0.04 <l2, l4, (arg2 < 1) /\ (arg3 > 0) /\ (undef6 > arg3) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0) /\ (arg4 > 0) /\ (undef21 > ~(1)) /\ (undef5 > 0), par{arg1 -> (undef21 - 1), arg2 -> undef6, arg3 -> undef19, arg4 -> undef20}> 0.00/0.04 <l2, l4, (arg1 >= undef9) /\ (arg2 < 1) /\ (arg1 > 0) /\ (undef9 > 0) /\ (arg4 > 0) /\ (undef21 > ~(1)) /\ (undef9 > 0), par{arg1 -> (undef21 - 1), arg2 -> 1, arg3 -> undef19, arg4 -> undef20}> 0.00/0.04 <l2, l2, (undef13 <= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> (arg2 - 1), arg3 -> undef15}> 0.00/0.04 <l4, l4, (arg2 > ~(1)) /\ (undef26 > 0) /\ (undef26 < arg2) /\ (arg1 > 0) /\ (undef26 < undef23), par{arg1 -> (arg1 - 1), arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> 0.00/0.04 <l4, l4, (arg1 > 0) /\ (undef31 < arg2) /\ (arg2 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> 1, arg3 -> undef29, arg4 -> undef30}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef1, undef5, undef6, undef8, undef9, undef12, undef13, undef15, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef1, undef5, undef6, undef8, undef9, undef12, undef13, undef15, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 ************************************************************* 0.00/0.04 ******************************************************************************************* 0.00/0.04 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Init Location: 0 0.00/0.04 Graph 0: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Graph 1: 0.00/0.04 Transitions: 0.00/0.04 <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef13 /\ undef13 <= arg1, {arg1 -> undef13, arg2 -> -1 + arg2, arg3 -> undef15, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 arg1, arg2, arg3 0.00/0.04 0.00/0.04 Graph 2: 0.00/0.04 Transitions: 0.00/0.04 <l4, l4, 1 <= arg1 /\ 1 + undef26 <= arg2 /\ 1 + undef26 <= undef23 /\ 1 <= undef26 /\ 0 <= arg2, {arg1 -> -1 + arg1, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25, rest remain the same}> 0.00/0.04 <l4, l4, 1 <= arg1 /\ 1 + undef31 <= arg2 /\ 0 <= arg2, {arg1 -> -1 + arg1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 arg1, arg2, arg3, arg4 0.00/0.04 0.00/0.04 Precedence: 0.00/0.04 Graph 0 0.00/0.04 0.00/0.04 Graph 1 0.00/0.04 <l0, l2, 1 <= undef1 /\ 1 <= undef32 /\ undef1 <= undef32 /\ 0 <= undef33 /\ 1 + arg2 = undef33 /\ arg1 = undef1 /\ arg3 = 0 /\ arg4 = undef33, {all remain the same}> 0.00/0.04 0.00/0.04 Graph 2 0.00/0.04 <l2, l4, 1 <= arg1 /\ 1 + arg3 <= undef6 /\ 1 <= arg3 /\ 1 <= arg4 /\ 1 <= undef5 /\ undef5 <= arg1 /\ arg2 <= 0 /\ 0 <= undef21, {arg1 -> -1 + undef21, arg2 -> undef6, arg3 -> undef19, arg4 -> undef20, rest remain the same}> 0.00/0.04 <l2, l4, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef9 /\ undef9 <= arg1 /\ arg2 <= 0 /\ 0 <= undef21, {arg1 -> -1 + undef21, arg2 -> 1, arg3 -> undef19, arg4 -> undef20, rest remain the same}> 0.00/0.04 0.00/0.04 Map Locations to Subgraph: 0.00/0.04 ( 0 , 0 ) 0.00/0.04 ( 2 , 1 ) 0.00/0.04 ( 4 , 2 ) 0.00/0.04 0.00/0.04 ******************************************************************************************* 0.00/0.04 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Proving termination of subgraph 0 0.00/0.04 Proving termination of subgraph 1 0.00/0.04 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