anchor.diff:      case wait_until(CheckStartedFun, 60 * 2, 100) of
           ok ->
               ok;
  -        {fail, {connected_check_failed, Nodes}} ->
  +        {fail, {false, {connected_check_failed, Nodes}}} ->
               ct:fail("Graph is not connected, unable to find route between pairs of nodes ~p",
                       [Nodes]);
  -        {fail, {symmetry_check_failed, Nodes}} ->
  +        {fail, {false, {symmetry_check_failed, Nodes}}} ->
               ct:fail("Symmetry is broken (ie. node1 has node2 in it's view but vice-versa is not true) between the following "
                       "pairs of nodes: ~p", [Nodes]);
  -        {fail, [{connected_check_failed, ConnectedFails},
  -                {symmetry_check_failed, SymmetryFails}]} ->
  +        {fail, {false, [{connected_check_failed, ConnectedFails},
  +                        {symmetry_check_failed, SymmetryFails}]}} ->
               ct:fail("Graph is not connected, unable to find route between pairs of nodes ~p, symmetry is broken as well"
                       "(ie. node1 has node2 in it's view but vice-versa is not true) between the following "
                       "pairs of nodes: ~p", [ConnectedFails, SymmetryFails])
  
positive.code:     case wait_until(CheckStartedFun, 60 * 2, 100) of
          ok ->
              ok;
          {fail, {connected_check_failed, Nodes}} ->
              ct:fail("Graph is not connected, unable to find route between pairs of nodes ~p",
                      [Nodes]);
          {fail, {symmetry_check_failed, Nodes}} ->
              ct:fail("Symmetry is broken (ie. node1 has node2 in it's view but vice-versa is not true) between the following "
                      "pairs of nodes: ~p", [Nodes]);
          {fail, [{connected_check_failed, ConnectedFails},
                  {symmetry_check_failed, SymmetryFails}]} ->
              ct:fail("Graph is not connected, unable to find route between pairs of nodes ~p, symmetry is broken as well"
                      "(ie. node1 has node2 in it's view but vice-versa is not true) between the following "
                      "pairs of nodes: ~p", [ConnectedFails, SymmetryFails])
  
negative.code:     case wait_until(CheckStartedFun, 60 * 2, 100) of
          ok ->
              ok;
          {fail, {false, {connected_check_failed, Nodes}}} ->
              ct:fail("Graph is not connected, unable to find route between pairs of nodes ~p",
                      [Nodes]);
          {fail, {false, {symmetry_check_failed, Nodes}}} ->
              ct:fail("Symmetry is broken (ie. node1 has node2 in it's view but vice-versa is not true) between the following "
                      "pairs of nodes: ~p", [Nodes]);
          {fail, {false, [{connected_check_failed, ConnectedFails},
                          {symmetry_check_failed, SymmetryFails}]}} ->
              ct:fail("Graph is not connected, unable to find route between pairs of nodes ~p, symmetry is broken as well"
                      "(ie. node1 has node2 in it's view but vice-versa is not true) between the following "
                      "pairs of nodes: ~p", [ConnectedFails, SymmetryFails])
  