Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273995
details
property
value
status
complete
benchmark
java_Double2.c.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n127.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.050406 seconds
cpu usage
0.050572
user time
0.039347
system time
0.011225
max virtual memory
113176.0
max residence set size
6844.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, l9, true> 0.00/0.04 <l1, l2, (undef3 = undef3) /\ (undef4 = undef4), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> 0.00/0.04 <l3, l4, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)), par{oldX0^0 -> undef7, oldX1^0 -> undef8, x0^0 -> (0 + undef7), x1^0 -> (~(1) + undef8)}> 0.00/0.04 <l3, l5, (undef14 = (0 + x1^0)) /\ (undef15 = undef15), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef14, oldX2^0 -> undef15, x0^0 -> (0 + undef14), x1^0 -> (0 + undef15)}> 0.00/0.04 <l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((1 + undef20) <= 0), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}> 0.00/0.04 <l4, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ (0 <= (0 + undef26)), par{oldX0^0 -> undef25, oldX1^0 -> undef26, x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}> 0.00/0.04 <l6, l4, (undef31 = (0 + x0^0)), par{oldX0^0 -> undef31, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef31), x1^0 -> (~(1) + undef31)}> 0.00/0.04 <l5, l6, (undef37 = (0 + x0^0)) /\ (undef39 = undef39), par{oldX0^0 -> undef37, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef39, x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}> 0.00/0.04 <l7, l8, (undef45 = undef45) /\ (undef46 = undef46), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef45, oldX3^0 -> undef46, x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}> 0.00/0.04 <l7, l8, true> 0.00/0.04 <l7, l2, true> 0.00/0.04 <l7, l1, true> 0.00/0.04 <l7, l3, true> 0.00/0.04 <l7, l4, true> 0.00/0.04 <l7, l6, true> 0.00/0.04 <l7, l5, true> 0.00/0.04 <l9, l7, true> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 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, l8, (undef45 = undef45) /\ (undef46 = undef46), par{x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}> 0.00/0.04 <l0, l8, true> 0.00/0.04 <l0, l2, true> 0.00/0.04 <l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> 0.00/0.04 <l0, l3, true> 0.00/0.04 <l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((1 + undef20) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> 0.00/0.04 <l0, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ (0 <= (0 + undef26)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}> 0.00/0.04 <l0, l2, (undef31 = (0 + x0^0)) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + (~(1) + undef31))) /\ ((1 + undef20) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> 0.00/0.04 <l0, l3, (undef31 = (0 + x0^0)) /\ (undef25 = (0 + (0 + undef31))) /\ (undef26 = (0 + (~(1) + undef31))) /\ (0 <= (0 + undef26)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}> 0.00/0.04 <l0, l2, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + (~(1) + undef31))) /\ ((1 + undef20) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> 0.00/0.04 <l0, l3, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef25 = (0 + (0 + undef31))) /\ (undef26 = (0 + (~(1) + undef31))) /\ (0 <= (0 + undef26)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}> 0.00/0.04 <l3, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef19 = (0 + (0 + undef7))) /\ (undef20 = (0 + (~(1) + undef8))) /\ ((1 + undef20) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> 0.00/0.04 <l3, l3, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef25 = (0 + (0 + undef7))) /\ (undef26 = (0 + (~(1) + undef8))) /\ (0 <= (0 + undef26)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}> 0.00/0.04 <l3, l2, (undef14 = (0 + x1^0)) /\ (undef15 = undef15) /\ (undef37 = (0 + (0 + undef14))) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + (~(1) + undef31))) /\ ((1 + undef20) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> 0.00/0.04 <l3, l3, (undef14 = (0 + x1^0)) /\ (undef15 = undef15) /\ (undef37 = (0 + (0 + undef14))) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef25 = (0 + (0 + undef31))) /\ (undef26 = (0 + (~(1) + undef31))) /\ (0 <= (0 + undef26)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 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 <l3, l3, 0 <= undef26 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef25 /\ undef8 = 1 + undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}> 0.00/0.04 <l3, l3, 0 <= undef26 /\ x1^0 = undef14 /\ undef14 = undef37 /\ undef25 = undef31 /\ undef31 = undef37 /\ 1 + undef26 = undef31, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 x0^0, x1^0 0.00/0.04 0.00/0.04 Graph 2: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Graph 3: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Precedence: 0.00/0.04 Graph 0 0.00/0.04
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