details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	29.5458 seconds
cpu usage	29.5394
user time	28.3011
system time	1.23825
max virtual memory	1026152.0
max residence set size	286852.0

stage attributes

key	value
starexec-result	NO

output

29.47/29.54 NO 29.47/29.54 29.47/29.54 Solver Timeout: 4 29.47/29.54 Global Timeout: 300 29.47/29.54 No parsing errors! 29.47/29.54 Init Location: 0 29.47/29.54 Transitions: 29.47/29.54 <l0, l3, true> 29.47/29.54 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 29.47/29.54 <l2, l2, (10 = arg1), par{arg1 -> 10, arg2 -> undef4}> 29.47/29.54 <l2, l2, (arg1 > 5) /\ (arg1 < 10), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 29.47/29.54 <l2, l2, (arg1 > 10), par{arg1 -> (arg1 - 1), arg2 -> undef8}> 29.47/29.54 <l3, l1, true, par{arg1 -> undef9, arg2 -> undef10}> 29.47/29.54 29.47/29.54 Fresh variables: 29.47/29.54 undef2, undef4, undef6, undef8, undef9, undef10, 29.47/29.54 29.47/29.54 Undef variables: 29.47/29.54 undef2, undef4, undef6, undef8, undef9, undef10, 29.47/29.54 29.47/29.54 Abstraction variables: 29.47/29.54 29.47/29.54 Exit nodes: 29.47/29.54 29.47/29.54 Accepting locations: 29.47/29.54 29.47/29.54 Asserts: 29.47/29.54 29.47/29.54 Preprocessed LLVMGraph 29.47/29.54 Init Location: 0 29.47/29.54 Transitions: 29.47/29.54 <l0, l2, (arg1 = undef10) /\ (undef9 > 0) /\ (undef10 > ~(1))> 29.47/29.54 <l2, l2, (10 = arg1), par{arg1 -> 10}> 29.47/29.54 <l2, l2, (arg1 > 5) /\ (arg1 < 10), par{arg1 -> (arg1 - 1)}> 29.47/29.54 <l2, l2, (arg1 > 10), par{arg1 -> (arg1 - 1)}> 29.47/29.54 29.47/29.54 Fresh variables: 29.47/29.54 undef2, undef4, undef6, undef8, undef9, undef10, 29.47/29.54 29.47/29.54 Undef variables: 29.47/29.54 undef2, undef4, undef6, undef8, undef9, undef10, 29.47/29.54 29.47/29.54 Abstraction variables: 29.47/29.54 29.47/29.54 Exit nodes: 29.47/29.54 29.47/29.54 Accepting locations: 29.47/29.54 29.47/29.54 Asserts: 29.47/29.54 29.47/29.54 ************************************************************* 29.47/29.54 ******************************************************************************************* 29.47/29.54 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 29.47/29.54 ******************************************************************************************* 29.47/29.54 29.47/29.54 Init Location: 0 29.47/29.54 Graph 0: 29.47/29.54 Transitions: 29.47/29.54 Variables: 29.47/29.54 29.47/29.54 Graph 1: 29.47/29.54 Transitions: 29.47/29.54 <l2, l2, arg1 = 10, {arg1 -> 10, rest remain the same}> 29.47/29.54 <l2, l2, 6 <= arg1 /\ arg1 <= 9, {arg1 -> -1 + arg1, rest remain the same}> 29.47/29.54 <l2, l2, 11 <= arg1, {arg1 -> -1 + arg1, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 29.47/29.54 Precedence: 29.47/29.54 Graph 0 29.47/29.54 29.47/29.54 Graph 1 29.47/29.54 <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}> 29.47/29.54 29.47/29.54 Map Locations to Subgraph: 29.47/29.54 ( 0 , 0 ) 29.47/29.54 ( 2 , 1 ) 29.47/29.54 29.47/29.54 ******************************************************************************************* 29.47/29.54 ******************************** CHECKING ASSERTIONS ******************************** 29.47/29.54 ******************************************************************************************* 29.47/29.54 29.47/29.54 Proving termination of subgraph 0 29.47/29.54 Proving termination of subgraph 1 29.47/29.54 Checking unfeasibility... 29.47/29.54 Time used: 0.004939 29.47/29.54 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001173s 29.47/29.54 �[33mRanking function: �[36m-1 + arg1�[0m 29.47/29.54 New Graphs: 29.47/29.54 Transitions: 29.47/29.54 <l2, l2, arg1 = 10, {arg1 -> 10, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 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