Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273476
details
property
value
status
complete
benchmark
costa09-example_1.jar-obl-10.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n088.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0399849 seconds
cpu usage
0.040126
user time
0.033067
system time
0.007059
max virtual memory
113176.0
max residence set size
6052.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.03 YES 0.00/0.03 0.00/0.03 Solver Timeout: 4 0.00/0.03 Global Timeout: 300 0.00/0.03 No parsing errors! 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 <l0, l5, true> 0.00/0.03 <l1, l2, true, par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0.00/0.03 <l2, l2, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 0.00/0.03 <l2, l3, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0.00/0.03 <l3, l3, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 2), arg3 -> (arg2 + 2)}> 0.00/0.03 <l3, l4, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0.00/0.03 <l4, l4, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 3), arg3 -> (arg2 + 3)}> 0.00/0.03 <l5, l1, true, par{arg1 -> undef19, arg2 -> undef20, arg3 -> undef21}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef19, undef20, undef21, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef19, undef20, undef21, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 Preprocessed LLVMGraph 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 <l0, l2, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = 0)> 0.00/0.03 <l2, l2, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 0.00/0.03 <l2, l3, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0.00/0.03 <l3, l3, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 2), arg3 -> (arg2 + 2)}> 0.00/0.03 <l3, l4, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0.00/0.03 <l4, l4, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 3), arg3 -> (arg2 + 3)}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef19, undef20, undef21, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef19, undef20, undef21, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 ************************************************************* 0.00/0.03 ******************************************************************************************* 0.00/0.03 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Init Location: 0 0.00/0.03 Graph 0: 0.00/0.03 Transitions: 0.00/0.03 Variables: 0.00/0.03 0.00/0.03 Graph 1: 0.00/0.03 Transitions: 0.00/0.03 <l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg2 <= 1000 /\ arg2 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2, arg3 0.00/0.03 0.00/0.03 Graph 2: 0.00/0.03 Transitions: 0.00/0.03 <l3, l3, 0 <= arg1 /\ 0 <= arg2 /\ arg2 <= 1000 /\ arg2 = arg3, {arg1 -> arg1 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2, arg3 0.00/0.03 0.00/0.03 Graph 3: 0.00/0.03 Transitions: 0.00/0.03 <l4, l4, 0 <= arg1 /\ 0 <= arg2 /\ arg2 <= 1000 /\ arg2 = arg3, {arg1 -> arg1 + arg2, arg2 -> 3 + arg2, arg3 -> 3 + arg2, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2, arg3 0.00/0.03 0.00/0.03 Precedence: 0.00/0.03 Graph 0 0.00/0.03 0.00/0.03 Graph 1 0.00/0.03 <l0, l2, arg1 = 0 /\ arg2 = 0 /\ arg3 = 0, {all remain the same}> 0.00/0.03 0.00/0.03 Graph 2 0.00/0.03 <l2, l3, 1001 <= arg2 /\ arg2 = arg3, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}> 0.00/0.03 0.00/0.03 Graph 3 0.00/0.03 <l3, l4, 1001 <= arg2 /\ arg2 = arg3, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}> 0.00/0.03 0.00/0.03 Map Locations to Subgraph: 0.00/0.03 ( 0 , 0 ) 0.00/0.03 ( 2 , 1 ) 0.00/0.03 ( 3 , 2 ) 0.00/0.03 ( 4 , 3 ) 0.00/0.03
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