Solution to maze search problem seems correct but EPI Judge test framework says the path is not valid

[thesellersab]

Here is the path I find and message printed by test framework:
First column is row number for maze, 1P mean corrdinate selected as part of path. DFS is used for path and from path it is also clear that it is valid path,
0: 1, 0, 1, 0, 1,
1: 1, 1, 1, 0, 1,
2: 1, 0, 0, 1, 0,
3: 0, 1, 1, 1, 1,
4: 0, 1, 1, 0, 0,
5: 1, 1, 1, 1, 1,
6: 0, 1, 1, 0, 1,
7: 1, 1, 1, 1, 1,
8: 0, 1, 0, 1P, 1,
9: 1, 0, 1P, 1P, 1,
10: 1, 1, 1P, 0, 0,
11: 1, 1, 1P, 0, 1,
12: 1, 1, 1P, 0, 1,
13: 0, 1, 1P, 1, 1,
14: 1, 0, 1P, 1, 1,
15: 1, 1, 1P, 0, 1,
16: 0, 1, 1P, 0, 1,
17: 0, 1P, 1P, 1, 1,
18: 1, 1P, 1P, 1, 1,
19: 1, 1P, 1P, 1, 1,
20: 0, 0, 0, 1, 1,
21: 1, 1, 1, 1, 0,
22: 1, 1, 1, 1, 0,
23: 1, 1, 1, 1, 1,
24: 1, 1, 1, 0, 0,
Test FAILED ( 1/101) Path contains invalid segments
Arguments
maze: [[0, 1, 0, 1, 0], [0, 0, 0, 1, 0], [0, 1, 1, 0, 1], [1, 0, 0, 0, 0], [1, 0, 0, 1, 1], [0, 0, 0, 0, 0], [1, 0, 0, 1, 0], [0, 0, 0, 0, 0], [1, 0, 1, 0, 0], [0, 1, 0, 0, 0], [0, 0, 0, 1, 1], [0, 0, 0, 1, 0], [0, 0, 0, 1, 0], [1, 0, 0, 0, 0], [0, 1, 0, 0, 0], [0, 0, 0, 1, 0], [1, 0, 0, 1, 0], [1, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [1, 1, 1, 0, 0], [0, 0, 0, 0, 1], [0, 0, 0, 0, 1], [0, 0, 0, 0, 0], [0, 0, 0, 1, 1]]
s: [8, 3]
e: [17, 1]

Failure info
explanation: TODO
Please mention if this is a general issue or specific problem

• Example of general issue: Solution to variant problems
• Example of specific problem: Python solution to node depth problem has off-by-1

If you are referring to a specific problem, please reference it by problem name, not problem number or page number (since both page and problem numbering have changed across editions)

• Please classify issues
  (1.) Better solution, e.g., Java countTrailingBits()
  (2.) Trouble with installation/execution, e.g., IntelliJ import, and Visual Studio 2017 compile bug
  (3.) Buggy test or buggy code, e.g., tests for permutation problem have nonpermutation inputs
  (4.) Feature request, e.g., Go language support

By better solution we mean something that is (1.) more idiomatic; (2.) faster (from a complexity perspective, or in practical settings); or (3.) easier to understand.

• If you have a complete solution that is better solution, please consider using a pull request. (If possible, please provide the solution for C++, Java, and Python.)
• If the problem is with installation or execution, please give system information, i.e., OS, and language and build environment (including versions).
• Please describe the behavior you see, including screenshots (you can use Google Drive, GitHub, or Imgur to upload images and link to them); as well as the expected behavior.
• For bugs, if possible please provide a reproducible test case that is the bare minimum necessary to generate the problem.

Because of our build process we cannot directly accept PRs by merging into the master branch. Instead please send PRs against the dev branch.

• The reason for this is that we have a single source of truth, which is the complete solution that we annotate with markers that are used to generate the solution that goes inline in the book as well as the skeleton for the judge. (Here is a snippet of a source program, note the markers.)