Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273020
details
property
value
status
complete
benchmark
PastaC9.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n123.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0398011 seconds
cpu usage
0.039922
user time
0.030895
system time
0.009027
max virtual memory
113176.0
max residence set size
7312.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.03 YES 0.00/0.03 0.00/0.03 Solver Timeout: 4 0.00/0.03 Global Timeout: 300 0.00/0.03 No parsing errors! 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 <l0, l3, true> 0.00/0.03 <l1, l2, (undef1 > ~(1)) /\ (arg2 > ~(1)) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> 2}> 0.00/0.03 <l2, l2, (arg3 > ~(1)) /\ (undef7 > 41) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}> 0.00/0.03 <l2, l2, (arg1 > 0) /\ (arg3 > ~(1)) /\ (arg2 > 0) /\ (undef11 > ~(1)) /\ (undef8 > ~(1)) /\ (undef11 < 42), par{arg1 -> undef8, arg2 -> (arg2 - 1), arg3 -> (arg3 + 2)}> 0.00/0.03 <l3, l1, true, par{arg1 -> undef12, arg2 -> undef13, arg3 -> undef14}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef2, undef7, undef8, undef11, undef12, undef13, undef14, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef2, undef7, undef8, undef11, undef12, undef13, undef14, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 Preprocessed LLVMGraph 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 <l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (arg3 = 2) /\ (undef1 > ~(1)) /\ (undef13 > ~(1)) /\ (undef2 > ~(1)) /\ (undef12 > 0)> 0.00/0.03 <l2, l2, (arg3 > ~(1)) /\ (undef7 > 41) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}> 0.00/0.03 <l2, l2, (arg1 > 0) /\ (arg3 > ~(1)) /\ (arg2 > 0) /\ (undef11 > ~(1)) /\ (undef8 > ~(1)) /\ (undef11 < 42), par{arg1 -> undef8, arg2 -> (arg2 - 1), arg3 -> (arg3 + 2)}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef2, undef7, undef8, undef11, undef12, undef13, undef14, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef2, undef7, undef8, undef11, undef12, undef13, undef14, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 ************************************************************* 0.00/0.03 ******************************************************************************************* 0.00/0.03 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Init Location: 0 0.00/0.03 Graph 0: 0.00/0.03 Transitions: 0.00/0.03 Variables: 0.00/0.03 0.00/0.03 Graph 1: 0.00/0.03 Transitions: 0.00/0.03 <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 0 <= arg3 /\ 42 <= undef7, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> 0.00/0.03 <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 0 <= arg3 /\ 0 <= undef8 /\ 0 <= undef11 /\ undef11 <= 41, {arg1 -> undef8, arg2 -> -1 + arg2, arg3 -> 2 + arg3, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2, arg3 0.00/0.03 0.00/0.03 Precedence: 0.00/0.03 Graph 0 0.00/0.03 0.00/0.03 Graph 1 0.00/0.03 <l0, l2, 1 <= undef12 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef13 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg3 = 2, {all remain the same}> 0.00/0.03 0.00/0.03 Map Locations to Subgraph: 0.00/0.03 ( 0 , 0 ) 0.00/0.03 ( 2 , 1 ) 0.00/0.03 0.00/0.03 ******************************************************************************************* 0.00/0.03 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Proving termination of subgraph 0 0.00/0.03 Proving termination of subgraph 1 0.00/0.03 Checking unfeasibility... 0.00/0.03 Time used: 0.009332 0.00/0.03 0.00/0.03 Checking conditional termination of SCC {l2}... 0.00/0.03 0.00/0.03 LOG: CALL solveLinear 0.00/0.03 0.00/0.03 LOG: RETURN solveLinear - Elapsed time: 0.001915s 0.00/0.03 �[33mRanking function: �[36m-1 + arg2�[0m 0.00/0.03 New Graphs: 0.00/0.03 Transitions: 0.00/0.03 <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 0 <= arg3 /\ 42 <= undef7, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2, arg3 0.00/0.03 Checking conditional termination of SCC {l2}... 0.00/0.03 0.00/0.03 LOG: CALL solveLinear 0.00/0.03 0.00/0.03 LOG: RETURN solveLinear - Elapsed time: 0.000852s
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