Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273329
details
property
value
status
complete
benchmark
Et6-rec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0833439 seconds
cpu usage
0.083462
user time
0.066259
system time
0.017203
max virtual memory
113176.0
max residence set size
18096.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.08 YES 0.00/0.08 0.00/0.08 Solver Timeout: 4 0.00/0.08 Global Timeout: 300 0.00/0.08 No parsing errors! 0.00/0.08 Init Location: 0 0.00/0.08 Transitions: 0.00/0.08 <l0, l3, true> 0.00/0.08 <l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0}> 0.00/0.08 <l1, l2, (arg1 > 0) /\ (undef9 > ~(1)) /\ (1 = arg2), par{arg1 -> 0, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 1, arg7 -> 1}> 0.00/0.08 <l1, l2, (undef16 > ~(1)) /\ (undef17 > ~(1)) /\ (arg1 > 0) /\ (2 = arg2), par{arg1 -> 0, arg2 -> undef16, arg3 -> undef17, arg4 -> 0, arg5 -> 0, arg6 -> 2, arg7 -> 2}> 0.00/0.08 <l1, l2, (undef23 > ~(1)) /\ (arg2 > 2) /\ (undef22 > ~(1)) /\ (undef24 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> undef22, arg5 -> undef22, arg6 -> arg2, arg7 -> 3}> 0.00/0.08 <l2, l2, (arg1 > ~(1)) /\ (arg6 > ~(1)) /\ (arg7 >= arg6) /\ ((2 * arg2) >= 0) /\ (((3 * arg3) - (2 * arg2)) < 0) /\ ((3 * arg3) >= 0) /\ (arg1 = arg4) /\ (arg1 = arg5), par{arg2 -> 0, arg3 -> 0, arg4 -> arg1, arg5 -> arg1}> 0.00/0.08 <l2, l2, (arg1 > ~(1)) /\ (arg6 > ~(1)) /\ (arg7 > ~(1)) /\ (arg7 < arg6) /\ (undef37 > ~(1)) /\ ((arg7 + 1) >= arg6) /\ ((2 * arg2) >= 0) /\ ((3 * arg3) >= 0) /\ (((3 * arg3) - (2 * arg2)) < (0 - (2 * undef37))) /\ ((2 * undef37) >= 0) /\ (arg1 = arg4) /\ (arg1 = arg5), par{arg1 -> (arg1 - (0 - (2 * undef37))), arg2 -> undef37, arg3 -> 0, arg4 -> (arg1 - (0 - (2 * undef37))), arg5 -> (arg1 - (0 - (2 * undef37))), arg7 -> (arg7 + 1)}> 0.00/0.08 <l2, l2, (arg6 > 1) /\ ((arg7 + 1) < arg6) /\ (arg1 > ~(1)) /\ (arg7 > ~(1)) /\ (undef44 > ~(1)) /\ (undef45 > ~(1)) /\ ((2 * arg2) >= 0) /\ ((3 * arg3) >= 0) /\ ((2 * undef44) >= 0) /\ ((3 * undef45) >= 0) /\ ((arg7 + 2) <= arg6) /\ (((3 * undef45) - (2 * undef44)) > ((3 * arg3) - (2 * arg2))) /\ (arg1 = arg4) /\ (arg1 = arg5), par{arg1 -> (arg1 - ((3 * undef45) - (2 * undef44))), arg2 -> undef44, arg3 -> undef45, arg4 -> (arg1 - ((3 * undef45) - (2 * undef44))), arg5 -> (arg1 - ((3 * undef45) - (2 * undef44))), arg7 -> (arg7 + 2)}> 0.00/0.08 <l3, l1, true, par{arg1 -> undef50, arg2 -> undef51, arg3 -> undef52, arg4 -> undef53, arg5 -> undef54, arg6 -> undef55, arg7 -> undef56}> 0.00/0.08 0.00/0.08 Fresh variables: 0.00/0.08 undef9, undef16, undef17, undef22, undef23, undef24, undef37, undef44, undef45, undef50, undef51, undef52, undef53, undef54, undef55, undef56, 0.00/0.08 0.00/0.08 Undef variables: 0.00/0.08 undef9, undef16, undef17, undef22, undef23, undef24, undef37, undef44, undef45, undef50, undef51, undef52, undef53, undef54, undef55, undef56, 0.00/0.08 0.00/0.08 Abstraction variables: 0.00/0.08 0.00/0.08 Exit nodes: 0.00/0.08 0.00/0.08 Accepting locations: 0.00/0.08 0.00/0.08 Asserts: 0.00/0.08 0.00/0.08 Preprocessed LLVMGraph 0.00/0.08 Init Location: 0 0.00/0.08 Transitions: 0.00/0.08 <l0, l2, (undef50 > 0) /\ (0 = undef51), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0}> 0.00/0.08 <l0, l2, (undef50 > 0) /\ (undef9 > ~(1)) /\ (1 = undef51), par{arg1 -> 0, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 1, arg7 -> 1}> 0.00/0.08 <l0, l2, (undef16 > ~(1)) /\ (undef17 > ~(1)) /\ (undef50 > 0) /\ (2 = undef51), par{arg1 -> 0, arg2 -> undef16, arg3 -> undef17, arg4 -> 0, arg5 -> 0, arg6 -> 2, arg7 -> 2}> 0.00/0.08 <l0, l2, (undef23 > ~(1)) /\ (undef51 > 2) /\ (undef22 > ~(1)) /\ (undef24 > ~(1)) /\ (undef50 > 0), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> undef22, arg5 -> undef22, arg6 -> undef51, arg7 -> 3}> 0.00/0.08 <l2, l2, (arg1 > ~(1)) /\ (arg6 > ~(1)) /\ (arg7 >= arg6) /\ ((2 * arg2) >= 0) /\ (((3 * arg3) - (2 * arg2)) < 0) /\ ((3 * arg3) >= 0) /\ (arg1 = arg4) /\ (arg1 = arg5), par{arg2 -> 0, arg3 -> 0, arg4 -> arg1, arg5 -> arg1}> 0.00/0.08 <l2, l2, (arg1 > ~(1)) /\ (arg6 > ~(1)) /\ (arg7 > ~(1)) /\ (arg7 < arg6) /\ (undef37 > ~(1)) /\ ((arg7 + 1) >= arg6) /\ ((2 * arg2) >= 0) /\ ((3 * arg3) >= 0) /\ (((3 * arg3) - (2 * arg2)) < (0 - (2 * undef37))) /\ ((2 * undef37) >= 0) /\ (arg1 = arg4) /\ (arg1 = arg5), par{arg1 -> (arg1 - (0 - (2 * undef37))), arg2 -> undef37, arg3 -> 0, arg4 -> (arg1 - (0 - (2 * undef37))), arg5 -> (arg1 - (0 - (2 * undef37))), arg7 -> (arg7 + 1)}> 0.00/0.08 <l2, l2, (arg6 > 1) /\ ((arg7 + 1) < arg6) /\ (arg1 > ~(1)) /\ (arg7 > ~(1)) /\ (undef44 > ~(1)) /\ (undef45 > ~(1)) /\ ((2 * arg2) >= 0) /\ ((3 * arg3) >= 0) /\ ((2 * undef44) >= 0) /\ ((3 * undef45) >= 0) /\ ((arg7 + 2) <= arg6) /\ (((3 * undef45) - (2 * undef44)) > ((3 * arg3) - (2 * arg2))) /\ (arg1 = arg4) /\ (arg1 = arg5), par{arg1 -> (arg1 - ((3 * undef45) - (2 * undef44))), arg2 -> undef44, arg3 -> undef45, arg4 -> (arg1 - ((3 * undef45) - (2 * undef44))), arg5 -> (arg1 - ((3 * undef45) - (2 * undef44))), arg7 -> (arg7 + 2)}> 0.00/0.08 0.00/0.08 Fresh variables: 0.00/0.08 undef9, undef16, undef17, undef22, undef23, undef24, undef37, undef44, undef45, undef50, undef51, undef52, undef53, undef54, undef55, undef56, 0.00/0.08 0.00/0.08 Undef variables: 0.00/0.08 undef9, undef16, undef17, undef22, undef23, undef24, undef37, undef44, undef45, undef50, undef51, undef52, undef53, undef54, undef55, undef56, 0.00/0.08 0.00/0.08 Abstraction variables: 0.00/0.08 0.00/0.08 Exit nodes: 0.00/0.08 0.00/0.08 Accepting locations: 0.00/0.08 0.00/0.08 Asserts: 0.00/0.08 0.00/0.08 ************************************************************* 0.00/0.08 ******************************************************************************************* 0.00/0.08 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.08 ******************************************************************************************* 0.00/0.08 0.00/0.08 Init Location: 0 0.00/0.08 Graph 0: 0.00/0.08 Transitions: 0.00/0.08 Variables: 0.00/0.08 0.00/0.08 Graph 1: 0.00/0.08 Transitions: 0.00/0.08 <l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 0 <= arg3 /\ arg6 <= arg7 /\ 0 <= arg6 /\ 1 + 3*arg3 <= 2*arg2 /\ arg1 = arg4 /\ arg1 = arg5, {arg2 -> 0, arg3 -> 0, arg4 -> arg1, arg5 -> arg1, rest remain the same}> 0.00/0.08 <l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 0 <= arg3 /\ 0 <= arg6 /\ 0 <= arg7 /\ 0 <= undef37 /\ 1 + 3*arg3 + 2*undef37 <= 2*arg2 /\ arg1 = arg4 /\ arg1 = arg5 /\ arg6 = 1 + arg7, {arg1 -> arg1 + 2*undef37, arg2 -> undef37, arg3 -> 0, arg4 -> arg1 + 2*undef37, arg5 -> arg1 + 2*undef37, arg7 -> 1 + arg7, rest remain the same}> 0.00/0.08 <l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 0 <= arg3 /\ 0 <= arg7 /\ 0 <= undef44 /\ 0 <= undef45 /\ 1 + 3*arg3 + 2*undef44 <= 2*arg2 + 3*undef45 /\ 2 <= arg6 /\ 2 + arg7 <= arg6 /\ arg1 = arg4 /\ arg1 = arg5, {arg1 -> arg1 + 2*undef44 - 3*undef45, arg2 -> undef44, arg3 -> undef45, arg4 -> arg1 + 2*undef44 - 3*undef45, arg5 -> arg1 + 2*undef44 - 3*undef45, arg7 -> 2 + arg7, rest remain the same}> 0.00/0.08 Variables: 0.00/0.08 arg1, arg2, arg3, arg4, arg5, arg6, arg7 0.00/0.08 0.00/0.08 Precedence: 0.00/0.08 Graph 0 0.00/0.08 0.00/0.08 Graph 1 0.00/0.08 <l0, l2, 1 <= undef50 /\ undef51 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0, rest remain the same}> 0.00/0.08 <l0, l2, 0 <= undef9 /\ 1 <= undef50 /\ undef51 = 1, {arg1 -> 0, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 1, arg7 -> 1, rest remain the same}> 0.00/0.08 <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 1 <= undef50 /\ undef51 = 2, {arg1 -> 0, arg2 -> undef16, arg3 -> undef17, arg4 -> 0, arg5 -> 0, arg6 -> 2, arg7 -> 2, rest remain the same}> 0.00/0.08 <l0, l2, 0 <= undef22 /\ 0 <= undef23 /\ 0 <= undef24 /\ 1 <= undef50 /\ 3 <= undef51, {arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> undef22, arg5 -> undef22, arg6 -> undef51, arg7 -> 3, rest remain the same}> 0.00/0.08 0.00/0.08 Map Locations to Subgraph: 0.00/0.08 ( 0 , 0 ) 0.00/0.08 ( 2 , 1 ) 0.00/0.08 0.00/0.08 ******************************************************************************************* 0.00/0.08 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.08 ******************************************************************************************* 0.00/0.08 0.00/0.08 Proving termination of subgraph 0 0.00/0.08 Proving termination of subgraph 1 0.00/0.08 Checking unfeasibility... 0.00/0.08 Time used: 0.027338 0.00/0.08 0.00/0.08 Checking conditional termination of SCC {l2}... 0.00/0.08 0.00/0.08 LOG: CALL solveLinear 0.00/0.08
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