Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273617
details
property
value
status
complete
benchmark
TypeSwitch.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
5.60092 seconds
cpu usage
5.5815
user time
5.10329
system time
0.47821
max virtual memory
979588.0
max residence set size
249844.0
stage attributes
key
value
starexec-result
NO
output
5.56/5.59 NO 5.56/5.59 5.56/5.59 Solver Timeout: 4 5.56/5.59 Global Timeout: 300 5.56/5.59 No parsing errors! 5.56/5.59 Init Location: 0 5.56/5.59 Transitions: 5.56/5.59 <l0, l3, true> 5.56/5.59 <l1, l2, (undef1 <= arg1) /\ (undef2 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > 0) /\ (2 = arg2), par{arg1 -> undef1, arg2 -> undef2, arg3 -> 2}> 5.56/5.59 <l1, l2, (undef4 <= arg1) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0) /\ (undef5 > 0) /\ (1 = arg2), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 1}> 5.56/5.59 <l2, l2, (undef7 <= arg1) /\ (undef7 <= arg2) /\ (arg1 >= undef8) /\ (arg2 >= undef8) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8}> 5.56/5.59 <l2, l2, (undef10 <= arg1) /\ (undef10 <= arg2) /\ (undef11 <= arg1) /\ (undef11 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef10 > 0) /\ (undef11 > 0), par{arg1 -> undef10, arg2 -> undef11}> 5.56/5.59 <l3, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 5.56/5.59 5.56/5.59 Fresh variables: 5.56/5.59 undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.56/5.59 5.56/5.59 Undef variables: 5.56/5.59 undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.56/5.59 5.56/5.59 Abstraction variables: 5.56/5.59 5.56/5.59 Exit nodes: 5.56/5.59 5.56/5.59 Accepting locations: 5.56/5.59 5.56/5.59 Asserts: 5.56/5.59 5.56/5.59 Preprocessed LLVMGraph 5.56/5.59 Init Location: 0 5.56/5.59 Transitions: 5.56/5.59 <l0, l2, (undef1 <= undef13) /\ (undef2 <= undef13) /\ (undef13 > 0) /\ (undef1 > 0) /\ (undef2 > 0) /\ (2 = undef14), par{arg1 -> undef1, arg2 -> undef2}> 5.56/5.59 <l0, l2, (undef4 <= undef13) /\ (undef5 <= undef13) /\ (undef13 > 0) /\ (undef4 > 0) /\ (undef5 > 0) /\ (1 = undef14), par{arg1 -> undef4, arg2 -> undef5}> 5.56/5.59 <l2, l2, (undef7 <= arg1) /\ (undef7 <= arg2) /\ (arg1 >= undef8) /\ (arg2 >= undef8) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8}> 5.56/5.59 <l2, l2, (undef10 <= arg1) /\ (undef10 <= arg2) /\ (undef11 <= arg1) /\ (undef11 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef10 > 0) /\ (undef11 > 0), par{arg1 -> undef10, arg2 -> undef11}> 5.56/5.59 5.56/5.59 Fresh variables: 5.56/5.59 undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.56/5.59 5.56/5.59 Undef variables: 5.56/5.59 undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.56/5.59 5.56/5.59 Abstraction variables: 5.56/5.59 5.56/5.59 Exit nodes: 5.56/5.59 5.56/5.59 Accepting locations: 5.56/5.59 5.56/5.59 Asserts: 5.56/5.59 5.56/5.59 ************************************************************* 5.56/5.59 ******************************************************************************************* 5.56/5.59 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.56/5.59 ******************************************************************************************* 5.56/5.59 5.56/5.59 Init Location: 0 5.56/5.59 Graph 0: 5.56/5.59 Transitions: 5.56/5.59 Variables: 5.56/5.59 5.56/5.59 Graph 1: 5.56/5.59 Transitions: 5.56/5.59 <l2, l2, undef7 <= arg1 /\ undef8 <= arg1 /\ undef7 <= arg2 /\ undef8 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef7 /\ 1 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}> 5.56/5.59 <l2, l2, undef10 <= arg1 /\ undef11 <= arg1 /\ undef10 <= arg2 /\ undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef10 /\ 1 <= undef11, {arg1 -> undef10, arg2 -> undef11, rest remain the same}> 5.56/5.59 Variables: 5.56/5.59 arg1, arg2 5.56/5.59 5.56/5.59 Precedence: 5.56/5.59 Graph 0 5.56/5.59 5.56/5.59 Graph 1 5.56/5.59 <l0, l2, undef1 <= undef13 /\ undef2 <= undef13 /\ 1 <= undef1 /\ 1 <= undef2 /\ 1 <= undef13 /\ undef14 = 2, {arg1 -> undef1, arg2 -> undef2, rest remain the same}> 5.56/5.59 <l0, l2, undef4 <= undef13 /\ undef5 <= undef13 /\ 1 <= undef4 /\ 1 <= undef5 /\ 1 <= undef13 /\ undef14 = 1, {arg1 -> undef4, arg2 -> undef5, rest remain the same}> 5.56/5.59 5.56/5.59 Map Locations to Subgraph: 5.56/5.59 ( 0 , 0 ) 5.56/5.59 ( 2 , 1 ) 5.56/5.59 5.56/5.59 ******************************************************************************************* 5.56/5.59 ******************************** CHECKING ASSERTIONS ******************************** 5.56/5.59 ******************************************************************************************* 5.56/5.59 5.56/5.59 Proving termination of subgraph 0 5.56/5.59 Proving termination of subgraph 1 5.56/5.59 Checking unfeasibility... 5.56/5.59 Time used: 0.006524 5.56/5.59 5.56/5.59 Checking conditional termination of SCC {l2}... 5.56/5.59 5.56/5.59 LOG: CALL solveLinear 5.56/5.59 5.56/5.59 LOG: RETURN solveLinear - Elapsed time: 0.001896s 5.56/5.59 5.56/5.59 LOG: CALL solveLinear 5.56/5.59 5.56/5.59 LOG: RETURN solveLinear - Elapsed time: 0.010600s 5.56/5.59 Trying to remove transition: <l2, l2, undef10 <= arg1 /\ undef11 <= arg1 /\ undef10 <= arg2 /\ undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef10 /\ 1 <= undef11, {arg1 -> undef10, arg2 -> undef11, rest remain the same}> 5.56/5.60 Solving with 1 template(s). 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinearGetFirstSolution
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