Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273533
details
property
value
status
complete
benchmark
GCD.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0580241 seconds
cpu usage
0.058221
user time
0.044411
system time
0.01381
max virtual memory
113176.0
max residence set size
10096.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.05 YES 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, l4, true> 0.00/0.05 <l1, l2, (undef2 > ~(1)) /\ (arg2 > ~(1)) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> 0.00/0.05 <l2, l3, (arg2 > 0) /\ (arg2 > arg1) /\ (arg1 > 0)> 0.00/0.05 <l2, l3, (arg2 > 0) /\ (arg2 < arg1) /\ (arg1 > 0)> 0.00/0.05 <l2, l2, (arg2 > 0) /\ (0 = arg1), par{arg1 -> arg2, arg2 -> 0}> 0.00/0.05 <l2, l2, (arg1 > 0) /\ (arg1 = arg2), par{arg2 -> 0}> 0.00/0.05 <l3, l3, (arg2 < arg1) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - arg2)}> 0.00/0.05 <l3, l2, (arg2 > arg1), par{arg1 -> arg2, arg2 -> arg1}> 0.00/0.05 <l4, l1, true, par{arg1 -> undef15, arg2 -> undef16}> 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef1, undef2, undef15, undef16, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef1, undef2, undef15, undef16, 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, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (undef2 > ~(1)) /\ (undef16 > ~(1)) /\ (undef1 > ~(1)) /\ (undef15 > 0)> 0.00/0.05 <l2, l3, (arg2 > 0) /\ (arg2 > arg1) /\ (arg1 > 0)> 0.00/0.05 <l2, l3, (arg2 > 0) /\ (arg2 < arg1) /\ (arg1 > 0)> 0.00/0.05 <l2, l2, (arg2 > 0) /\ (0 = arg1), par{arg1 -> arg2, arg2 -> 0}> 0.00/0.05 <l2, l2, (arg1 > 0) /\ (arg1 = arg2), par{arg2 -> 0}> 0.00/0.05 <l3, l3, (arg2 < arg1) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - arg2)}> 0.00/0.05 <l3, l2, (arg2 > arg1), par{arg1 -> arg2, arg2 -> arg1}> 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef1, undef2, undef15, undef16, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef1, undef2, undef15, undef16, 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 <l2, l3, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}> 0.00/0.05 <l2, l3, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {all remain the same}> 0.00/0.05 <l2, l2, 1 <= arg2 /\ arg1 = 0, {arg1 -> arg2, arg2 -> 0, rest remain the same}> 0.00/0.05 <l2, l2, 1 <= arg1 /\ arg1 = arg2, {arg2 -> 0, rest remain the same}> 0.00/0.05 <l3, l3, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg1 - arg2, rest remain the same}> 0.00/0.05 <l3, l2, 1 + arg1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}> 0.00/0.05 Variables: 0.00/0.05 arg1, arg2 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, l2, 1 <= undef15 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef16 /\ arg1 = undef1 /\ arg2 = undef2, {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 ( 2 , 1 ) 0.00/0.05 ( 3 , 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... 0.00/0.05 Time used: 0.019289 0.00/0.05 0.00/0.05 Checking conditional termination of SCC {l2, l3}... 0.00/0.05 0.00/0.05 LOG: CALL solveLinear
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