Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273044
details
property
value
status
complete
benchmark
Test2.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n135.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
12.5133 seconds
cpu usage
12.512
user time
11.9316
system time
0.58045
max virtual memory
846072.0
max residence set size
159892.0
stage attributes
key
value
starexec-result
YES
output
12.48/12.51 YES 12.48/12.51 12.48/12.51 Solver Timeout: 4 12.48/12.51 Global Timeout: 300 12.48/12.51 No parsing errors! 12.48/12.51 Init Location: 0 12.48/12.51 Transitions: 12.48/12.51 <l0, l4, true> 12.48/12.51 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg3 -> undef3, arg4 -> undef4}> 12.48/12.51 <l2, l3, (arg1 > 0) /\ (arg2 > ~(1)) /\ ((arg2 - (5 * undef9)) >= 0) /\ ((arg2 - (5 * undef9)) < 5) /\ ((arg2 - (4 * undef10)) >= 0) /\ ((arg2 - (4 * undef10)) < 4) /\ ((arg2 - (5 * undef11)) >= 0) /\ ((arg2 - (5 * undef11)) < 5) /\ ((arg2 - (4 * undef12)) < 4) /\ ((arg2 - (4 * undef12)) >= 0), par{arg1 -> arg2, arg2 -> (arg2 - (5 * undef9)), arg3 -> (arg2 - (4 * undef10)), arg4 -> ((arg2 + (arg2 - (5 * undef11))) + ((3 * arg2) - (12 * undef12)))}> 12.48/12.51 <l3, l3, (arg4 > ~(1)) /\ (arg2 < arg1), par{arg1 -> (arg1 - 1), arg4 -> (((arg1 - 1) + arg2) + (3 * arg3))}> 12.48/12.51 <l3, l3, (arg3 < arg2) /\ (arg4 > ~(1)) /\ (arg2 >= arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 2), arg4 -> (((arg1 + 1) + (arg2 - 2)) + (3 * arg3))}> 12.48/12.51 <l3, l3, (arg4 > ~(1)) /\ (arg3 >= arg2) /\ (arg2 >= arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1), arg3 -> (arg3 - 1), arg4 -> (((arg1 + 1) + (arg2 + 1)) + ((3 * arg3) - 3))}> 12.48/12.51 <l4, l1, true, par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}> 12.48/12.51 12.48/12.51 Fresh variables: 12.48/12.51 undef3, undef4, undef9, undef10, undef11, undef12, undef25, undef26, undef27, undef28, 12.48/12.51 12.48/12.51 Undef variables: 12.48/12.51 undef3, undef4, undef9, undef10, undef11, undef12, undef25, undef26, undef27, undef28, 12.48/12.51 12.48/12.51 Abstraction variables: 12.48/12.51 12.48/12.51 Exit nodes: 12.48/12.51 12.48/12.51 Accepting locations: 12.48/12.51 12.48/12.51 Asserts: 12.48/12.51 12.48/12.51 Preprocessed LLVMGraph 12.48/12.51 Init Location: 0 12.48/12.51 Transitions: 12.48/12.51 <l0, l3, (arg1 = undef26) /\ (arg2 = (undef26 - (5 * undef9))) /\ (arg3 = (undef26 - (4 * undef10))) /\ (arg4 = ((undef26 + (undef26 - (5 * undef11))) + ((3 * undef26) - (12 * undef12)))) /\ (undef25 > 0) /\ (undef26 > ~(1)) /\ (undef25 > 0) /\ (undef26 > ~(1)) /\ ((undef26 - (5 * undef9)) >= 0) /\ ((undef26 - (5 * undef9)) < 5) /\ ((undef26 - (4 * undef10)) >= 0) /\ ((undef26 - (4 * undef10)) < 4) /\ ((undef26 - (5 * undef11)) >= 0) /\ ((undef26 - (5 * undef11)) < 5) /\ ((undef26 - (4 * undef12)) < 4) /\ ((undef26 - (4 * undef12)) >= 0)> 12.48/12.51 <l3, l3, (arg4 > ~(1)) /\ (arg2 < arg1), par{arg1 -> (arg1 - 1), arg4 -> (((arg1 - 1) + arg2) + (3 * arg3))}> 12.50/12.51 <l3, l3, (arg3 < arg2) /\ (arg4 > ~(1)) /\ (arg2 >= arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 2), arg4 -> (((arg1 + 1) + (arg2 - 2)) + (3 * arg3))}> 12.50/12.51 <l3, l3, (arg4 > ~(1)) /\ (arg3 >= arg2) /\ (arg2 >= arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1), arg3 -> (arg3 - 1), arg4 -> (((arg1 + 1) + (arg2 + 1)) + ((3 * arg3) - 3))}> 12.50/12.51 12.50/12.51 Fresh variables: 12.50/12.51 undef3, undef4, undef9, undef10, undef11, undef12, undef25, undef26, undef27, undef28, 12.50/12.51 12.50/12.51 Undef variables: 12.50/12.51 undef3, undef4, undef9, undef10, undef11, undef12, undef25, undef26, undef27, undef28, 12.50/12.51 12.50/12.51 Abstraction variables: 12.50/12.51 12.50/12.51 Exit nodes: 12.50/12.51 12.50/12.51 Accepting locations: 12.50/12.51 12.50/12.51 Asserts: 12.50/12.51 12.50/12.51 ************************************************************* 12.50/12.51 ******************************************************************************************* 12.50/12.51 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 12.50/12.51 ******************************************************************************************* 12.50/12.51 12.50/12.51 Init Location: 0 12.50/12.51 Graph 0: 12.50/12.51 Transitions: 12.50/12.51 Variables: 12.50/12.51 12.50/12.51 Graph 1: 12.50/12.51 Transitions: 12.50/12.51 <l3, l3, 0 <= arg4 /\ 1 + arg2 <= arg1, {arg1 -> -1 + arg1, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 <l3, l3, arg1 <= arg2 /\ 0 <= arg4 /\ 1 + arg3 <= arg2, {arg1 -> 1 + arg1, arg2 -> -2 + arg2, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 <l3, l3, arg1 <= arg2 /\ arg2 <= arg3 /\ 0 <= arg4, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, arg3 -> -1 + arg3, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 Variables: 12.50/12.51 arg1, arg2, arg3, arg4 12.50/12.51 12.50/12.51 Precedence: 12.50/12.51 Graph 0 12.50/12.51 12.50/12.51 Graph 1 12.50/12.51 <l0, l3, 5*undef9 <= undef26 /\ 4*undef10 <= undef26 /\ 5*undef11 <= undef26 /\ 4*undef12 <= undef26 /\ 0 <= undef26 /\ 1 <= undef25 /\ undef26 <= 3 + 4*undef10 /\ undef26 <= 3 + 4*undef12 /\ undef26 <= 4 + 5*undef9 /\ undef26 <= 4 + 5*undef11 /\ arg1 = undef26 /\ arg2 + 5*undef9 = undef26 /\ arg3 + 4*undef10 = undef26 /\ arg4 + 5*undef11 + 12*undef12 = 5*undef26, {all remain the same}> 12.50/12.51 12.50/12.51 Map Locations to Subgraph: 12.50/12.51 ( 0 , 0 ) 12.50/12.51 ( 3 , 1 ) 12.50/12.51 12.50/12.51 ******************************************************************************************* 12.50/12.51 ******************************** CHECKING ASSERTIONS ******************************** 12.50/12.51 ******************************************************************************************* 12.50/12.51 12.50/12.51 Proving termination of subgraph 0 12.50/12.51 Proving termination of subgraph 1 12.50/12.51 Checking unfeasibility... 12.50/12.51 Time used: 0.044616 12.50/12.51 12.50/12.51 Checking conditional termination of SCC {l3}... 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.002754s 12.50/12.51 12.50/12.51 LOG: CALL solveLinear 12.50/12.51 12.50/12.51 LOG: RETURN solveLinear - Elapsed time: 0.054400s 12.50/12.51 Trying to remove transition: <l3, l3, arg1 <= arg2 /\ arg2 <= arg3 /\ 0 <= arg4, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, arg3 -> -1 + arg3, arg4 -> -1 + arg1 + arg2 + 3*arg3, rest remain the same}> 12.50/12.51 Solving with 1 template(s). 12.50/12.51
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