details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	9.46099 seconds
cpu usage	9.45808
user time	8.84163
system time	0.616448
max virtual memory	923336.0
max residence set size	214156.0

stage attributes

key	value
starexec-result	YES

output

9.42/9.45 YES 9.42/9.45 9.42/9.45 Solver Timeout: 4 9.42/9.45 Global Timeout: 300 9.42/9.45 No parsing errors! 9.42/9.45 Init Location: 0 9.42/9.45 Transitions: 9.42/9.45 <l0, l4, true> 9.42/9.45 <l1, l2, (arg1 > 0) /\ (undef2 > ~(1)) /\ (1 = arg2), par{arg1 -> 0, arg2 -> undef2}> 9.42/9.45 <l1, l3, (undef3 > ~(1)) /\ (arg2 > 1) /\ (undef4 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef3, arg2 -> undef4}> 9.42/9.45 <l2, l2, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + arg1)}> 9.42/9.45 <l3, l3, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + arg1)}> 9.42/9.45 <l4, l1, true, par{arg1 -> undef9, arg2 -> undef10}> 9.42/9.45 9.42/9.45 Fresh variables: 9.42/9.45 undef2, undef3, undef4, undef9, undef10, 9.42/9.45 9.42/9.45 Undef variables: 9.42/9.45 undef2, undef3, undef4, undef9, undef10, 9.42/9.45 9.42/9.45 Abstraction variables: 9.42/9.45 9.42/9.45 Exit nodes: 9.42/9.45 9.42/9.45 Accepting locations: 9.42/9.45 9.42/9.45 Asserts: 9.42/9.45 9.42/9.45 Preprocessed LLVMGraph 9.42/9.45 Init Location: 0 9.42/9.45 Transitions: 9.42/9.45 <l0, l2, (undef9 > 0) /\ (undef2 > ~(1)) /\ (1 = undef10), par{arg1 -> 0, arg2 -> undef2}> 9.42/9.45 <l0, l3, (undef3 > ~(1)) /\ (undef10 > 1) /\ (undef4 > ~(1)) /\ (undef9 > 0), par{arg1 -> undef3, arg2 -> undef4}> 9.42/9.45 <l2, l2, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + arg1)}> 9.42/9.45 <l3, l3, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + arg1)}> 9.42/9.45 9.42/9.45 Fresh variables: 9.42/9.45 undef2, undef3, undef4, undef9, undef10, 9.42/9.45 9.42/9.45 Undef variables: 9.42/9.45 undef2, undef3, undef4, undef9, undef10, 9.42/9.45 9.42/9.45 Abstraction variables: 9.42/9.45 9.42/9.45 Exit nodes: 9.42/9.45 9.42/9.45 Accepting locations: 9.42/9.45 9.42/9.45 Asserts: 9.42/9.45 9.42/9.45 ************************************************************* 9.42/9.45 ******************************************************************************************* 9.42/9.45 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 9.42/9.45 ******************************************************************************************* 9.42/9.45 9.42/9.45 Init Location: 0 9.42/9.45 Graph 0: 9.42/9.45 Transitions: 9.42/9.45 Variables: 9.42/9.45 9.42/9.45 Graph 1: 9.42/9.45 Transitions: 9.42/9.45 <l3, l3, 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> 9.42/9.45 Variables: 9.42/9.45 arg1, arg2 9.42/9.45 9.42/9.45 Graph 2: 9.42/9.45 Transitions: 9.42/9.45 <l2, l2, 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> 9.42/9.45 Variables: 9.42/9.45 arg1, arg2 9.42/9.45 9.42/9.45 Precedence: 9.42/9.45 Graph 0 9.42/9.45 9.42/9.45 Graph 1 9.42/9.45 <l0, l3, 0 <= undef3 /\ 0 <= undef4 /\ 1 <= undef9 /\ 2 <= undef10, {arg1 -> undef3, arg2 -> undef4, rest remain the same}> 9.42/9.45 9.42/9.45 Graph 2 9.42/9.45 <l0, l2, 0 <= undef2 /\ 1 <= undef9 /\ undef10 = 1, {arg1 -> 0, arg2 -> undef2, rest remain the same}> 9.42/9.45 9.42/9.45 Map Locations to Subgraph: 9.42/9.45 ( 0 , 0 ) 9.42/9.45 ( 2 , 2 ) 9.42/9.45 ( 3 , 1 ) 9.42/9.45 9.42/9.45 ******************************************************************************************* 9.42/9.45 ******************************** CHECKING ASSERTIONS ******************************** 9.42/9.45 ******************************************************************************************* 9.42/9.45 9.42/9.45 Proving termination of subgraph 0 9.42/9.45 Proving termination of subgraph 1 9.42/9.45 Checking unfeasibility... 9.42/9.45 Time used: 0.0022 9.42/9.45 9.42/9.45 Checking conditional termination of SCC {l3}... 9.42/9.45 9.42/9.45 LOG: CALL solveLinear 9.42/9.45 9.42/9.45 LOG: RETURN solveLinear - Elapsed time: 0.000490s 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