Pumping lemma for regular tree languages