Is there an algorithm that given a PDA $M$ decides if there exists a string in $L(M)$ with a suitable decomposition?
In a context-free language $L$, by the Pumping Lemma, there exists a $p &gt; 0$ such that every $w \in L$ such that $|w| \ge p$ admits a decomposition $w = uvxyz$ such that $uv^ixy^iz \in L$ for all $i \geq 0$.

If $L$ is infinite, it has words of length $\ge p$, and you can pick any of them. If $L$ is finite then no word satisfies the condition (this is not a contradiction with the pumping lemma, because the pumping lemma gives a length $p$ which is more than the length of any of the words in $L$).

It is decidable if a context-free grammar generates an infinite language (see e.g. Is it decidable whether a given context free grammar generates an infinite number of strings?). 

Therefore the algorithm is


  On input $\langle M \rangle$, where $M$ is a PDA
  
  
  Convert $\langle M \rangle$ to the description of an equivalent CFG $\langle G \rangle $
  Check if $L(G)$ is infinite
  If yes, then answer yes else answer no