Аннотация:It is known that Ogden lemma fails for the class of k-well-nested multiple context-free languages for k≥3. In this article we prove a relaxed version of this lemma for linear well-nested MCFLs and show that its statement may be applied to generate counterexamples of linear well-nested MCFLs by the method already existing for the stronger variant.