0

Abstract state of the on the fly tree automata(TA):
	Points in the automaton:
		1
		L : 1
	Transitions:	0	
	Weight Matrix : 
	
			0,0	


	Push done at L : 0

Abstract state of the on the fly tree automata(TA):
	Points in the automaton:
		1----2
		L : 1
	Transitions:	0	9	
	Weight Matrix : 
	
			0,0	1,0	
			-1,0	0,0	


	Push done at L : 0

Abstract state of the on the fly tree automata(TA):
	Points in the automaton:
		1----2
		L : 1
	Transitions:	0	9	
	Accuracy: 	    1	    
	TSM : 		0	1	


	Push done at L : 0
	Pop done at R : 0

A run of the automation as a witness for the language to be non-empty.
The run given as a sequence of pairs (Transition, Time stamp) : 
(0, 0.0), (9, 1.0), 

Correct!
#stacks : 1
#clocks : 2
#states : 4
#transitions : 11
Maximum constant(M) : 3
Tree-Width(K) : 8

---END OF EXECUTION---

Execution time : 0.000191 seconds.

