Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432272846
details
property
value
status
complete
benchmark
RetValRec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n103.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
5.13191 seconds
cpu usage
5.13138
user time
4.95275
system time
0.178639
max virtual memory
700340.0
max residence set size
46596.0
stage attributes
key
value
starexec-result
YES
output
5.11/5.12 YES 5.11/5.12 5.11/5.13 Solver Timeout: 4 5.11/5.13 Global Timeout: 300 5.11/5.13 No parsing errors! 5.11/5.13 Init Location: 0 5.11/5.13 Transitions: 5.11/5.13 <l0, l4, true> 5.11/5.13 <l1, l2, (undef3 > ~(1)) /\ (arg2 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (arg1 > 0)> 5.11/5.13 <l2, l3, (undef7 > ~(1)) /\ (arg2 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (arg1 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> 5.11/5.13 <l1, l2, (undef11 > ~(1)) /\ (arg2 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (arg1 > 0)> 5.11/5.13 <l2, l3, (undef15 > ~(1)) /\ (arg2 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (arg1 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> 5.11/5.13 <l3, l3, (arg1 = arg2), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1)}> 5.11/5.13 <l4, l1, true, par{arg1 -> undef19, arg2 -> undef20}> 5.11/5.13 5.11/5.13 Fresh variables: 5.11/5.13 undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, 5.11/5.13 5.11/5.13 Undef variables: 5.11/5.13 undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, 5.11/5.13 5.11/5.13 Abstraction variables: 5.11/5.13 5.11/5.13 Exit nodes: 5.11/5.13 5.11/5.13 Accepting locations: 5.11/5.13 5.11/5.13 Asserts: 5.11/5.13 5.11/5.13 Preprocessed LLVMGraph 5.11/5.13 Init Location: 0 5.11/5.13 Transitions: 5.11/5.13 <l0, l3, (undef3 > ~(1)) /\ (undef20 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (undef19 > 0) /\ (undef7 > ~(1)) /\ (undef20 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (undef19 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> 5.11/5.13 <l0, l3, (undef3 > ~(1)) /\ (undef20 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (undef19 > 0) /\ (undef15 > ~(1)) /\ (undef20 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef19 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> 5.11/5.13 <l0, l3, (undef11 > ~(1)) /\ (undef20 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef19 > 0) /\ (undef7 > ~(1)) /\ (undef20 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (undef19 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> 5.11/5.13 <l0, l3, (undef11 > ~(1)) /\ (undef20 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef19 > 0) /\ (undef15 > ~(1)) /\ (undef20 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef19 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> 5.11/5.13 <l3, l3, (arg1 = arg2), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1)}> 5.11/5.13 5.11/5.13 Fresh variables: 5.11/5.13 undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, 5.11/5.13 5.11/5.13 Undef variables: 5.11/5.13 undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, 5.11/5.13 5.11/5.13 Abstraction variables: 5.11/5.13 5.11/5.13 Exit nodes: 5.11/5.13 5.11/5.13 Accepting locations: 5.11/5.13 5.11/5.13 Asserts: 5.11/5.13 5.11/5.13 ************************************************************* 5.11/5.13 ******************************************************************************************* 5.11/5.13 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.11/5.13 ******************************************************************************************* 5.11/5.13 5.11/5.13 Init Location: 0 5.11/5.13 Graph 0: 5.11/5.13 Transitions: 5.11/5.13 Variables: 5.11/5.13 5.11/5.13 Graph 1: 5.11/5.13 Transitions: 5.11/5.13 <l3, l3, arg1 = arg2, {arg1 -> -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 5.11/5.13 Variables: 5.11/5.13 arg1, arg2 5.11/5.13 5.11/5.13 Precedence: 5.11/5.13 Graph 0 5.11/5.13 5.11/5.13 Graph 1 5.11/5.13 <l0, l3, 1 <= undef19 /\ 1 <= undef20 /\ 0 <= undef3 /\ 0 <= undef7 /\ undef3 = 1 + 2*undef4 /\ undef7 = 1 + 2*undef8, {arg1 -> 1, arg2 -> 0, rest remain the same}> 5.11/5.13 <l0, l3, 1 <= undef19 /\ 1 <= undef20 /\ 0 <= undef3 /\ 0 <= undef15 /\ undef3 = 1 + 2*undef4 /\ undef15 = 2*undef16, {arg1 -> 0, arg2 -> 1, rest remain the same}> 5.11/5.13 <l0, l3, 1 <= undef19 /\ 1 <= undef20 /\ 0 <= undef7 /\ 0 <= undef11 /\ undef7 = 1 + 2*undef8 /\ undef11 = 2*undef12, {arg1 -> 1, arg2 -> 0, rest remain the same}> 5.11/5.13 <l0, l3, 1 <= undef19 /\ 1 <= undef20 /\ 0 <= undef11 /\ 0 <= undef15 /\ undef11 = 2*undef12 /\ undef15 = 2*undef16, {arg1 -> 0, arg2 -> 1, rest remain the same}> 5.11/5.13 5.11/5.13 Map Locations to Subgraph: 5.11/5.13 ( 0 , 0 ) 5.11/5.13 ( 3 , 1 ) 5.11/5.13 5.11/5.13 ******************************************************************************************* 5.11/5.13 ******************************** CHECKING ASSERTIONS ******************************** 5.11/5.13 ******************************************************************************************* 5.11/5.13 5.11/5.13 Proving termination of subgraph 0 5.11/5.13 Proving termination of subgraph 1 5.11/5.13 Checking unfeasibility... 5.11/5.13 Time used: 0.003081 5.11/5.13 5.11/5.13 Checking conditional termination of SCC {l3}... 5.11/5.13 5.11/5.13 LOG: CALL solveLinear 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear - Elapsed time: 0.000489s 5.11/5.13 5.11/5.13 LOG: CALL solveLinear 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear - Elapsed time: 0.001333s 5.11/5.13 Trying to remove transition: <l3, l3, arg1 = arg2, {arg1 -> -1 + arg1, arg2 -> -1 + arg1, rest remain the same}>
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