relauch ci

paddle/framework/backward.cc

@@ -144,24 +144,17 @@ static std::unique_ptr<OperatorBase> BackwardRecursive(
       //
       // one variable is shared between multiple operators.
       // insert add operator one by one, then add it to output
-      if (dup_outputs.size() == 2) {
-        insert_position.push_back(
-            {dup_op.back(),
-             OpRegistry::CreateOp(
-                 "add", {{"X", {dup_outputs[0]}}, {"Y", {dup_outputs[1]}}},
-                 {{"Out", {name}}}, {})});
-      } else {
       for (size_t output_idx = 0; output_idx < dup_outputs.size() - 1;
            ++output_idx) {
         auto insert_add_x = dup_outputs[output_idx];
         auto insert_add_y = dup_outputs[output_idx];
         auto insert_add_out = name + "@SHARED@" + std::to_string(output_idx);
         // first add op inserted
-          if (output_idx == dup_outputs.size() - 1) {
+        if (output_idx == dup_outputs.size() - 2) {
           insert_add_out = name;
         }
         if (output_idx != 0) {
-            insert_add_y = name + "@SHARED@" + std::to_string(output_idx-1);
+          insert_add_y = name + "@SHARED@" + std::to_string(output_idx - 1);
         }
         insert_position.push_back(
             {dup_op.back(),
@@ -170,7 +163,6 @@ static std::unique_ptr<OperatorBase> BackwardRecursive(
                  {{"Out", {insert_add_out}}}, {})});
       }
     }
-    }
 
     // make sure the inserted `add` ops follow the BFS order.
     insert_position.sort(