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