ntm v1.0 starting
reading input finished.
start state s
states:b0 b1 b2 c c0 c1 c2 c3 c4 d d0 d1 d2 f fail s sh sh0 sh1 shb 

final states:f 

trace states:No states to trace
Sorted transition table:
b0	#[	c	##	R
b0	&	c	##	R
b0	0	b0	##	L
b0	1	b0	##	L
b1	&	b2	##	L
b2	&	d	##	R
b2	0	b2	##	L
b2	1	b2	##	L
c	0	c0	&	R
c	1	c1	&	R
c0	#]	f	##	N
c0	&	c2	0	R
c0	0	c0	##	R
c0	1	c0	##	R
c1	#]	f	##	N
c1	&	c3	1	R
c1	0	c1	##	R
c1	1	c1	##	R
c2	0	c4	&	R
c2	1	b0	&	L
c2	x	b0	&	L
c3	0	b0	&	L
c3	1	c4	&	R
c3	x	b0	&	L
c4	#]	f	##	N
c4	&	sh	##	L
c4	0	b1	##	L
c4	1	b1	##	L
c4	x	b1	##	L
d	0	d0	&	R
d	1	d1	&	R
d0	#]	f	##	N
d0	&	d2	0	R
d0	0	d0	##	R
d0	1	d0	##	R
d1	#]	f	##	N
d1	&	d2	1	R
d1	0	d1	##	R
d1	1	d1	##	R
d2	0	c4	&	R
d2	1	c4	&	R
d2	x	c4	&	R
s	#]	fail	##	N
s	#b	s	1	R
s	#b	s	0	R
s	&	b0	##	L
sh	&	sh	##	L
sh	0	sh0	&	R
sh	1	sh1	&	R
sh0	&	b0	0	L
sh0	0	shb	0	R
sh0	1	shb	0	R
sh1	&	b0	1	L
sh1	0	shb	1	R
sh1	1	shb	1	R
shb	0	sh	##	L
shb	1	sh	##	L

tape = 
tape rejected after 3 steps

tape =  &1
tape accepted after 16 steps, at f

tape =  &0
tape accepted after 17 steps, at f

tape =  &x
tape rejected after 24 steps

tape =  &1&0
tape rejected after 32 steps

tape =  &0&1
tape rejected after 32 steps

tape =  &1&x
tape rejected after 32 steps

tape =  &x&0
tape rejected after 24 steps

tape =   &11&10
tape accepted after 120 steps, at f

tape =   &1x&x0
tape accepted after 111 steps, at f

tape =    &1x1&x01&xx1&10x&x01&1x1
tape accepted after 742 steps, at f

tape =     &1010&1010
tape accepted after 1177 steps, at f
 No more input tapes. Stopping.