Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432274166
details
property
value
status
complete
benchmark
java_FibRecursive.c.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n174.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0558551 seconds
cpu usage
0.055954
user time
0.047421
system time
0.008533
max virtual memory
113176.0
max residence set size
6540.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.05 YES 0.00/0.05 0.00/0.05 Solver Timeout: 4 0.00/0.05 Global Timeout: 300 0.00/0.05 No parsing errors! 0.00/0.05 Init Location: 0 0.00/0.05 Transitions: 0.00/0.05 <l0, l8, true> 0.00/0.05 <l1, l2, (undef2 = undef2), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef2, x0^0 -> (0 + undef2)}> 0.00/0.05 <l1, l3, (undef4 = (0 + x0^0)), par{oldX0^0 -> undef4, x0^0 -> (~(2) + undef4)}> 0.00/0.05 <l1, l3, (undef7 = (0 + x0^0)), par{oldX0^0 -> undef7, x0^0 -> (~(1) + undef7)}> 0.00/0.05 <l4, l1, (undef10 = (0 + x0^0)) /\ (2 <= (0 + undef10)), par{oldX0^0 -> undef10, x0^0 -> (0 + undef10)}> 0.00/0.05 <l4, l1, (undef13 = (0 + x0^0)) /\ ((1 + undef13) <= 1), par{oldX0^0 -> undef13, x0^0 -> (0 + undef13)}> 0.00/0.05 <l4, l5, (undef16 = (0 + x0^0)) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)), par{oldX0^0 -> undef16, x0^0 -> (0 + undef16)}> 0.00/0.05 <l5, l2, (undef20 = undef20), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef20, x0^0 -> (0 + undef20)}> 0.00/0.05 <l6, l4, (undef22 = (0 + x0^0)) /\ (1 <= (0 + undef22)), par{oldX0^0 -> undef22, x0^0 -> (0 + undef22)}> 0.00/0.05 <l6, l5, (undef25 = (0 + x0^0)) /\ ((0 + undef25) <= 0), par{oldX0^0 -> undef25, x0^0 -> (0 + undef25)}> 0.00/0.05 <l3, l6, (undef28 = (0 + x0^0)), par{oldX0^0 -> undef28, x0^0 -> (0 + undef28)}> 0.00/0.05 <l7, l2, true> 0.00/0.05 <l7, l1, true> 0.00/0.05 <l7, l4, true> 0.00/0.05 <l7, l5, true> 0.00/0.05 <l7, l6, true> 0.00/0.05 <l7, l3, true> 0.00/0.05 <l8, l7, true> 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 Preprocessed LLVMGraph 0.00/0.05 Init Location: 0 0.00/0.05 Transitions: 0.00/0.05 <l0, l2, true> 0.00/0.05 <l0, l1, true> 0.00/0.05 <l0, l1, (undef10 = (0 + x0^0)) /\ (2 <= (0 + undef10)), par{x0^0 -> (0 + undef10)}> 0.00/0.05 <l0, l1, (undef13 = (0 + x0^0)) /\ ((1 + undef13) <= 1), par{x0^0 -> (0 + undef13)}> 0.00/0.05 <l0, l2, (undef16 = (0 + x0^0)) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}> 0.00/0.05 <l0, l2, (undef20 = undef20), par{x0^0 -> (0 + undef20)}> 0.00/0.05 <l0, l1, (undef22 = (0 + x0^0)) /\ (1 <= (0 + undef22)) /\ (undef10 = (0 + (0 + undef22))) /\ (2 <= (0 + undef10)), par{x0^0 -> (0 + undef10)}> 0.00/0.05 <l0, l2, (undef22 = (0 + x0^0)) /\ (1 <= (0 + undef22)) /\ (undef16 = (0 + (0 + undef22))) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}> 0.00/0.05 <l0, l2, (undef25 = (0 + x0^0)) /\ ((0 + undef25) <= 0) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}> 0.00/0.05 <l0, l1, (undef28 = (0 + x0^0)) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef10 = (0 + (0 + undef22))) /\ (2 <= (0 + undef10)), par{x0^0 -> (0 + undef10)}> 0.00/0.05 <l0, l2, (undef28 = (0 + x0^0)) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef16 = (0 + (0 + undef22))) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}> 0.00/0.05 <l0, l2, (undef28 = (0 + x0^0)) /\ (undef25 = (0 + (0 + undef28))) /\ ((0 + undef25) <= 0) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}> 0.00/0.05 <l1, l2, (undef2 = undef2), par{x0^0 -> (0 + undef2)}> 0.00/0.05 <l1, l1, (undef4 = (0 + x0^0)) /\ (undef28 = (0 + (~(2) + undef4))) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef10 = (0 + (0 + undef22))) /\ (2 <= (0 + undef10)), par{x0^0 -> (0 + undef10)}> 0.00/0.05 <l1, l2, (undef4 = (0 + x0^0)) /\ (undef28 = (0 + (~(2) + undef4))) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef16 = (0 + (0 + undef22))) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}> 0.00/0.05 <l1, l2, (undef4 = (0 + x0^0)) /\ (undef28 = (0 + (~(2) + undef4))) /\ (undef25 = (0 + (0 + undef28))) /\ ((0 + undef25) <= 0) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}> 0.00/0.05 <l1, l1, (undef7 = (0 + x0^0)) /\ (undef28 = (0 + (~(1) + undef7))) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef10 = (0 + (0 + undef22))) /\ (2 <= (0 + undef10)), par{x0^0 -> (0 + undef10)}> 0.00/0.05 <l1, l2, (undef7 = (0 + x0^0)) /\ (undef28 = (0 + (~(1) + undef7))) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef16 = (0 + (0 + undef22))) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}> 0.00/0.05 <l1, l2, (undef7 = (0 + x0^0)) /\ (undef28 = (0 + (~(1) + undef7))) /\ (undef25 = (0 + (0 + undef28))) /\ ((0 + undef25) <= 0) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}> 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 ************************************************************* 0.00/0.05 ******************************************************************************************* 0.00/0.05 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.05 ******************************************************************************************* 0.00/0.05 0.00/0.05 Init Location: 0 0.00/0.05 Graph 0: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 1: 0.00/0.05 Transitions: 0.00/0.05 <l1, l1, 2 <= undef10 /\ 1 <= undef22 /\ x0^0 = undef4 /\ undef10 = undef22 /\ undef22 = undef28 /\ undef4 = 2 + undef28, {x0^0 -> undef10, rest remain the same}> 0.00/0.05 <l1, l1, 2 <= undef10 /\ 1 <= undef22 /\ x0^0 = undef7 /\ undef10 = undef22 /\ undef22 = undef28 /\ undef7 = 1 + undef28, {x0^0 -> undef10, rest remain the same}> 0.00/0.05 Variables: 0.00/0.05 x0^0 0.00/0.05 0.00/0.05 Graph 2: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Precedence: 0.00/0.05 Graph 0
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