Restricted branching programs capture various complexity measures like space in Turing machines or length of proofs in proof systems. In this paper, we focus on the application in the proof complexity that was discovered by Lovasz et al. [14] who showed the equivalence between regular Resolution and read-once branching programs for “unsatisfied clause search problem” (Searchφ). This connection is widely used, in particular, in the recent breakthrough result about the Clique problem in regular Resolution by Atserias et al. [5]. We study the branching programs with bounded repetitions, so-called (1,+k)-BPs (Sieling [21]) in application to the Searchφ problem. On the one hand, it is a natural generalization of read-once branching programs. On the other hand, this model gives a powerful proof system that can efficiently certify the unsatisfiability of a wide class of formulas that is hard for Resolution (Knop [13]). We deal with Searchφ that is “relatively easy” compared to all known hard examples for the (1,+k)-BPs. We introduce the first technique for proving exponential lower bounds for the (1,+k)-BPs on Searchφ. To do it we combine a well-known technique for proving lower bounds on the size of branching programs [12,21,22] with the modification of the “closure” technique [1,3]. In contrast with most Resolution lower bounds, our technique uses not only “local” properties of the formula, but also a “global” structure. Our hard examples are based on the Flow formulas introduced in [3].