Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273149
details
property
value
status
complete
benchmark
FactSumList.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n032.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0931159 seconds
cpu usage
0.093254
user time
0.079451
system time
0.013803
max virtual memory
113176.0
max residence set size
10048.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.09 YES 0.00/0.09 0.00/0.09 Solver Timeout: 4 0.00/0.09 Global Timeout: 300 0.00/0.09 No parsing errors! 0.00/0.09 Init Location: 0 0.00/0.09 Transitions: 0.00/0.09 <l0, l4, true> 0.00/0.09 <l1, l2, (undef1 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5, arg6 -> undef6}> 0.00/0.09 <l2, l3, (undef7 <= arg1) /\ ((undef12 + 1) <= arg1) /\ (arg1 > 0) /\ (undef7 > 0) /\ (undef12 > ~(1)) /\ ((undef11 + 2) <= arg1), par{arg1 -> undef7, arg2 -> 1, arg3 -> 1, arg4 -> 1, arg5 -> undef11, arg6 -> undef12}> 0.00/0.09 <l3, l2, (arg2 > 0) /\ (arg5 < arg3) /\ (arg1 >= (undef13 + 1)) /\ (arg6 >= undef13) /\ (arg1 > 0) /\ (arg6 > ~(1)) /\ (undef13 > ~(1)) /\ ((arg5 + 2) <= arg1) /\ (arg3 = arg4), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, arg5 -> undef17, arg6 -> undef18}> 0.00/0.09 <l3, l3, (arg5 >= arg3) /\ (arg3 > 0) /\ (arg2 > 0) /\ (undef19 <= arg1) /\ ((undef24 + 1) <= arg1) /\ (undef24 <= arg6) /\ (arg1 > 0) /\ (arg6 > ~(1)) /\ (undef19 > 0) /\ (undef24 > ~(1)) /\ ((arg5 + 2) <= arg1) /\ (arg3 = arg4), par{arg1 -> undef19, arg2 -> (arg2 * arg3), arg3 -> (arg3 + 1), arg4 -> (arg3 + 1), arg6 -> undef24}> 0.00/0.09 <l4, l1, true, par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28, arg5 -> undef29, arg6 -> undef30}> 0.00/0.09 0.00/0.09 Fresh variables: 0.00/0.09 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef24, undef25, undef26, undef27, undef28, undef29, undef30, 0.00/0.09 0.00/0.09 Undef variables: 0.00/0.09 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef24, undef25, undef26, undef27, undef28, undef29, undef30, 0.00/0.09 0.00/0.09 Abstraction variables: 0.00/0.09 0.00/0.09 Exit nodes: 0.00/0.09 0.00/0.09 Accepting locations: 0.00/0.09 0.00/0.09 Asserts: 0.00/0.09 0.00/0.09 Preprocessed LLVMGraph 0.00/0.09 Init Location: 0 0.00/0.09 Transitions: 0.00/0.09 <l0, l3, (arg1 = undef7) /\ (arg2 = 1) /\ (arg3 = 1) /\ (arg4 = 1) /\ (arg5 = undef11) /\ (arg6 = undef12) /\ (undef1 > 3) /\ (undef7 <= undef1) /\ ((undef12 + 1) <= undef1) /\ (undef1 > 0) /\ (undef7 > 0) /\ (undef12 > ~(1)) /\ ((undef11 + 2) <= undef1)> 0.00/0.09 <l3, l3, (arg2 > 0) /\ (arg5 < arg3) /\ (arg1 >= (undef13 + 1)) /\ (arg6 >= undef13) /\ (arg1 > 0) /\ (arg6 > ~(1)) /\ (undef13 > ~(1)) /\ ((arg5 + 2) <= arg1) /\ (arg3 = arg4) /\ (undef7 <= undef13) /\ ((undef12 + 1) <= undef13) /\ (undef13 > 0) /\ (undef7 > 0) /\ (undef12 > ~(1)) /\ ((undef11 + 2) <= undef13), par{arg1 -> undef7, arg2 -> 1, arg3 -> 1, arg4 -> 1, arg5 -> undef11, arg6 -> undef12}> 0.00/0.09 <l3, l3, (arg5 >= arg3) /\ (arg3 > 0) /\ (arg2 > 0) /\ (undef19 <= arg1) /\ ((undef24 + 1) <= arg1) /\ (undef24 <= arg6) /\ (arg1 > 0) /\ (arg6 > ~(1)) /\ (undef19 > 0) /\ (undef24 > ~(1)) /\ ((arg5 + 2) <= arg1) /\ (arg3 = arg4), par{arg1 -> undef19, arg2 -> abstract_31, arg3 -> (arg3 + 1), arg4 -> (arg3 + 1), arg6 -> undef24}> 0.00/0.09 0.00/0.09 Fresh variables: 0.00/0.09 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef24, undef25, undef26, undef27, undef28, undef29, undef30, abstract_31, 0.00/0.09 0.00/0.09 Undef variables: 0.00/0.09 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef24, undef25, undef26, undef27, undef28, undef29, undef30, 0.00/0.09 0.00/0.09 Abstraction variables: 0.00/0.09 abstract_31 --> ( * arg2 arg3 ) 0.00/0.09 0.00/0.09 Exit nodes: 0.00/0.09 0.00/0.09 Accepting locations: 0.00/0.09 0.00/0.09 Asserts: 0.00/0.09 0.00/0.09 ************************************************************* 0.00/0.09 ******************************************************************************************* 0.00/0.09 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.09 ******************************************************************************************* 0.00/0.09 0.00/0.09 Init Location: 0 0.00/0.09 Graph 0: 0.00/0.09 Transitions: 0.00/0.09 Variables: 0.00/0.09 0.00/0.09 Graph 1: 0.00/0.09 Transitions: 0.00/0.09 <l3, l3, 1 <= arg1 /\ 1 + undef13 <= arg1 /\ 1 <= arg2 /\ 1 + arg5 <= arg3 /\ 1 <= undef7 /\ 1 + undef12 <= undef13 /\ 1 <= undef13 /\ 0 <= arg6 /\ undef13 <= arg6 /\ undef7 <= undef13 /\ 0 <= undef12 /\ 2 + arg5 <= arg1 /\ 2 + undef11 <= undef13 /\ arg3 = arg4, {arg1 -> undef7, arg2 -> 1, arg3 -> 1, arg4 -> 1, arg5 -> undef11, arg6 -> undef12, rest remain the same}> 0.00/0.09 <l3, l3, 1 <= arg1 /\ 1 + undef24 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef19 /\ undef19 <= arg1 /\ arg3 <= arg5 /\ 0 <= arg6 /\ undef24 <= arg6 /\ 0 <= undef24 /\ 2 + arg5 <= arg1 /\ arg3 = arg4, {arg1 -> undef19, arg2 -> abstract_31, arg3 -> 1 + arg3, arg4 -> 1 + arg3, arg6 -> undef24, rest remain the same}> 0.00/0.09 Variables: 0.00/0.09 arg1, arg2, arg3, arg4, arg5, arg6 0.00/0.09 0.00/0.09 Precedence: 0.00/0.09 Graph 0 0.00/0.09 0.00/0.09 Graph 1 0.00/0.09 <l0, l3, 1 + undef12 <= undef1 /\ 1 <= undef7 /\ undef7 <= undef1 /\ 0 <= undef12 /\ 2 + undef11 <= undef1 /\ 4 <= undef1 /\ arg1 = undef7 /\ arg5 = undef11 /\ arg6 = undef12 /\ arg2 = 1 /\ arg3 = 1 /\ arg4 = 1, {all remain the same}> 0.00/0.09 0.00/0.09 Map Locations to Subgraph: 0.00/0.09 ( 0 , 0 ) 0.00/0.09 ( 3 , 1 ) 0.00/0.09 0.00/0.09 ******************************************************************************************* 0.00/0.09 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.09 ******************************************************************************************* 0.00/0.09 0.00/0.09 Detected abstraction incompatible with non-termination check. 0.00/0.09 Proving termination of subgraph 0 0.00/0.09 Proving termination of subgraph 1 0.00/0.09 Checking unfeasibility... 0.00/0.09 Time used: 0.048451 0.00/0.09 0.00/0.09 Checking conditional termination of SCC {l3}... 0.00/0.09 0.00/0.09 LOG: CALL solveLinear 0.00/0.09 0.00/0.09 LOG: RETURN solveLinear - Elapsed time: 0.005101s 0.00/0.09 �[33mRanking function: �[36m1 + arg3 - arg4 + arg6�[0m 0.00/0.09 New Graphs: 0.00/0.09 Transitions: 0.00/0.09 <l3, l3, 1 <= arg1 /\ 1 + undef24 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef19 /\ undef19 <= arg1 /\ arg3 <= arg5 /\ 0 <= arg6 /\ undef24 <= arg6 /\ 0 <= undef24 /\ 2 + arg5 <= arg1 /\ arg3 = arg4, {arg1 -> undef19, arg2 -> abstract_31, arg3 -> 1 + arg3, arg4 -> 1 + arg3, arg6 -> undef24, rest remain the same}> 0.00/0.09 Variables: 0.00/0.09 arg1, arg2, arg3, arg4, arg5, arg6 0.00/0.09 Checking conditional termination of SCC {l3}... 0.00/0.09
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