details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	1.27604 seconds
cpu usage	1.27602
user time	1.21412
system time	0.061901
max virtual memory	690312.0
max residence set size	34332.0

stage attributes

key	value
starexec-result	YES

output

1.24/1.27 YES 1.24/1.27 1.24/1.27 Solver Timeout: 4 1.24/1.27 Global Timeout: 300 1.24/1.27 No parsing errors! 1.24/1.27 Init Location: 0 1.24/1.27 Transitions: 1.24/1.27 <l0, l3, true> 1.24/1.27 <l1, l2, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (0 = arg2), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0}> 1.24/1.27 <l1, l2, (undef7 <= arg1) /\ (undef8 > ~(1)) /\ (arg1 > 0) /\ (undef7 > 0) /\ (1 = arg2), par{arg1 -> undef7, arg2 -> undef8, arg3 -> 0, arg4 -> 1, arg5 -> 1, arg6 -> 1}> 1.24/1.27 <l1, l2, (undef15 > ~(1)) /\ (arg2 > 1) /\ (undef14 > ~(1)) /\ (undef13 <= arg1) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> arg2, arg5 -> 2, arg6 -> arg2}> 1.24/1.27 <l2, l2, (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef19 <= arg1) /\ (arg1 > 0) /\ (undef19 > 0) /\ (arg4 = arg6), par{arg1 -> undef19, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1), arg6 -> arg4}> 1.24/1.27 <l2, l2, (arg3 > 0) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (undef31 > ~(1)) /\ (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0) /\ (arg4 = arg6), par{arg1 -> undef25, arg2 -> ((arg2 - 1) - undef31), arg3 -> ((arg2 - 1) - undef31), arg5 -> (arg5 + 1), arg6 -> arg4}> 1.24/1.27 <l3, l1, true, par{arg1 -> undef32, arg2 -> undef33, arg3 -> undef34, arg4 -> undef35, arg5 -> undef36, arg6 -> undef37}> 1.24/1.27 1.24/1.27 Fresh variables: 1.24/1.27 undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, 1.24/1.27 1.24/1.27 Undef variables: 1.24/1.27 undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, 1.24/1.27 1.24/1.27 Abstraction variables: 1.24/1.27 1.24/1.27 Exit nodes: 1.24/1.27 1.24/1.27 Accepting locations: 1.24/1.27 1.24/1.27 Asserts: 1.24/1.27 1.24/1.27 Preprocessed LLVMGraph 1.24/1.27 Init Location: 0 1.24/1.27 Transitions: 1.24/1.27 <l0, l2, (undef1 <= undef32) /\ (undef32 > 0) /\ (undef1 > 0) /\ (0 = undef33), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0}> 1.24/1.27 <l0, l2, (undef7 <= undef32) /\ (undef8 > ~(1)) /\ (undef32 > 0) /\ (undef7 > 0) /\ (1 = undef33), par{arg1 -> undef7, arg2 -> undef8, arg3 -> 0, arg4 -> 1, arg5 -> 1, arg6 -> 1}> 1.24/1.27 <l0, l2, (undef15 > ~(1)) /\ (undef33 > 1) /\ (undef14 > ~(1)) /\ (undef13 <= undef32) /\ (undef32 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef33, arg5 -> 2, arg6 -> undef33}> 1.24/1.27 <l2, l2, (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef19 <= arg1) /\ (arg1 > 0) /\ (undef19 > 0) /\ (arg4 = arg6), par{arg1 -> undef19, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1), arg6 -> arg4}> 1.24/1.27 <l2, l2, (arg3 > 0) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (undef31 > ~(1)) /\ (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0) /\ (arg4 = arg6), par{arg1 -> undef25, arg2 -> ((arg2 - 1) - undef31), arg3 -> ((arg2 - 1) - undef31), arg5 -> (arg5 + 1), arg6 -> arg4}> 1.24/1.27 1.24/1.27 Fresh variables: 1.24/1.27 undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, 1.24/1.27 1.24/1.27 Undef variables: 1.24/1.27 undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, 1.24/1.27 1.24/1.27 Abstraction variables: 1.24/1.27 1.24/1.27 Exit nodes: 1.24/1.27 1.24/1.27 Accepting locations: 1.24/1.27 1.24/1.27 Asserts: 1.24/1.27 1.24/1.27 ************************************************************* 1.24/1.27 ******************************************************************************************* 1.24/1.27 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 1.24/1.27 ******************************************************************************************* 1.24/1.27 1.24/1.27 Init Location: 0 1.24/1.27 Graph 0: 1.24/1.27 Transitions: 1.24/1.27 Variables: 1.24/1.27 1.24/1.27 Graph 1: 1.24/1.27 Transitions: 1.24/1.27 <l2, l2, undef19 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef19 /\ arg4 = arg6, {arg1 -> undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> 1.24/1.27 <l2, l2, undef25 <= arg1 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef31 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ 1 <= undef25 /\ arg4 = arg6, {arg1 -> undef25, arg2 -> -1 + arg2 - undef31, arg3 -> -1 + arg2 - undef31, arg5 -> 1 + arg5, arg6 -> arg4, rest remain the same}> 1.24/1.27 Variables: 1.24/1.27 arg1, arg2, arg3, arg4, arg5, arg6 1.24/1.27 1.24/1.27 Precedence: 1.24/1.27 Graph 0 1.24/1.27 1.24/1.27 Graph 1 1.24/1.27 <l0, l2, undef1 <= undef32 /\ 1 <= undef1 /\ 1 <= undef32 /\ undef33 = 0, {arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, rest remain the same}> 1.24/1.27 <l0, l2, undef7 <= undef32 /\ 0 <= undef8 /\ 1 <= undef7 /\ 1 <= undef32 /\ undef33 = 1, {arg1 -> undef7, arg2 -> undef8, arg3 -> 0, arg4 -> 1, arg5 -> 1, arg6 -> 1, rest remain the same}> 1.24/1.27 <l0, l2, undef13 <= undef32 /\ 0 <= undef14 /\ 0 <= undef15 /\ 1 <= undef13 /\ 1 <= undef32 /\ 2 <= undef33, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef33, arg5 -> 2, arg6 -> undef33, rest remain the same}> 1.24/1.27 1.24/1.27 Map Locations to Subgraph: 1.24/1.27 ( 0 , 0 ) 1.24/1.27 ( 2 , 1 ) 1.24/1.27 1.24/1.27 ******************************************************************************************* 1.24/1.27 ******************************** CHECKING ASSERTIONS ******************************** 1.24/1.27 ******************************************************************************************* 1.24/1.27 1.24/1.27 Proving termination of subgraph 0 1.24/1.27 Proving termination of subgraph 1 1.24/1.27 Checking unfeasibility... 1.24/1.27 Time used: 0.01286 1.24/1.27 1.24/1.27 Checking conditional termination of SCC {l2}... 1.24/1.27 1.24/1.27 LOG: CALL solveLinear 1.24/1.27 1.24/1.27 LOG: RETURN solveLinear - Elapsed time: 0.003002s 1.24/1.27 �[33mRanking function: �[36m-4 + 4*arg4 - 4*arg5�[0m 1.24/1.27 New Graphs: 1.24/1.27 Transitions: 1.24/1.27 <l2, l2, undef19 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef19 /\ arg4 = arg6, {arg1 -> undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> 1.24/1.27 Variables: 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