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