Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273203
details
property
value
status
complete
benchmark
Velroyen08-alternDivWide.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
16.3959 seconds
cpu usage
16.3936
user time
15.3882
system time
1.00543
max virtual memory
980984.0
max residence set size
253804.0
stage attributes
key
value
starexec-result
NO
output
16.34/16.39 NO 16.34/16.39 16.34/16.39 Solver Timeout: 4 16.34/16.39 Global Timeout: 300 16.34/16.39 No parsing errors! 16.34/16.39 Init Location: 0 16.34/16.39 Transitions: 16.34/16.39 <l0, l3, true> 16.34/16.39 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 16.34/16.39 <l2, l2, (arg1 < 2) /\ (arg1 < ~(5)) /\ (arg1 < 0), par{arg1 -> ((~(1) * arg1) + 1), arg2 -> undef4}> 16.34/16.39 <l2, l2, (arg1 < 2) /\ (arg1 < ~(5)) /\ (arg1 > 0), par{arg1 -> ((~(1) * arg1) + 1), arg2 -> undef6}> 16.34/16.39 <l2, l2, (arg1 < 6) /\ (arg1 > ~(6)) /\ (arg1 < 0), par{arg1 -> 0, arg2 -> undef8}> 16.34/16.39 <l2, l2, (arg1 < 6) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> undef10}> 16.34/16.39 <l2, l2, (arg1 > 5), par{arg1 -> ((~(1) * arg1) - 1), arg2 -> undef12}> 16.34/16.39 <l3, l1, true, par{arg1 -> undef13, arg2 -> undef14}> 16.34/16.39 16.34/16.39 Fresh variables: 16.34/16.39 undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 16.34/16.39 16.34/16.39 Undef variables: 16.34/16.39 undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 16.34/16.39 16.34/16.39 Abstraction variables: 16.34/16.39 16.34/16.39 Exit nodes: 16.34/16.39 16.34/16.39 Accepting locations: 16.34/16.39 16.34/16.39 Asserts: 16.34/16.39 16.34/16.39 Preprocessed LLVMGraph 16.34/16.39 Init Location: 0 16.34/16.39 Transitions: 16.34/16.39 <l0, l2, (arg1 = undef14) /\ (undef13 > 0) /\ (undef14 > ~(1))> 16.34/16.39 <l2, l2, (arg1 < 2) /\ (arg1 < ~(5)) /\ (arg1 < 0), par{arg1 -> ((~(1) * arg1) + 1)}> 16.34/16.39 <l2, l2, (arg1 < 6) /\ (arg1 > ~(6)) /\ (arg1 < 0), par{arg1 -> 0}> 16.34/16.39 <l2, l2, (arg1 < 6) /\ (arg1 > 0), par{arg1 -> 0}> 16.34/16.39 <l2, l2, (arg1 > 5), par{arg1 -> ((~(1) * arg1) - 1)}> 16.34/16.39 16.34/16.39 Fresh variables: 16.34/16.39 undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 16.34/16.39 16.34/16.39 Undef variables: 16.34/16.39 undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 16.34/16.39 16.34/16.39 Abstraction variables: 16.34/16.39 16.34/16.39 Exit nodes: 16.34/16.39 16.34/16.39 Accepting locations: 16.34/16.39 16.34/16.39 Asserts: 16.34/16.39 16.34/16.39 ************************************************************* 16.34/16.39 ******************************************************************************************* 16.34/16.39 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 16.34/16.39 ******************************************************************************************* 16.34/16.39 16.34/16.39 Init Location: 0 16.34/16.39 Graph 0: 16.34/16.39 Transitions: 16.34/16.39 Variables: 16.34/16.39 16.34/16.39 Graph 1: 16.34/16.39 Transitions: 16.34/16.39 <l2, l2, 6 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}> 16.34/16.39 <l2, l2, 1 + arg1 <= 0 /\ 0 <= 5 + arg1, {arg1 -> 0, rest remain the same}> 16.34/16.39 <l2, l2, 1 <= arg1 /\ arg1 <= 5, {arg1 -> 0, rest remain the same}> 16.34/16.39 <l2, l2, 6 <= arg1, {arg1 -> -1 - arg1, rest remain the same}> 16.34/16.39 Variables: 16.34/16.39 arg1 16.34/16.39 16.34/16.39 Precedence: 16.34/16.39 Graph 0 16.34/16.39 16.34/16.39 Graph 1 16.34/16.39 <l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ arg1 = undef14, {all remain the same}> 16.34/16.39 16.34/16.39 Map Locations to Subgraph: 16.34/16.39 ( 0 , 0 ) 16.34/16.39 ( 2 , 1 ) 16.34/16.39 16.34/16.39 ******************************************************************************************* 16.34/16.39 ******************************** CHECKING ASSERTIONS ******************************** 16.34/16.39 ******************************************************************************************* 16.34/16.39 16.34/16.39 Proving termination of subgraph 0 16.34/16.39 Proving termination of subgraph 1 16.34/16.39 Checking unfeasibility... 16.34/16.39 Time used: 0.005606 16.34/16.39 16.34/16.39 Checking conditional termination of SCC {l2}... 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.001282s 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.081129s
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