details

property	value
status	complete
benchmark	SharingPair.jar-obl-8.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n032.star.cs.uiowa.edu
space	From_AProVE_2014

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	5.81438 seconds
cpu usage	5.81384
user time	5.5215
system time	0.29234
max virtual memory	737128.0
max residence set size	80032.0

stage attributes

key	value
starexec-result	NO

output

5.80/5.81 NO 5.80/5.81 5.80/5.81 Solver Timeout: 4 5.80/5.81 Global Timeout: 300 5.80/5.81 No parsing errors! 5.80/5.81 Init Location: 0 5.80/5.81 Transitions: 5.80/5.81 <l0, l3, true> 5.80/5.81 <l1, l2, (undef3 > 0) /\ (arg2 > ~(1)) /\ ((undef1 - 1) <= arg1) /\ ((undef2 - 3) <= arg1) /\ (arg1 > 0) /\ (undef1 > 1) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> 5.80/5.81 <l1, l2, ((undef4 - 3) <= arg1) /\ (arg2 > ~(1)) /\ ((undef5 - 1) <= arg1) /\ (arg1 > 0) /\ (undef4 > 3) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}> 5.80/5.81 <l2, l2, (arg1 >= undef7) /\ (arg3 > 0) /\ (arg1 >= (undef8 - 3)) /\ ((undef8 - 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 3), par{arg1 -> undef7, arg2 -> undef8}> 5.80/5.81 <l2, l2, ((undef10 - 3) <= arg1) /\ ((undef10 - 3) <= arg2) /\ (undef11 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef10 > 3) /\ (undef11 > 0) /\ (0 = arg3), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> 5.80/5.81 <l3, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 5.80/5.81 5.80/5.81 Fresh variables: 5.80/5.81 undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.80/5.81 5.80/5.81 Undef variables: 5.80/5.81 undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.80/5.81 5.80/5.81 Abstraction variables: 5.80/5.81 5.80/5.81 Exit nodes: 5.80/5.81 5.80/5.81 Accepting locations: 5.80/5.81 5.80/5.81 Asserts: 5.80/5.81 5.80/5.81 Preprocessed LLVMGraph 5.80/5.81 Init Location: 0 5.80/5.81 Transitions: 5.80/5.81 <l0, l2, (undef3 > 0) /\ (undef14 > ~(1)) /\ ((undef1 - 1) <= undef13) /\ ((undef2 - 3) <= undef13) /\ (undef13 > 0) /\ (undef1 > 1) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> 5.80/5.81 <l0, l2, ((undef4 - 3) <= undef13) /\ (undef14 > ~(1)) /\ ((undef5 - 1) <= undef13) /\ (undef13 > 0) /\ (undef4 > 3) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}> 5.80/5.81 <l2, l2, (arg1 >= undef7) /\ (arg3 > 0) /\ (arg1 >= (undef8 - 3)) /\ ((undef8 - 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 3), par{arg1 -> undef7, arg2 -> undef8}> 5.80/5.81 <l2, l2, ((undef10 - 3) <= arg1) /\ ((undef10 - 3) <= arg2) /\ (undef11 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef10 > 3) /\ (undef11 > 0) /\ (0 = arg3), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> 5.80/5.81 5.80/5.81 Fresh variables: 5.80/5.81 undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.80/5.81 5.80/5.81 Undef variables: 5.80/5.81 undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.80/5.81 5.80/5.81 Abstraction variables: 5.80/5.81 5.80/5.81 Exit nodes: 5.80/5.81 5.80/5.81 Accepting locations: 5.80/5.81 5.80/5.81 Asserts: 5.80/5.81 5.80/5.81 ************************************************************* 5.80/5.81 ******************************************************************************************* 5.80/5.81 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.80/5.81 ******************************************************************************************* 5.80/5.81 5.80/5.81 Init Location: 0 5.80/5.81 Graph 0: 5.80/5.81 Transitions: 5.80/5.81 Variables: 5.80/5.81 5.80/5.81 Graph 1: 5.80/5.81 Transitions: 5.80/5.81 <l2, l2, undef7 <= arg1 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef7 /\ undef8 <= 3 + arg1 /\ undef8 <= 3 + arg2 /\ 4 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}> 5.80/5.81 <l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> 5.80/5.81 Variables: 5.80/5.81 arg1, arg2, arg3 5.80/5.81 5.80/5.81 Precedence: 5.80/5.81 Graph 0 5.80/5.81 5.80/5.81 Graph 1 5.80/5.81 <l0, l2, 0 <= undef14 /\ 1 <= undef3 /\ 1 <= undef13 /\ undef1 <= 1 + undef13 /\ undef2 <= 3 + undef13 /\ 2 <= undef1 /\ 4 <= undef2, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> 5.80/5.81 <l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ undef5 <= 1 + undef13 /\ undef4 <= 3 + undef13 /\ 2 <= undef5 /\ 4 <= undef4, {arg1 -> undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}> 5.80/5.81 5.80/5.81 Map Locations to Subgraph: 5.80/5.81 ( 0 , 0 ) 5.80/5.81 ( 2 , 1 ) 5.80/5.81 5.80/5.81 ******************************************************************************************* 5.80/5.81 ******************************** CHECKING ASSERTIONS ******************************** 5.80/5.81 ******************************************************************************************* 5.80/5.81 5.80/5.81 Proving termination of subgraph 0 5.80/5.81 Proving termination of subgraph 1 5.80/5.81 Checking unfeasibility... 5.80/5.81 Time used: 0.009206 5.80/5.81 5.80/5.81 Checking conditional termination of SCC {l2}... 5.80/5.81 5.80/5.81 LOG: CALL solveLinear 5.80/5.81 5.80/5.81 LOG: RETURN solveLinear - Elapsed time: 0.002263s 5.80/5.81 5.80/5.81 LOG: CALL solveLinear 5.80/5.81 5.80/5.81 LOG: RETURN solveLinear - Elapsed time: 0.012811s 5.80/5.81 Trying to remove transition: <l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> 5.80/5.81 Solving with 1 template(s). 5.80/5.81 5.80/5.81 LOG: CALL solveNonLinearGetFirstSolution 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