Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432272882
details
property
value
status
complete
benchmark
Et4-rec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n001.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
30.5774 seconds
cpu usage
30.5595
user time
29.4975
system time
1.062
max virtual memory
880604.0
max residence set size
195356.0
stage attributes
key
value
starexec-result
YES
output
30.50/30.57 YES 30.50/30.57 30.50/30.57 Solver Timeout: 4 30.50/30.57 Global Timeout: 300 30.50/30.57 No parsing errors! 30.50/30.57 Init Location: 0 30.50/30.57 Transitions: 30.50/30.57 <l0, l3, true> 30.50/30.57 <l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}> 30.50/30.57 <l1, l2, (arg1 > 0) /\ (undef6 > ~(1)) /\ (1 = arg2), par{arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1}> 30.50/30.57 <l1, l2, (undef13 > ~(1)) /\ (undef11 > ~(1)) /\ (arg1 > 0) /\ (2 = arg2), par{arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2}> 30.50/30.57 <l1, l2, (undef16 > ~(1)) /\ (arg2 > 2) /\ (undef21 > ~(1)) /\ (undef17 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef16, arg2 -> undef17, arg3 -> (undef21 - undef17), arg4 -> arg2, arg5 -> 3}> 30.50/30.57 <l2, l2, ((arg1 + 1) > arg1) /\ (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg1 = arg2), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (10 - (arg1 + 1))}> 30.50/30.57 <l2, l2, (arg3 > 0) /\ (((arg1 + 1) + undef32) >= 1) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > ~(1)) /\ (undef32 > ~(1)) /\ (arg1 = arg2), par{arg1 -> ((arg1 + 1) + undef32), arg2 -> ((arg1 + 1) + undef32), arg3 -> (10 - ((arg1 + 1) + undef32)), arg5 -> (arg5 + 1)}> 30.50/30.57 <l3, l1, true, par{arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> 30.50/30.57 30.50/30.57 Fresh variables: 30.50/30.57 undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, 30.50/30.57 30.50/30.57 Undef variables: 30.50/30.57 undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, 30.50/30.57 30.50/30.57 Abstraction variables: 30.50/30.57 30.50/30.57 Exit nodes: 30.50/30.57 30.50/30.57 Accepting locations: 30.50/30.57 30.50/30.57 Asserts: 30.50/30.57 30.50/30.57 Preprocessed LLVMGraph 30.50/30.57 Init Location: 0 30.50/30.57 Transitions: 30.50/30.57 <l0, l2, (undef33 > 0) /\ (0 = undef34), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}> 30.50/30.57 <l0, l2, (undef33 > 0) /\ (undef6 > ~(1)) /\ (1 = undef34), par{arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1}> 30.50/30.57 <l0, l2, (undef13 > ~(1)) /\ (undef11 > ~(1)) /\ (undef33 > 0) /\ (2 = undef34), par{arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2}> 30.50/30.57 <l0, l2, (undef16 > ~(1)) /\ (undef34 > 2) /\ (undef21 > ~(1)) /\ (undef17 > ~(1)) /\ (undef33 > 0), par{arg1 -> undef16, arg2 -> undef17, arg3 -> (undef21 - undef17), arg4 -> undef34, arg5 -> 3}> 30.50/30.57 <l2, l2, ((arg1 + 1) > arg1) /\ (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg1 = arg2), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (10 - (arg1 + 1))}> 30.50/30.57 <l2, l2, (arg3 > 0) /\ (((arg1 + 1) + undef32) >= 1) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > ~(1)) /\ (undef32 > ~(1)) /\ (arg1 = arg2), par{arg1 -> ((arg1 + 1) + undef32), arg2 -> ((arg1 + 1) + undef32), arg3 -> (10 - ((arg1 + 1) + undef32)), arg5 -> (arg5 + 1)}> 30.50/30.57 30.50/30.57 Fresh variables: 30.50/30.57 undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, 30.50/30.57 30.50/30.57 Undef variables: 30.50/30.57 undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, 30.50/30.57 30.50/30.57 Abstraction variables: 30.50/30.57 30.50/30.57 Exit nodes: 30.50/30.57 30.50/30.57 Accepting locations: 30.50/30.57 30.50/30.57 Asserts: 30.50/30.57 30.50/30.57 ************************************************************* 30.50/30.57 ******************************************************************************************* 30.50/30.57 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 30.50/30.57 ******************************************************************************************* 30.50/30.57 30.50/30.57 Init Location: 0 30.50/30.57 Graph 0: 30.50/30.57 Transitions: 30.50/30.57 Variables: 30.50/30.57 30.50/30.57 Graph 1: 30.50/30.57 Transitions: 30.50/30.57 <l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> 30.50/30.57 <l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> 30.50/30.57 Variables: 30.50/30.57 arg1, arg2, arg3, arg4, arg5 30.50/30.57 30.50/30.57 Precedence: 30.50/30.57 Graph 0 30.50/30.57 30.50/30.57 Graph 1 30.50/30.57 <l0, l2, 1 <= undef33 /\ undef34 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}> 30.50/30.57 <l0, l2, 0 <= undef6 /\ 1 <= undef33 /\ undef34 = 1, {arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1, rest remain the same}> 30.50/30.57 <l0, l2, 0 <= undef11 /\ 0 <= undef13 /\ 1 <= undef33 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> 30.50/30.57 <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 0 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> 30.50/30.57 30.50/30.57 Map Locations to Subgraph: 30.50/30.57 ( 0 , 0 ) 30.50/30.57 ( 2 , 1 ) 30.50/30.57 30.50/30.57 ******************************************************************************************* 30.50/30.57 ******************************** CHECKING ASSERTIONS ******************************** 30.50/30.57 ******************************************************************************************* 30.50/30.57 30.50/30.57 Proving termination of subgraph 0 30.50/30.57 Proving termination of subgraph 1 30.50/30.57 Checking unfeasibility... 30.50/30.57 Time used: 0.013536 30.50/30.57 30.50/30.57 Checking conditional termination of SCC {l2}... 30.50/30.57 30.50/30.57 LOG: CALL solveLinear 30.50/30.57 30.50/30.57 LOG: RETURN solveLinear - Elapsed time: 0.002594s 30.50/30.57 �[33mRanking function: �[36marg4 - arg5�[0m 30.50/30.57 New Graphs:
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