Goal:
  
  G : t
  HI : invariants G
  HG : acyclic_no_loop G
  s0 : VSet.t
  x : V.t
  x0 : V.t
  ============================
   (forall (z : Z) (p : SPath G (V G) x0 (s G)),
    {|
      pr1 := {| pr1 := V G; pr2 := {| pr1 := x0; pr2 := s G |} |}; pr2 := p
    |} =
    {|
      pr1 := {| pr1 := s0; pr2 := {| pr1 := x; pr2 := x |} |};
      pr2 := spath_refl G s0 x
    |} ->
    let H := CoreTactics.block in
    sweight p = z ->
    ~ VSet.In x0 (V G) -> let H0 := CoreTactics.block in z = 0)


DEBUG:Going to execute:
match goal with
           | |- context [ eq_rect_r _ _ eq_refl ] => progress simpl eq_rect_r
           | |- context [ eq_rect _ _ _ _ eq_refl ] => progress simpl eq_rect
           | |- context [ Prop.Logic.transport _ eq_refl _ ] =>
                 progress simpl Prop.Logic.transport
           | |- context [ Logic.eq_elim _ _ _ _ _ eq_refl ] =>
                 progress simpl eq_rect
           | |- context [ Logic.eq_elim_r _ _ _ _ eq_refl ] =>
                 progress simpl Logic.eq_elim_r
           | |- context [ noConfusion_inv _ ] =>
                 progress simpl noConfusion_inv
           | |- DepElim.opaque_ind_pack_eq_inv ?G eq_refl =>
                 apply (DepElim.simplify_ind_pack_inv B x p G)
           | |- let _ := CoreTactics.block in _ => fail 1
           | |- _ => simplify * || simplify ?; cbv beta
           | |- _ -> ?B =>
                 let ty := type of B in
                 intro || (let H := fresh in
                           intro
                           H)
           | |- forall x, _ => let H := fresh x in
                               intro
                               H
           | |- _ => intro
           end