Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273920
details
property
value
status
complete
benchmark
PastaB10.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0484671 seconds
cpu usage
0.048611
user time
0.037941
system time
0.01067
max virtual memory
113176.0
max residence set size
8136.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.04 YES 0.00/0.04 0.00/0.04 Solver Timeout: 4 0.00/0.04 Global Timeout: 300 0.00/0.04 No parsing errors! 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 <l0, l3, true> 0.00/0.04 <l1, l2, (undef1 > ~(1)) /\ (arg2 > ~(1)) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> (undef1 + undef2)}> 0.00/0.04 <l2, l2, (arg1 > 0) /\ (arg3 > 0) /\ (arg2 > ~(1)), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2)}> 0.00/0.04 <l2, l2, (arg3 > 0) /\ (0 = arg1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0.00/0.04 <l2, l2, (arg3 > 0) /\ (arg2 > 0) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> 0.00/0.04 <l3, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef1, undef2, undef13, undef14, undef15, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef1, undef2, undef13, undef14, undef15, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 Preprocessed LLVMGraph 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 <l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (arg3 = (undef1 + undef2)) /\ (undef1 > ~(1)) /\ (undef14 > ~(1)) /\ (undef2 > ~(1)) /\ (undef13 > 0)> 0.00/0.04 <l2, l2, (arg1 > 0) /\ (arg3 > 0) /\ (arg2 > ~(1)), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2)}> 0.00/0.04 <l2, l2, (arg3 > 0) /\ (0 = arg1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0.00/0.04 <l2, l2, (arg3 > 0) /\ (arg2 > 0) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef1, undef2, undef13, undef14, undef15, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef1, undef2, undef13, undef14, undef15, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 ************************************************************* 0.00/0.04 ******************************************************************************************* 0.00/0.04 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Init Location: 0 0.00/0.04 Graph 0: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Graph 1: 0.00/0.04 Transitions: 0.00/0.04 <l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 0 <= arg2, {arg1 -> -1 + arg1, arg3 -> -1 + arg1 + arg2, rest remain the same}> 0.00/0.04 <l2, l2, 1 <= arg3 /\ arg1 = 0 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}> 0.00/0.04 <l2, l2, 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 arg1, arg2, arg3 0.00/0.04 0.00/0.04 Precedence: 0.00/0.04 Graph 0 0.00/0.04 0.00/0.04 Graph 1 0.00/0.04 <l0, l2, 1 <= undef13 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef14 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg3 = undef1 + undef2, {all remain the same}> 0.00/0.04 0.00/0.04 Map Locations to Subgraph: 0.00/0.04 ( 0 , 0 ) 0.00/0.04 ( 2 , 1 ) 0.00/0.04 0.00/0.04 ******************************************************************************************* 0.00/0.04 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Proving termination of subgraph 0 0.00/0.04 Proving termination of subgraph 1 0.00/0.04 Checking unfeasibility... 0.00/0.04 Time used: 0.010785 0.00/0.04 �[33mSome transition disabled by a set of invariant(s):�[0m 0.00/0.04 �[36mInvariant at l2: arg3 <= arg1 + arg2�[0m 0.00/0.04 0.00/0.04 �[33mStrengthening and disabling transitions...�[0m 0.00/0.04 > It's unfeasible. Removing transition: 0.00/0.04 <l2, l2, 1 <= arg3 /\ arg1 = 0 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}> 0.00/0.04 0.00/0.04 LOG: CALL solverLinear in Graph for feasibility 0.00/0.04 0.00/0.04 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.04 Strengthening transition (result): 0.00/0.04 <l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2, {arg1 -> -1 + arg1, arg3 -> -1 + arg1 + arg2, rest remain the same}> 0.00/0.04 0.00/0.04 LOG: CALL solverLinear in Graph for feasibility
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