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