Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275675
details
property
value
status
complete
benchmark
janne_complex.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
33.5179 seconds
cpu usage
33.5012
user time
31.3185
system time
2.18263
max virtual memory
1125012.0
max residence set size
360488.0
stage attributes
key
value
starexec-result
NO
output
33.47/33.51 NO 33.47/33.51 33.47/33.51 Solver Timeout: 4 33.47/33.51 Global Timeout: 300 33.47/33.51 No parsing errors! 33.47/33.51 Init Location: 0 33.47/33.51 Transitions: 33.47/33.51 <l0, l10, true> 33.47/33.51 <l1, l2, (30 <= (0 + a4^0)) /\ (undef6 = 1), par{answer^0 -> (0 + undef6), ret_complex6^0 -> undef6}> 33.47/33.51 <l1, l3, ((1 + a4^0) <= 30)> 33.47/33.51 <l4, l1, true> 33.47/33.51 <l3, l5, true> 33.47/33.51 <l6, l3, (13 <= (0 + b5^0)), par{a4^0 -> (1 + a4^0)}> 33.47/33.51 <l6, l3, ((0 + b5^0) <= 12), par{a4^0 -> (10 + a4^0)}> 33.47/33.51 <l7, l3, ((1 + b5^0) <= 10), par{a4^0 -> (1 + a4^0)}> 33.47/33.51 <l7, l6, (10 <= (0 + b5^0))> 33.47/33.51 <l8, l7, ((0 + b5^0) <= 5), par{b5^0 -> (2 + b5^0)}> 33.47/33.51 <l8, l7, (6 <= (0 + b5^0)) /\ (undef58 = undef58), par{b5^0 -> undef58}> 33.47/33.51 <l5, l4, ((0 + a4^0) <= (0 + b5^0)), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}> 33.47/33.51 <l5, l8, ((1 + b5^0) <= (0 + a4^0))> 33.47/33.51 <l9, l4, (undef74 = 1) /\ (undef77 = 1), par{a4^0 -> (0 + undef74), a^0 -> undef74, answer^0 -> 0, b5^0 -> (0 + undef77), b^0 -> undef77}> 33.47/33.51 <l10, l9, true> 33.47/33.51 33.47/33.51 Fresh variables: 33.47/33.51 undef6, undef58, undef74, undef77, 33.47/33.51 33.47/33.51 Undef variables: 33.47/33.51 undef6, undef58, undef74, undef77, 33.47/33.51 33.47/33.51 Abstraction variables: 33.47/33.51 33.47/33.51 Exit nodes: 33.47/33.51 33.47/33.51 Accepting locations: 33.47/33.51 33.47/33.51 Asserts: 33.47/33.51 33.47/33.51 Preprocessed LLVMGraph 33.47/33.51 Init Location: 0 33.47/33.51 Transitions: 33.47/33.51 <l0, l3, (a4^0 = (0 + undef74)) /\ (b5^0 = (0 + undef77)) /\ (undef74 = 1) /\ (undef77 = 1) /\ ((1 + (0 + undef74)) <= 30)> 33.47/33.51 <l3, l2, ((0 + a4^0) <= (0 + b5^0)) /\ (30 <= (0 + (2 + a4^0))) /\ (undef6 = 1), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}> 33.47/33.51 <l3, l3, ((0 + a4^0) <= (0 + b5^0)) /\ ((1 + (2 + a4^0)) <= 30), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}> 33.47/33.51 <l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ ((0 + b5^0) <= 5) /\ ((1 + (2 + b5^0)) <= 10), par{a4^0 -> (1 + a4^0), b5^0 -> (2 + b5^0)}> 33.47/33.51 <l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ ((1 + undef58) <= 10), par{a4^0 -> (1 + a4^0), b5^0 -> undef58}> 33.47/33.51 <l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ (10 <= (0 + undef58)) /\ (13 <= (0 + undef58)), par{a4^0 -> (1 + a4^0), b5^0 -> undef58}> 33.47/33.51 <l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ (10 <= (0 + undef58)) /\ ((0 + undef58) <= 12), par{a4^0 -> (10 + a4^0), b5^0 -> undef58}> 33.47/33.51 33.47/33.51 Fresh variables: 33.47/33.51 undef6, undef58, undef74, undef77, 33.47/33.51 33.47/33.51 Undef variables: 33.47/33.51 undef6, undef58, undef74, undef77, 33.47/33.51 33.47/33.51 Abstraction variables: 33.47/33.51 33.47/33.51 Exit nodes: 33.47/33.51 33.47/33.51 Accepting locations: 33.47/33.51 33.47/33.51 Asserts: 33.47/33.51 33.47/33.51 ************************************************************* 33.47/33.51 ******************************************************************************************* 33.47/33.51 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 33.47/33.51 ******************************************************************************************* 33.47/33.51 33.47/33.51 Init Location: 0 33.47/33.51 Graph 0: 33.47/33.51 Transitions: 33.47/33.51 Variables: 33.47/33.51 33.47/33.51 Graph 1: 33.47/33.51 Transitions: 33.47/33.51 <l3, l3, a4^0 <= b5^0 /\ a4^0 <= 27, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}> 33.47/33.51 <l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}> 33.47/33.51 <l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}> 33.47/33.51 <l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}> 33.47/33.51 <l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}> 33.47/33.51 Variables: 33.47/33.51 a4^0, b5^0 33.47/33.51 33.47/33.51 Graph 2: 33.47/33.51 Transitions: 33.47/33.51 Variables: 33.47/33.51 33.47/33.51 Precedence: 33.47/33.51 Graph 0 33.47/33.51 33.47/33.51 Graph 1 33.47/33.51 <l0, l3, a4^0 = undef74 /\ b5^0 = undef77 /\ undef74 = 1 /\ undef77 = 1, {all remain the same}> 33.47/33.51 33.47/33.51 Graph 2 33.47/33.51 <l3, l2, a4^0 <= b5^0 /\ 28 <= a4^0 /\ undef6 = 1, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}> 33.47/33.51 33.47/33.51 Map Locations to Subgraph: 33.47/33.51 ( 0 , 0 ) 33.47/33.51 ( 2 , 2 ) 33.47/33.51 ( 3 , 1 ) 33.47/33.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