We consider the problem of replacing several dependent routes in a Software-Defined Network (SDN). Delaet et al. focused on the replacement of a single pair of routes and proposed a verification idea for launching a new sub-route. Dinitz et al. suggested a dependence graph model for solving the problem with several routes pairs, and described the sub-route launching verification in the form of a high level network protocol. In both works, each sub-route is seamlessly updated using the Make&Activate-Before-Break (MABB) approach, eliminating flow stopping and delays in transmission. According to the MABB approach, a new sub-route is first fully prepared by possibly adding additional traffic in the sake of readiness signaling and seamless route change; after that the new sub-route is activated by redirecting the flow through it and the corresponding part of the current route is dismantled. In this brief announcement, we describe our extension for the case of replacing several dependent routes to also address network policies preservation. Additionally, we describe the existing verification gap of OpenFlow (the standard communication protocol tool for SDN) in signaling the readiness of route changes. We describe a verification protocol of route change readiness by means of OpenFlow, called Route Readiness Verifier (RRV). We show that RRV closes the verification gap in OpenFlow for route updates.