details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	71.2198 seconds
cpu usage	71.2172
user time	68.1197
system time	3.09751
max virtual memory	1125104.0
max residence set size	438620.0

stage attributes

key	value
starexec-result	NO

output

71.19/71.21 NO 71.19/71.21 71.19/71.21 Solver Timeout: 4 71.19/71.21 Global Timeout: 300 71.19/71.21 No parsing errors! 71.19/71.21 Init Location: 0 71.19/71.21 Transitions: 71.19/71.21 <l0, l3, true> 71.19/71.21 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 20, arg2 -> ~(20), arg3 -> arg2}> 71.19/71.21 <l2, l2, ((arg1 - arg3) < 5) /\ (arg3 <= arg1) /\ (arg3 >= arg2), par{arg2 -> (0 - arg1), arg3 -> (~(1) * arg3)}> 71.19/71.21 <l2, l2, (arg3 <= arg1) /\ (arg3 >= arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) < 5), par{arg2 -> (0 - arg1), arg3 -> (~(1) * arg3)}> 71.19/71.21 <l2, l2, (arg1 >= arg3) /\ (arg2 <= arg3) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 < 1), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}> 71.19/71.21 <l2, l2, (arg1 >= arg3) /\ (arg2 <= arg3) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 > 1), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}> 71.19/71.21 <l2, l2, (arg1 > 5) /\ (arg2 < 2) /\ (1 = arg3), par{arg1 -> ~(1), arg2 -> 1, arg3 -> 0}> 71.19/71.21 <l3, l1, true, par{arg1 -> undef19, arg2 -> undef20, arg3 -> undef21}> 71.19/71.21 71.19/71.21 Fresh variables: 71.19/71.21 undef19, undef20, undef21, 71.19/71.21 71.19/71.21 Undef variables: 71.19/71.21 undef19, undef20, undef21, 71.19/71.21 71.19/71.21 Abstraction variables: 71.19/71.21 71.19/71.21 Exit nodes: 71.19/71.21 71.19/71.21 Accepting locations: 71.19/71.21 71.19/71.21 Asserts: 71.19/71.21 71.19/71.21 Preprocessed LLVMGraph 71.19/71.21 Init Location: 0 71.19/71.21 Transitions: 71.19/71.21 <l0, l2, (arg1 = 20) /\ (arg2 = ~(20)) /\ (arg3 = undef20) /\ (undef19 > 0) /\ (undef20 > ~(1))> 71.19/71.21 <l2, l2, ((arg1 - arg3) < 5) /\ (arg3 <= arg1) /\ (arg3 >= arg2), par{arg2 -> (0 - arg1), arg3 -> (~(1) * arg3)}> 71.19/71.21 <l2, l2, (arg3 <= arg1) /\ (arg3 >= arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) < 5), par{arg2 -> (0 - arg1), arg3 -> (~(1) * arg3)}> 71.19/71.21 <l2, l2, (arg1 >= arg3) /\ (arg2 <= arg3) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 < 1), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}> 71.19/71.21 <l2, l2, (arg1 >= arg3) /\ (arg2 <= arg3) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 > 1), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}> 71.19/71.21 <l2, l2, (arg1 > 5) /\ (arg2 < 2) /\ (1 = arg3), par{arg1 -> ~(1), arg2 -> 1, arg3 -> 0}> 71.19/71.21 71.19/71.21 Fresh variables: 71.19/71.21 undef19, undef20, undef21, 71.19/71.21 71.19/71.21 Undef variables: 71.19/71.21 undef19, undef20, undef21, 71.19/71.21 71.19/71.21 Abstraction variables: 71.19/71.21 71.19/71.21 Exit nodes: 71.19/71.21 71.19/71.21 Accepting locations: 71.19/71.21 71.19/71.21 Asserts: 71.19/71.21 71.19/71.21 ************************************************************* 71.19/71.21 ******************************************************************************************* 71.19/71.21 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 71.19/71.21 ******************************************************************************************* 71.19/71.21 71.19/71.21 Init Location: 0 71.19/71.21 Graph 0: 71.19/71.21 Transitions: 71.19/71.21 Variables: 71.19/71.21 71.19/71.21 Graph 1: 71.19/71.21 Transitions: 71.19/71.21 <l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}> 71.19/71.21 <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}> 71.19/71.21 <l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> 71.19/71.21 <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> 71.19/71.21 <l2, l2, arg2 <= 1 /\ 6 <= arg1 /\ arg3 = 1, {arg1 -> -1, arg2 -> 1, arg3 -> 0, rest remain the same}> 71.19/71.21 Variables: 71.19/71.21 arg1, arg2, arg3 71.19/71.21 71.19/71.21 Precedence: 71.19/71.21 Graph 0 71.19/71.21 71.19/71.21 Graph 1 71.19/71.21 <l0, l2, 0 <= undef20 /\ 1 <= undef19 /\ arg3 = undef20 /\ 20 + arg2 = 0 /\ arg1 = 20, {all remain the same}> 71.19/71.21 71.19/71.21 Map Locations to Subgraph: 71.19/71.21 ( 0 , 0 ) 71.19/71.21 ( 2 , 1 ) 71.19/71.21 71.19/71.21 ******************************************************************************************* 71.19/71.21 ******************************** CHECKING ASSERTIONS ******************************** 71.19/71.21 ******************************************************************************************* 71.19/71.21 71.19/71.21 Proving termination of subgraph 0 71.19/71.21 Proving termination of subgraph 1 71.19/71.21 Checking unfeasibility... 71.19/71.21 Time used: 0.087217 71.19/71.21 71.19/71.21 Checking conditional termination of SCC {l2}... 71.19/71.21 71.19/71.21 LOG: CALL solveLinear 71.19/71.21 71.19/71.21 LOG: RETURN solveLinear - Elapsed time: 0.005269s 71.19/71.21 71.19/71.21 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