// Danish Lakhani
// Anthony Giardullo
//
// The code below is 'annotated' PRISM code.  Using this file
// as input to preparse.java will create a valid PRISM .pm and .pctl
// file.  See the comments in preparse.java for useage information.  
//
//
//


probabilistic

//Probability a mix node is bad    
//rate badP = 0.5;
//rate goodP = 0.5; //must be 1 - bad


//const numPaths = 10;
//const maxLength = 3;
//const minLength = 3;
//const userCount = 10;
//const mixCount = 3;
//const nodeCount = 13;//must be userCount+mixCount
//const maxSearchLength = 100;
//const minSearchLength = 1;
//const useSearchLength = 1;

//rate numPathsInv = 0.1; //must be 1/numPaths

const checkSelfLoop = 0;


//Constants

rate badP = 0.5;
rate goodP = 0.5;
const numPaths = 100;
const maxLength = 7;
const minLength = 5;
const userCount = 50;
const mixCount = 10;
const nodeCount = 60;
rate numPathsInv = 0.01;
const useSearchLength = 0;
const minSearchLength = 1;
const maxSearchLength = 1;

//End Constants


//Graph

const node51path1 = 1;
const node59path1 = 51;
const node60path1 = 59;
const node58path1 = 60;
const node54path1 = 58;
const node52path1 = 54;
const node20path1 = 52;
const initNode = 20;
const node1path1 = 0;
const node2path1 = 0;
const node3path1 = 0;
const node4path1 = 0;
const node5path1 = 0;
const node6path1 = 0;
const node7path1 = 0;
const node8path1 = 0;
const node9path1 = 0;
const node10path1 = 0;
const node11path1 = 0;
const node12path1 = 0;
const node13path1 = 0;
const node14path1 = 0;
const node15path1 = 0;
const node16path1 = 0;
const node17path1 = 0;
const node18path1 = 0;
const node19path1 = 0;
const node21path1 = 0;
const node22path1 = 0;
const node23path1 = 0;
const node24path1 = 0;
const node25path1 = 0;
const node26path1 = 0;
const node27path1 = 0;
const node28path1 = 0;
const node29path1 = 0;
const node30path1 = 0;
const node31path1 = 0;
const node32path1 = 0;
const node33path1 = 0;
const node34path1 = 0;
const node35path1 = 0;
const node36path1 = 0;
const node37path1 = 0;
const node38path1 = 0;
const node39path1 = 0;
const node40path1 = 0;
const node41path1 = 0;
const node42path1 = 0;
const node43path1 = 0;
const node44path1 = 0;
const node45path1 = 0;
const node46path1 = 0;
const node47path1 = 0;
const node48path1 = 0;
const node49path1 = 0;
const node50path1 = 0;
const node53path1 = 0;
const node55path1 = 0;
const node56path1 = 0;
const node57path1 = 0;
const node58path2 = 5;
const node54path2 = 58;
const node53path2 = 54;
const node56path2 = 53;
const node55path2 = 56;
const node42path2 = 55;
const node1path2 = 0;
const node2path2 = 0;
const node3path2 = 0;
const node4path2 = 0;
const node5path2 = 0;
const node6path2 = 0;
const node7path2 = 0;
const node8path2 = 0;
const node9path2 = 0;
const node10path2 = 0;
const node11path2 = 0;
const node12path2 = 0;
const node13path2 = 0;
const node14path2 = 0;
const node15path2 = 0;
const node16path2 = 0;
const node17path2 = 0;
const node18path2 = 0;
const node19path2 = 0;
const node20path2 = 0;
const node21path2 = 0;
const node22path2 = 0;
const node23path2 = 0;
const node24path2 = 0;
const node25path2 = 0;
const node26path2 = 0;
const node27path2 = 0;
const node28path2 = 0;
const node29path2 = 0;
const node30path2 = 0;
const node31path2 = 0;
const node32path2 = 0;
const node33path2 = 0;
const node34path2 = 0;
const node35path2 = 0;
const node36path2 = 0;
const node37path2 = 0;
const node38path2 = 0;
const node39path2 = 0;
const node40path2 = 0;
const node41path2 = 0;
const node43path2 = 0;
const node44path2 = 0;
const node45path2 = 0;
const node46path2 = 0;
const node47path2 = 0;
const node48path2 = 0;
const node49path2 = 0;
const node50path2 = 0;
const node51path2 = 0;
const node52path2 = 0;
const node57path2 = 0;
const node59path2 = 0;
const node60path2 = 0;
const node54path3 = 21;
const node59path3 = 54;
const node55path3 = 59;
const node58path3 = 55;
const node51path3 = 58;
const node33path3 = 51;
const node1path3 = 0;
const node2path3 = 0;
const node3path3 = 0;
const node4path3 = 0;
const node5path3 = 0;
const node6path3 = 0;
const node7path3 = 0;
const node8path3 = 0;
const node9path3 = 0;
const node10path3 = 0;
const node11path3 = 0;
const node12path3 = 0;
const node13path3 = 0;
const node14path3 = 0;
const node15path3 = 0;
const node16path3 = 0;
const node17path3 = 0;
const node18path3 = 0;
const node19path3 = 0;
const node20path3 = 0;
const node21path3 = 0;
const node22path3 = 0;
const node23path3 = 0;
const node24path3 = 0;
const node25path3 = 0;
const node26path3 = 0;
const node27path3 = 0;
const node28path3 = 0;
const node29path3 = 0;
const node30path3 = 0;
const node31path3 = 0;
const node32path3 = 0;
const node34path3 = 0;
const node35path3 = 0;
const node36path3 = 0;
const node37path3 = 0;
const node38path3 = 0;
const node39path3 = 0;
const node40path3 = 0;
const node41path3 = 0;
const node42path3 = 0;
const node43path3 = 0;
const node44path3 = 0;
const node45path3 = 0;
const node46path3 = 0;
const node47path3 = 0;
const node48path3 = 0;
const node49path3 = 0;
const node50path3 = 0;
const node52path3 = 0;
const node53path3 = 0;
const node56path3 = 0;
const node57path3 = 0;
const node60path3 = 0;
const node54path4 = 43;
const node56path4 = 54;
const node58path4 = 56;
const node53path4 = 58;
const node59path4 = 53;
const node51path4 = 59;
const node26path4 = 51;
const node1path4 = 0;
const node2path4 = 0;
const node3path4 = 0;
const node4path4 = 0;
const node5path4 = 0;
const node6path4 = 0;
const node7path4 = 0;
const node8path4 = 0;
const node9path4 = 0;
const node10path4 = 0;
const node11path4 = 0;
const node12path4 = 0;
const node13path4 = 0;
const node14path4 = 0;
const node15path4 = 0;
const node16path4 = 0;
const node17path4 = 0;
const node18path4 = 0;
const node19path4 = 0;
const node20path4 = 0;
const node21path4 = 0;
const node22path4 = 0;
const node23path4 = 0;
const node24path4 = 0;
const node25path4 = 0;
const node27path4 = 0;
const node28path4 = 0;
const node29path4 = 0;
const node30path4 = 0;
const node31path4 = 0;
const node32path4 = 0;
const node33path4 = 0;
const node34path4 = 0;
const node35path4 = 0;
const node36path4 = 0;
const node37path4 = 0;
const node38path4 = 0;
const node39path4 = 0;
const node40path4 = 0;
const node41path4 = 0;
const node42path4 = 0;
const node43path4 = 0;
const node44path4 = 0;
const node45path4 = 0;
const node46path4 = 0;
const node47path4 = 0;
const node48path4 = 0;
const node49path4 = 0;
const node50path4 = 0;
const node52path4 = 0;
const node55path4 = 0;
const node57path4 = 0;
const node60path4 = 0;
const node51path5 = 6;
const node59path5 = 51;
const node52path5 = 59;
const node55path5 = 52;
const node53path5 = 55;
const node20path5 = 53;
const node1path5 = 0;
const node2path5 = 0;
const node3path5 = 0;
const node4path5 = 0;
const node5path5 = 0;
const node6path5 = 0;
const node7path5 = 0;
const node8path5 = 0;
const node9path5 = 0;
const node10path5 = 0;
const node11path5 = 0;
const node12path5 = 0;
const node13path5 = 0;
const node14path5 = 0;
const node15path5 = 0;
const node16path5 = 0;
const node17path5 = 0;
const node18path5 = 0;
const node19path5 = 0;
const node21path5 = 0;
const node22path5 = 0;
const node23path5 = 0;
const node24path5 = 0;
const node25path5 = 0;
const node26path5 = 0;
const node27path5 = 0;
const node28path5 = 0;
const node29path5 = 0;
const node30path5 = 0;
const node31path5 = 0;
const node32path5 = 0;
const node33path5 = 0;
const node34path5 = 0;
const node35path5 = 0;
const node36path5 = 0;
const node37path5 = 0;
const node38path5 = 0;
const node39path5 = 0;
const node40path5 = 0;
const node41path5 = 0;
const node42path5 = 0;
const node43path5 = 0;
const node44path5 = 0;
const node45path5 = 0;
const node46path5 = 0;
const node47path5 = 0;
const node48path5 = 0;
const node49path5 = 0;
const node50path5 = 0;
const node54path5 = 0;
const node56path5 = 0;
const node57path5 = 0;
const node58path5 = 0;
const node60path5 = 0;
const node57path6 = 28;
const node58path6 = 57;
const node59path6 = 58;
const node54path6 = 59;
const node56path6 = 54;
const node52path6 = 56;
const node19path6 = 52;
const node1path6 = 0;
const node2path6 = 0;
const node3path6 = 0;
const node4path6 = 0;
const node5path6 = 0;
const node6path6 = 0;
const node7path6 = 0;
const node8path6 = 0;
const node9path6 = 0;
const node10path6 = 0;
const node11path6 = 0;
const node12path6 = 0;
const node13path6 = 0;
const node14path6 = 0;
const node15path6 = 0;
const node16path6 = 0;
const node17path6 = 0;
const node18path6 = 0;
const node20path6 = 0;
const node21path6 = 0;
const node22path6 = 0;
const node23path6 = 0;
const node24path6 = 0;
const node25path6 = 0;
const node26path6 = 0;
const node27path6 = 0;
const node28path6 = 0;
const node29path6 = 0;
const node30path6 = 0;
const node31path6 = 0;
const node32path6 = 0;
const node33path6 = 0;
const node34path6 = 0;
const node35path6 = 0;
const node36path6 = 0;
const node37path6 = 0;
const node38path6 = 0;
const node39path6 = 0;
const node40path6 = 0;
const node41path6 = 0;
const node42path6 = 0;
const node43path6 = 0;
const node44path6 = 0;
const node45path6 = 0;
const node46path6 = 0;
const node47path6 = 0;
const node48path6 = 0;
const node49path6 = 0;
const node50path6 = 0;
const node51path6 = 0;
const node53path6 = 0;
const node55path6 = 0;
const node60path6 = 0;
const node59path7 = 9;
const node53path7 = 59;
const node58path7 = 53;
const node52path7 = 58;
const node51path7 = 52;
const node13path7 = 51;
const node1path7 = 0;
const node2path7 = 0;
const node3path7 = 0;
const node4path7 = 0;
const node5path7 = 0;
const node6path7 = 0;
const node7path7 = 0;
const node8path7 = 0;
const node9path7 = 0;
const node10path7 = 0;
const node11path7 = 0;
const node12path7 = 0;
const node14path7 = 0;
const node15path7 = 0;
const node16path7 = 0;
const node17path7 = 0;
const node18path7 = 0;
const node19path7 = 0;
const node20path7 = 0;
const node21path7 = 0;
const node22path7 = 0;
const node23path7 = 0;
const node24path7 = 0;
const node25path7 = 0;
const node26path7 = 0;
const node27path7 = 0;
const node28path7 = 0;
const node29path7 = 0;
const node30path7 = 0;
const node31path7 = 0;
const node32path7 = 0;
const node33path7 = 0;
const node34path7 = 0;
const node35path7 = 0;
const node36path7 = 0;
const node37path7 = 0;
const node38path7 = 0;
const node39path7 = 0;
const node40path7 = 0;
const node41path7 = 0;
const node42path7 = 0;
const node43path7 = 0;
const node44path7 = 0;
const node45path7 = 0;
const node46path7 = 0;
const node47path7 = 0;
const node48path7 = 0;
const node49path7 = 0;
const node50path7 = 0;
const node54path7 = 0;
const node55path7 = 0;
const node56path7 = 0;
const node57path7 = 0;
const node60path7 = 0;
const node51path8 = 36;
const node58path8 = 51;
const node54path8 = 58;
const node60path8 = 54;
const node3path8 = 60;
const node1path8 = 0;
const node2path8 = 0;
const node4path8 = 0;
const node5path8 = 0;
const node6path8 = 0;
const node7path8 = 0;
const node8path8 = 0;
const node9path8 = 0;
const node10path8 = 0;
const node11path8 = 0;
const node12path8 = 0;
const node13path8 = 0;
const node14path8 = 0;
const node15path8 = 0;
const node16path8 = 0;
const node17path8 = 0;
const node18path8 = 0;
const node19path8 = 0;
const node20path8 = 0;
const node21path8 = 0;
const node22path8 = 0;
const node23path8 = 0;
const node24path8 = 0;
const node25path8 = 0;
const node26path8 = 0;
const node27path8 = 0;
const node28path8 = 0;
const node29path8 = 0;
const node30path8 = 0;
const node31path8 = 0;
const node32path8 = 0;
const node33path8 = 0;
const node34path8 = 0;
const node35path8 = 0;
const node36path8 = 0;
const node37path8 = 0;
const node38path8 = 0;
const node39path8 = 0;
const node40path8 = 0;
const node41path8 = 0;
const node42path8 = 0;
const node43path8 = 0;
const node44path8 = 0;
const node45path8 = 0;
const node46path8 = 0;
const node47path8 = 0;
const node48path8 = 0;
const node49path8 = 0;
const node50path8 = 0;
const node52path8 = 0;
const node53path8 = 0;
const node55path8 = 0;
const node56path8 = 0;
const node57path8 = 0;
const node59path8 = 0;
const node54path9 = 40;
const node52path9 = 54;
const node51path9 = 52;
const node59path9 = 51;
const node17path9 = 59;
const node1path9 = 0;
const node2path9 = 0;
const node3path9 = 0;
const node4path9 = 0;
const node5path9 = 0;
const node6path9 = 0;
const node7path9 = 0;
const node8path9 = 0;
const node9path9 = 0;
const node10path9 = 0;
const node11path9 = 0;
const node12path9 = 0;
const node13path9 = 0;
const node14path9 = 0;
const node15path9 = 0;
const node16path9 = 0;
const node18path9 = 0;
const node19path9 = 0;
const node20path9 = 0;
const node21path9 = 0;
const node22path9 = 0;
const node23path9 = 0;
const node24path9 = 0;
const node25path9 = 0;
const node26path9 = 0;
const node27path9 = 0;
const node28path9 = 0;
const node29path9 = 0;
const node30path9 = 0;
const node31path9 = 0;
const node32path9 = 0;
const node33path9 = 0;
const node34path9 = 0;
const node35path9 = 0;
const node36path9 = 0;
const node37path9 = 0;
const node38path9 = 0;
const node39path9 = 0;
const node40path9 = 0;
const node41path9 = 0;
const node42path9 = 0;
const node43path9 = 0;
const node44path9 = 0;
const node45path9 = 0;
const node46path9 = 0;
const node47path9 = 0;
const node48path9 = 0;
const node49path9 = 0;
const node50path9 = 0;
const node53path9 = 0;
const node55path9 = 0;
const node56path9 = 0;
const node57path9 = 0;
const node58path9 = 0;
const node60path9 = 0;
const node58path10 = 24;
const node53path10 = 58;
const node56path10 = 53;
const node52path10 = 56;
const node60path10 = 52;
const node18path10 = 60;
const node1path10 = 0;
const node2path10 = 0;
const node3path10 = 0;
const node4path10 = 0;
const node5path10 = 0;
const node6path10 = 0;
const node7path10 = 0;
const node8path10 = 0;
const node9path10 = 0;
const node10path10 = 0;
const node11path10 = 0;
const node12path10 = 0;
const node13path10 = 0;
const node14path10 = 0;
const node15path10 = 0;
const node16path10 = 0;
const node17path10 = 0;
const node19path10 = 0;
const node20path10 = 0;
const node21path10 = 0;
const node22path10 = 0;
const node23path10 = 0;
const node24path10 = 0;
const node25path10 = 0;
const node26path10 = 0;
const node27path10 = 0;
const node28path10 = 0;
const node29path10 = 0;
const node30path10 = 0;
const node31path10 = 0;
const node32path10 = 0;
const node33path10 = 0;
const node34path10 = 0;
const node35path10 = 0;
const node36path10 = 0;
const node37path10 = 0;
const node38path10 = 0;
const node39path10 = 0;
const node40path10 = 0;
const node41path10 = 0;
const node42path10 = 0;
const node43path10 = 0;
const node44path10 = 0;
const node45path10 = 0;
const node46path10 = 0;
const node47path10 = 0;
const node48path10 = 0;
const node49path10 = 0;
const node50path10 = 0;
const node51path10 = 0;
const node54path10 = 0;
const node55path10 = 0;
const node57path10 = 0;
const node59path10 = 0;
const node52path11 = 18;
const node58path11 = 52;
const node59path11 = 58;
const node54path11 = 59;
const node56path11 = 54;
const node57path11 = 56;
const node42path11 = 57;
const node1path11 = 0;
const node2path11 = 0;
const node3path11 = 0;
const node4path11 = 0;
const node5path11 = 0;
const node6path11 = 0;
const node7path11 = 0;
const node8path11 = 0;
const node9path11 = 0;
const node10path11 = 0;
const node11path11 = 0;
const node12path11 = 0;
const node13path11 = 0;
const node14path11 = 0;
const node15path11 = 0;
const node16path11 = 0;
const node17path11 = 0;
const node18path11 = 0;
const node19path11 = 0;
const node20path11 = 0;
const node21path11 = 0;
const node22path11 = 0;
const node23path11 = 0;
const node24path11 = 0;
const node25path11 = 0;
const node26path11 = 0;
const node27path11 = 0;
const node28path11 = 0;
const node29path11 = 0;
const node30path11 = 0;
const node31path11 = 0;
const node32path11 = 0;
const node33path11 = 0;
const node34path11 = 0;
const node35path11 = 0;
const node36path11 = 0;
const node37path11 = 0;
const node38path11 = 0;
const node39path11 = 0;
const node40path11 = 0;
const node41path11 = 0;
const node43path11 = 0;
const node44path11 = 0;
const node45path11 = 0;
const node46path11 = 0;
const node47path11 = 0;
const node48path11 = 0;
const node49path11 = 0;
const node50path11 = 0;
const node51path11 = 0;
const node53path11 = 0;
const node55path11 = 0;
const node60path11 = 0;
const node52path12 = 41;
const node55path12 = 52;
const node51path12 = 55;
const node56path12 = 51;
const node53path12 = 56;
const node1path12 = 53;
const node2path12 = 0;
const node3path12 = 0;
const node4path12 = 0;
const node5path12 = 0;
const node6path12 = 0;
const node7path12 = 0;
const node8path12 = 0;
const node9path12 = 0;
const node10path12 = 0;
const node11path12 = 0;
const node12path12 = 0;
const node13path12 = 0;
const node14path12 = 0;
const node15path12 = 0;
const node16path12 = 0;
const node17path12 = 0;
const node18path12 = 0;
const node19path12 = 0;
const node20path12 = 0;
const node21path12 = 0;
const node22path12 = 0;
const node23path12 = 0;
const node24path12 = 0;
const node25path12 = 0;
const node26path12 = 0;
const node27path12 = 0;
const node28path12 = 0;
const node29path12 = 0;
const node30path12 = 0;
const node31path12 = 0;
const node32path12 = 0;
const node33path12 = 0;
const node34path12 = 0;
const node35path12 = 0;
const node36path12 = 0;
const node37path12 = 0;
const node38path12 = 0;
const node39path12 = 0;
const node40path12 = 0;
const node41path12 = 0;
const node42path12 = 0;
const node43path12 = 0;
const node44path12 = 0;
const node45path12 = 0;
const node46path12 = 0;
const node47path12 = 0;
const node48path12 = 0;
const node49path12 = 0;
const node50path12 = 0;
const node54path12 = 0;
const node57path12 = 0;
const node58path12 = 0;
const node59path12 = 0;
const node60path12 = 0;
const node54path13 = 29;
const node60path13 = 54;
const node56path13 = 60;
const node52path13 = 56;
const node53path13 = 52;
const node58path13 = 53;
const node12path13 = 58;
const node1path13 = 0;
const node2path13 = 0;
const node3path13 = 0;
const node4path13 = 0;
const node5path13 = 0;
const node6path13 = 0;
const node7path13 = 0;
const node8path13 = 0;
const node9path13 = 0;
const node10path13 = 0;
const node11path13 = 0;
const node13path13 = 0;
const node14path13 = 0;
const node15path13 = 0;
const node16path13 = 0;
const node17path13 = 0;
const node18path13 = 0;
const node19path13 = 0;
const node20path13 = 0;
const node21path13 = 0;
const node22path13 = 0;
const node23path13 = 0;
const node24path13 = 0;
const node25path13 = 0;
const node26path13 = 0;
const node27path13 = 0;
const node28path13 = 0;
const node29path13 = 0;
const node30path13 = 0;
const node31path13 = 0;
const node32path13 = 0;
const node33path13 = 0;
const node34path13 = 0;
const node35path13 = 0;
const node36path13 = 0;
const node37path13 = 0;
const node38path13 = 0;
const node39path13 = 0;
const node40path13 = 0;
const node41path13 = 0;
const node42path13 = 0;
const node43path13 = 0;
const node44path13 = 0;
const node45path13 = 0;
const node46path13 = 0;
const node47path13 = 0;
const node48path13 = 0;
const node49path13 = 0;
const node50path13 = 0;
const node51path13 = 0;
const node55path13 = 0;
const node57path13 = 0;
const node59path13 = 0;
const node54path14 = 22;
const node58path14 = 54;
const node59path14 = 58;
const node57path14 = 59;
const node56path14 = 57;
const node37path14 = 56;
const node1path14 = 0;
const node2path14 = 0;
const node3path14 = 0;
const node4path14 = 0;
const node5path14 = 0;
const node6path14 = 0;
const node7path14 = 0;
const node8path14 = 0;
const node9path14 = 0;
const node10path14 = 0;
const node11path14 = 0;
const node12path14 = 0;
const node13path14 = 0;
const node14path14 = 0;
const node15path14 = 0;
const node16path14 = 0;
const node17path14 = 0;
const node18path14 = 0;
const node19path14 = 0;
const node20path14 = 0;
const node21path14 = 0;
const node22path14 = 0;
const node23path14 = 0;
const node24path14 = 0;
const node25path14 = 0;
const node26path14 = 0;
const node27path14 = 0;
const node28path14 = 0;
const node29path14 = 0;
const node30path14 = 0;
const node31path14 = 0;
const node32path14 = 0;
const node33path14 = 0;
const node34path14 = 0;
const node35path14 = 0;
const node36path14 = 0;
const node38path14 = 0;
const node39path14 = 0;
const node40path14 = 0;
const node41path14 = 0;
const node42path14 = 0;
const node43path14 = 0;
const node44path14 = 0;
const node45path14 = 0;
const node46path14 = 0;
const node47path14 = 0;
const node48path14 = 0;
const node49path14 = 0;
const node50path14 = 0;
const node51path14 = 0;
const node52path14 = 0;
const node53path14 = 0;
const node55path14 = 0;
const node60path14 = 0;
const node54path15 = 44;
const node58path15 = 54;
const node59path15 = 58;
const node57path15 = 59;
const node51path15 = 57;
const node6path15 = 51;
const node1path15 = 0;
const node2path15 = 0;
const node3path15 = 0;
const node4path15 = 0;
const node5path15 = 0;
const node7path15 = 0;
const node8path15 = 0;
const node9path15 = 0;
const node10path15 = 0;
const node11path15 = 0;
const node12path15 = 0;
const node13path15 = 0;
const node14path15 = 0;
const node15path15 = 0;
const node16path15 = 0;
const node17path15 = 0;
const node18path15 = 0;
const node19path15 = 0;
const node20path15 = 0;
const node21path15 = 0;
const node22path15 = 0;
const node23path15 = 0;
const node24path15 = 0;
const node25path15 = 0;
const node26path15 = 0;
const node27path15 = 0;
const node28path15 = 0;
const node29path15 = 0;
const node30path15 = 0;
const node31path15 = 0;
const node32path15 = 0;
const node33path15 = 0;
const node34path15 = 0;
const node35path15 = 0;
const node36path15 = 0;
const node37path15 = 0;
const node38path15 = 0;
const node39path15 = 0;
const node40path15 = 0;
const node41path15 = 0;
const node42path15 = 0;
const node43path15 = 0;
const node44path15 = 0;
const node45path15 = 0;
const node46path15 = 0;
const node47path15 = 0;
const node48path15 = 0;
const node49path15 = 0;
const node50path15 = 0;
const node52path15 = 0;
const node53path15 = 0;
const node55path15 = 0;
const node56path15 = 0;
const node60path15 = 0;
const node59path16 = 46;
const node60path16 = 59;
const node56path16 = 60;
const node54path16 = 56;
const node52path16 = 54;
const node53path16 = 52;
const node29path16 = 53;
const node1path16 = 0;
const node2path16 = 0;
const node3path16 = 0;
const node4path16 = 0;
const node5path16 = 0;
const node6path16 = 0;
const node7path16 = 0;
const node8path16 = 0;
const node9path16 = 0;
const node10path16 = 0;
const node11path16 = 0;
const node12path16 = 0;
const node13path16 = 0;
const node14path16 = 0;
const node15path16 = 0;
const node16path16 = 0;
const node17path16 = 0;
const node18path16 = 0;
const node19path16 = 0;
const node20path16 = 0;
const node21path16 = 0;
const node22path16 = 0;
const node23path16 = 0;
const node24path16 = 0;
const node25path16 = 0;
const node26path16 = 0;
const node27path16 = 0;
const node28path16 = 0;
const node30path16 = 0;
const node31path16 = 0;
const node32path16 = 0;
const node33path16 = 0;
const node34path16 = 0;
const node35path16 = 0;
const node36path16 = 0;
const node37path16 = 0;
const node38path16 = 0;
const node39path16 = 0;
const node40path16 = 0;
const node41path16 = 0;
const node42path16 = 0;
const node43path16 = 0;
const node44path16 = 0;
const node45path16 = 0;
const node46path16 = 0;
const node47path16 = 0;
const node48path16 = 0;
const node49path16 = 0;
const node50path16 = 0;
const node51path16 = 0;
const node55path16 = 0;
const node57path16 = 0;
const node58path16 = 0;
const node58path17 = 42;
const node60path17 = 58;
const node52path17 = 60;
const node53path17 = 52;
const node59path17 = 53;
const node55path17 = 59;
const node14path17 = 55;
const node1path17 = 0;
const node2path17 = 0;
const node3path17 = 0;
const node4path17 = 0;
const node5path17 = 0;
const node6path17 = 0;
const node7path17 = 0;
const node8path17 = 0;
const node9path17 = 0;
const node10path17 = 0;
const node11path17 = 0;
const node12path17 = 0;
const node13path17 = 0;
const node15path17 = 0;
const node16path17 = 0;
const node17path17 = 0;
const node18path17 = 0;
const node19path17 = 0;
const node20path17 = 0;
const node21path17 = 0;
const node22path17 = 0;
const node23path17 = 0;
const node24path17 = 0;
const node25path17 = 0;
const node26path17 = 0;
const node27path17 = 0;
const node28path17 = 0;
const node29path17 = 0;
const node30path17 = 0;
const node31path17 = 0;
const node32path17 = 0;
const node33path17 = 0;
const node34path17 = 0;
const node35path17 = 0;
const node36path17 = 0;
const node37path17 = 0;
const node38path17 = 0;
const node39path17 = 0;
const node40path17 = 0;
const node41path17 = 0;
const node42path17 = 0;
const node43path17 = 0;
const node44path17 = 0;
const node45path17 = 0;
const node46path17 = 0;
const node47path17 = 0;
const node48path17 = 0;
const node49path17 = 0;
const node50path17 = 0;
const node51path17 = 0;
const node54path17 = 0;
const node56path17 = 0;
const node57path17 = 0;
const node53path18 = 40;
const node51path18 = 53;
const node54path18 = 51;
const node56path18 = 54;
const node52path18 = 56;
const node3path18 = 52;
const node1path18 = 0;
const node2path18 = 0;
const node4path18 = 0;
const node5path18 = 0;
const node6path18 = 0;
const node7path18 = 0;
const node8path18 = 0;
const node9path18 = 0;
const node10path18 = 0;
const node11path18 = 0;
const node12path18 = 0;
const node13path18 = 0;
const node14path18 = 0;
const node15path18 = 0;
const node16path18 = 0;
const node17path18 = 0;
const node18path18 = 0;
const node19path18 = 0;
const node20path18 = 0;
const node21path18 = 0;
const node22path18 = 0;
const node23path18 = 0;
const node24path18 = 0;
const node25path18 = 0;
const node26path18 = 0;
const node27path18 = 0;
const node28path18 = 0;
const node29path18 = 0;
const node30path18 = 0;
const node31path18 = 0;
const node32path18 = 0;
const node33path18 = 0;
const node34path18 = 0;
const node35path18 = 0;
const node36path18 = 0;
const node37path18 = 0;
const node38path18 = 0;
const node39path18 = 0;
const node40path18 = 0;
const node41path18 = 0;
const node42path18 = 0;
const node43path18 = 0;
const node44path18 = 0;
const node45path18 = 0;
const node46path18 = 0;
const node47path18 = 0;
const node48path18 = 0;
const node49path18 = 0;
const node50path18 = 0;
const node55path18 = 0;
const node57path18 = 0;
const node58path18 = 0;
const node59path18 = 0;
const node60path18 = 0;
const node55path19 = 31;
const node59path19 = 55;
const node56path19 = 59;
const node53path19 = 56;
const node49path19 = 53;
const node1path19 = 0;
const node2path19 = 0;
const node3path19 = 0;
const node4path19 = 0;
const node5path19 = 0;
const node6path19 = 0;
const node7path19 = 0;
const node8path19 = 0;
const node9path19 = 0;
const node10path19 = 0;
const node11path19 = 0;
const node12path19 = 0;
const node13path19 = 0;
const node14path19 = 0;
const node15path19 = 0;
const node16path19 = 0;
const node17path19 = 0;
const node18path19 = 0;
const node19path19 = 0;
const node20path19 = 0;
const node21path19 = 0;
const node22path19 = 0;
const node23path19 = 0;
const node24path19 = 0;
const node25path19 = 0;
const node26path19 = 0;
const node27path19 = 0;
const node28path19 = 0;
const node29path19 = 0;
const node30path19 = 0;
const node31path19 = 0;
const node32path19 = 0;
const node33path19 = 0;
const node34path19 = 0;
const node35path19 = 0;
const node36path19 = 0;
const node37path19 = 0;
const node38path19 = 0;
const node39path19 = 0;
const node40path19 = 0;
const node41path19 = 0;
const node42path19 = 0;
const node43path19 = 0;
const node44path19 = 0;
const node45path19 = 0;
const node46path19 = 0;
const node47path19 = 0;
const node48path19 = 0;
const node50path19 = 0;
const node51path19 = 0;
const node52path19 = 0;
const node54path19 = 0;
const node57path19 = 0;
const node58path19 = 0;
const node60path19 = 0;
const node51path20 = 39;
const node57path20 = 51;
const node54path20 = 57;
const node53path20 = 54;
const node45path20 = 53;
const node1path20 = 0;
const node2path20 = 0;
const node3path20 = 0;
const node4path20 = 0;
const node5path20 = 0;
const node6path20 = 0;
const node7path20 = 0;
const node8path20 = 0;
const node9path20 = 0;
const node10path20 = 0;
const node11path20 = 0;
const node12path20 = 0;
const node13path20 = 0;
const node14path20 = 0;
const node15path20 = 0;
const node16path20 = 0;
const node17path20 = 0;
const node18path20 = 0;
const node19path20 = 0;
const node20path20 = 0;
const node21path20 = 0;
const node22path20 = 0;
const node23path20 = 0;
const node24path20 = 0;
const node25path20 = 0;
const node26path20 = 0;
const node27path20 = 0;
const node28path20 = 0;
const node29path20 = 0;
const node30path20 = 0;
const node31path20 = 0;
const node32path20 = 0;
const node33path20 = 0;
const node34path20 = 0;
const node35path20 = 0;
const node36path20 = 0;
const node37path20 = 0;
const node38path20 = 0;
const node39path20 = 0;
const node40path20 = 0;
const node41path20 = 0;
const node42path20 = 0;
const node43path20 = 0;
const node44path20 = 0;
const node46path20 = 0;
const node47path20 = 0;
const node48path20 = 0;
const node49path20 = 0;
const node50path20 = 0;
const node52path20 = 0;
const node55path20 = 0;
const node56path20 = 0;
const node58path20 = 0;
const node59path20 = 0;
const node60path20 = 0;
const node59path21 = 13;
const node60path21 = 59;
const node53path21 = 60;
const node55path21 = 53;
const node51path21 = 55;
const node58path21 = 51;
const node1path21 = 58;
const node2path21 = 0;
const node3path21 = 0;
const node4path21 = 0;
const node5path21 = 0;
const node6path21 = 0;
const node7path21 = 0;
const node8path21 = 0;
const node9path21 = 0;
const node10path21 = 0;
const node11path21 = 0;
const node12path21 = 0;
const node13path21 = 0;
const node14path21 = 0;
const node15path21 = 0;
const node16path21 = 0;
const node17path21 = 0;
const node18path21 = 0;
const node19path21 = 0;
const node20path21 = 0;
const node21path21 = 0;
const node22path21 = 0;
const node23path21 = 0;
const node24path21 = 0;
const node25path21 = 0;
const node26path21 = 0;
const node27path21 = 0;
const node28path21 = 0;
const node29path21 = 0;
const node30path21 = 0;
const node31path21 = 0;
const node32path21 = 0;
const node33path21 = 0;
const node34path21 = 0;
const node35path21 = 0;
const node36path21 = 0;
const node37path21 = 0;
const node38path21 = 0;
const node39path21 = 0;
const node40path21 = 0;
const node41path21 = 0;
const node42path21 = 0;
const node43path21 = 0;
const node44path21 = 0;
const node45path21 = 0;
const node46path21 = 0;
const node47path21 = 0;
const node48path21 = 0;
const node49path21 = 0;
const node50path21 = 0;
const node52path21 = 0;
const node54path21 = 0;
const node56path21 = 0;
const node57path21 = 0;
const node53path22 = 33;
const node51path22 = 53;
const node54path22 = 51;
const node55path22 = 54;
const node57path22 = 55;
const node46path22 = 57;
const node1path22 = 0;
const node2path22 = 0;
const node3path22 = 0;
const node4path22 = 0;
const node5path22 = 0;
const node6path22 = 0;
const node7path22 = 0;
const node8path22 = 0;
const node9path22 = 0;
const node10path22 = 0;
const node11path22 = 0;
const node12path22 = 0;
const node13path22 = 0;
const node14path22 = 0;
const node15path22 = 0;
const node16path22 = 0;
const node17path22 = 0;
const node18path22 = 0;
const node19path22 = 0;
const node20path22 = 0;
const node21path22 = 0;
const node22path22 = 0;
const node23path22 = 0;
const node24path22 = 0;
const node25path22 = 0;
const node26path22 = 0;
const node27path22 = 0;
const node28path22 = 0;
const node29path22 = 0;
const node30path22 = 0;
const node31path22 = 0;
const node32path22 = 0;
const node33path22 = 0;
const node34path22 = 0;
const node35path22 = 0;
const node36path22 = 0;
const node37path22 = 0;
const node38path22 = 0;
const node39path22 = 0;
const node40path22 = 0;
const node41path22 = 0;
const node42path22 = 0;
const node43path22 = 0;
const node44path22 = 0;
const node45path22 = 0;
const node47path22 = 0;
const node48path22 = 0;
const node49path22 = 0;
const node50path22 = 0;
const node52path22 = 0;
const node56path22 = 0;
const node58path22 = 0;
const node59path22 = 0;
const node60path22 = 0;
const node54path23 = 6;
const node59path23 = 54;
const node58path23 = 59;
const node51path23 = 58;
const node53path23 = 51;
const node57path23 = 53;
const node20path23 = 57;
const node1path23 = 0;
const node2path23 = 0;
const node3path23 = 0;
const node4path23 = 0;
const node5path23 = 0;
const node6path23 = 0;
const node7path23 = 0;
const node8path23 = 0;
const node9path23 = 0;
const node10path23 = 0;
const node11path23 = 0;
const node12path23 = 0;
const node13path23 = 0;
const node14path23 = 0;
const node15path23 = 0;
const node16path23 = 0;
const node17path23 = 0;
const node18path23 = 0;
const node19path23 = 0;
const node21path23 = 0;
const node22path23 = 0;
const node23path23 = 0;
const node24path23 = 0;
const node25path23 = 0;
const node26path23 = 0;
const node27path23 = 0;
const node28path23 = 0;
const node29path23 = 0;
const node30path23 = 0;
const node31path23 = 0;
const node32path23 = 0;
const node33path23 = 0;
const node34path23 = 0;
const node35path23 = 0;
const node36path23 = 0;
const node37path23 = 0;
const node38path23 = 0;
const node39path23 = 0;
const node40path23 = 0;
const node41path23 = 0;
const node42path23 = 0;
const node43path23 = 0;
const node44path23 = 0;
const node45path23 = 0;
const node46path23 = 0;
const node47path23 = 0;
const node48path23 = 0;
const node49path23 = 0;
const node50path23 = 0;
const node52path23 = 0;
const node55path23 = 0;
const node56path23 = 0;
const node60path23 = 0;
const node53path24 = 44;
const node58path24 = 53;
const node51path24 = 58;
const node56path24 = 51;
const node57path24 = 56;
const node59path24 = 57;
const node20path24 = 59;
const node1path24 = 0;
const node2path24 = 0;
const node3path24 = 0;
const node4path24 = 0;
const node5path24 = 0;
const node6path24 = 0;
const node7path24 = 0;
const node8path24 = 0;
const node9path24 = 0;
const node10path24 = 0;
const node11path24 = 0;
const node12path24 = 0;
const node13path24 = 0;
const node14path24 = 0;
const node15path24 = 0;
const node16path24 = 0;
const node17path24 = 0;
const node18path24 = 0;
const node19path24 = 0;
const node21path24 = 0;
const node22path24 = 0;
const node23path24 = 0;
const node24path24 = 0;
const node25path24 = 0;
const node26path24 = 0;
const node27path24 = 0;
const node28path24 = 0;
const node29path24 = 0;
const node30path24 = 0;
const node31path24 = 0;
const node32path24 = 0;
const node33path24 = 0;
const node34path24 = 0;
const node35path24 = 0;
const node36path24 = 0;
const node37path24 = 0;
const node38path24 = 0;
const node39path24 = 0;
const node40path24 = 0;
const node41path24 = 0;
const node42path24 = 0;
const node43path24 = 0;
const node44path24 = 0;
const node45path24 = 0;
const node46path24 = 0;
const node47path24 = 0;
const node48path24 = 0;
const node49path24 = 0;
const node50path24 = 0;
const node52path24 = 0;
const node54path24 = 0;
const node55path24 = 0;
const node60path24 = 0;
const node59path25 = 39;
const node56path25 = 59;
const node57path25 = 56;
const node58path25 = 57;
const node25path25 = 58;
const node1path25 = 0;
const node2path25 = 0;
const node3path25 = 0;
const node4path25 = 0;
const node5path25 = 0;
const node6path25 = 0;
const node7path25 = 0;
const node8path25 = 0;
const node9path25 = 0;
const node10path25 = 0;
const node11path25 = 0;
const node12path25 = 0;
const node13path25 = 0;
const node14path25 = 0;
const node15path25 = 0;
const node16path25 = 0;
const node17path25 = 0;
const node18path25 = 0;
const node19path25 = 0;
const node20path25 = 0;
const node21path25 = 0;
const node22path25 = 0;
const node23path25 = 0;
const node24path25 = 0;
const node26path25 = 0;
const node27path25 = 0;
const node28path25 = 0;
const node29path25 = 0;
const node30path25 = 0;
const node31path25 = 0;
const node32path25 = 0;
const node33path25 = 0;
const node34path25 = 0;
const node35path25 = 0;
const node36path25 = 0;
const node37path25 = 0;
const node38path25 = 0;
const node39path25 = 0;
const node40path25 = 0;
const node41path25 = 0;
const node42path25 = 0;
const node43path25 = 0;
const node44path25 = 0;
const node45path25 = 0;
const node46path25 = 0;
const node47path25 = 0;
const node48path25 = 0;
const node49path25 = 0;
const node50path25 = 0;
const node51path25 = 0;
const node52path25 = 0;
const node53path25 = 0;
const node54path25 = 0;
const node55path25 = 0;
const node60path25 = 0;
const node54path26 = 40;
const node53path26 = 54;
const node57path26 = 53;
const node55path26 = 57;
const node56path26 = 55;
const node22path26 = 56;
const node1path26 = 0;
const node2path26 = 0;
const node3path26 = 0;
const node4path26 = 0;
const node5path26 = 0;
const node6path26 = 0;
const node7path26 = 0;
const node8path26 = 0;
const node9path26 = 0;
const node10path26 = 0;
const node11path26 = 0;
const node12path26 = 0;
const node13path26 = 0;
const node14path26 = 0;
const node15path26 = 0;
const node16path26 = 0;
const node17path26 = 0;
const node18path26 = 0;
const node19path26 = 0;
const node20path26 = 0;
const node21path26 = 0;
const node23path26 = 0;
const node24path26 = 0;
const node25path26 = 0;
const node26path26 = 0;
const node27path26 = 0;
const node28path26 = 0;
const node29path26 = 0;
const node30path26 = 0;
const node31path26 = 0;
const node32path26 = 0;
const node33path26 = 0;
const node34path26 = 0;
const node35path26 = 0;
const node36path26 = 0;
const node37path26 = 0;
const node38path26 = 0;
const node39path26 = 0;
const node40path26 = 0;
const node41path26 = 0;
const node42path26 = 0;
const node43path26 = 0;
const node44path26 = 0;
const node45path26 = 0;
const node46path26 = 0;
const node47path26 = 0;
const node48path26 = 0;
const node49path26 = 0;
const node50path26 = 0;
const node51path26 = 0;
const node52path26 = 0;
const node58path26 = 0;
const node59path26 = 0;
const node60path26 = 0;
const node55path27 = 8;
const node58path27 = 55;
const node60path27 = 58;
const node53path27 = 60;
const node59path27 = 53;
const node52path27 = 59;
const node31path27 = 52;
const node1path27 = 0;
const node2path27 = 0;
const node3path27 = 0;
const node4path27 = 0;
const node5path27 = 0;
const node6path27 = 0;
const node7path27 = 0;
const node8path27 = 0;
const node9path27 = 0;
const node10path27 = 0;
const node11path27 = 0;
const node12path27 = 0;
const node13path27 = 0;
const node14path27 = 0;
const node15path27 = 0;
const node16path27 = 0;
const node17path27 = 0;
const node18path27 = 0;
const node19path27 = 0;
const node20path27 = 0;
const node21path27 = 0;
const node22path27 = 0;
const node23path27 = 0;
const node24path27 = 0;
const node25path27 = 0;
const node26path27 = 0;
const node27path27 = 0;
const node28path27 = 0;
const node29path27 = 0;
const node30path27 = 0;
const node32path27 = 0;
const node33path27 = 0;
const node34path27 = 0;
const node35path27 = 0;
const node36path27 = 0;
const node37path27 = 0;
const node38path27 = 0;
const node39path27 = 0;
const node40path27 = 0;
const node41path27 = 0;
const node42path27 = 0;
const node43path27 = 0;
const node44path27 = 0;
const node45path27 = 0;
const node46path27 = 0;
const node47path27 = 0;
const node48path27 = 0;
const node49path27 = 0;
const node50path27 = 0;
const node51path27 = 0;
const node54path27 = 0;
const node56path27 = 0;
const node57path27 = 0;
const node59path28 = 37;
const node60path28 = 59;
const node52path28 = 60;
const node57path28 = 52;
const node36path28 = 57;
const node1path28 = 0;
const node2path28 = 0;
const node3path28 = 0;
const node4path28 = 0;
const node5path28 = 0;
const node6path28 = 0;
const node7path28 = 0;
const node8path28 = 0;
const node9path28 = 0;
const node10path28 = 0;
const node11path28 = 0;
const node12path28 = 0;
const node13path28 = 0;
const node14path28 = 0;
const node15path28 = 0;
const node16path28 = 0;
const node17path28 = 0;
const node18path28 = 0;
const node19path28 = 0;
const node20path28 = 0;
const node21path28 = 0;
const node22path28 = 0;
const node23path28 = 0;
const node24path28 = 0;
const node25path28 = 0;
const node26path28 = 0;
const node27path28 = 0;
const node28path28 = 0;
const node29path28 = 0;
const node30path28 = 0;
const node31path28 = 0;
const node32path28 = 0;
const node33path28 = 0;
const node34path28 = 0;
const node35path28 = 0;
const node37path28 = 0;
const node38path28 = 0;
const node39path28 = 0;
const node40path28 = 0;
const node41path28 = 0;
const node42path28 = 0;
const node43path28 = 0;
const node44path28 = 0;
const node45path28 = 0;
const node46path28 = 0;
const node47path28 = 0;
const node48path28 = 0;
const node49path28 = 0;
const node50path28 = 0;
const node51path28 = 0;
const node53path28 = 0;
const node54path28 = 0;
const node55path28 = 0;
const node56path28 = 0;
const node58path28 = 0;
const node58path29 = 15;
const node57path29 = 58;
const node54path29 = 57;
const node53path29 = 54;
const node59path29 = 53;
const node52path29 = 59;
const node37path29 = 52;
const node1path29 = 0;
const node2path29 = 0;
const node3path29 = 0;
const node4path29 = 0;
const node5path29 = 0;
const node6path29 = 0;
const node7path29 = 0;
const node8path29 = 0;
const node9path29 = 0;
const node10path29 = 0;
const node11path29 = 0;
const node12path29 = 0;
const node13path29 = 0;
const node14path29 = 0;
const node15path29 = 0;
const node16path29 = 0;
const node17path29 = 0;
const node18path29 = 0;
const node19path29 = 0;
const node20path29 = 0;
const node21path29 = 0;
const node22path29 = 0;
const node23path29 = 0;
const node24path29 = 0;
const node25path29 = 0;
const node26path29 = 0;
const node27path29 = 0;
const node28path29 = 0;
const node29path29 = 0;
const node30path29 = 0;
const node31path29 = 0;
const node32path29 = 0;
const node33path29 = 0;
const node34path29 = 0;
const node35path29 = 0;
const node36path29 = 0;
const node38path29 = 0;
const node39path29 = 0;
const node40path29 = 0;
const node41path29 = 0;
const node42path29 = 0;
const node43path29 = 0;
const node44path29 = 0;
const node45path29 = 0;
const node46path29 = 0;
const node47path29 = 0;
const node48path29 = 0;
const node49path29 = 0;
const node50path29 = 0;
const node51path29 = 0;
const node55path29 = 0;
const node56path29 = 0;
const node60path29 = 0;
const node54path30 = 13;
const node59path30 = 54;
const node51path30 = 59;
const node60path30 = 51;
const node12path30 = 60;
const node1path30 = 0;
const node2path30 = 0;
const node3path30 = 0;
const node4path30 = 0;
const node5path30 = 0;
const node6path30 = 0;
const node7path30 = 0;
const node8path30 = 0;
const node9path30 = 0;
const node10path30 = 0;
const node11path30 = 0;
const node13path30 = 0;
const node14path30 = 0;
const node15path30 = 0;
const node16path30 = 0;
const node17path30 = 0;
const node18path30 = 0;
const node19path30 = 0;
const node20path30 = 0;
const node21path30 = 0;
const node22path30 = 0;
const node23path30 = 0;
const node24path30 = 0;
const node25path30 = 0;
const node26path30 = 0;
const node27path30 = 0;
const node28path30 = 0;
const node29path30 = 0;
const node30path30 = 0;
const node31path30 = 0;
const node32path30 = 0;
const node33path30 = 0;
const node34path30 = 0;
const node35path30 = 0;
const node36path30 = 0;
const node37path30 = 0;
const node38path30 = 0;
const node39path30 = 0;
const node40path30 = 0;
const node41path30 = 0;
const node42path30 = 0;
const node43path30 = 0;
const node44path30 = 0;
const node45path30 = 0;
const node46path30 = 0;
const node47path30 = 0;
const node48path30 = 0;
const node49path30 = 0;
const node50path30 = 0;
const node52path30 = 0;
const node53path30 = 0;
const node55path30 = 0;
const node56path30 = 0;
const node57path30 = 0;
const node58path30 = 0;
const node60path31 = 11;
const node58path31 = 60;
const node57path31 = 58;
const node56path31 = 57;
const node55path31 = 56;
const node36path31 = 55;
const node1path31 = 0;
const node2path31 = 0;
const node3path31 = 0;
const node4path31 = 0;
const node5path31 = 0;
const node6path31 = 0;
const node7path31 = 0;
const node8path31 = 0;
const node9path31 = 0;
const node10path31 = 0;
const node11path31 = 0;
const node12path31 = 0;
const node13path31 = 0;
const node14path31 = 0;
const node15path31 = 0;
const node16path31 = 0;
const node17path31 = 0;
const node18path31 = 0;
const node19path31 = 0;
const node20path31 = 0;
const node21path31 = 0;
const node22path31 = 0;
const node23path31 = 0;
const node24path31 = 0;
const node25path31 = 0;
const node26path31 = 0;
const node27path31 = 0;
const node28path31 = 0;
const node29path31 = 0;
const node30path31 = 0;
const node31path31 = 0;
const node32path31 = 0;
const node33path31 = 0;
const node34path31 = 0;
const node35path31 = 0;
const node37path31 = 0;
const node38path31 = 0;
const node39path31 = 0;
const node40path31 = 0;
const node41path31 = 0;
const node42path31 = 0;
const node43path31 = 0;
const node44path31 = 0;
const node45path31 = 0;
const node46path31 = 0;
const node47path31 = 0;
const node48path31 = 0;
const node49path31 = 0;
const node50path31 = 0;
const node51path31 = 0;
const node52path31 = 0;
const node53path31 = 0;
const node54path31 = 0;
const node59path31 = 0;
const node52path32 = 11;
const node51path32 = 52;
const node55path32 = 51;
const node58path32 = 55;
const node54path32 = 58;
const node57path32 = 54;
const node3path32 = 57;
const node1path32 = 0;
const node2path32 = 0;
const node4path32 = 0;
const node5path32 = 0;
const node6path32 = 0;
const node7path32 = 0;
const node8path32 = 0;
const node9path32 = 0;
const node10path32 = 0;
const node11path32 = 0;
const node12path32 = 0;
const node13path32 = 0;
const node14path32 = 0;
const node15path32 = 0;
const node16path32 = 0;
const node17path32 = 0;
const node18path32 = 0;
const node19path32 = 0;
const node20path32 = 0;
const node21path32 = 0;
const node22path32 = 0;
const node23path32 = 0;
const node24path32 = 0;
const node25path32 = 0;
const node26path32 = 0;
const node27path32 = 0;
const node28path32 = 0;
const node29path32 = 0;
const node30path32 = 0;
const node31path32 = 0;
const node32path32 = 0;
const node33path32 = 0;
const node34path32 = 0;
const node35path32 = 0;
const node36path32 = 0;
const node37path32 = 0;
const node38path32 = 0;
const node39path32 = 0;
const node40path32 = 0;
const node41path32 = 0;
const node42path32 = 0;
const node43path32 = 0;
const node44path32 = 0;
const node45path32 = 0;
const node46path32 = 0;
const node47path32 = 0;
const node48path32 = 0;
const node49path32 = 0;
const node50path32 = 0;
const node53path32 = 0;
const node56path32 = 0;
const node59path32 = 0;
const node60path32 = 0;
const node59path33 = 35;
const node60path33 = 59;
const node54path33 = 60;
const node52path33 = 54;
const node31path33 = 52;
const node1path33 = 0;
const node2path33 = 0;
const node3path33 = 0;
const node4path33 = 0;
const node5path33 = 0;
const node6path33 = 0;
const node7path33 = 0;
const node8path33 = 0;
const node9path33 = 0;
const node10path33 = 0;
const node11path33 = 0;
const node12path33 = 0;
const node13path33 = 0;
const node14path33 = 0;
const node15path33 = 0;
const node16path33 = 0;
const node17path33 = 0;
const node18path33 = 0;
const node19path33 = 0;
const node20path33 = 0;
const node21path33 = 0;
const node22path33 = 0;
const node23path33 = 0;
const node24path33 = 0;
const node25path33 = 0;
const node26path33 = 0;
const node27path33 = 0;
const node28path33 = 0;
const node29path33 = 0;
const node30path33 = 0;
const node32path33 = 0;
const node33path33 = 0;
const node34path33 = 0;
const node35path33 = 0;
const node36path33 = 0;
const node37path33 = 0;
const node38path33 = 0;
const node39path33 = 0;
const node40path33 = 0;
const node41path33 = 0;
const node42path33 = 0;
const node43path33 = 0;
const node44path33 = 0;
const node45path33 = 0;
const node46path33 = 0;
const node47path33 = 0;
const node48path33 = 0;
const node49path33 = 0;
const node50path33 = 0;
const node51path33 = 0;
const node53path33 = 0;
const node55path33 = 0;
const node56path33 = 0;
const node57path33 = 0;
const node58path33 = 0;
const node55path34 = 37;
const node54path34 = 55;
const node53path34 = 54;
const node57path34 = 53;
const node18path34 = 57;
const node1path34 = 0;
const node2path34 = 0;
const node3path34 = 0;
const node4path34 = 0;
const node5path34 = 0;
const node6path34 = 0;
const node7path34 = 0;
const node8path34 = 0;
const node9path34 = 0;
const node10path34 = 0;
const node11path34 = 0;
const node12path34 = 0;
const node13path34 = 0;
const node14path34 = 0;
const node15path34 = 0;
const node16path34 = 0;
const node17path34 = 0;
const node19path34 = 0;
const node20path34 = 0;
const node21path34 = 0;
const node22path34 = 0;
const node23path34 = 0;
const node24path34 = 0;
const node25path34 = 0;
const node26path34 = 0;
const node27path34 = 0;
const node28path34 = 0;
const node29path34 = 0;
const node30path34 = 0;
const node31path34 = 0;
const node32path34 = 0;
const node33path34 = 0;
const node34path34 = 0;
const node35path34 = 0;
const node36path34 = 0;
const node37path34 = 0;
const node38path34 = 0;
const node39path34 = 0;
const node40path34 = 0;
const node41path34 = 0;
const node42path34 = 0;
const node43path34 = 0;
const node44path34 = 0;
const node45path34 = 0;
const node46path34 = 0;
const node47path34 = 0;
const node48path34 = 0;
const node49path34 = 0;
const node50path34 = 0;
const node51path34 = 0;
const node52path34 = 0;
const node56path34 = 0;
const node58path34 = 0;
const node59path34 = 0;
const node60path34 = 0;
const node55path35 = 8;
const node60path35 = 55;
const node53path35 = 60;
const node58path35 = 53;
const node39path35 = 58;
const node1path35 = 0;
const node2path35 = 0;
const node3path35 = 0;
const node4path35 = 0;
const node5path35 = 0;
const node6path35 = 0;
const node7path35 = 0;
const node8path35 = 0;
const node9path35 = 0;
const node10path35 = 0;
const node11path35 = 0;
const node12path35 = 0;
const node13path35 = 0;
const node14path35 = 0;
const node15path35 = 0;
const node16path35 = 0;
const node17path35 = 0;
const node18path35 = 0;
const node19path35 = 0;
const node20path35 = 0;
const node21path35 = 0;
const node22path35 = 0;
const node23path35 = 0;
const node24path35 = 0;
const node25path35 = 0;
const node26path35 = 0;
const node27path35 = 0;
const node28path35 = 0;
const node29path35 = 0;
const node30path35 = 0;
const node31path35 = 0;
const node32path35 = 0;
const node33path35 = 0;
const node34path35 = 0;
const node35path35 = 0;
const node36path35 = 0;
const node37path35 = 0;
const node38path35 = 0;
const node40path35 = 0;
const node41path35 = 0;
const node42path35 = 0;
const node43path35 = 0;
const node44path35 = 0;
const node45path35 = 0;
const node46path35 = 0;
const node47path35 = 0;
const node48path35 = 0;
const node49path35 = 0;
const node50path35 = 0;
const node51path35 = 0;
const node52path35 = 0;
const node54path35 = 0;
const node56path35 = 0;
const node57path35 = 0;
const node59path35 = 0;
const node60path36 = 13;
const node51path36 = 60;
const node57path36 = 51;
const node54path36 = 57;
const node59path36 = 54;
const node53path36 = 59;
const node27path36 = 53;
const node1path36 = 0;
const node2path36 = 0;
const node3path36 = 0;
const node4path36 = 0;
const node5path36 = 0;
const node6path36 = 0;
const node7path36 = 0;
const node8path36 = 0;
const node9path36 = 0;
const node10path36 = 0;
const node11path36 = 0;
const node12path36 = 0;
const node13path36 = 0;
const node14path36 = 0;
const node15path36 = 0;
const node16path36 = 0;
const node17path36 = 0;
const node18path36 = 0;
const node19path36 = 0;
const node20path36 = 0;
const node21path36 = 0;
const node22path36 = 0;
const node23path36 = 0;
const node24path36 = 0;
const node25path36 = 0;
const node26path36 = 0;
const node28path36 = 0;
const node29path36 = 0;
const node30path36 = 0;
const node31path36 = 0;
const node32path36 = 0;
const node33path36 = 0;
const node34path36 = 0;
const node35path36 = 0;
const node36path36 = 0;
const node37path36 = 0;
const node38path36 = 0;
const node39path36 = 0;
const node40path36 = 0;
const node41path36 = 0;
const node42path36 = 0;
const node43path36 = 0;
const node44path36 = 0;
const node45path36 = 0;
const node46path36 = 0;
const node47path36 = 0;
const node48path36 = 0;
const node49path36 = 0;
const node50path36 = 0;
const node52path36 = 0;
const node55path36 = 0;
const node56path36 = 0;
const node58path36 = 0;
const node60path37 = 49;
const node57path37 = 60;
const node55path37 = 57;
const node51path37 = 55;
const node47path37 = 51;
const node1path37 = 0;
const node2path37 = 0;
const node3path37 = 0;
const node4path37 = 0;
const node5path37 = 0;
const node6path37 = 0;
const node7path37 = 0;
const node8path37 = 0;
const node9path37 = 0;
const node10path37 = 0;
const node11path37 = 0;
const node12path37 = 0;
const node13path37 = 0;
const node14path37 = 0;
const node15path37 = 0;
const node16path37 = 0;
const node17path37 = 0;
const node18path37 = 0;
const node19path37 = 0;
const node20path37 = 0;
const node21path37 = 0;
const node22path37 = 0;
const node23path37 = 0;
const node24path37 = 0;
const node25path37 = 0;
const node26path37 = 0;
const node27path37 = 0;
const node28path37 = 0;
const node29path37 = 0;
const node30path37 = 0;
const node31path37 = 0;
const node32path37 = 0;
const node33path37 = 0;
const node34path37 = 0;
const node35path37 = 0;
const node36path37 = 0;
const node37path37 = 0;
const node38path37 = 0;
const node39path37 = 0;
const node40path37 = 0;
const node41path37 = 0;
const node42path37 = 0;
const node43path37 = 0;
const node44path37 = 0;
const node45path37 = 0;
const node46path37 = 0;
const node48path37 = 0;
const node49path37 = 0;
const node50path37 = 0;
const node52path37 = 0;
const node53path37 = 0;
const node54path37 = 0;
const node56path37 = 0;
const node58path37 = 0;
const node59path37 = 0;
const node52path38 = 29;
const node56path38 = 52;
const node53path38 = 56;
const node57path38 = 53;
const node60path38 = 57;
const node59path38 = 60;
const node12path38 = 59;
const node1path38 = 0;
const node2path38 = 0;
const node3path38 = 0;
const node4path38 = 0;
const node5path38 = 0;
const node6path38 = 0;
const node7path38 = 0;
const node8path38 = 0;
const node9path38 = 0;
const node10path38 = 0;
const node11path38 = 0;
const node13path38 = 0;
const node14path38 = 0;
const node15path38 = 0;
const node16path38 = 0;
const node17path38 = 0;
const node18path38 = 0;
const node19path38 = 0;
const node20path38 = 0;
const node21path38 = 0;
const node22path38 = 0;
const node23path38 = 0;
const node24path38 = 0;
const node25path38 = 0;
const node26path38 = 0;
const node27path38 = 0;
const node28path38 = 0;
const node29path38 = 0;
const node30path38 = 0;
const node31path38 = 0;
const node32path38 = 0;
const node33path38 = 0;
const node34path38 = 0;
const node35path38 = 0;
const node36path38 = 0;
const node37path38 = 0;
const node38path38 = 0;
const node39path38 = 0;
const node40path38 = 0;
const node41path38 = 0;
const node42path38 = 0;
const node43path38 = 0;
const node44path38 = 0;
const node45path38 = 0;
const node46path38 = 0;
const node47path38 = 0;
const node48path38 = 0;
const node49path38 = 0;
const node50path38 = 0;
const node51path38 = 0;
const node54path38 = 0;
const node55path38 = 0;
const node58path38 = 0;
const node51path39 = 41;
const node54path39 = 51;
const node53path39 = 54;
const node58path39 = 53;
const node56path39 = 58;
const node60path39 = 56;
const node29path39 = 60;
const node1path39 = 0;
const node2path39 = 0;
const node3path39 = 0;
const node4path39 = 0;
const node5path39 = 0;
const node6path39 = 0;
const node7path39 = 0;
const node8path39 = 0;
const node9path39 = 0;
const node10path39 = 0;
const node11path39 = 0;
const node12path39 = 0;
const node13path39 = 0;
const node14path39 = 0;
const node15path39 = 0;
const node16path39 = 0;
const node17path39 = 0;
const node18path39 = 0;
const node19path39 = 0;
const node20path39 = 0;
const node21path39 = 0;
const node22path39 = 0;
const node23path39 = 0;
const node24path39 = 0;
const node25path39 = 0;
const node26path39 = 0;
const node27path39 = 0;
const node28path39 = 0;
const node30path39 = 0;
const node31path39 = 0;
const node32path39 = 0;
const node33path39 = 0;
const node34path39 = 0;
const node35path39 = 0;
const node36path39 = 0;
const node37path39 = 0;
const node38path39 = 0;
const node39path39 = 0;
const node40path39 = 0;
const node41path39 = 0;
const node42path39 = 0;
const node43path39 = 0;
const node44path39 = 0;
const node45path39 = 0;
const node46path39 = 0;
const node47path39 = 0;
const node48path39 = 0;
const node49path39 = 0;
const node50path39 = 0;
const node52path39 = 0;
const node55path39 = 0;
const node57path39 = 0;
const node59path39 = 0;
const node60path40 = 19;
const node51path40 = 60;
const node53path40 = 51;
const node52path40 = 53;
const node54path40 = 52;
const node28path40 = 54;
const node1path40 = 0;
const node2path40 = 0;
const node3path40 = 0;
const node4path40 = 0;
const node5path40 = 0;
const node6path40 = 0;
const node7path40 = 0;
const node8path40 = 0;
const node9path40 = 0;
const node10path40 = 0;
const node11path40 = 0;
const node12path40 = 0;
const node13path40 = 0;
const node14path40 = 0;
const node15path40 = 0;
const node16path40 = 0;
const node17path40 = 0;
const node18path40 = 0;
const node19path40 = 0;
const node20path40 = 0;
const node21path40 = 0;
const node22path40 = 0;
const node23path40 = 0;
const node24path40 = 0;
const node25path40 = 0;
const node26path40 = 0;
const node27path40 = 0;
const node29path40 = 0;
const node30path40 = 0;
const node31path40 = 0;
const node32path40 = 0;
const node33path40 = 0;
const node34path40 = 0;
const node35path40 = 0;
const node36path40 = 0;
const node37path40 = 0;
const node38path40 = 0;
const node39path40 = 0;
const node40path40 = 0;
const node41path40 = 0;
const node42path40 = 0;
const node43path40 = 0;
const node44path40 = 0;
const node45path40 = 0;
const node46path40 = 0;
const node47path40 = 0;
const node48path40 = 0;
const node49path40 = 0;
const node50path40 = 0;
const node55path40 = 0;
const node56path40 = 0;
const node57path40 = 0;
const node58path40 = 0;
const node59path40 = 0;
const node52path41 = 23;
const node55path41 = 52;
const node59path41 = 55;
const node54path41 = 59;
const node29path41 = 54;
const node1path41 = 0;
const node2path41 = 0;
const node3path41 = 0;
const node4path41 = 0;
const node5path41 = 0;
const node6path41 = 0;
const node7path41 = 0;
const node8path41 = 0;
const node9path41 = 0;
const node10path41 = 0;
const node11path41 = 0;
const node12path41 = 0;
const node13path41 = 0;
const node14path41 = 0;
const node15path41 = 0;
const node16path41 = 0;
const node17path41 = 0;
const node18path41 = 0;
const node19path41 = 0;
const node20path41 = 0;
const node21path41 = 0;
const node22path41 = 0;
const node23path41 = 0;
const node24path41 = 0;
const node25path41 = 0;
const node26path41 = 0;
const node27path41 = 0;
const node28path41 = 0;
const node30path41 = 0;
const node31path41 = 0;
const node32path41 = 0;
const node33path41 = 0;
const node34path41 = 0;
const node35path41 = 0;
const node36path41 = 0;
const node37path41 = 0;
const node38path41 = 0;
const node39path41 = 0;
const node40path41 = 0;
const node41path41 = 0;
const node42path41 = 0;
const node43path41 = 0;
const node44path41 = 0;
const node45path41 = 0;
const node46path41 = 0;
const node47path41 = 0;
const node48path41 = 0;
const node49path41 = 0;
const node50path41 = 0;
const node51path41 = 0;
const node53path41 = 0;
const node56path41 = 0;
const node57path41 = 0;
const node58path41 = 0;
const node60path41 = 0;
const node58path42 = 7;
const node56path42 = 58;
const node54path42 = 56;
const node53path42 = 54;
const node51path42 = 53;
const node32path42 = 51;
const node1path42 = 0;
const node2path42 = 0;
const node3path42 = 0;
const node4path42 = 0;
const node5path42 = 0;
const node6path42 = 0;
const node7path42 = 0;
const node8path42 = 0;
const node9path42 = 0;
const node10path42 = 0;
const node11path42 = 0;
const node12path42 = 0;
const node13path42 = 0;
const node14path42 = 0;
const node15path42 = 0;
const node16path42 = 0;
const node17path42 = 0;
const node18path42 = 0;
const node19path42 = 0;
const node20path42 = 0;
const node21path42 = 0;
const node22path42 = 0;
const node23path42 = 0;
const node24path42 = 0;
const node25path42 = 0;
const node26path42 = 0;
const node27path42 = 0;
const node28path42 = 0;
const node29path42 = 0;
const node30path42 = 0;
const node31path42 = 0;
const node33path42 = 0;
const node34path42 = 0;
const node35path42 = 0;
const node36path42 = 0;
const node37path42 = 0;
const node38path42 = 0;
const node39path42 = 0;
const node40path42 = 0;
const node41path42 = 0;
const node42path42 = 0;
const node43path42 = 0;
const node44path42 = 0;
const node45path42 = 0;
const node46path42 = 0;
const node47path42 = 0;
const node48path42 = 0;
const node49path42 = 0;
const node50path42 = 0;
const node52path42 = 0;
const node55path42 = 0;
const node57path42 = 0;
const node59path42 = 0;
const node60path42 = 0;
const node51path43 = 30;
const node60path43 = 51;
const node57path43 = 60;
const node55path43 = 57;
const node58path43 = 55;
const node54path43 = 58;
const node13path43 = 54;
const node1path43 = 0;
const node2path43 = 0;
const node3path43 = 0;
const node4path43 = 0;
const node5path43 = 0;
const node6path43 = 0;
const node7path43 = 0;
const node8path43 = 0;
const node9path43 = 0;
const node10path43 = 0;
const node11path43 = 0;
const node12path43 = 0;
const node14path43 = 0;
const node15path43 = 0;
const node16path43 = 0;
const node17path43 = 0;
const node18path43 = 0;
const node19path43 = 0;
const node20path43 = 0;
const node21path43 = 0;
const node22path43 = 0;
const node23path43 = 0;
const node24path43 = 0;
const node25path43 = 0;
const node26path43 = 0;
const node27path43 = 0;
const node28path43 = 0;
const node29path43 = 0;
const node30path43 = 0;
const node31path43 = 0;
const node32path43 = 0;
const node33path43 = 0;
const node34path43 = 0;
const node35path43 = 0;
const node36path43 = 0;
const node37path43 = 0;
const node38path43 = 0;
const node39path43 = 0;
const node40path43 = 0;
const node41path43 = 0;
const node42path43 = 0;
const node43path43 = 0;
const node44path43 = 0;
const node45path43 = 0;
const node46path43 = 0;
const node47path43 = 0;
const node48path43 = 0;
const node49path43 = 0;
const node50path43 = 0;
const node52path43 = 0;
const node53path43 = 0;
const node56path43 = 0;
const node59path43 = 0;
const node60path44 = 23;
const node53path44 = 60;
const node57path44 = 53;
const node58path44 = 57;
const node59path44 = 58;
const node46path44 = 59;
const node1path44 = 0;
const node2path44 = 0;
const node3path44 = 0;
const node4path44 = 0;
const node5path44 = 0;
const node6path44 = 0;
const node7path44 = 0;
const node8path44 = 0;
const node9path44 = 0;
const node10path44 = 0;
const node11path44 = 0;
const node12path44 = 0;
const node13path44 = 0;
const node14path44 = 0;
const node15path44 = 0;
const node16path44 = 0;
const node17path44 = 0;
const node18path44 = 0;
const node19path44 = 0;
const node20path44 = 0;
const node21path44 = 0;
const node22path44 = 0;
const node23path44 = 0;
const node24path44 = 0;
const node25path44 = 0;
const node26path44 = 0;
const node27path44 = 0;
const node28path44 = 0;
const node29path44 = 0;
const node30path44 = 0;
const node31path44 = 0;
const node32path44 = 0;
const node33path44 = 0;
const node34path44 = 0;
const node35path44 = 0;
const node36path44 = 0;
const node37path44 = 0;
const node38path44 = 0;
const node39path44 = 0;
const node40path44 = 0;
const node41path44 = 0;
const node42path44 = 0;
const node43path44 = 0;
const node44path44 = 0;
const node45path44 = 0;
const node47path44 = 0;
const node48path44 = 0;
const node49path44 = 0;
const node50path44 = 0;
const node51path44 = 0;
const node52path44 = 0;
const node54path44 = 0;
const node55path44 = 0;
const node56path44 = 0;
const node51path45 = 30;
const node58path45 = 51;
const node52path45 = 58;
const node55path45 = 52;
const node8path45 = 55;
const node1path45 = 0;
const node2path45 = 0;
const node3path45 = 0;
const node4path45 = 0;
const node5path45 = 0;
const node6path45 = 0;
const node7path45 = 0;
const node9path45 = 0;
const node10path45 = 0;
const node11path45 = 0;
const node12path45 = 0;
const node13path45 = 0;
const node14path45 = 0;
const node15path45 = 0;
const node16path45 = 0;
const node17path45 = 0;
const node18path45 = 0;
const node19path45 = 0;
const node20path45 = 0;
const node21path45 = 0;
const node22path45 = 0;
const node23path45 = 0;
const node24path45 = 0;
const node25path45 = 0;
const node26path45 = 0;
const node27path45 = 0;
const node28path45 = 0;
const node29path45 = 0;
const node30path45 = 0;
const node31path45 = 0;
const node32path45 = 0;
const node33path45 = 0;
const node34path45 = 0;
const node35path45 = 0;
const node36path45 = 0;
const node37path45 = 0;
const node38path45 = 0;
const node39path45 = 0;
const node40path45 = 0;
const node41path45 = 0;
const node42path45 = 0;
const node43path45 = 0;
const node44path45 = 0;
const node45path45 = 0;
const node46path45 = 0;
const node47path45 = 0;
const node48path45 = 0;
const node49path45 = 0;
const node50path45 = 0;
const node53path45 = 0;
const node54path45 = 0;
const node56path45 = 0;
const node57path45 = 0;
const node59path45 = 0;
const node60path45 = 0;
const node53path46 = 8;
const node54path46 = 53;
const node55path46 = 54;
const node58path46 = 55;
const node26path46 = 58;
const node1path46 = 0;
const node2path46 = 0;
const node3path46 = 0;
const node4path46 = 0;
const node5path46 = 0;
const node6path46 = 0;
const node7path46 = 0;
const node8path46 = 0;
const node9path46 = 0;
const node10path46 = 0;
const node11path46 = 0;
const node12path46 = 0;
const node13path46 = 0;
const node14path46 = 0;
const node15path46 = 0;
const node16path46 = 0;
const node17path46 = 0;
const node18path46 = 0;
const node19path46 = 0;
const node20path46 = 0;
const node21path46 = 0;
const node22path46 = 0;
const node23path46 = 0;
const node24path46 = 0;
const node25path46 = 0;
const node27path46 = 0;
const node28path46 = 0;
const node29path46 = 0;
const node30path46 = 0;
const node31path46 = 0;
const node32path46 = 0;
const node33path46 = 0;
const node34path46 = 0;
const node35path46 = 0;
const node36path46 = 0;
const node37path46 = 0;
const node38path46 = 0;
const node39path46 = 0;
const node40path46 = 0;
const node41path46 = 0;
const node42path46 = 0;
const node43path46 = 0;
const node44path46 = 0;
const node45path46 = 0;
const node46path46 = 0;
const node47path46 = 0;
const node48path46 = 0;
const node49path46 = 0;
const node50path46 = 0;
const node51path46 = 0;
const node52path46 = 0;
const node56path46 = 0;
const node57path46 = 0;
const node59path46 = 0;
const node60path46 = 0;
const node57path47 = 9;
const node54path47 = 57;
const node51path47 = 54;
const node55path47 = 51;
const node7path47 = 55;
const node1path47 = 0;
const node2path47 = 0;
const node3path47 = 0;
const node4path47 = 0;
const node5path47 = 0;
const node6path47 = 0;
const node8path47 = 0;
const node9path47 = 0;
const node10path47 = 0;
const node11path47 = 0;
const node12path47 = 0;
const node13path47 = 0;
const node14path47 = 0;
const node15path47 = 0;
const node16path47 = 0;
const node17path47 = 0;
const node18path47 = 0;
const node19path47 = 0;
const node20path47 = 0;
const node21path47 = 0;
const node22path47 = 0;
const node23path47 = 0;
const node24path47 = 0;
const node25path47 = 0;
const node26path47 = 0;
const node27path47 = 0;
const node28path47 = 0;
const node29path47 = 0;
const node30path47 = 0;
const node31path47 = 0;
const node32path47 = 0;
const node33path47 = 0;
const node34path47 = 0;
const node35path47 = 0;
const node36path47 = 0;
const node37path47 = 0;
const node38path47 = 0;
const node39path47 = 0;
const node40path47 = 0;
const node41path47 = 0;
const node42path47 = 0;
const node43path47 = 0;
const node44path47 = 0;
const node45path47 = 0;
const node46path47 = 0;
const node47path47 = 0;
const node48path47 = 0;
const node49path47 = 0;
const node50path47 = 0;
const node52path47 = 0;
const node53path47 = 0;
const node56path47 = 0;
const node58path47 = 0;
const node59path47 = 0;
const node60path47 = 0;
const node57path48 = 18;
const node51path48 = 57;
const node58path48 = 51;
const node52path48 = 58;
const node56path48 = 52;
const node60path48 = 56;
const node45path48 = 60;
const node1path48 = 0;
const node2path48 = 0;
const node3path48 = 0;
const node4path48 = 0;
const node5path48 = 0;
const node6path48 = 0;
const node7path48 = 0;
const node8path48 = 0;
const node9path48 = 0;
const node10path48 = 0;
const node11path48 = 0;
const node12path48 = 0;
const node13path48 = 0;
const node14path48 = 0;
const node15path48 = 0;
const node16path48 = 0;
const node17path48 = 0;
const node18path48 = 0;
const node19path48 = 0;
const node20path48 = 0;
const node21path48 = 0;
const node22path48 = 0;
const node23path48 = 0;
const node24path48 = 0;
const node25path48 = 0;
const node26path48 = 0;
const node27path48 = 0;
const node28path48 = 0;
const node29path48 = 0;
const node30path48 = 0;
const node31path48 = 0;
const node32path48 = 0;
const node33path48 = 0;
const node34path48 = 0;
const node35path48 = 0;
const node36path48 = 0;
const node37path48 = 0;
const node38path48 = 0;
const node39path48 = 0;
const node40path48 = 0;
const node41path48 = 0;
const node42path48 = 0;
const node43path48 = 0;
const node44path48 = 0;
const node46path48 = 0;
const node47path48 = 0;
const node48path48 = 0;
const node49path48 = 0;
const node50path48 = 0;
const node53path48 = 0;
const node54path48 = 0;
const node55path48 = 0;
const node59path48 = 0;
const node53path49 = 23;
const node56path49 = 53;
const node60path49 = 56;
const node54path49 = 60;
const node52path49 = 54;
const node51path49 = 52;
const node15path49 = 51;
const node1path49 = 0;
const node2path49 = 0;
const node3path49 = 0;
const node4path49 = 0;
const node5path49 = 0;
const node6path49 = 0;
const node7path49 = 0;
const node8path49 = 0;
const node9path49 = 0;
const node10path49 = 0;
const node11path49 = 0;
const node12path49 = 0;
const node13path49 = 0;
const node14path49 = 0;
const node16path49 = 0;
const node17path49 = 0;
const node18path49 = 0;
const node19path49 = 0;
const node20path49 = 0;
const node21path49 = 0;
const node22path49 = 0;
const node23path49 = 0;
const node24path49 = 0;
const node25path49 = 0;
const node26path49 = 0;
const node27path49 = 0;
const node28path49 = 0;
const node29path49 = 0;
const node30path49 = 0;
const node31path49 = 0;
const node32path49 = 0;
const node33path49 = 0;
const node34path49 = 0;
const node35path49 = 0;
const node36path49 = 0;
const node37path49 = 0;
const node38path49 = 0;
const node39path49 = 0;
const node40path49 = 0;
const node41path49 = 0;
const node42path49 = 0;
const node43path49 = 0;
const node44path49 = 0;
const node45path49 = 0;
const node46path49 = 0;
const node47path49 = 0;
const node48path49 = 0;
const node49path49 = 0;
const node50path49 = 0;
const node55path49 = 0;
const node57path49 = 0;
const node58path49 = 0;
const node59path49 = 0;
const node59path50 = 15;
const node57path50 = 59;
const node54path50 = 57;
const node58path50 = 54;
const node7path50 = 58;
const node1path50 = 0;
const node2path50 = 0;
const node3path50 = 0;
const node4path50 = 0;
const node5path50 = 0;
const node6path50 = 0;
const node8path50 = 0;
const node9path50 = 0;
const node10path50 = 0;
const node11path50 = 0;
const node12path50 = 0;
const node13path50 = 0;
const node14path50 = 0;
const node15path50 = 0;
const node16path50 = 0;
const node17path50 = 0;
const node18path50 = 0;
const node19path50 = 0;
const node20path50 = 0;
const node21path50 = 0;
const node22path50 = 0;
const node23path50 = 0;
const node24path50 = 0;
const node25path50 = 0;
const node26path50 = 0;
const node27path50 = 0;
const node28path50 = 0;
const node29path50 = 0;
const node30path50 = 0;
const node31path50 = 0;
const node32path50 = 0;
const node33path50 = 0;
const node34path50 = 0;
const node35path50 = 0;
const node36path50 = 0;
const node37path50 = 0;
const node38path50 = 0;
const node39path50 = 0;
const node40path50 = 0;
const node41path50 = 0;
const node42path50 = 0;
const node43path50 = 0;
const node44path50 = 0;
const node45path50 = 0;
const node46path50 = 0;
const node47path50 = 0;
const node48path50 = 0;
const node49path50 = 0;
const node50path50 = 0;
const node51path50 = 0;
const node52path50 = 0;
const node53path50 = 0;
const node55path50 = 0;
const node56path50 = 0;
const node60path50 = 0;
const node51path51 = 20;
const node58path51 = 51;
const node57path51 = 58;
const node56path51 = 57;
const node28path51 = 56;
const node1path51 = 0;
const node2path51 = 0;
const node3path51 = 0;
const node4path51 = 0;
const node5path51 = 0;
const node6path51 = 0;
const node7path51 = 0;
const node8path51 = 0;
const node9path51 = 0;
const node10path51 = 0;
const node11path51 = 0;
const node12path51 = 0;
const node13path51 = 0;
const node14path51 = 0;
const node15path51 = 0;
const node16path51 = 0;
const node17path51 = 0;
const node18path51 = 0;
const node19path51 = 0;
const node20path51 = 0;
const node21path51 = 0;
const node22path51 = 0;
const node23path51 = 0;
const node24path51 = 0;
const node25path51 = 0;
const node26path51 = 0;
const node27path51 = 0;
const node29path51 = 0;
const node30path51 = 0;
const node31path51 = 0;
const node32path51 = 0;
const node33path51 = 0;
const node34path51 = 0;
const node35path51 = 0;
const node36path51 = 0;
const node37path51 = 0;
const node38path51 = 0;
const node39path51 = 0;
const node40path51 = 0;
const node41path51 = 0;
const node42path51 = 0;
const node43path51 = 0;
const node44path51 = 0;
const node45path51 = 0;
const node46path51 = 0;
const node47path51 = 0;
const node48path51 = 0;
const node49path51 = 0;
const node50path51 = 0;
const node52path51 = 0;
const node53path51 = 0;
const node54path51 = 0;
const node55path51 = 0;
const node59path51 = 0;
const node60path51 = 0;
const node60path52 = 29;
const node58path52 = 60;
const node52path52 = 58;
const node56path52 = 52;
const node55path52 = 56;
const node57path52 = 55;
const node9path52 = 57;
const node1path52 = 0;
const node2path52 = 0;
const node3path52 = 0;
const node4path52 = 0;
const node5path52 = 0;
const node6path52 = 0;
const node7path52 = 0;
const node8path52 = 0;
const node10path52 = 0;
const node11path52 = 0;
const node12path52 = 0;
const node13path52 = 0;
const node14path52 = 0;
const node15path52 = 0;
const node16path52 = 0;
const node17path52 = 0;
const node18path52 = 0;
const node19path52 = 0;
const node20path52 = 0;
const node21path52 = 0;
const node22path52 = 0;
const node23path52 = 0;
const node24path52 = 0;
const node25path52 = 0;
const node26path52 = 0;
const node27path52 = 0;
const node28path52 = 0;
const node29path52 = 0;
const node30path52 = 0;
const node31path52 = 0;
const node32path52 = 0;
const node33path52 = 0;
const node34path52 = 0;
const node35path52 = 0;
const node36path52 = 0;
const node37path52 = 0;
const node38path52 = 0;
const node39path52 = 0;
const node40path52 = 0;
const node41path52 = 0;
const node42path52 = 0;
const node43path52 = 0;
const node44path52 = 0;
const node45path52 = 0;
const node46path52 = 0;
const node47path52 = 0;
const node48path52 = 0;
const node49path52 = 0;
const node50path52 = 0;
const node51path52 = 0;
const node53path52 = 0;
const node54path52 = 0;
const node59path52 = 0;
const node55path53 = 34;
const node58path53 = 55;
const node56path53 = 58;
const node52path53 = 56;
const node32path53 = 52;
const node1path53 = 0;
const node2path53 = 0;
const node3path53 = 0;
const node4path53 = 0;
const node5path53 = 0;
const node6path53 = 0;
const node7path53 = 0;
const node8path53 = 0;
const node9path53 = 0;
const node10path53 = 0;
const node11path53 = 0;
const node12path53 = 0;
const node13path53 = 0;
const node14path53 = 0;
const node15path53 = 0;
const node16path53 = 0;
const node17path53 = 0;
const node18path53 = 0;
const node19path53 = 0;
const node20path53 = 0;
const node21path53 = 0;
const node22path53 = 0;
const node23path53 = 0;
const node24path53 = 0;
const node25path53 = 0;
const node26path53 = 0;
const node27path53 = 0;
const node28path53 = 0;
const node29path53 = 0;
const node30path53 = 0;
const node31path53 = 0;
const node33path53 = 0;
const node34path53 = 0;
const node35path53 = 0;
const node36path53 = 0;
const node37path53 = 0;
const node38path53 = 0;
const node39path53 = 0;
const node40path53 = 0;
const node41path53 = 0;
const node42path53 = 0;
const node43path53 = 0;
const node44path53 = 0;
const node45path53 = 0;
const node46path53 = 0;
const node47path53 = 0;
const node48path53 = 0;
const node49path53 = 0;
const node50path53 = 0;
const node51path53 = 0;
const node53path53 = 0;
const node54path53 = 0;
const node57path53 = 0;
const node59path53 = 0;
const node60path53 = 0;
const node55path54 = 12;
const node52path54 = 55;
const node60path54 = 52;
const node51path54 = 60;
const node57path54 = 51;
const node59path54 = 57;
const node41path54 = 59;
const node1path54 = 0;
const node2path54 = 0;
const node3path54 = 0;
const node4path54 = 0;
const node5path54 = 0;
const node6path54 = 0;
const node7path54 = 0;
const node8path54 = 0;
const node9path54 = 0;
const node10path54 = 0;
const node11path54 = 0;
const node12path54 = 0;
const node13path54 = 0;
const node14path54 = 0;
const node15path54 = 0;
const node16path54 = 0;
const node17path54 = 0;
const node18path54 = 0;
const node19path54 = 0;
const node20path54 = 0;
const node21path54 = 0;
const node22path54 = 0;
const node23path54 = 0;
const node24path54 = 0;
const node25path54 = 0;
const node26path54 = 0;
const node27path54 = 0;
const node28path54 = 0;
const node29path54 = 0;
const node30path54 = 0;
const node31path54 = 0;
const node32path54 = 0;
const node33path54 = 0;
const node34path54 = 0;
const node35path54 = 0;
const node36path54 = 0;
const node37path54 = 0;
const node38path54 = 0;
const node39path54 = 0;
const node40path54 = 0;
const node42path54 = 0;
const node43path54 = 0;
const node44path54 = 0;
const node45path54 = 0;
const node46path54 = 0;
const node47path54 = 0;
const node48path54 = 0;
const node49path54 = 0;
const node50path54 = 0;
const node53path54 = 0;
const node54path54 = 0;
const node56path54 = 0;
const node58path54 = 0;
const node53path55 = 48;
const node54path55 = 53;
const node55path55 = 54;
const node56path55 = 55;
const node59path55 = 56;
const node46path55 = 59;
const node1path55 = 0;
const node2path55 = 0;
const node3path55 = 0;
const node4path55 = 0;
const node5path55 = 0;
const node6path55 = 0;
const node7path55 = 0;
const node8path55 = 0;
const node9path55 = 0;
const node10path55 = 0;
const node11path55 = 0;
const node12path55 = 0;
const node13path55 = 0;
const node14path55 = 0;
const node15path55 = 0;
const node16path55 = 0;
const node17path55 = 0;
const node18path55 = 0;
const node19path55 = 0;
const node20path55 = 0;
const node21path55 = 0;
const node22path55 = 0;
const node23path55 = 0;
const node24path55 = 0;
const node25path55 = 0;
const node26path55 = 0;
const node27path55 = 0;
const node28path55 = 0;
const node29path55 = 0;
const node30path55 = 0;
const node31path55 = 0;
const node32path55 = 0;
const node33path55 = 0;
const node34path55 = 0;
const node35path55 = 0;
const node36path55 = 0;
const node37path55 = 0;
const node38path55 = 0;
const node39path55 = 0;
const node40path55 = 0;
const node41path55 = 0;
const node42path55 = 0;
const node43path55 = 0;
const node44path55 = 0;
const node45path55 = 0;
const node47path55 = 0;
const node48path55 = 0;
const node49path55 = 0;
const node50path55 = 0;
const node51path55 = 0;
const node52path55 = 0;
const node57path55 = 0;
const node58path55 = 0;
const node60path55 = 0;
const node55path56 = 7;
const node53path56 = 55;
const node59path56 = 53;
const node60path56 = 59;
const node2path56 = 60;
const node1path56 = 0;
const node3path56 = 0;
const node4path56 = 0;
const node5path56 = 0;
const node6path56 = 0;
const node7path56 = 0;
const node8path56 = 0;
const node9path56 = 0;
const node10path56 = 0;
const node11path56 = 0;
const node12path56 = 0;
const node13path56 = 0;
const node14path56 = 0;
const node15path56 = 0;
const node16path56 = 0;
const node17path56 = 0;
const node18path56 = 0;
const node19path56 = 0;
const node20path56 = 0;
const node21path56 = 0;
const node22path56 = 0;
const node23path56 = 0;
const node24path56 = 0;
const node25path56 = 0;
const node26path56 = 0;
const node27path56 = 0;
const node28path56 = 0;
const node29path56 = 0;
const node30path56 = 0;
const node31path56 = 0;
const node32path56 = 0;
const node33path56 = 0;
const node34path56 = 0;
const node35path56 = 0;
const node36path56 = 0;
const node37path56 = 0;
const node38path56 = 0;
const node39path56 = 0;
const node40path56 = 0;
const node41path56 = 0;
const node42path56 = 0;
const node43path56 = 0;
const node44path56 = 0;
const node45path56 = 0;
const node46path56 = 0;
const node47path56 = 0;
const node48path56 = 0;
const node49path56 = 0;
const node50path56 = 0;
const node51path56 = 0;
const node52path56 = 0;
const node54path56 = 0;
const node56path56 = 0;
const node57path56 = 0;
const node58path56 = 0;
const node58path57 = 18;
const node51path57 = 58;
const node54path57 = 51;
const node57path57 = 54;
const node52path57 = 57;
const node60path57 = 52;
const node4path57 = 60;
const node1path57 = 0;
const node2path57 = 0;
const node3path57 = 0;
const node5path57 = 0;
const node6path57 = 0;
const node7path57 = 0;
const node8path57 = 0;
const node9path57 = 0;
const node10path57 = 0;
const node11path57 = 0;
const node12path57 = 0;
const node13path57 = 0;
const node14path57 = 0;
const node15path57 = 0;
const node16path57 = 0;
const node17path57 = 0;
const node18path57 = 0;
const node19path57 = 0;
const node20path57 = 0;
const node21path57 = 0;
const node22path57 = 0;
const node23path57 = 0;
const node24path57 = 0;
const node25path57 = 0;
const node26path57 = 0;
const node27path57 = 0;
const node28path57 = 0;
const node29path57 = 0;
const node30path57 = 0;
const node31path57 = 0;
const node32path57 = 0;
const node33path57 = 0;
const node34path57 = 0;
const node35path57 = 0;
const node36path57 = 0;
const node37path57 = 0;
const node38path57 = 0;
const node39path57 = 0;
const node40path57 = 0;
const node41path57 = 0;
const node42path57 = 0;
const node43path57 = 0;
const node44path57 = 0;
const node45path57 = 0;
const node46path57 = 0;
const node47path57 = 0;
const node48path57 = 0;
const node49path57 = 0;
const node50path57 = 0;
const node53path57 = 0;
const node55path57 = 0;
const node56path57 = 0;
const node59path57 = 0;
const node57path58 = 26;
const node56path58 = 57;
const node59path58 = 56;
const node53path58 = 59;
const node58path58 = 53;
const node54path58 = 58;
const node20path58 = 54;
const node1path58 = 0;
const node2path58 = 0;
const node3path58 = 0;
const node4path58 = 0;
const node5path58 = 0;
const node6path58 = 0;
const node7path58 = 0;
const node8path58 = 0;
const node9path58 = 0;
const node10path58 = 0;
const node11path58 = 0;
const node12path58 = 0;
const node13path58 = 0;
const node14path58 = 0;
const node15path58 = 0;
const node16path58 = 0;
const node17path58 = 0;
const node18path58 = 0;
const node19path58 = 0;
const node21path58 = 0;
const node22path58 = 0;
const node23path58 = 0;
const node24path58 = 0;
const node25path58 = 0;
const node26path58 = 0;
const node27path58 = 0;
const node28path58 = 0;
const node29path58 = 0;
const node30path58 = 0;
const node31path58 = 0;
const node32path58 = 0;
const node33path58 = 0;
const node34path58 = 0;
const node35path58 = 0;
const node36path58 = 0;
const node37path58 = 0;
const node38path58 = 0;
const node39path58 = 0;
const node40path58 = 0;
const node41path58 = 0;
const node42path58 = 0;
const node43path58 = 0;
const node44path58 = 0;
const node45path58 = 0;
const node46path58 = 0;
const node47path58 = 0;
const node48path58 = 0;
const node49path58 = 0;
const node50path58 = 0;
const node51path58 = 0;
const node52path58 = 0;
const node55path58 = 0;
const node60path58 = 0;
const node56path59 = 42;
const node59path59 = 56;
const node55path59 = 59;
const node52path59 = 55;
const node7path59 = 52;
const node1path59 = 0;
const node2path59 = 0;
const node3path59 = 0;
const node4path59 = 0;
const node5path59 = 0;
const node6path59 = 0;
const node8path59 = 0;
const node9path59 = 0;
const node10path59 = 0;
const node11path59 = 0;
const node12path59 = 0;
const node13path59 = 0;
const node14path59 = 0;
const node15path59 = 0;
const node16path59 = 0;
const node17path59 = 0;
const node18path59 = 0;
const node19path59 = 0;
const node20path59 = 0;
const node21path59 = 0;
const node22path59 = 0;
const node23path59 = 0;
const node24path59 = 0;
const node25path59 = 0;
const node26path59 = 0;
const node27path59 = 0;
const node28path59 = 0;
const node29path59 = 0;
const node30path59 = 0;
const node31path59 = 0;
const node32path59 = 0;
const node33path59 = 0;
const node34path59 = 0;
const node35path59 = 0;
const node36path59 = 0;
const node37path59 = 0;
const node38path59 = 0;
const node39path59 = 0;
const node40path59 = 0;
const node41path59 = 0;
const node42path59 = 0;
const node43path59 = 0;
const node44path59 = 0;
const node45path59 = 0;
const node46path59 = 0;
const node47path59 = 0;
const node48path59 = 0;
const node49path59 = 0;
const node50path59 = 0;
const node51path59 = 0;
const node53path59 = 0;
const node54path59 = 0;
const node57path59 = 0;
const node58path59 = 0;
const node60path59 = 0;
const node58path60 = 11;
const node54path60 = 58;
const node57path60 = 54;
const node51path60 = 57;
const node56path60 = 51;
const node37path60 = 56;
const node1path60 = 0;
const node2path60 = 0;
const node3path60 = 0;
const node4path60 = 0;
const node5path60 = 0;
const node6path60 = 0;
const node7path60 = 0;
const node8path60 = 0;
const node9path60 = 0;
const node10path60 = 0;
const node11path60 = 0;
const node12path60 = 0;
const node13path60 = 0;
const node14path60 = 0;
const node15path60 = 0;
const node16path60 = 0;
const node17path60 = 0;
const node18path60 = 0;
const node19path60 = 0;
const node20path60 = 0;
const node21path60 = 0;
const node22path60 = 0;
const node23path60 = 0;
const node24path60 = 0;
const node25path60 = 0;
const node26path60 = 0;
const node27path60 = 0;
const node28path60 = 0;
const node29path60 = 0;
const node30path60 = 0;
const node31path60 = 0;
const node32path60 = 0;
const node33path60 = 0;
const node34path60 = 0;
const node35path60 = 0;
const node36path60 = 0;
const node38path60 = 0;
const node39path60 = 0;
const node40path60 = 0;
const node41path60 = 0;
const node42path60 = 0;
const node43path60 = 0;
const node44path60 = 0;
const node45path60 = 0;
const node46path60 = 0;
const node47path60 = 0;
const node48path60 = 0;
const node49path60 = 0;
const node50path60 = 0;
const node52path60 = 0;
const node53path60 = 0;
const node55path60 = 0;
const node59path60 = 0;
const node60path60 = 0;
const node57path61 = 5;
const node52path61 = 57;
const node60path61 = 52;
const node54path61 = 60;
const node21path61 = 54;
const node1path61 = 0;
const node2path61 = 0;
const node3path61 = 0;
const node4path61 = 0;
const node5path61 = 0;
const node6path61 = 0;
const node7path61 = 0;
const node8path61 = 0;
const node9path61 = 0;
const node10path61 = 0;
const node11path61 = 0;
const node12path61 = 0;
const node13path61 = 0;
const node14path61 = 0;
const node15path61 = 0;
const node16path61 = 0;
const node17path61 = 0;
const node18path61 = 0;
const node19path61 = 0;
const node20path61 = 0;
const node22path61 = 0;
const node23path61 = 0;
const node24path61 = 0;
const node25path61 = 0;
const node26path61 = 0;
const node27path61 = 0;
const node28path61 = 0;
const node29path61 = 0;
const node30path61 = 0;
const node31path61 = 0;
const node32path61 = 0;
const node33path61 = 0;
const node34path61 = 0;
const node35path61 = 0;
const node36path61 = 0;
const node37path61 = 0;
const node38path61 = 0;
const node39path61 = 0;
const node40path61 = 0;
const node41path61 = 0;
const node42path61 = 0;
const node43path61 = 0;
const node44path61 = 0;
const node45path61 = 0;
const node46path61 = 0;
const node47path61 = 0;
const node48path61 = 0;
const node49path61 = 0;
const node50path61 = 0;
const node51path61 = 0;
const node53path61 = 0;
const node55path61 = 0;
const node56path61 = 0;
const node58path61 = 0;
const node59path61 = 0;
const node60path62 = 16;
const node52path62 = 60;
const node58path62 = 52;
const node57path62 = 58;
const node19path62 = 57;
const node1path62 = 0;
const node2path62 = 0;
const node3path62 = 0;
const node4path62 = 0;
const node5path62 = 0;
const node6path62 = 0;
const node7path62 = 0;
const node8path62 = 0;
const node9path62 = 0;
const node10path62 = 0;
const node11path62 = 0;
const node12path62 = 0;
const node13path62 = 0;
const node14path62 = 0;
const node15path62 = 0;
const node16path62 = 0;
const node17path62 = 0;
const node18path62 = 0;
const node20path62 = 0;
const node21path62 = 0;
const node22path62 = 0;
const node23path62 = 0;
const node24path62 = 0;
const node25path62 = 0;
const node26path62 = 0;
const node27path62 = 0;
const node28path62 = 0;
const node29path62 = 0;
const node30path62 = 0;
const node31path62 = 0;
const node32path62 = 0;
const node33path62 = 0;
const node34path62 = 0;
const node35path62 = 0;
const node36path62 = 0;
const node37path62 = 0;
const node38path62 = 0;
const node39path62 = 0;
const node40path62 = 0;
const node41path62 = 0;
const node42path62 = 0;
const node43path62 = 0;
const node44path62 = 0;
const node45path62 = 0;
const node46path62 = 0;
const node47path62 = 0;
const node48path62 = 0;
const node49path62 = 0;
const node50path62 = 0;
const node51path62 = 0;
const node53path62 = 0;
const node54path62 = 0;
const node55path62 = 0;
const node56path62 = 0;
const node59path62 = 0;
const node57path63 = 20;
const node59path63 = 57;
const node54path63 = 59;
const node58path63 = 54;
const node14path63 = 58;
const node1path63 = 0;
const node2path63 = 0;
const node3path63 = 0;
const node4path63 = 0;
const node5path63 = 0;
const node6path63 = 0;
const node7path63 = 0;
const node8path63 = 0;
const node9path63 = 0;
const node10path63 = 0;
const node11path63 = 0;
const node12path63 = 0;
const node13path63 = 0;
const node15path63 = 0;
const node16path63 = 0;
const node17path63 = 0;
const node18path63 = 0;
const node19path63 = 0;
const node20path63 = 0;
const node21path63 = 0;
const node22path63 = 0;
const node23path63 = 0;
const node24path63 = 0;
const node25path63 = 0;
const node26path63 = 0;
const node27path63 = 0;
const node28path63 = 0;
const node29path63 = 0;
const node30path63 = 0;
const node31path63 = 0;
const node32path63 = 0;
const node33path63 = 0;
const node34path63 = 0;
const node35path63 = 0;
const node36path63 = 0;
const node37path63 = 0;
const node38path63 = 0;
const node39path63 = 0;
const node40path63 = 0;
const node41path63 = 0;
const node42path63 = 0;
const node43path63 = 0;
const node44path63 = 0;
const node45path63 = 0;
const node46path63 = 0;
const node47path63 = 0;
const node48path63 = 0;
const node49path63 = 0;
const node50path63 = 0;
const node51path63 = 0;
const node52path63 = 0;
const node53path63 = 0;
const node55path63 = 0;
const node56path63 = 0;
const node60path63 = 0;
const node60path64 = 36;
const node54path64 = 60;
const node53path64 = 54;
const node59path64 = 53;
const node57path64 = 59;
const node21path64 = 57;
const node1path64 = 0;
const node2path64 = 0;
const node3path64 = 0;
const node4path64 = 0;
const node5path64 = 0;
const node6path64 = 0;
const node7path64 = 0;
const node8path64 = 0;
const node9path64 = 0;
const node10path64 = 0;
const node11path64 = 0;
const node12path64 = 0;
const node13path64 = 0;
const node14path64 = 0;
const node15path64 = 0;
const node16path64 = 0;
const node17path64 = 0;
const node18path64 = 0;
const node19path64 = 0;
const node20path64 = 0;
const node22path64 = 0;
const node23path64 = 0;
const node24path64 = 0;
const node25path64 = 0;
const node26path64 = 0;
const node27path64 = 0;
const node28path64 = 0;
const node29path64 = 0;
const node30path64 = 0;
const node31path64 = 0;
const node32path64 = 0;
const node33path64 = 0;
const node34path64 = 0;
const node35path64 = 0;
const node36path64 = 0;
const node37path64 = 0;
const node38path64 = 0;
const node39path64 = 0;
const node40path64 = 0;
const node41path64 = 0;
const node42path64 = 0;
const node43path64 = 0;
const node44path64 = 0;
const node45path64 = 0;
const node46path64 = 0;
const node47path64 = 0;
const node48path64 = 0;
const node49path64 = 0;
const node50path64 = 0;
const node51path64 = 0;
const node52path64 = 0;
const node55path64 = 0;
const node56path64 = 0;
const node58path64 = 0;
const node56path65 = 1;
const node51path65 = 56;
const node53path65 = 51;
const node55path65 = 53;
const node19path65 = 55;
const node1path65 = 0;
const node2path65 = 0;
const node3path65 = 0;
const node4path65 = 0;
const node5path65 = 0;
const node6path65 = 0;
const node7path65 = 0;
const node8path65 = 0;
const node9path65 = 0;
const node10path65 = 0;
const node11path65 = 0;
const node12path65 = 0;
const node13path65 = 0;
const node14path65 = 0;
const node15path65 = 0;
const node16path65 = 0;
const node17path65 = 0;
const node18path65 = 0;
const node20path65 = 0;
const node21path65 = 0;
const node22path65 = 0;
const node23path65 = 0;
const node24path65 = 0;
const node25path65 = 0;
const node26path65 = 0;
const node27path65 = 0;
const node28path65 = 0;
const node29path65 = 0;
const node30path65 = 0;
const node31path65 = 0;
const node32path65 = 0;
const node33path65 = 0;
const node34path65 = 0;
const node35path65 = 0;
const node36path65 = 0;
const node37path65 = 0;
const node38path65 = 0;
const node39path65 = 0;
const node40path65 = 0;
const node41path65 = 0;
const node42path65 = 0;
const node43path65 = 0;
const node44path65 = 0;
const node45path65 = 0;
const node46path65 = 0;
const node47path65 = 0;
const node48path65 = 0;
const node49path65 = 0;
const node50path65 = 0;
const node52path65 = 0;
const node54path65 = 0;
const node57path65 = 0;
const node58path65 = 0;
const node59path65 = 0;
const node60path65 = 0;
const node51path66 = 3;
const node54path66 = 51;
const node57path66 = 54;
const node53path66 = 57;
const node59path66 = 53;
const node56path66 = 59;
const node17path66 = 56;
const node1path66 = 0;
const node2path66 = 0;
const node3path66 = 0;
const node4path66 = 0;
const node5path66 = 0;
const node6path66 = 0;
const node7path66 = 0;
const node8path66 = 0;
const node9path66 = 0;
const node10path66 = 0;
const node11path66 = 0;
const node12path66 = 0;
const node13path66 = 0;
const node14path66 = 0;
const node15path66 = 0;
const node16path66 = 0;
const node18path66 = 0;
const node19path66 = 0;
const node20path66 = 0;
const node21path66 = 0;
const node22path66 = 0;
const node23path66 = 0;
const node24path66 = 0;
const node25path66 = 0;
const node26path66 = 0;
const node27path66 = 0;
const node28path66 = 0;
const node29path66 = 0;
const node30path66 = 0;
const node31path66 = 0;
const node32path66 = 0;
const node33path66 = 0;
const node34path66 = 0;
const node35path66 = 0;
const node36path66 = 0;
const node37path66 = 0;
const node38path66 = 0;
const node39path66 = 0;
const node40path66 = 0;
const node41path66 = 0;
const node42path66 = 0;
const node43path66 = 0;
const node44path66 = 0;
const node45path66 = 0;
const node46path66 = 0;
const node47path66 = 0;
const node48path66 = 0;
const node49path66 = 0;
const node50path66 = 0;
const node52path66 = 0;
const node55path66 = 0;
const node58path66 = 0;
const node60path66 = 0;
const node56path67 = 9;
const node52path67 = 56;
const node60path67 = 52;
const node58path67 = 60;
const node51path67 = 58;
const node27path67 = 51;
const node1path67 = 0;
const node2path67 = 0;
const node3path67 = 0;
const node4path67 = 0;
const node5path67 = 0;
const node6path67 = 0;
const node7path67 = 0;
const node8path67 = 0;
const node9path67 = 0;
const node10path67 = 0;
const node11path67 = 0;
const node12path67 = 0;
const node13path67 = 0;
const node14path67 = 0;
const node15path67 = 0;
const node16path67 = 0;
const node17path67 = 0;
const node18path67 = 0;
const node19path67 = 0;
const node20path67 = 0;
const node21path67 = 0;
const node22path67 = 0;
const node23path67 = 0;
const node24path67 = 0;
const node25path67 = 0;
const node26path67 = 0;
const node28path67 = 0;
const node29path67 = 0;
const node30path67 = 0;
const node31path67 = 0;
const node32path67 = 0;
const node33path67 = 0;
const node34path67 = 0;
const node35path67 = 0;
const node36path67 = 0;
const node37path67 = 0;
const node38path67 = 0;
const node39path67 = 0;
const node40path67 = 0;
const node41path67 = 0;
const node42path67 = 0;
const node43path67 = 0;
const node44path67 = 0;
const node45path67 = 0;
const node46path67 = 0;
const node47path67 = 0;
const node48path67 = 0;
const node49path67 = 0;
const node50path67 = 0;
const node53path67 = 0;
const node54path67 = 0;
const node55path67 = 0;
const node57path67 = 0;
const node59path67 = 0;
const node52path68 = 32;
const node56path68 = 52;
const node60path68 = 56;
const node57path68 = 60;
const node51path68 = 57;
const node25path68 = 51;
const node1path68 = 0;
const node2path68 = 0;
const node3path68 = 0;
const node4path68 = 0;
const node5path68 = 0;
const node6path68 = 0;
const node7path68 = 0;
const node8path68 = 0;
const node9path68 = 0;
const node10path68 = 0;
const node11path68 = 0;
const node12path68 = 0;
const node13path68 = 0;
const node14path68 = 0;
const node15path68 = 0;
const node16path68 = 0;
const node17path68 = 0;
const node18path68 = 0;
const node19path68 = 0;
const node20path68 = 0;
const node21path68 = 0;
const node22path68 = 0;
const node23path68 = 0;
const node24path68 = 0;
const node26path68 = 0;
const node27path68 = 0;
const node28path68 = 0;
const node29path68 = 0;
const node30path68 = 0;
const node31path68 = 0;
const node32path68 = 0;
const node33path68 = 0;
const node34path68 = 0;
const node35path68 = 0;
const node36path68 = 0;
const node37path68 = 0;
const node38path68 = 0;
const node39path68 = 0;
const node40path68 = 0;
const node41path68 = 0;
const node42path68 = 0;
const node43path68 = 0;
const node44path68 = 0;
const node45path68 = 0;
const node46path68 = 0;
const node47path68 = 0;
const node48path68 = 0;
const node49path68 = 0;
const node50path68 = 0;
const node53path68 = 0;
const node54path68 = 0;
const node55path68 = 0;
const node58path68 = 0;
const node59path68 = 0;
const node55path69 = 22;
const node57path69 = 55;
const node59path69 = 57;
const node54path69 = 59;
const node56path69 = 54;
const node51path69 = 56;
const node18path69 = 51;
const node1path69 = 0;
const node2path69 = 0;
const node3path69 = 0;
const node4path69 = 0;
const node5path69 = 0;
const node6path69 = 0;
const node7path69 = 0;
const node8path69 = 0;
const node9path69 = 0;
const node10path69 = 0;
const node11path69 = 0;
const node12path69 = 0;
const node13path69 = 0;
const node14path69 = 0;
const node15path69 = 0;
const node16path69 = 0;
const node17path69 = 0;
const node19path69 = 0;
const node20path69 = 0;
const node21path69 = 0;
const node22path69 = 0;
const node23path69 = 0;
const node24path69 = 0;
const node25path69 = 0;
const node26path69 = 0;
const node27path69 = 0;
const node28path69 = 0;
const node29path69 = 0;
const node30path69 = 0;
const node31path69 = 0;
const node32path69 = 0;
const node33path69 = 0;
const node34path69 = 0;
const node35path69 = 0;
const node36path69 = 0;
const node37path69 = 0;
const node38path69 = 0;
const node39path69 = 0;
const node40path69 = 0;
const node41path69 = 0;
const node42path69 = 0;
const node43path69 = 0;
const node44path69 = 0;
const node45path69 = 0;
const node46path69 = 0;
const node47path69 = 0;
const node48path69 = 0;
const node49path69 = 0;
const node50path69 = 0;
const node52path69 = 0;
const node53path69 = 0;
const node58path69 = 0;
const node60path69 = 0;
const node58path70 = 33;
const node59path70 = 58;
const node60path70 = 59;
const node55path70 = 60;
const node26path70 = 55;
const node1path70 = 0;
const node2path70 = 0;
const node3path70 = 0;
const node4path70 = 0;
const node5path70 = 0;
const node6path70 = 0;
const node7path70 = 0;
const node8path70 = 0;
const node9path70 = 0;
const node10path70 = 0;
const node11path70 = 0;
const node12path70 = 0;
const node13path70 = 0;
const node14path70 = 0;
const node15path70 = 0;
const node16path70 = 0;
const node17path70 = 0;
const node18path70 = 0;
const node19path70 = 0;
const node20path70 = 0;
const node21path70 = 0;
const node22path70 = 0;
const node23path70 = 0;
const node24path70 = 0;
const node25path70 = 0;
const node27path70 = 0;
const node28path70 = 0;
const node29path70 = 0;
const node30path70 = 0;
const node31path70 = 0;
const node32path70 = 0;
const node33path70 = 0;
const node34path70 = 0;
const node35path70 = 0;
const node36path70 = 0;
const node37path70 = 0;
const node38path70 = 0;
const node39path70 = 0;
const node40path70 = 0;
const node41path70 = 0;
const node42path70 = 0;
const node43path70 = 0;
const node44path70 = 0;
const node45path70 = 0;
const node46path70 = 0;
const node47path70 = 0;
const node48path70 = 0;
const node49path70 = 0;
const node50path70 = 0;
const node51path70 = 0;
const node52path70 = 0;
const node53path70 = 0;
const node54path70 = 0;
const node56path70 = 0;
const node57path70 = 0;
const node57path71 = 17;
const node52path71 = 57;
const node56path71 = 52;
const node60path71 = 56;
const node10path71 = 60;
const node1path71 = 0;
const node2path71 = 0;
const node3path71 = 0;
const node4path71 = 0;
const node5path71 = 0;
const node6path71 = 0;
const node7path71 = 0;
const node8path71 = 0;
const node9path71 = 0;
const node11path71 = 0;
const node12path71 = 0;
const node13path71 = 0;
const node14path71 = 0;
const node15path71 = 0;
const node16path71 = 0;
const node17path71 = 0;
const node18path71 = 0;
const node19path71 = 0;
const node20path71 = 0;
const node21path71 = 0;
const node22path71 = 0;
const node23path71 = 0;
const node24path71 = 0;
const node25path71 = 0;
const node26path71 = 0;
const node27path71 = 0;
const node28path71 = 0;
const node29path71 = 0;
const node30path71 = 0;
const node31path71 = 0;
const node32path71 = 0;
const node33path71 = 0;
const node34path71 = 0;
const node35path71 = 0;
const node36path71 = 0;
const node37path71 = 0;
const node38path71 = 0;
const node39path71 = 0;
const node40path71 = 0;
const node41path71 = 0;
const node42path71 = 0;
const node43path71 = 0;
const node44path71 = 0;
const node45path71 = 0;
const node46path71 = 0;
const node47path71 = 0;
const node48path71 = 0;
const node49path71 = 0;
const node50path71 = 0;
const node51path71 = 0;
const node53path71 = 0;
const node54path71 = 0;
const node55path71 = 0;
const node58path71 = 0;
const node59path71 = 0;
const node59path72 = 34;
const node54path72 = 59;
const node58path72 = 54;
const node55path72 = 58;
const node56path72 = 55;
const node46path72 = 56;
const node1path72 = 0;
const node2path72 = 0;
const node3path72 = 0;
const node4path72 = 0;
const node5path72 = 0;
const node6path72 = 0;
const node7path72 = 0;
const node8path72 = 0;
const node9path72 = 0;
const node10path72 = 0;
const node11path72 = 0;
const node12path72 = 0;
const node13path72 = 0;
const node14path72 = 0;
const node15path72 = 0;
const node16path72 = 0;
const node17path72 = 0;
const node18path72 = 0;
const node19path72 = 0;
const node20path72 = 0;
const node21path72 = 0;
const node22path72 = 0;
const node23path72 = 0;
const node24path72 = 0;
const node25path72 = 0;
const node26path72 = 0;
const node27path72 = 0;
const node28path72 = 0;
const node29path72 = 0;
const node30path72 = 0;
const node31path72 = 0;
const node32path72 = 0;
const node33path72 = 0;
const node34path72 = 0;
const node35path72 = 0;
const node36path72 = 0;
const node37path72 = 0;
const node38path72 = 0;
const node39path72 = 0;
const node40path72 = 0;
const node41path72 = 0;
const node42path72 = 0;
const node43path72 = 0;
const node44path72 = 0;
const node45path72 = 0;
const node47path72 = 0;
const node48path72 = 0;
const node49path72 = 0;
const node50path72 = 0;
const node51path72 = 0;
const node52path72 = 0;
const node53path72 = 0;
const node57path72 = 0;
const node60path72 = 0;
const node60path73 = 1;
const node51path73 = 60;
const node59path73 = 51;
const node57path73 = 59;
const node54path73 = 57;
const node40path73 = 54;
const node1path73 = 0;
const node2path73 = 0;
const node3path73 = 0;
const node4path73 = 0;
const node5path73 = 0;
const node6path73 = 0;
const node7path73 = 0;
const node8path73 = 0;
const node9path73 = 0;
const node10path73 = 0;
const node11path73 = 0;
const node12path73 = 0;
const node13path73 = 0;
const node14path73 = 0;
const node15path73 = 0;
const node16path73 = 0;
const node17path73 = 0;
const node18path73 = 0;
const node19path73 = 0;
const node20path73 = 0;
const node21path73 = 0;
const node22path73 = 0;
const node23path73 = 0;
const node24path73 = 0;
const node25path73 = 0;
const node26path73 = 0;
const node27path73 = 0;
const node28path73 = 0;
const node29path73 = 0;
const node30path73 = 0;
const node31path73 = 0;
const node32path73 = 0;
const node33path73 = 0;
const node34path73 = 0;
const node35path73 = 0;
const node36path73 = 0;
const node37path73 = 0;
const node38path73 = 0;
const node39path73 = 0;
const node41path73 = 0;
const node42path73 = 0;
const node43path73 = 0;
const node44path73 = 0;
const node45path73 = 0;
const node46path73 = 0;
const node47path73 = 0;
const node48path73 = 0;
const node49path73 = 0;
const node50path73 = 0;
const node52path73 = 0;
const node53path73 = 0;
const node55path73 = 0;
const node56path73 = 0;
const node58path73 = 0;
const node57path74 = 37;
const node51path74 = 57;
const node60path74 = 51;
const node58path74 = 60;
const node41path74 = 58;
const node1path74 = 0;
const node2path74 = 0;
const node3path74 = 0;
const node4path74 = 0;
const node5path74 = 0;
const node6path74 = 0;
const node7path74 = 0;
const node8path74 = 0;
const node9path74 = 0;
const node10path74 = 0;
const node11path74 = 0;
const node12path74 = 0;
const node13path74 = 0;
const node14path74 = 0;
const node15path74 = 0;
const node16path74 = 0;
const node17path74 = 0;
const node18path74 = 0;
const node19path74 = 0;
const node20path74 = 0;
const node21path74 = 0;
const node22path74 = 0;
const node23path74 = 0;
const node24path74 = 0;
const node25path74 = 0;
const node26path74 = 0;
const node27path74 = 0;
const node28path74 = 0;
const node29path74 = 0;
const node30path74 = 0;
const node31path74 = 0;
const node32path74 = 0;
const node33path74 = 0;
const node34path74 = 0;
const node35path74 = 0;
const node36path74 = 0;
const node37path74 = 0;
const node38path74 = 0;
const node39path74 = 0;
const node40path74 = 0;
const node42path74 = 0;
const node43path74 = 0;
const node44path74 = 0;
const node45path74 = 0;
const node46path74 = 0;
const node47path74 = 0;
const node48path74 = 0;
const node49path74 = 0;
const node50path74 = 0;
const node52path74 = 0;
const node53path74 = 0;
const node54path74 = 0;
const node55path74 = 0;
const node56path74 = 0;
const node59path74 = 0;
const node54path75 = 5;
const node57path75 = 54;
const node52path75 = 57;
const node55path75 = 52;
const node38path75 = 55;
const node1path75 = 0;
const node2path75 = 0;
const node3path75 = 0;
const node4path75 = 0;
const node5path75 = 0;
const node6path75 = 0;
const node7path75 = 0;
const node8path75 = 0;
const node9path75 = 0;
const node10path75 = 0;
const node11path75 = 0;
const node12path75 = 0;
const node13path75 = 0;
const node14path75 = 0;
const node15path75 = 0;
const node16path75 = 0;
const node17path75 = 0;
const node18path75 = 0;
const node19path75 = 0;
const node20path75 = 0;
const node21path75 = 0;
const node22path75 = 0;
const node23path75 = 0;
const node24path75 = 0;
const node25path75 = 0;
const node26path75 = 0;
const node27path75 = 0;
const node28path75 = 0;
const node29path75 = 0;
const node30path75 = 0;
const node31path75 = 0;
const node32path75 = 0;
const node33path75 = 0;
const node34path75 = 0;
const node35path75 = 0;
const node36path75 = 0;
const node37path75 = 0;
const node39path75 = 0;
const node40path75 = 0;
const node41path75 = 0;
const node42path75 = 0;
const node43path75 = 0;
const node44path75 = 0;
const node45path75 = 0;
const node46path75 = 0;
const node47path75 = 0;
const node48path75 = 0;
const node49path75 = 0;
const node50path75 = 0;
const node51path75 = 0;
const node53path75 = 0;
const node56path75 = 0;
const node58path75 = 0;
const node59path75 = 0;
const node60path75 = 0;
const node57path76 = 27;
const node56path76 = 57;
const node59path76 = 56;
const node55path76 = 59;
const node58path76 = 55;
const node52path76 = 58;
const node49path76 = 52;
const node1path76 = 0;
const node2path76 = 0;
const node3path76 = 0;
const node4path76 = 0;
const node5path76 = 0;
const node6path76 = 0;
const node7path76 = 0;
const node8path76 = 0;
const node9path76 = 0;
const node10path76 = 0;
const node11path76 = 0;
const node12path76 = 0;
const node13path76 = 0;
const node14path76 = 0;
const node15path76 = 0;
const node16path76 = 0;
const node17path76 = 0;
const node18path76 = 0;
const node19path76 = 0;
const node20path76 = 0;
const node21path76 = 0;
const node22path76 = 0;
const node23path76 = 0;
const node24path76 = 0;
const node25path76 = 0;
const node26path76 = 0;
const node27path76 = 0;
const node28path76 = 0;
const node29path76 = 0;
const node30path76 = 0;
const node31path76 = 0;
const node32path76 = 0;
const node33path76 = 0;
const node34path76 = 0;
const node35path76 = 0;
const node36path76 = 0;
const node37path76 = 0;
const node38path76 = 0;
const node39path76 = 0;
const node40path76 = 0;
const node41path76 = 0;
const node42path76 = 0;
const node43path76 = 0;
const node44path76 = 0;
const node45path76 = 0;
const node46path76 = 0;
const node47path76 = 0;
const node48path76 = 0;
const node50path76 = 0;
const node51path76 = 0;
const node53path76 = 0;
const node54path76 = 0;
const node60path76 = 0;
const node52path77 = 41;
const node54path77 = 52;
const node59path77 = 54;
const node56path77 = 59;
const node58path77 = 56;
const node57path77 = 58;
const node21path77 = 57;
const node1path77 = 0;
const node2path77 = 0;
const node3path77 = 0;
const node4path77 = 0;
const node5path77 = 0;
const node6path77 = 0;
const node7path77 = 0;
const node8path77 = 0;
const node9path77 = 0;
const node10path77 = 0;
const node11path77 = 0;
const node12path77 = 0;
const node13path77 = 0;
const node14path77 = 0;
const node15path77 = 0;
const node16path77 = 0;
const node17path77 = 0;
const node18path77 = 0;
const node19path77 = 0;
const node20path77 = 0;
const node22path77 = 0;
const node23path77 = 0;
const node24path77 = 0;
const node25path77 = 0;
const node26path77 = 0;
const node27path77 = 0;
const node28path77 = 0;
const node29path77 = 0;
const node30path77 = 0;
const node31path77 = 0;
const node32path77 = 0;
const node33path77 = 0;
const node34path77 = 0;
const node35path77 = 0;
const node36path77 = 0;
const node37path77 = 0;
const node38path77 = 0;
const node39path77 = 0;
const node40path77 = 0;
const node41path77 = 0;
const node42path77 = 0;
const node43path77 = 0;
const node44path77 = 0;
const node45path77 = 0;
const node46path77 = 0;
const node47path77 = 0;
const node48path77 = 0;
const node49path77 = 0;
const node50path77 = 0;
const node51path77 = 0;
const node53path77 = 0;
const node55path77 = 0;
const node60path77 = 0;
const node52path78 = 19;
const node58path78 = 52;
const node54path78 = 58;
const node55path78 = 54;
const node33path78 = 55;
const node1path78 = 0;
const node2path78 = 0;
const node3path78 = 0;
const node4path78 = 0;
const node5path78 = 0;
const node6path78 = 0;
const node7path78 = 0;
const node8path78 = 0;
const node9path78 = 0;
const node10path78 = 0;
const node11path78 = 0;
const node12path78 = 0;
const node13path78 = 0;
const node14path78 = 0;
const node15path78 = 0;
const node16path78 = 0;
const node17path78 = 0;
const node18path78 = 0;
const node19path78 = 0;
const node20path78 = 0;
const node21path78 = 0;
const node22path78 = 0;
const node23path78 = 0;
const node24path78 = 0;
const node25path78 = 0;
const node26path78 = 0;
const node27path78 = 0;
const node28path78 = 0;
const node29path78 = 0;
const node30path78 = 0;
const node31path78 = 0;
const node32path78 = 0;
const node34path78 = 0;
const node35path78 = 0;
const node36path78 = 0;
const node37path78 = 0;
const node38path78 = 0;
const node39path78 = 0;
const node40path78 = 0;
const node41path78 = 0;
const node42path78 = 0;
const node43path78 = 0;
const node44path78 = 0;
const node45path78 = 0;
const node46path78 = 0;
const node47path78 = 0;
const node48path78 = 0;
const node49path78 = 0;
const node50path78 = 0;
const node51path78 = 0;
const node53path78 = 0;
const node56path78 = 0;
const node57path78 = 0;
const node59path78 = 0;
const node60path78 = 0;
const node57path79 = 32;
const node52path79 = 57;
const node54path79 = 52;
const node51path79 = 54;
const node56path79 = 51;
const node53path79 = 56;
const node12path79 = 53;
const node1path79 = 0;
const node2path79 = 0;
const node3path79 = 0;
const node4path79 = 0;
const node5path79 = 0;
const node6path79 = 0;
const node7path79 = 0;
const node8path79 = 0;
const node9path79 = 0;
const node10path79 = 0;
const node11path79 = 0;
const node13path79 = 0;
const node14path79 = 0;
const node15path79 = 0;
const node16path79 = 0;
const node17path79 = 0;
const node18path79 = 0;
const node19path79 = 0;
const node20path79 = 0;
const node21path79 = 0;
const node22path79 = 0;
const node23path79 = 0;
const node24path79 = 0;
const node25path79 = 0;
const node26path79 = 0;
const node27path79 = 0;
const node28path79 = 0;
const node29path79 = 0;
const node30path79 = 0;
const node31path79 = 0;
const node32path79 = 0;
const node33path79 = 0;
const node34path79 = 0;
const node35path79 = 0;
const node36path79 = 0;
const node37path79 = 0;
const node38path79 = 0;
const node39path79 = 0;
const node40path79 = 0;
const node41path79 = 0;
const node42path79 = 0;
const node43path79 = 0;
const node44path79 = 0;
const node45path79 = 0;
const node46path79 = 0;
const node47path79 = 0;
const node48path79 = 0;
const node49path79 = 0;
const node50path79 = 0;
const node55path79 = 0;
const node58path79 = 0;
const node59path79 = 0;
const node60path79 = 0;
const node59path80 = 48;
const node58path80 = 59;
const node60path80 = 58;
const node54path80 = 60;
const node53path80 = 54;
const node23path80 = 53;
const node1path80 = 0;
const node2path80 = 0;
const node3path80 = 0;
const node4path80 = 0;
const node5path80 = 0;
const node6path80 = 0;
const node7path80 = 0;
const node8path80 = 0;
const node9path80 = 0;
const node10path80 = 0;
const node11path80 = 0;
const node12path80 = 0;
const node13path80 = 0;
const node14path80 = 0;
const node15path80 = 0;
const node16path80 = 0;
const node17path80 = 0;
const node18path80 = 0;
const node19path80 = 0;
const node20path80 = 0;
const node21path80 = 0;
const node22path80 = 0;
const node24path80 = 0;
const node25path80 = 0;
const node26path80 = 0;
const node27path80 = 0;
const node28path80 = 0;
const node29path80 = 0;
const node30path80 = 0;
const node31path80 = 0;
const node32path80 = 0;
const node33path80 = 0;
const node34path80 = 0;
const node35path80 = 0;
const node36path80 = 0;
const node37path80 = 0;
const node38path80 = 0;
const node39path80 = 0;
const node40path80 = 0;
const node41path80 = 0;
const node42path80 = 0;
const node43path80 = 0;
const node44path80 = 0;
const node45path80 = 0;
const node46path80 = 0;
const node47path80 = 0;
const node48path80 = 0;
const node49path80 = 0;
const node50path80 = 0;
const node51path80 = 0;
const node52path80 = 0;
const node55path80 = 0;
const node56path80 = 0;
const node57path80 = 0;
const node58path81 = 18;
const node53path81 = 58;
const node55path81 = 53;
const node57path81 = 55;
const node52path81 = 57;
const node51path81 = 52;
const node42path81 = 51;
const node1path81 = 0;
const node2path81 = 0;
const node3path81 = 0;
const node4path81 = 0;
const node5path81 = 0;
const node6path81 = 0;
const node7path81 = 0;
const node8path81 = 0;
const node9path81 = 0;
const node10path81 = 0;
const node11path81 = 0;
const node12path81 = 0;
const node13path81 = 0;
const node14path81 = 0;
const node15path81 = 0;
const node16path81 = 0;
const node17path81 = 0;
const node18path81 = 0;
const node19path81 = 0;
const node20path81 = 0;
const node21path81 = 0;
const node22path81 = 0;
const node23path81 = 0;
const node24path81 = 0;
const node25path81 = 0;
const node26path81 = 0;
const node27path81 = 0;
const node28path81 = 0;
const node29path81 = 0;
const node30path81 = 0;
const node31path81 = 0;
const node32path81 = 0;
const node33path81 = 0;
const node34path81 = 0;
const node35path81 = 0;
const node36path81 = 0;
const node37path81 = 0;
const node38path81 = 0;
const node39path81 = 0;
const node40path81 = 0;
const node41path81 = 0;
const node43path81 = 0;
const node44path81 = 0;
const node45path81 = 0;
const node46path81 = 0;
const node47path81 = 0;
const node48path81 = 0;
const node49path81 = 0;
const node50path81 = 0;
const node54path81 = 0;
const node56path81 = 0;
const node59path81 = 0;
const node60path81 = 0;
const node52path82 = 10;
const node59path82 = 52;
const node60path82 = 59;
const node55path82 = 60;
const node33path82 = 55;
const node1path82 = 0;
const node2path82 = 0;
const node3path82 = 0;
const node4path82 = 0;
const node5path82 = 0;
const node6path82 = 0;
const node7path82 = 0;
const node8path82 = 0;
const node9path82 = 0;
const node10path82 = 0;
const node11path82 = 0;
const node12path82 = 0;
const node13path82 = 0;
const node14path82 = 0;
const node15path82 = 0;
const node16path82 = 0;
const node17path82 = 0;
const node18path82 = 0;
const node19path82 = 0;
const node20path82 = 0;
const node21path82 = 0;
const node22path82 = 0;
const node23path82 = 0;
const node24path82 = 0;
const node25path82 = 0;
const node26path82 = 0;
const node27path82 = 0;
const node28path82 = 0;
const node29path82 = 0;
const node30path82 = 0;
const node31path82 = 0;
const node32path82 = 0;
const node34path82 = 0;
const node35path82 = 0;
const node36path82 = 0;
const node37path82 = 0;
const node38path82 = 0;
const node39path82 = 0;
const node40path82 = 0;
const node41path82 = 0;
const node42path82 = 0;
const node43path82 = 0;
const node44path82 = 0;
const node45path82 = 0;
const node46path82 = 0;
const node47path82 = 0;
const node48path82 = 0;
const node49path82 = 0;
const node50path82 = 0;
const node51path82 = 0;
const node53path82 = 0;
const node54path82 = 0;
const node56path82 = 0;
const node57path82 = 0;
const node58path82 = 0;
const node52path83 = 7;
const node60path83 = 52;
const node56path83 = 60;
const node55path83 = 56;
const node57path83 = 55;
const node23path83 = 57;
const node1path83 = 0;
const node2path83 = 0;
const node3path83 = 0;
const node4path83 = 0;
const node5path83 = 0;
const node6path83 = 0;
const node7path83 = 0;
const node8path83 = 0;
const node9path83 = 0;
const node10path83 = 0;
const node11path83 = 0;
const node12path83 = 0;
const node13path83 = 0;
const node14path83 = 0;
const node15path83 = 0;
const node16path83 = 0;
const node17path83 = 0;
const node18path83 = 0;
const node19path83 = 0;
const node20path83 = 0;
const node21path83 = 0;
const node22path83 = 0;
const node24path83 = 0;
const node25path83 = 0;
const node26path83 = 0;
const node27path83 = 0;
const node28path83 = 0;
const node29path83 = 0;
const node30path83 = 0;
const node31path83 = 0;
const node32path83 = 0;
const node33path83 = 0;
const node34path83 = 0;
const node35path83 = 0;
const node36path83 = 0;
const node37path83 = 0;
const node38path83 = 0;
const node39path83 = 0;
const node40path83 = 0;
const node41path83 = 0;
const node42path83 = 0;
const node43path83 = 0;
const node44path83 = 0;
const node45path83 = 0;
const node46path83 = 0;
const node47path83 = 0;
const node48path83 = 0;
const node49path83 = 0;
const node50path83 = 0;
const node51path83 = 0;
const node53path83 = 0;
const node54path83 = 0;
const node58path83 = 0;
const node59path83 = 0;
const node56path84 = 34;
const node57path84 = 56;
const node52path84 = 57;
const node51path84 = 52;
const node53path84 = 51;
const node60path84 = 53;
const node46path84 = 60;
const node1path84 = 0;
const node2path84 = 0;
const node3path84 = 0;
const node4path84 = 0;
const node5path84 = 0;
const node6path84 = 0;
const node7path84 = 0;
const node8path84 = 0;
const node9path84 = 0;
const node10path84 = 0;
const node11path84 = 0;
const node12path84 = 0;
const node13path84 = 0;
const node14path84 = 0;
const node15path84 = 0;
const node16path84 = 0;
const node17path84 = 0;
const node18path84 = 0;
const node19path84 = 0;
const node20path84 = 0;
const node21path84 = 0;
const node22path84 = 0;
const node23path84 = 0;
const node24path84 = 0;
const node25path84 = 0;
const node26path84 = 0;
const node27path84 = 0;
const node28path84 = 0;
const node29path84 = 0;
const node30path84 = 0;
const node31path84 = 0;
const node32path84 = 0;
const node33path84 = 0;
const node34path84 = 0;
const node35path84 = 0;
const node36path84 = 0;
const node37path84 = 0;
const node38path84 = 0;
const node39path84 = 0;
const node40path84 = 0;
const node41path84 = 0;
const node42path84 = 0;
const node43path84 = 0;
const node44path84 = 0;
const node45path84 = 0;
const node47path84 = 0;
const node48path84 = 0;
const node49path84 = 0;
const node50path84 = 0;
const node54path84 = 0;
const node55path84 = 0;
const node58path84 = 0;
const node59path84 = 0;
const node53path85 = 36;
const node59path85 = 53;
const node54path85 = 59;
const node58path85 = 54;
const node51path85 = 58;
const node42path85 = 51;
const node1path85 = 0;
const node2path85 = 0;
const node3path85 = 0;
const node4path85 = 0;
const node5path85 = 0;
const node6path85 = 0;
const node7path85 = 0;
const node8path85 = 0;
const node9path85 = 0;
const node10path85 = 0;
const node11path85 = 0;
const node12path85 = 0;
const node13path85 = 0;
const node14path85 = 0;
const node15path85 = 0;
const node16path85 = 0;
const node17path85 = 0;
const node18path85 = 0;
const node19path85 = 0;
const node20path85 = 0;
const node21path85 = 0;
const node22path85 = 0;
const node23path85 = 0;
const node24path85 = 0;
const node25path85 = 0;
const node26path85 = 0;
const node27path85 = 0;
const node28path85 = 0;
const node29path85 = 0;
const node30path85 = 0;
const node31path85 = 0;
const node32path85 = 0;
const node33path85 = 0;
const node34path85 = 0;
const node35path85 = 0;
const node36path85 = 0;
const node37path85 = 0;
const node38path85 = 0;
const node39path85 = 0;
const node40path85 = 0;
const node41path85 = 0;
const node43path85 = 0;
const node44path85 = 0;
const node45path85 = 0;
const node46path85 = 0;
const node47path85 = 0;
const node48path85 = 0;
const node49path85 = 0;
const node50path85 = 0;
const node52path85 = 0;
const node55path85 = 0;
const node56path85 = 0;
const node57path85 = 0;
const node60path85 = 0;
const node60path86 = 45;
const node51path86 = 60;
const node54path86 = 51;
const node53path86 = 54;
const node52path86 = 53;
const node30path86 = 52;
const node1path86 = 0;
const node2path86 = 0;
const node3path86 = 0;
const node4path86 = 0;
const node5path86 = 0;
const node6path86 = 0;
const node7path86 = 0;
const node8path86 = 0;
const node9path86 = 0;
const node10path86 = 0;
const node11path86 = 0;
const node12path86 = 0;
const node13path86 = 0;
const node14path86 = 0;
const node15path86 = 0;
const node16path86 = 0;
const node17path86 = 0;
const node18path86 = 0;
const node19path86 = 0;
const node20path86 = 0;
const node21path86 = 0;
const node22path86 = 0;
const node23path86 = 0;
const node24path86 = 0;
const node25path86 = 0;
const node26path86 = 0;
const node27path86 = 0;
const node28path86 = 0;
const node29path86 = 0;
const node31path86 = 0;
const node32path86 = 0;
const node33path86 = 0;
const node34path86 = 0;
const node35path86 = 0;
const node36path86 = 0;
const node37path86 = 0;
const node38path86 = 0;
const node39path86 = 0;
const node40path86 = 0;
const node41path86 = 0;
const node42path86 = 0;
const node43path86 = 0;
const node44path86 = 0;
const node45path86 = 0;
const node46path86 = 0;
const node47path86 = 0;
const node48path86 = 0;
const node49path86 = 0;
const node50path86 = 0;
const node55path86 = 0;
const node56path86 = 0;
const node57path86 = 0;
const node58path86 = 0;
const node59path86 = 0;
const node51path87 = 17;
const node60path87 = 51;
const node59path87 = 60;
const node54path87 = 59;
const node53path87 = 54;
const node52path87 = 53;
const node7path87 = 52;
const node1path87 = 0;
const node2path87 = 0;
const node3path87 = 0;
const node4path87 = 0;
const node5path87 = 0;
const node6path87 = 0;
const node8path87 = 0;
const node9path87 = 0;
const node10path87 = 0;
const node11path87 = 0;
const node12path87 = 0;
const node13path87 = 0;
const node14path87 = 0;
const node15path87 = 0;
const node16path87 = 0;
const node17path87 = 0;
const node18path87 = 0;
const node19path87 = 0;
const node20path87 = 0;
const node21path87 = 0;
const node22path87 = 0;
const node23path87 = 0;
const node24path87 = 0;
const node25path87 = 0;
const node26path87 = 0;
const node27path87 = 0;
const node28path87 = 0;
const node29path87 = 0;
const node30path87 = 0;
const node31path87 = 0;
const node32path87 = 0;
const node33path87 = 0;
const node34path87 = 0;
const node35path87 = 0;
const node36path87 = 0;
const node37path87 = 0;
const node38path87 = 0;
const node39path87 = 0;
const node40path87 = 0;
const node41path87 = 0;
const node42path87 = 0;
const node43path87 = 0;
const node44path87 = 0;
const node45path87 = 0;
const node46path87 = 0;
const node47path87 = 0;
const node48path87 = 0;
const node49path87 = 0;
const node50path87 = 0;
const node55path87 = 0;
const node56path87 = 0;
const node57path87 = 0;
const node58path87 = 0;
const node51path88 = 37;
const node56path88 = 51;
const node58path88 = 56;
const node53path88 = 58;
const node20path88 = 53;
const node1path88 = 0;
const node2path88 = 0;
const node3path88 = 0;
const node4path88 = 0;
const node5path88 = 0;
const node6path88 = 0;
const node7path88 = 0;
const node8path88 = 0;
const node9path88 = 0;
const node10path88 = 0;
const node11path88 = 0;
const node12path88 = 0;
const node13path88 = 0;
const node14path88 = 0;
const node15path88 = 0;
const node16path88 = 0;
const node17path88 = 0;
const node18path88 = 0;
const node19path88 = 0;
const node21path88 = 0;
const node22path88 = 0;
const node23path88 = 0;
const node24path88 = 0;
const node25path88 = 0;
const node26path88 = 0;
const node27path88 = 0;
const node28path88 = 0;
const node29path88 = 0;
const node30path88 = 0;
const node31path88 = 0;
const node32path88 = 0;
const node33path88 = 0;
const node34path88 = 0;
const node35path88 = 0;
const node36path88 = 0;
const node37path88 = 0;
const node38path88 = 0;
const node39path88 = 0;
const node40path88 = 0;
const node41path88 = 0;
const node42path88 = 0;
const node43path88 = 0;
const node44path88 = 0;
const node45path88 = 0;
const node46path88 = 0;
const node47path88 = 0;
const node48path88 = 0;
const node49path88 = 0;
const node50path88 = 0;
const node52path88 = 0;
const node54path88 = 0;
const node55path88 = 0;
const node57path88 = 0;
const node59path88 = 0;
const node60path88 = 0;
const node51path89 = 21;
const node56path89 = 51;
const node54path89 = 56;
const node59path89 = 54;
const node58path89 = 59;
const node3path89 = 58;
const node1path89 = 0;
const node2path89 = 0;
const node4path89 = 0;
const node5path89 = 0;
const node6path89 = 0;
const node7path89 = 0;
const node8path89 = 0;
const node9path89 = 0;
const node10path89 = 0;
const node11path89 = 0;
const node12path89 = 0;
const node13path89 = 0;
const node14path89 = 0;
const node15path89 = 0;
const node16path89 = 0;
const node17path89 = 0;
const node18path89 = 0;
const node19path89 = 0;
const node20path89 = 0;
const node21path89 = 0;
const node22path89 = 0;
const node23path89 = 0;
const node24path89 = 0;
const node25path89 = 0;
const node26path89 = 0;
const node27path89 = 0;
const node28path89 = 0;
const node29path89 = 0;
const node30path89 = 0;
const node31path89 = 0;
const node32path89 = 0;
const node33path89 = 0;
const node34path89 = 0;
const node35path89 = 0;
const node36path89 = 0;
const node37path89 = 0;
const node38path89 = 0;
const node39path89 = 0;
const node40path89 = 0;
const node41path89 = 0;
const node42path89 = 0;
const node43path89 = 0;
const node44path89 = 0;
const node45path89 = 0;
const node46path89 = 0;
const node47path89 = 0;
const node48path89 = 0;
const node49path89 = 0;
const node50path89 = 0;
const node52path89 = 0;
const node53path89 = 0;
const node55path89 = 0;
const node57path89 = 0;
const node60path89 = 0;
const node60path90 = 23;
const node53path90 = 60;
const node59path90 = 53;
const node55path90 = 59;
const node57path90 = 55;
const node33path90 = 57;
const node1path90 = 0;
const node2path90 = 0;
const node3path90 = 0;
const node4path90 = 0;
const node5path90 = 0;
const node6path90 = 0;
const node7path90 = 0;
const node8path90 = 0;
const node9path90 = 0;
const node10path90 = 0;
const node11path90 = 0;
const node12path90 = 0;
const node13path90 = 0;
const node14path90 = 0;
const node15path90 = 0;
const node16path90 = 0;
const node17path90 = 0;
const node18path90 = 0;
const node19path90 = 0;
const node20path90 = 0;
const node21path90 = 0;
const node22path90 = 0;
const node23path90 = 0;
const node24path90 = 0;
const node25path90 = 0;
const node26path90 = 0;
const node27path90 = 0;
const node28path90 = 0;
const node29path90 = 0;
const node30path90 = 0;
const node31path90 = 0;
const node32path90 = 0;
const node34path90 = 0;
const node35path90 = 0;
const node36path90 = 0;
const node37path90 = 0;
const node38path90 = 0;
const node39path90 = 0;
const node40path90 = 0;
const node41path90 = 0;
const node42path90 = 0;
const node43path90 = 0;
const node44path90 = 0;
const node45path90 = 0;
const node46path90 = 0;
const node47path90 = 0;
const node48path90 = 0;
const node49path90 = 0;
const node50path90 = 0;
const node51path90 = 0;
const node52path90 = 0;
const node54path90 = 0;
const node56path90 = 0;
const node58path90 = 0;
const node52path91 = 30;
const node53path91 = 52;
const node59path91 = 53;
const node58path91 = 59;
const node51path91 = 58;
const node54path91 = 51;
const node8path91 = 54;
const node1path91 = 0;
const node2path91 = 0;
const node3path91 = 0;
const node4path91 = 0;
const node5path91 = 0;
const node6path91 = 0;
const node7path91 = 0;
const node9path91 = 0;
const node10path91 = 0;
const node11path91 = 0;
const node12path91 = 0;
const node13path91 = 0;
const node14path91 = 0;
const node15path91 = 0;
const node16path91 = 0;
const node17path91 = 0;
const node18path91 = 0;
const node19path91 = 0;
const node20path91 = 0;
const node21path91 = 0;
const node22path91 = 0;
const node23path91 = 0;
const node24path91 = 0;
const node25path91 = 0;
const node26path91 = 0;
const node27path91 = 0;
const node28path91 = 0;
const node29path91 = 0;
const node30path91 = 0;
const node31path91 = 0;
const node32path91 = 0;
const node33path91 = 0;
const node34path91 = 0;
const node35path91 = 0;
const node36path91 = 0;
const node37path91 = 0;
const node38path91 = 0;
const node39path91 = 0;
const node40path91 = 0;
const node41path91 = 0;
const node42path91 = 0;
const node43path91 = 0;
const node44path91 = 0;
const node45path91 = 0;
const node46path91 = 0;
const node47path91 = 0;
const node48path91 = 0;
const node49path91 = 0;
const node50path91 = 0;
const node55path91 = 0;
const node56path91 = 0;
const node57path91 = 0;
const node60path91 = 0;
const node54path92 = 44;
const node57path92 = 54;
const node56path92 = 57;
const node51path92 = 56;
const node53path92 = 51;
const node60path92 = 53;
const node43path92 = 60;
const node1path92 = 0;
const node2path92 = 0;
const node3path92 = 0;
const node4path92 = 0;
const node5path92 = 0;
const node6path92 = 0;
const node7path92 = 0;
const node8path92 = 0;
const node9path92 = 0;
const node10path92 = 0;
const node11path92 = 0;
const node12path92 = 0;
const node13path92 = 0;
const node14path92 = 0;
const node15path92 = 0;
const node16path92 = 0;
const node17path92 = 0;
const node18path92 = 0;
const node19path92 = 0;
const node20path92 = 0;
const node21path92 = 0;
const node22path92 = 0;
const node23path92 = 0;
const node24path92 = 0;
const node25path92 = 0;
const node26path92 = 0;
const node27path92 = 0;
const node28path92 = 0;
const node29path92 = 0;
const node30path92 = 0;
const node31path92 = 0;
const node32path92 = 0;
const node33path92 = 0;
const node34path92 = 0;
const node35path92 = 0;
const node36path92 = 0;
const node37path92 = 0;
const node38path92 = 0;
const node39path92 = 0;
const node40path92 = 0;
const node41path92 = 0;
const node42path92 = 0;
const node44path92 = 0;
const node45path92 = 0;
const node46path92 = 0;
const node47path92 = 0;
const node48path92 = 0;
const node49path92 = 0;
const node50path92 = 0;
const node52path92 = 0;
const node55path92 = 0;
const node58path92 = 0;
const node59path92 = 0;
const node58path93 = 15;
const node56path93 = 58;
const node57path93 = 56;
const node60path93 = 57;
const node51path93 = 60;
const node54path93 = 51;
const node36path93 = 54;
const node1path93 = 0;
const node2path93 = 0;
const node3path93 = 0;
const node4path93 = 0;
const node5path93 = 0;
const node6path93 = 0;
const node7path93 = 0;
const node8path93 = 0;
const node9path93 = 0;
const node10path93 = 0;
const node11path93 = 0;
const node12path93 = 0;
const node13path93 = 0;
const node14path93 = 0;
const node15path93 = 0;
const node16path93 = 0;
const node17path93 = 0;
const node18path93 = 0;
const node19path93 = 0;
const node20path93 = 0;
const node21path93 = 0;
const node22path93 = 0;
const node23path93 = 0;
const node24path93 = 0;
const node25path93 = 0;
const node26path93 = 0;
const node27path93 = 0;
const node28path93 = 0;
const node29path93 = 0;
const node30path93 = 0;
const node31path93 = 0;
const node32path93 = 0;
const node33path93 = 0;
const node34path93 = 0;
const node35path93 = 0;
const node37path93 = 0;
const node38path93 = 0;
const node39path93 = 0;
const node40path93 = 0;
const node41path93 = 0;
const node42path93 = 0;
const node43path93 = 0;
const node44path93 = 0;
const node45path93 = 0;
const node46path93 = 0;
const node47path93 = 0;
const node48path93 = 0;
const node49path93 = 0;
const node50path93 = 0;
const node52path93 = 0;
const node53path93 = 0;
const node55path93 = 0;
const node59path93 = 0;
const node55path94 = 42;
const node53path94 = 55;
const node56path94 = 53;
const node57path94 = 56;
const node45path94 = 57;
const node1path94 = 0;
const node2path94 = 0;
const node3path94 = 0;
const node4path94 = 0;
const node5path94 = 0;
const node6path94 = 0;
const node7path94 = 0;
const node8path94 = 0;
const node9path94 = 0;
const node10path94 = 0;
const node11path94 = 0;
const node12path94 = 0;
const node13path94 = 0;
const node14path94 = 0;
const node15path94 = 0;
const node16path94 = 0;
const node17path94 = 0;
const node18path94 = 0;
const node19path94 = 0;
const node20path94 = 0;
const node21path94 = 0;
const node22path94 = 0;
const node23path94 = 0;
const node24path94 = 0;
const node25path94 = 0;
const node26path94 = 0;
const node27path94 = 0;
const node28path94 = 0;
const node29path94 = 0;
const node30path94 = 0;
const node31path94 = 0;
const node32path94 = 0;
const node33path94 = 0;
const node34path94 = 0;
const node35path94 = 0;
const node36path94 = 0;
const node37path94 = 0;
const node38path94 = 0;
const node39path94 = 0;
const node40path94 = 0;
const node41path94 = 0;
const node42path94 = 0;
const node43path94 = 0;
const node44path94 = 0;
const node46path94 = 0;
const node47path94 = 0;
const node48path94 = 0;
const node49path94 = 0;
const node50path94 = 0;
const node51path94 = 0;
const node52path94 = 0;
const node54path94 = 0;
const node58path94 = 0;
const node59path94 = 0;
const node60path94 = 0;
const node56path95 = 43;
const node52path95 = 56;
const node55path95 = 52;
const node57path95 = 55;
const node53path95 = 57;
const node12path95 = 53;
const node1path95 = 0;
const node2path95 = 0;
const node3path95 = 0;
const node4path95 = 0;
const node5path95 = 0;
const node6path95 = 0;
const node7path95 = 0;
const node8path95 = 0;
const node9path95 = 0;
const node10path95 = 0;
const node11path95 = 0;
const node13path95 = 0;
const node14path95 = 0;
const node15path95 = 0;
const node16path95 = 0;
const node17path95 = 0;
const node18path95 = 0;
const node19path95 = 0;
const node20path95 = 0;
const node21path95 = 0;
const node22path95 = 0;
const node23path95 = 0;
const node24path95 = 0;
const node25path95 = 0;
const node26path95 = 0;
const node27path95 = 0;
const node28path95 = 0;
const node29path95 = 0;
const node30path95 = 0;
const node31path95 = 0;
const node32path95 = 0;
const node33path95 = 0;
const node34path95 = 0;
const node35path95 = 0;
const node36path95 = 0;
const node37path95 = 0;
const node38path95 = 0;
const node39path95 = 0;
const node40path95 = 0;
const node41path95 = 0;
const node42path95 = 0;
const node43path95 = 0;
const node44path95 = 0;
const node45path95 = 0;
const node46path95 = 0;
const node47path95 = 0;
const node48path95 = 0;
const node49path95 = 0;
const node50path95 = 0;
const node51path95 = 0;
const node54path95 = 0;
const node58path95 = 0;
const node59path95 = 0;
const node60path95 = 0;
const node55path96 = 41;
const node53path96 = 55;
const node57path96 = 53;
const node52path96 = 57;
const node58path96 = 52;
const node54path96 = 58;
const node27path96 = 54;
const node1path96 = 0;
const node2path96 = 0;
const node3path96 = 0;
const node4path96 = 0;
const node5path96 = 0;
const node6path96 = 0;
const node7path96 = 0;
const node8path96 = 0;
const node9path96 = 0;
const node10path96 = 0;
const node11path96 = 0;
const node12path96 = 0;
const node13path96 = 0;
const node14path96 = 0;
const node15path96 = 0;
const node16path96 = 0;
const node17path96 = 0;
const node18path96 = 0;
const node19path96 = 0;
const node20path96 = 0;
const node21path96 = 0;
const node22path96 = 0;
const node23path96 = 0;
const node24path96 = 0;
const node25path96 = 0;
const node26path96 = 0;
const node28path96 = 0;
const node29path96 = 0;
const node30path96 = 0;
const node31path96 = 0;
const node32path96 = 0;
const node33path96 = 0;
const node34path96 = 0;
const node35path96 = 0;
const node36path96 = 0;
const node37path96 = 0;
const node38path96 = 0;
const node39path96 = 0;
const node40path96 = 0;
const node41path96 = 0;
const node42path96 = 0;
const node43path96 = 0;
const node44path96 = 0;
const node45path96 = 0;
const node46path96 = 0;
const node47path96 = 0;
const node48path96 = 0;
const node49path96 = 0;
const node50path96 = 0;
const node51path96 = 0;
const node56path96 = 0;
const node59path96 = 0;
const node60path96 = 0;
const node53path97 = 10;
const node51path97 = 53;
const node57path97 = 51;
const node60path97 = 57;
const node52path97 = 60;
const node54path97 = 52;
const node41path97 = 54;
const node1path97 = 0;
const node2path97 = 0;
const node3path97 = 0;
const node4path97 = 0;
const node5path97 = 0;
const node6path97 = 0;
const node7path97 = 0;
const node8path97 = 0;
const node9path97 = 0;
const node10path97 = 0;
const node11path97 = 0;
const node12path97 = 0;
const node13path97 = 0;
const node14path97 = 0;
const node15path97 = 0;
const node16path97 = 0;
const node17path97 = 0;
const node18path97 = 0;
const node19path97 = 0;
const node20path97 = 0;
const node21path97 = 0;
const node22path97 = 0;
const node23path97 = 0;
const node24path97 = 0;
const node25path97 = 0;
const node26path97 = 0;
const node27path97 = 0;
const node28path97 = 0;
const node29path97 = 0;
const node30path97 = 0;
const node31path97 = 0;
const node32path97 = 0;
const node33path97 = 0;
const node34path97 = 0;
const node35path97 = 0;
const node36path97 = 0;
const node37path97 = 0;
const node38path97 = 0;
const node39path97 = 0;
const node40path97 = 0;
const node42path97 = 0;
const node43path97 = 0;
const node44path97 = 0;
const node45path97 = 0;
const node46path97 = 0;
const node47path97 = 0;
const node48path97 = 0;
const node49path97 = 0;
const node50path97 = 0;
const node55path97 = 0;
const node56path97 = 0;
const node58path97 = 0;
const node59path97 = 0;
const node52path98 = 34;
const node54path98 = 52;
const node51path98 = 54;
const node58path98 = 51;
const node57path98 = 58;
const node31path98 = 57;
const node1path98 = 0;
const node2path98 = 0;
const node3path98 = 0;
const node4path98 = 0;
const node5path98 = 0;
const node6path98 = 0;
const node7path98 = 0;
const node8path98 = 0;
const node9path98 = 0;
const node10path98 = 0;
const node11path98 = 0;
const node12path98 = 0;
const node13path98 = 0;
const node14path98 = 0;
const node15path98 = 0;
const node16path98 = 0;
const node17path98 = 0;
const node18path98 = 0;
const node19path98 = 0;
const node20path98 = 0;
const node21path98 = 0;
const node22path98 = 0;
const node23path98 = 0;
const node24path98 = 0;
const node25path98 = 0;
const node26path98 = 0;
const node27path98 = 0;
const node28path98 = 0;
const node29path98 = 0;
const node30path98 = 0;
const node32path98 = 0;
const node33path98 = 0;
const node34path98 = 0;
const node35path98 = 0;
const node36path98 = 0;
const node37path98 = 0;
const node38path98 = 0;
const node39path98 = 0;
const node40path98 = 0;
const node41path98 = 0;
const node42path98 = 0;
const node43path98 = 0;
const node44path98 = 0;
const node45path98 = 0;
const node46path98 = 0;
const node47path98 = 0;
const node48path98 = 0;
const node49path98 = 0;
const node50path98 = 0;
const node53path98 = 0;
const node55path98 = 0;
const node56path98 = 0;
const node59path98 = 0;
const node60path98 = 0;
const node55path99 = 20;
const node54path99 = 55;
const node51path99 = 54;
const node60path99 = 51;
const node52path99 = 60;
const node56path99 = 52;
const node31path99 = 56;
const node1path99 = 0;
const node2path99 = 0;
const node3path99 = 0;
const node4path99 = 0;
const node5path99 = 0;
const node6path99 = 0;
const node7path99 = 0;
const node8path99 = 0;
const node9path99 = 0;
const node10path99 = 0;
const node11path99 = 0;
const node12path99 = 0;
const node13path99 = 0;
const node14path99 = 0;
const node15path99 = 0;
const node16path99 = 0;
const node17path99 = 0;
const node18path99 = 0;
const node19path99 = 0;
const node20path99 = 0;
const node21path99 = 0;
const node22path99 = 0;
const node23path99 = 0;
const node24path99 = 0;
const node25path99 = 0;
const node26path99 = 0;
const node27path99 = 0;
const node28path99 = 0;
const node29path99 = 0;
const node30path99 = 0;
const node32path99 = 0;
const node33path99 = 0;
const node34path99 = 0;
const node35path99 = 0;
const node36path99 = 0;
const node37path99 = 0;
const node38path99 = 0;
const node39path99 = 0;
const node40path99 = 0;
const node41path99 = 0;
const node42path99 = 0;
const node43path99 = 0;
const node44path99 = 0;
const node45path99 = 0;
const node46path99 = 0;
const node47path99 = 0;
const node48path99 = 0;
const node49path99 = 0;
const node50path99 = 0;
const node53path99 = 0;
const node57path99 = 0;
const node58path99 = 0;
const node59path99 = 0;
const node56path100 = 15;
const node60path100 = 56;
const node53path100 = 60;
const node58path100 = 53;
const node59path100 = 58;
const node54path100 = 59;
const node41path100 = 54;
const node1path100 = 0;
const node2path100 = 0;
const node3path100 = 0;
const node4path100 = 0;
const node5path100 = 0;
const node6path100 = 0;
const node7path100 = 0;
const node8path100 = 0;
const node9path100 = 0;
const node10path100 = 0;
const node11path100 = 0;
const node12path100 = 0;
const node13path100 = 0;
const node14path100 = 0;
const node15path100 = 0;
const node16path100 = 0;
const node17path100 = 0;
const node18path100 = 0;
const node19path100 = 0;
const node20path100 = 0;
const node21path100 = 0;
const node22path100 = 0;
const node23path100 = 0;
const node24path100 = 0;
const node25path100 = 0;
const node26path100 = 0;
const node27path100 = 0;
const node28path100 = 0;
const node29path100 = 0;
const node30path100 = 0;
const node31path100 = 0;
const node32path100 = 0;
const node33path100 = 0;
const node34path100 = 0;
const node35path100 = 0;
const node36path100 = 0;
const node37path100 = 0;
const node38path100 = 0;
const node39path100 = 0;
const node40path100 = 0;
const node42path100 = 0;
const node43path100 = 0;
const node44path100 = 0;
const node45path100 = 0;
const node46path100 = 0;
const node47path100 = 0;
const node48path100 = 0;
const node49path100 = 0;
const node50path100 = 0;
const node51path100 = 0;
const node52path100 = 0;
const node55path100 = 0;
const node57path100 = 0;

//end Graph


module entropy


start:  bool init true;
launch:  bool init false;
new:  bool init false;
chooseBad:  bool init false;
done:  bool init false;
bad:  bool init false;
good: bool init false;
checkNode: bool init false;
end: bool init false;
checkEnd: bool init false;


currentNode: [0..nodeCount] init initNode;
currentPath: [0..numPaths] init 1;
success:  [0..1] init 0;
length: [0..maxSearchLength] init 0;


[] start -> (launch'=true) & (start'=false);


[] launch -> (length'=0) & (currentNode'=initNode) & (currentPath'=1) & (new'=true) & (launch'=false);


[] new & (useSearchLength != 1) -> (chooseBad'=true) & (new'=false);

[] new & (useSearchLength = 1) & (length < maxSearchLength) -> (length'=(length+1)) & (chooseBad'=true)  & (new'=false);

[] new & (useSearchLength = 1) & (length >= maxSearchLength)-> (launch'=true) & (new'=false);


[] chooseBad ->
  badP: (bad'=true) & (chooseBad'=false) +
  goodP: (good'=true) & (chooseBad'=false);


[] bad & (currentNode = 1) & (currentPath = 1)  -> (currentNode'=node1path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 2)  -> (currentNode'=node1path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 3)  -> (currentNode'=node1path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 4)  -> (currentNode'=node1path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 5)  -> (currentNode'=node1path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 6)  -> (currentNode'=node1path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 7)  -> (currentNode'=node1path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 8)  -> (currentNode'=node1path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 9)  -> (currentNode'=node1path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 10)  -> (currentNode'=node1path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 11)  -> (currentNode'=node1path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 12)  -> (currentNode'=node1path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 13)  -> (currentNode'=node1path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 14)  -> (currentNode'=node1path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 15)  -> (currentNode'=node1path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 16)  -> (currentNode'=node1path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 17)  -> (currentNode'=node1path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 18)  -> (currentNode'=node1path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 19)  -> (currentNode'=node1path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 20)  -> (currentNode'=node1path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 21)  -> (currentNode'=node1path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 22)  -> (currentNode'=node1path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 23)  -> (currentNode'=node1path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 24)  -> (currentNode'=node1path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 25)  -> (currentNode'=node1path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 26)  -> (currentNode'=node1path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 27)  -> (currentNode'=node1path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 28)  -> (currentNode'=node1path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 29)  -> (currentNode'=node1path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 30)  -> (currentNode'=node1path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 31)  -> (currentNode'=node1path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 32)  -> (currentNode'=node1path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 33)  -> (currentNode'=node1path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 34)  -> (currentNode'=node1path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 35)  -> (currentNode'=node1path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 36)  -> (currentNode'=node1path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 37)  -> (currentNode'=node1path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 38)  -> (currentNode'=node1path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 39)  -> (currentNode'=node1path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 40)  -> (currentNode'=node1path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 41)  -> (currentNode'=node1path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 42)  -> (currentNode'=node1path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 43)  -> (currentNode'=node1path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 44)  -> (currentNode'=node1path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 45)  -> (currentNode'=node1path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 46)  -> (currentNode'=node1path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 47)  -> (currentNode'=node1path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 48)  -> (currentNode'=node1path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 49)  -> (currentNode'=node1path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 50)  -> (currentNode'=node1path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 51)  -> (currentNode'=node1path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 52)  -> (currentNode'=node1path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 53)  -> (currentNode'=node1path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 54)  -> (currentNode'=node1path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 55)  -> (currentNode'=node1path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 56)  -> (currentNode'=node1path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 57)  -> (currentNode'=node1path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 58)  -> (currentNode'=node1path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 59)  -> (currentNode'=node1path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 60)  -> (currentNode'=node1path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 61)  -> (currentNode'=node1path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 62)  -> (currentNode'=node1path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 63)  -> (currentNode'=node1path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 64)  -> (currentNode'=node1path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 65)  -> (currentNode'=node1path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 66)  -> (currentNode'=node1path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 67)  -> (currentNode'=node1path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 68)  -> (currentNode'=node1path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 69)  -> (currentNode'=node1path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 70)  -> (currentNode'=node1path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 71)  -> (currentNode'=node1path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 72)  -> (currentNode'=node1path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 73)  -> (currentNode'=node1path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 74)  -> (currentNode'=node1path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 75)  -> (currentNode'=node1path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 76)  -> (currentNode'=node1path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 77)  -> (currentNode'=node1path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 78)  -> (currentNode'=node1path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 79)  -> (currentNode'=node1path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 80)  -> (currentNode'=node1path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 81)  -> (currentNode'=node1path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 82)  -> (currentNode'=node1path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 83)  -> (currentNode'=node1path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 84)  -> (currentNode'=node1path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 85)  -> (currentNode'=node1path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 86)  -> (currentNode'=node1path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 87)  -> (currentNode'=node1path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 88)  -> (currentNode'=node1path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 89)  -> (currentNode'=node1path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 90)  -> (currentNode'=node1path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 91)  -> (currentNode'=node1path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 92)  -> (currentNode'=node1path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 93)  -> (currentNode'=node1path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 94)  -> (currentNode'=node1path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 95)  -> (currentNode'=node1path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 96)  -> (currentNode'=node1path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 97)  -> (currentNode'=node1path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 98)  -> (currentNode'=node1path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 99)  -> (currentNode'=node1path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 1) & (currentPath = 100)  -> (currentNode'=node1path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 1)  -> (currentNode'=node2path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 2)  -> (currentNode'=node2path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 3)  -> (currentNode'=node2path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 4)  -> (currentNode'=node2path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 5)  -> (currentNode'=node2path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 6)  -> (currentNode'=node2path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 7)  -> (currentNode'=node2path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 8)  -> (currentNode'=node2path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 9)  -> (currentNode'=node2path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 10)  -> (currentNode'=node2path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 11)  -> (currentNode'=node2path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 12)  -> (currentNode'=node2path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 13)  -> (currentNode'=node2path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 14)  -> (currentNode'=node2path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 15)  -> (currentNode'=node2path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 16)  -> (currentNode'=node2path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 17)  -> (currentNode'=node2path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 18)  -> (currentNode'=node2path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 19)  -> (currentNode'=node2path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 20)  -> (currentNode'=node2path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 21)  -> (currentNode'=node2path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 22)  -> (currentNode'=node2path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 23)  -> (currentNode'=node2path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 24)  -> (currentNode'=node2path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 25)  -> (currentNode'=node2path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 26)  -> (currentNode'=node2path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 27)  -> (currentNode'=node2path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 28)  -> (currentNode'=node2path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 29)  -> (currentNode'=node2path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 30)  -> (currentNode'=node2path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 31)  -> (currentNode'=node2path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 32)  -> (currentNode'=node2path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 33)  -> (currentNode'=node2path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 34)  -> (currentNode'=node2path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 35)  -> (currentNode'=node2path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 36)  -> (currentNode'=node2path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 37)  -> (currentNode'=node2path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 38)  -> (currentNode'=node2path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 39)  -> (currentNode'=node2path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 40)  -> (currentNode'=node2path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 41)  -> (currentNode'=node2path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 42)  -> (currentNode'=node2path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 43)  -> (currentNode'=node2path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 44)  -> (currentNode'=node2path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 45)  -> (currentNode'=node2path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 46)  -> (currentNode'=node2path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 47)  -> (currentNode'=node2path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 48)  -> (currentNode'=node2path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 49)  -> (currentNode'=node2path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 50)  -> (currentNode'=node2path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 51)  -> (currentNode'=node2path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 52)  -> (currentNode'=node2path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 53)  -> (currentNode'=node2path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 54)  -> (currentNode'=node2path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 55)  -> (currentNode'=node2path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 56)  -> (currentNode'=node2path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 57)  -> (currentNode'=node2path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 58)  -> (currentNode'=node2path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 59)  -> (currentNode'=node2path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 60)  -> (currentNode'=node2path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 61)  -> (currentNode'=node2path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 62)  -> (currentNode'=node2path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 63)  -> (currentNode'=node2path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 64)  -> (currentNode'=node2path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 65)  -> (currentNode'=node2path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 66)  -> (currentNode'=node2path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 67)  -> (currentNode'=node2path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 68)  -> (currentNode'=node2path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 69)  -> (currentNode'=node2path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 70)  -> (currentNode'=node2path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 71)  -> (currentNode'=node2path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 72)  -> (currentNode'=node2path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 73)  -> (currentNode'=node2path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 74)  -> (currentNode'=node2path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 75)  -> (currentNode'=node2path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 76)  -> (currentNode'=node2path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 77)  -> (currentNode'=node2path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 78)  -> (currentNode'=node2path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 79)  -> (currentNode'=node2path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 80)  -> (currentNode'=node2path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 81)  -> (currentNode'=node2path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 82)  -> (currentNode'=node2path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 83)  -> (currentNode'=node2path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 84)  -> (currentNode'=node2path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 85)  -> (currentNode'=node2path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 86)  -> (currentNode'=node2path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 87)  -> (currentNode'=node2path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 88)  -> (currentNode'=node2path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 89)  -> (currentNode'=node2path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 90)  -> (currentNode'=node2path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 91)  -> (currentNode'=node2path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 92)  -> (currentNode'=node2path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 93)  -> (currentNode'=node2path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 94)  -> (currentNode'=node2path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 95)  -> (currentNode'=node2path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 96)  -> (currentNode'=node2path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 97)  -> (currentNode'=node2path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 98)  -> (currentNode'=node2path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 99)  -> (currentNode'=node2path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 2) & (currentPath = 100)  -> (currentNode'=node2path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 1)  -> (currentNode'=node3path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 2)  -> (currentNode'=node3path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 3)  -> (currentNode'=node3path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 4)  -> (currentNode'=node3path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 5)  -> (currentNode'=node3path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 6)  -> (currentNode'=node3path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 7)  -> (currentNode'=node3path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 8)  -> (currentNode'=node3path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 9)  -> (currentNode'=node3path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 10)  -> (currentNode'=node3path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 11)  -> (currentNode'=node3path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 12)  -> (currentNode'=node3path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 13)  -> (currentNode'=node3path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 14)  -> (currentNode'=node3path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 15)  -> (currentNode'=node3path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 16)  -> (currentNode'=node3path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 17)  -> (currentNode'=node3path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 18)  -> (currentNode'=node3path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 19)  -> (currentNode'=node3path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 20)  -> (currentNode'=node3path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 21)  -> (currentNode'=node3path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 22)  -> (currentNode'=node3path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 23)  -> (currentNode'=node3path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 24)  -> (currentNode'=node3path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 25)  -> (currentNode'=node3path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 26)  -> (currentNode'=node3path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 27)  -> (currentNode'=node3path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 28)  -> (currentNode'=node3path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 29)  -> (currentNode'=node3path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 30)  -> (currentNode'=node3path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 31)  -> (currentNode'=node3path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 32)  -> (currentNode'=node3path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 33)  -> (currentNode'=node3path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 34)  -> (currentNode'=node3path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 35)  -> (currentNode'=node3path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 36)  -> (currentNode'=node3path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 37)  -> (currentNode'=node3path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 38)  -> (currentNode'=node3path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 39)  -> (currentNode'=node3path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 40)  -> (currentNode'=node3path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 41)  -> (currentNode'=node3path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 42)  -> (currentNode'=node3path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 43)  -> (currentNode'=node3path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 44)  -> (currentNode'=node3path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 45)  -> (currentNode'=node3path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 46)  -> (currentNode'=node3path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 47)  -> (currentNode'=node3path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 48)  -> (currentNode'=node3path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 49)  -> (currentNode'=node3path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 50)  -> (currentNode'=node3path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 51)  -> (currentNode'=node3path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 52)  -> (currentNode'=node3path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 53)  -> (currentNode'=node3path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 54)  -> (currentNode'=node3path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 55)  -> (currentNode'=node3path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 56)  -> (currentNode'=node3path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 57)  -> (currentNode'=node3path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 58)  -> (currentNode'=node3path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 59)  -> (currentNode'=node3path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 60)  -> (currentNode'=node3path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 61)  -> (currentNode'=node3path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 62)  -> (currentNode'=node3path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 63)  -> (currentNode'=node3path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 64)  -> (currentNode'=node3path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 65)  -> (currentNode'=node3path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 66)  -> (currentNode'=node3path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 67)  -> (currentNode'=node3path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 68)  -> (currentNode'=node3path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 69)  -> (currentNode'=node3path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 70)  -> (currentNode'=node3path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 71)  -> (currentNode'=node3path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 72)  -> (currentNode'=node3path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 73)  -> (currentNode'=node3path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 74)  -> (currentNode'=node3path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 75)  -> (currentNode'=node3path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 76)  -> (currentNode'=node3path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 77)  -> (currentNode'=node3path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 78)  -> (currentNode'=node3path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 79)  -> (currentNode'=node3path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 80)  -> (currentNode'=node3path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 81)  -> (currentNode'=node3path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 82)  -> (currentNode'=node3path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 83)  -> (currentNode'=node3path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 84)  -> (currentNode'=node3path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 85)  -> (currentNode'=node3path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 86)  -> (currentNode'=node3path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 87)  -> (currentNode'=node3path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 88)  -> (currentNode'=node3path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 89)  -> (currentNode'=node3path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 90)  -> (currentNode'=node3path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 91)  -> (currentNode'=node3path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 92)  -> (currentNode'=node3path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 93)  -> (currentNode'=node3path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 94)  -> (currentNode'=node3path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 95)  -> (currentNode'=node3path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 96)  -> (currentNode'=node3path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 97)  -> (currentNode'=node3path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 98)  -> (currentNode'=node3path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 99)  -> (currentNode'=node3path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 3) & (currentPath = 100)  -> (currentNode'=node3path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 1)  -> (currentNode'=node4path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 2)  -> (currentNode'=node4path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 3)  -> (currentNode'=node4path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 4)  -> (currentNode'=node4path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 5)  -> (currentNode'=node4path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 6)  -> (currentNode'=node4path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 7)  -> (currentNode'=node4path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 8)  -> (currentNode'=node4path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 9)  -> (currentNode'=node4path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 10)  -> (currentNode'=node4path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 11)  -> (currentNode'=node4path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 12)  -> (currentNode'=node4path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 13)  -> (currentNode'=node4path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 14)  -> (currentNode'=node4path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 15)  -> (currentNode'=node4path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 16)  -> (currentNode'=node4path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 17)  -> (currentNode'=node4path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 18)  -> (currentNode'=node4path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 19)  -> (currentNode'=node4path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 20)  -> (currentNode'=node4path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 21)  -> (currentNode'=node4path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 22)  -> (currentNode'=node4path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 23)  -> (currentNode'=node4path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 24)  -> (currentNode'=node4path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 25)  -> (currentNode'=node4path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 26)  -> (currentNode'=node4path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 27)  -> (currentNode'=node4path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 28)  -> (currentNode'=node4path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 29)  -> (currentNode'=node4path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 30)  -> (currentNode'=node4path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 31)  -> (currentNode'=node4path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 32)  -> (currentNode'=node4path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 33)  -> (currentNode'=node4path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 34)  -> (currentNode'=node4path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 35)  -> (currentNode'=node4path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 36)  -> (currentNode'=node4path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 37)  -> (currentNode'=node4path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 38)  -> (currentNode'=node4path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 39)  -> (currentNode'=node4path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 40)  -> (currentNode'=node4path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 41)  -> (currentNode'=node4path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 42)  -> (currentNode'=node4path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 43)  -> (currentNode'=node4path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 44)  -> (currentNode'=node4path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 45)  -> (currentNode'=node4path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 46)  -> (currentNode'=node4path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 47)  -> (currentNode'=node4path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 48)  -> (currentNode'=node4path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 49)  -> (currentNode'=node4path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 50)  -> (currentNode'=node4path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 51)  -> (currentNode'=node4path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 52)  -> (currentNode'=node4path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 53)  -> (currentNode'=node4path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 54)  -> (currentNode'=node4path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 55)  -> (currentNode'=node4path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 56)  -> (currentNode'=node4path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 57)  -> (currentNode'=node4path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 58)  -> (currentNode'=node4path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 59)  -> (currentNode'=node4path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 60)  -> (currentNode'=node4path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 61)  -> (currentNode'=node4path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 62)  -> (currentNode'=node4path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 63)  -> (currentNode'=node4path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 64)  -> (currentNode'=node4path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 65)  -> (currentNode'=node4path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 66)  -> (currentNode'=node4path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 67)  -> (currentNode'=node4path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 68)  -> (currentNode'=node4path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 69)  -> (currentNode'=node4path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 70)  -> (currentNode'=node4path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 71)  -> (currentNode'=node4path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 72)  -> (currentNode'=node4path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 73)  -> (currentNode'=node4path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 74)  -> (currentNode'=node4path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 75)  -> (currentNode'=node4path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 76)  -> (currentNode'=node4path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 77)  -> (currentNode'=node4path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 78)  -> (currentNode'=node4path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 79)  -> (currentNode'=node4path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 80)  -> (currentNode'=node4path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 81)  -> (currentNode'=node4path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 82)  -> (currentNode'=node4path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 83)  -> (currentNode'=node4path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 84)  -> (currentNode'=node4path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 85)  -> (currentNode'=node4path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 86)  -> (currentNode'=node4path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 87)  -> (currentNode'=node4path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 88)  -> (currentNode'=node4path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 89)  -> (currentNode'=node4path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 90)  -> (currentNode'=node4path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 91)  -> (currentNode'=node4path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 92)  -> (currentNode'=node4path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 93)  -> (currentNode'=node4path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 94)  -> (currentNode'=node4path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 95)  -> (currentNode'=node4path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 96)  -> (currentNode'=node4path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 97)  -> (currentNode'=node4path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 98)  -> (currentNode'=node4path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 99)  -> (currentNode'=node4path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 4) & (currentPath = 100)  -> (currentNode'=node4path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 1)  -> (currentNode'=node5path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 2)  -> (currentNode'=node5path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 3)  -> (currentNode'=node5path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 4)  -> (currentNode'=node5path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 5)  -> (currentNode'=node5path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 6)  -> (currentNode'=node5path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 7)  -> (currentNode'=node5path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 8)  -> (currentNode'=node5path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 9)  -> (currentNode'=node5path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 10)  -> (currentNode'=node5path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 11)  -> (currentNode'=node5path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 12)  -> (currentNode'=node5path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 13)  -> (currentNode'=node5path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 14)  -> (currentNode'=node5path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 15)  -> (currentNode'=node5path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 16)  -> (currentNode'=node5path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 17)  -> (currentNode'=node5path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 18)  -> (currentNode'=node5path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 19)  -> (currentNode'=node5path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 20)  -> (currentNode'=node5path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 21)  -> (currentNode'=node5path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 22)  -> (currentNode'=node5path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 23)  -> (currentNode'=node5path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 24)  -> (currentNode'=node5path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 25)  -> (currentNode'=node5path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 26)  -> (currentNode'=node5path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 27)  -> (currentNode'=node5path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 28)  -> (currentNode'=node5path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 29)  -> (currentNode'=node5path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 30)  -> (currentNode'=node5path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 31)  -> (currentNode'=node5path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 32)  -> (currentNode'=node5path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 33)  -> (currentNode'=node5path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 34)  -> (currentNode'=node5path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 35)  -> (currentNode'=node5path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 36)  -> (currentNode'=node5path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 37)  -> (currentNode'=node5path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 38)  -> (currentNode'=node5path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 39)  -> (currentNode'=node5path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 40)  -> (currentNode'=node5path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 41)  -> (currentNode'=node5path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 42)  -> (currentNode'=node5path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 43)  -> (currentNode'=node5path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 44)  -> (currentNode'=node5path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 45)  -> (currentNode'=node5path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 46)  -> (currentNode'=node5path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 47)  -> (currentNode'=node5path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 48)  -> (currentNode'=node5path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 49)  -> (currentNode'=node5path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 50)  -> (currentNode'=node5path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 51)  -> (currentNode'=node5path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 52)  -> (currentNode'=node5path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 53)  -> (currentNode'=node5path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 54)  -> (currentNode'=node5path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 55)  -> (currentNode'=node5path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 56)  -> (currentNode'=node5path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 57)  -> (currentNode'=node5path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 58)  -> (currentNode'=node5path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 59)  -> (currentNode'=node5path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 60)  -> (currentNode'=node5path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 61)  -> (currentNode'=node5path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 62)  -> (currentNode'=node5path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 63)  -> (currentNode'=node5path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 64)  -> (currentNode'=node5path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 65)  -> (currentNode'=node5path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 66)  -> (currentNode'=node5path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 67)  -> (currentNode'=node5path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 68)  -> (currentNode'=node5path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 69)  -> (currentNode'=node5path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 70)  -> (currentNode'=node5path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 71)  -> (currentNode'=node5path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 72)  -> (currentNode'=node5path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 73)  -> (currentNode'=node5path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 74)  -> (currentNode'=node5path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 75)  -> (currentNode'=node5path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 76)  -> (currentNode'=node5path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 77)  -> (currentNode'=node5path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 78)  -> (currentNode'=node5path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 79)  -> (currentNode'=node5path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 80)  -> (currentNode'=node5path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 81)  -> (currentNode'=node5path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 82)  -> (currentNode'=node5path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 83)  -> (currentNode'=node5path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 84)  -> (currentNode'=node5path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 85)  -> (currentNode'=node5path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 86)  -> (currentNode'=node5path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 87)  -> (currentNode'=node5path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 88)  -> (currentNode'=node5path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 89)  -> (currentNode'=node5path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 90)  -> (currentNode'=node5path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 91)  -> (currentNode'=node5path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 92)  -> (currentNode'=node5path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 93)  -> (currentNode'=node5path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 94)  -> (currentNode'=node5path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 95)  -> (currentNode'=node5path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 96)  -> (currentNode'=node5path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 97)  -> (currentNode'=node5path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 98)  -> (currentNode'=node5path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 99)  -> (currentNode'=node5path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 5) & (currentPath = 100)  -> (currentNode'=node5path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 1)  -> (currentNode'=node6path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 2)  -> (currentNode'=node6path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 3)  -> (currentNode'=node6path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 4)  -> (currentNode'=node6path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 5)  -> (currentNode'=node6path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 6)  -> (currentNode'=node6path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 7)  -> (currentNode'=node6path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 8)  -> (currentNode'=node6path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 9)  -> (currentNode'=node6path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 10)  -> (currentNode'=node6path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 11)  -> (currentNode'=node6path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 12)  -> (currentNode'=node6path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 13)  -> (currentNode'=node6path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 14)  -> (currentNode'=node6path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 15)  -> (currentNode'=node6path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 16)  -> (currentNode'=node6path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 17)  -> (currentNode'=node6path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 18)  -> (currentNode'=node6path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 19)  -> (currentNode'=node6path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 20)  -> (currentNode'=node6path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 21)  -> (currentNode'=node6path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 22)  -> (currentNode'=node6path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 23)  -> (currentNode'=node6path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 24)  -> (currentNode'=node6path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 25)  -> (currentNode'=node6path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 26)  -> (currentNode'=node6path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 27)  -> (currentNode'=node6path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 28)  -> (currentNode'=node6path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 29)  -> (currentNode'=node6path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 30)  -> (currentNode'=node6path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 31)  -> (currentNode'=node6path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 32)  -> (currentNode'=node6path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 33)  -> (currentNode'=node6path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 34)  -> (currentNode'=node6path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 35)  -> (currentNode'=node6path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 36)  -> (currentNode'=node6path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 37)  -> (currentNode'=node6path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 38)  -> (currentNode'=node6path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 39)  -> (currentNode'=node6path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 40)  -> (currentNode'=node6path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 41)  -> (currentNode'=node6path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 42)  -> (currentNode'=node6path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 43)  -> (currentNode'=node6path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 44)  -> (currentNode'=node6path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 45)  -> (currentNode'=node6path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 46)  -> (currentNode'=node6path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 47)  -> (currentNode'=node6path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 48)  -> (currentNode'=node6path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 49)  -> (currentNode'=node6path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 50)  -> (currentNode'=node6path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 51)  -> (currentNode'=node6path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 52)  -> (currentNode'=node6path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 53)  -> (currentNode'=node6path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 54)  -> (currentNode'=node6path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 55)  -> (currentNode'=node6path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 56)  -> (currentNode'=node6path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 57)  -> (currentNode'=node6path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 58)  -> (currentNode'=node6path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 59)  -> (currentNode'=node6path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 60)  -> (currentNode'=node6path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 61)  -> (currentNode'=node6path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 62)  -> (currentNode'=node6path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 63)  -> (currentNode'=node6path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 64)  -> (currentNode'=node6path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 65)  -> (currentNode'=node6path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 66)  -> (currentNode'=node6path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 67)  -> (currentNode'=node6path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 68)  -> (currentNode'=node6path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 69)  -> (currentNode'=node6path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 70)  -> (currentNode'=node6path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 71)  -> (currentNode'=node6path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 72)  -> (currentNode'=node6path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 73)  -> (currentNode'=node6path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 74)  -> (currentNode'=node6path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 75)  -> (currentNode'=node6path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 76)  -> (currentNode'=node6path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 77)  -> (currentNode'=node6path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 78)  -> (currentNode'=node6path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 79)  -> (currentNode'=node6path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 80)  -> (currentNode'=node6path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 81)  -> (currentNode'=node6path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 82)  -> (currentNode'=node6path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 83)  -> (currentNode'=node6path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 84)  -> (currentNode'=node6path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 85)  -> (currentNode'=node6path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 86)  -> (currentNode'=node6path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 87)  -> (currentNode'=node6path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 88)  -> (currentNode'=node6path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 89)  -> (currentNode'=node6path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 90)  -> (currentNode'=node6path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 91)  -> (currentNode'=node6path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 92)  -> (currentNode'=node6path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 93)  -> (currentNode'=node6path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 94)  -> (currentNode'=node6path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 95)  -> (currentNode'=node6path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 96)  -> (currentNode'=node6path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 97)  -> (currentNode'=node6path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 98)  -> (currentNode'=node6path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 99)  -> (currentNode'=node6path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 6) & (currentPath = 100)  -> (currentNode'=node6path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 1)  -> (currentNode'=node7path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 2)  -> (currentNode'=node7path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 3)  -> (currentNode'=node7path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 4)  -> (currentNode'=node7path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 5)  -> (currentNode'=node7path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 6)  -> (currentNode'=node7path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 7)  -> (currentNode'=node7path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 8)  -> (currentNode'=node7path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 9)  -> (currentNode'=node7path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 10)  -> (currentNode'=node7path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 11)  -> (currentNode'=node7path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 12)  -> (currentNode'=node7path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 13)  -> (currentNode'=node7path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 14)  -> (currentNode'=node7path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 15)  -> (currentNode'=node7path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 16)  -> (currentNode'=node7path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 17)  -> (currentNode'=node7path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 18)  -> (currentNode'=node7path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 19)  -> (currentNode'=node7path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 20)  -> (currentNode'=node7path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 21)  -> (currentNode'=node7path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 22)  -> (currentNode'=node7path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 23)  -> (currentNode'=node7path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 24)  -> (currentNode'=node7path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 25)  -> (currentNode'=node7path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 26)  -> (currentNode'=node7path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 27)  -> (currentNode'=node7path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 28)  -> (currentNode'=node7path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 29)  -> (currentNode'=node7path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 30)  -> (currentNode'=node7path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 31)  -> (currentNode'=node7path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 32)  -> (currentNode'=node7path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 33)  -> (currentNode'=node7path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 34)  -> (currentNode'=node7path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 35)  -> (currentNode'=node7path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 36)  -> (currentNode'=node7path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 37)  -> (currentNode'=node7path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 38)  -> (currentNode'=node7path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 39)  -> (currentNode'=node7path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 40)  -> (currentNode'=node7path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 41)  -> (currentNode'=node7path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 42)  -> (currentNode'=node7path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 43)  -> (currentNode'=node7path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 44)  -> (currentNode'=node7path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 45)  -> (currentNode'=node7path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 46)  -> (currentNode'=node7path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 47)  -> (currentNode'=node7path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 48)  -> (currentNode'=node7path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 49)  -> (currentNode'=node7path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 50)  -> (currentNode'=node7path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 51)  -> (currentNode'=node7path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 52)  -> (currentNode'=node7path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 53)  -> (currentNode'=node7path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 54)  -> (currentNode'=node7path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 55)  -> (currentNode'=node7path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 56)  -> (currentNode'=node7path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 57)  -> (currentNode'=node7path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 58)  -> (currentNode'=node7path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 59)  -> (currentNode'=node7path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 60)  -> (currentNode'=node7path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 61)  -> (currentNode'=node7path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 62)  -> (currentNode'=node7path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 63)  -> (currentNode'=node7path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 64)  -> (currentNode'=node7path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 65)  -> (currentNode'=node7path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 66)  -> (currentNode'=node7path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 67)  -> (currentNode'=node7path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 68)  -> (currentNode'=node7path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 69)  -> (currentNode'=node7path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 70)  -> (currentNode'=node7path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 71)  -> (currentNode'=node7path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 72)  -> (currentNode'=node7path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 73)  -> (currentNode'=node7path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 74)  -> (currentNode'=node7path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 75)  -> (currentNode'=node7path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 76)  -> (currentNode'=node7path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 77)  -> (currentNode'=node7path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 78)  -> (currentNode'=node7path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 79)  -> (currentNode'=node7path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 80)  -> (currentNode'=node7path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 81)  -> (currentNode'=node7path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 82)  -> (currentNode'=node7path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 83)  -> (currentNode'=node7path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 84)  -> (currentNode'=node7path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 85)  -> (currentNode'=node7path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 86)  -> (currentNode'=node7path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 87)  -> (currentNode'=node7path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 88)  -> (currentNode'=node7path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 89)  -> (currentNode'=node7path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 90)  -> (currentNode'=node7path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 91)  -> (currentNode'=node7path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 92)  -> (currentNode'=node7path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 93)  -> (currentNode'=node7path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 94)  -> (currentNode'=node7path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 95)  -> (currentNode'=node7path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 96)  -> (currentNode'=node7path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 97)  -> (currentNode'=node7path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 98)  -> (currentNode'=node7path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 99)  -> (currentNode'=node7path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 7) & (currentPath = 100)  -> (currentNode'=node7path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 1)  -> (currentNode'=node8path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 2)  -> (currentNode'=node8path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 3)  -> (currentNode'=node8path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 4)  -> (currentNode'=node8path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 5)  -> (currentNode'=node8path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 6)  -> (currentNode'=node8path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 7)  -> (currentNode'=node8path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 8)  -> (currentNode'=node8path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 9)  -> (currentNode'=node8path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 10)  -> (currentNode'=node8path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 11)  -> (currentNode'=node8path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 12)  -> (currentNode'=node8path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 13)  -> (currentNode'=node8path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 14)  -> (currentNode'=node8path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 15)  -> (currentNode'=node8path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 16)  -> (currentNode'=node8path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 17)  -> (currentNode'=node8path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 18)  -> (currentNode'=node8path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 19)  -> (currentNode'=node8path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 20)  -> (currentNode'=node8path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 21)  -> (currentNode'=node8path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 22)  -> (currentNode'=node8path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 23)  -> (currentNode'=node8path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 24)  -> (currentNode'=node8path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 25)  -> (currentNode'=node8path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 26)  -> (currentNode'=node8path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 27)  -> (currentNode'=node8path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 28)  -> (currentNode'=node8path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 29)  -> (currentNode'=node8path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 30)  -> (currentNode'=node8path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 31)  -> (currentNode'=node8path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 32)  -> (currentNode'=node8path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 33)  -> (currentNode'=node8path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 34)  -> (currentNode'=node8path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 35)  -> (currentNode'=node8path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 36)  -> (currentNode'=node8path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 37)  -> (currentNode'=node8path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 38)  -> (currentNode'=node8path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 39)  -> (currentNode'=node8path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 40)  -> (currentNode'=node8path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 41)  -> (currentNode'=node8path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 42)  -> (currentNode'=node8path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 43)  -> (currentNode'=node8path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 44)  -> (currentNode'=node8path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 45)  -> (currentNode'=node8path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 46)  -> (currentNode'=node8path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 47)  -> (currentNode'=node8path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 48)  -> (currentNode'=node8path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 49)  -> (currentNode'=node8path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 50)  -> (currentNode'=node8path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 51)  -> (currentNode'=node8path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 52)  -> (currentNode'=node8path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 53)  -> (currentNode'=node8path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 54)  -> (currentNode'=node8path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 55)  -> (currentNode'=node8path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 56)  -> (currentNode'=node8path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 57)  -> (currentNode'=node8path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 58)  -> (currentNode'=node8path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 59)  -> (currentNode'=node8path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 60)  -> (currentNode'=node8path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 61)  -> (currentNode'=node8path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 62)  -> (currentNode'=node8path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 63)  -> (currentNode'=node8path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 64)  -> (currentNode'=node8path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 65)  -> (currentNode'=node8path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 66)  -> (currentNode'=node8path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 67)  -> (currentNode'=node8path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 68)  -> (currentNode'=node8path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 69)  -> (currentNode'=node8path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 70)  -> (currentNode'=node8path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 71)  -> (currentNode'=node8path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 72)  -> (currentNode'=node8path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 73)  -> (currentNode'=node8path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 74)  -> (currentNode'=node8path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 75)  -> (currentNode'=node8path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 76)  -> (currentNode'=node8path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 77)  -> (currentNode'=node8path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 78)  -> (currentNode'=node8path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 79)  -> (currentNode'=node8path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 80)  -> (currentNode'=node8path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 81)  -> (currentNode'=node8path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 82)  -> (currentNode'=node8path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 83)  -> (currentNode'=node8path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 84)  -> (currentNode'=node8path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 85)  -> (currentNode'=node8path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 86)  -> (currentNode'=node8path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 87)  -> (currentNode'=node8path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 88)  -> (currentNode'=node8path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 89)  -> (currentNode'=node8path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 90)  -> (currentNode'=node8path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 91)  -> (currentNode'=node8path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 92)  -> (currentNode'=node8path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 93)  -> (currentNode'=node8path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 94)  -> (currentNode'=node8path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 95)  -> (currentNode'=node8path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 96)  -> (currentNode'=node8path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 97)  -> (currentNode'=node8path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 98)  -> (currentNode'=node8path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 99)  -> (currentNode'=node8path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 8) & (currentPath = 100)  -> (currentNode'=node8path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 1)  -> (currentNode'=node9path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 2)  -> (currentNode'=node9path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 3)  -> (currentNode'=node9path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 4)  -> (currentNode'=node9path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 5)  -> (currentNode'=node9path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 6)  -> (currentNode'=node9path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 7)  -> (currentNode'=node9path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 8)  -> (currentNode'=node9path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 9)  -> (currentNode'=node9path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 10)  -> (currentNode'=node9path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 11)  -> (currentNode'=node9path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 12)  -> (currentNode'=node9path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 13)  -> (currentNode'=node9path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 14)  -> (currentNode'=node9path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 15)  -> (currentNode'=node9path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 16)  -> (currentNode'=node9path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 17)  -> (currentNode'=node9path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 18)  -> (currentNode'=node9path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 19)  -> (currentNode'=node9path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 20)  -> (currentNode'=node9path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 21)  -> (currentNode'=node9path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 22)  -> (currentNode'=node9path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 23)  -> (currentNode'=node9path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 24)  -> (currentNode'=node9path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 25)  -> (currentNode'=node9path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 26)  -> (currentNode'=node9path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 27)  -> (currentNode'=node9path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 28)  -> (currentNode'=node9path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 29)  -> (currentNode'=node9path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 30)  -> (currentNode'=node9path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 31)  -> (currentNode'=node9path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 32)  -> (currentNode'=node9path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 33)  -> (currentNode'=node9path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 34)  -> (currentNode'=node9path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 35)  -> (currentNode'=node9path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 36)  -> (currentNode'=node9path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 37)  -> (currentNode'=node9path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 38)  -> (currentNode'=node9path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 39)  -> (currentNode'=node9path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 40)  -> (currentNode'=node9path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 41)  -> (currentNode'=node9path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 42)  -> (currentNode'=node9path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 43)  -> (currentNode'=node9path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 44)  -> (currentNode'=node9path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 45)  -> (currentNode'=node9path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 46)  -> (currentNode'=node9path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 47)  -> (currentNode'=node9path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 48)  -> (currentNode'=node9path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 49)  -> (currentNode'=node9path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 50)  -> (currentNode'=node9path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 51)  -> (currentNode'=node9path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 52)  -> (currentNode'=node9path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 53)  -> (currentNode'=node9path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 54)  -> (currentNode'=node9path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 55)  -> (currentNode'=node9path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 56)  -> (currentNode'=node9path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 57)  -> (currentNode'=node9path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 58)  -> (currentNode'=node9path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 59)  -> (currentNode'=node9path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 60)  -> (currentNode'=node9path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 61)  -> (currentNode'=node9path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 62)  -> (currentNode'=node9path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 63)  -> (currentNode'=node9path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 64)  -> (currentNode'=node9path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 65)  -> (currentNode'=node9path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 66)  -> (currentNode'=node9path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 67)  -> (currentNode'=node9path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 68)  -> (currentNode'=node9path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 69)  -> (currentNode'=node9path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 70)  -> (currentNode'=node9path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 71)  -> (currentNode'=node9path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 72)  -> (currentNode'=node9path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 73)  -> (currentNode'=node9path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 74)  -> (currentNode'=node9path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 75)  -> (currentNode'=node9path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 76)  -> (currentNode'=node9path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 77)  -> (currentNode'=node9path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 78)  -> (currentNode'=node9path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 79)  -> (currentNode'=node9path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 80)  -> (currentNode'=node9path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 81)  -> (currentNode'=node9path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 82)  -> (currentNode'=node9path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 83)  -> (currentNode'=node9path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 84)  -> (currentNode'=node9path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 85)  -> (currentNode'=node9path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 86)  -> (currentNode'=node9path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 87)  -> (currentNode'=node9path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 88)  -> (currentNode'=node9path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 89)  -> (currentNode'=node9path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 90)  -> (currentNode'=node9path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 91)  -> (currentNode'=node9path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 92)  -> (currentNode'=node9path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 93)  -> (currentNode'=node9path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 94)  -> (currentNode'=node9path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 95)  -> (currentNode'=node9path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 96)  -> (currentNode'=node9path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 97)  -> (currentNode'=node9path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 98)  -> (currentNode'=node9path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 99)  -> (currentNode'=node9path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 9) & (currentPath = 100)  -> (currentNode'=node9path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 1)  -> (currentNode'=node10path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 2)  -> (currentNode'=node10path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 3)  -> (currentNode'=node10path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 4)  -> (currentNode'=node10path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 5)  -> (currentNode'=node10path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 6)  -> (currentNode'=node10path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 7)  -> (currentNode'=node10path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 8)  -> (currentNode'=node10path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 9)  -> (currentNode'=node10path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 10)  -> (currentNode'=node10path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 11)  -> (currentNode'=node10path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 12)  -> (currentNode'=node10path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 13)  -> (currentNode'=node10path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 14)  -> (currentNode'=node10path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 15)  -> (currentNode'=node10path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 16)  -> (currentNode'=node10path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 17)  -> (currentNode'=node10path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 18)  -> (currentNode'=node10path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 19)  -> (currentNode'=node10path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 20)  -> (currentNode'=node10path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 21)  -> (currentNode'=node10path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 22)  -> (currentNode'=node10path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 23)  -> (currentNode'=node10path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 24)  -> (currentNode'=node10path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 25)  -> (currentNode'=node10path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 26)  -> (currentNode'=node10path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 27)  -> (currentNode'=node10path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 28)  -> (currentNode'=node10path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 29)  -> (currentNode'=node10path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 30)  -> (currentNode'=node10path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 31)  -> (currentNode'=node10path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 32)  -> (currentNode'=node10path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 33)  -> (currentNode'=node10path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 34)  -> (currentNode'=node10path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 35)  -> (currentNode'=node10path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 36)  -> (currentNode'=node10path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 37)  -> (currentNode'=node10path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 38)  -> (currentNode'=node10path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 39)  -> (currentNode'=node10path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 40)  -> (currentNode'=node10path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 41)  -> (currentNode'=node10path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 42)  -> (currentNode'=node10path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 43)  -> (currentNode'=node10path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 44)  -> (currentNode'=node10path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 45)  -> (currentNode'=node10path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 46)  -> (currentNode'=node10path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 47)  -> (currentNode'=node10path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 48)  -> (currentNode'=node10path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 49)  -> (currentNode'=node10path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 50)  -> (currentNode'=node10path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 51)  -> (currentNode'=node10path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 52)  -> (currentNode'=node10path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 53)  -> (currentNode'=node10path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 54)  -> (currentNode'=node10path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 55)  -> (currentNode'=node10path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 56)  -> (currentNode'=node10path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 57)  -> (currentNode'=node10path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 58)  -> (currentNode'=node10path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 59)  -> (currentNode'=node10path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 60)  -> (currentNode'=node10path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 61)  -> (currentNode'=node10path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 62)  -> (currentNode'=node10path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 63)  -> (currentNode'=node10path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 64)  -> (currentNode'=node10path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 65)  -> (currentNode'=node10path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 66)  -> (currentNode'=node10path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 67)  -> (currentNode'=node10path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 68)  -> (currentNode'=node10path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 69)  -> (currentNode'=node10path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 70)  -> (currentNode'=node10path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 71)  -> (currentNode'=node10path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 72)  -> (currentNode'=node10path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 73)  -> (currentNode'=node10path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 74)  -> (currentNode'=node10path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 75)  -> (currentNode'=node10path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 76)  -> (currentNode'=node10path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 77)  -> (currentNode'=node10path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 78)  -> (currentNode'=node10path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 79)  -> (currentNode'=node10path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 80)  -> (currentNode'=node10path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 81)  -> (currentNode'=node10path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 82)  -> (currentNode'=node10path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 83)  -> (currentNode'=node10path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 84)  -> (currentNode'=node10path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 85)  -> (currentNode'=node10path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 86)  -> (currentNode'=node10path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 87)  -> (currentNode'=node10path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 88)  -> (currentNode'=node10path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 89)  -> (currentNode'=node10path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 90)  -> (currentNode'=node10path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 91)  -> (currentNode'=node10path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 92)  -> (currentNode'=node10path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 93)  -> (currentNode'=node10path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 94)  -> (currentNode'=node10path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 95)  -> (currentNode'=node10path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 96)  -> (currentNode'=node10path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 97)  -> (currentNode'=node10path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 98)  -> (currentNode'=node10path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 99)  -> (currentNode'=node10path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 10) & (currentPath = 100)  -> (currentNode'=node10path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 1)  -> (currentNode'=node11path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 2)  -> (currentNode'=node11path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 3)  -> (currentNode'=node11path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 4)  -> (currentNode'=node11path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 5)  -> (currentNode'=node11path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 6)  -> (currentNode'=node11path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 7)  -> (currentNode'=node11path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 8)  -> (currentNode'=node11path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 9)  -> (currentNode'=node11path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 10)  -> (currentNode'=node11path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 11)  -> (currentNode'=node11path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 12)  -> (currentNode'=node11path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 13)  -> (currentNode'=node11path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 14)  -> (currentNode'=node11path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 15)  -> (currentNode'=node11path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 16)  -> (currentNode'=node11path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 17)  -> (currentNode'=node11path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 18)  -> (currentNode'=node11path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 19)  -> (currentNode'=node11path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 20)  -> (currentNode'=node11path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 21)  -> (currentNode'=node11path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 22)  -> (currentNode'=node11path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 23)  -> (currentNode'=node11path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 24)  -> (currentNode'=node11path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 25)  -> (currentNode'=node11path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 26)  -> (currentNode'=node11path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 27)  -> (currentNode'=node11path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 28)  -> (currentNode'=node11path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 29)  -> (currentNode'=node11path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 30)  -> (currentNode'=node11path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 31)  -> (currentNode'=node11path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 32)  -> (currentNode'=node11path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 33)  -> (currentNode'=node11path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 34)  -> (currentNode'=node11path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 35)  -> (currentNode'=node11path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 36)  -> (currentNode'=node11path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 37)  -> (currentNode'=node11path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 38)  -> (currentNode'=node11path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 39)  -> (currentNode'=node11path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 40)  -> (currentNode'=node11path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 41)  -> (currentNode'=node11path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 42)  -> (currentNode'=node11path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 43)  -> (currentNode'=node11path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 44)  -> (currentNode'=node11path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 45)  -> (currentNode'=node11path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 46)  -> (currentNode'=node11path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 47)  -> (currentNode'=node11path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 48)  -> (currentNode'=node11path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 49)  -> (currentNode'=node11path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 50)  -> (currentNode'=node11path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 51)  -> (currentNode'=node11path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 52)  -> (currentNode'=node11path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 53)  -> (currentNode'=node11path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 54)  -> (currentNode'=node11path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 55)  -> (currentNode'=node11path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 56)  -> (currentNode'=node11path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 57)  -> (currentNode'=node11path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 58)  -> (currentNode'=node11path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 59)  -> (currentNode'=node11path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 60)  -> (currentNode'=node11path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 61)  -> (currentNode'=node11path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 62)  -> (currentNode'=node11path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 63)  -> (currentNode'=node11path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 64)  -> (currentNode'=node11path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 65)  -> (currentNode'=node11path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 66)  -> (currentNode'=node11path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 67)  -> (currentNode'=node11path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 68)  -> (currentNode'=node11path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 69)  -> (currentNode'=node11path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 70)  -> (currentNode'=node11path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 71)  -> (currentNode'=node11path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 72)  -> (currentNode'=node11path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 73)  -> (currentNode'=node11path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 74)  -> (currentNode'=node11path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 75)  -> (currentNode'=node11path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 76)  -> (currentNode'=node11path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 77)  -> (currentNode'=node11path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 78)  -> (currentNode'=node11path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 79)  -> (currentNode'=node11path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 80)  -> (currentNode'=node11path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 81)  -> (currentNode'=node11path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 82)  -> (currentNode'=node11path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 83)  -> (currentNode'=node11path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 84)  -> (currentNode'=node11path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 85)  -> (currentNode'=node11path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 86)  -> (currentNode'=node11path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 87)  -> (currentNode'=node11path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 88)  -> (currentNode'=node11path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 89)  -> (currentNode'=node11path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 90)  -> (currentNode'=node11path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 91)  -> (currentNode'=node11path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 92)  -> (currentNode'=node11path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 93)  -> (currentNode'=node11path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 94)  -> (currentNode'=node11path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 95)  -> (currentNode'=node11path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 96)  -> (currentNode'=node11path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 97)  -> (currentNode'=node11path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 98)  -> (currentNode'=node11path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 99)  -> (currentNode'=node11path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 11) & (currentPath = 100)  -> (currentNode'=node11path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 1)  -> (currentNode'=node12path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 2)  -> (currentNode'=node12path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 3)  -> (currentNode'=node12path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 4)  -> (currentNode'=node12path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 5)  -> (currentNode'=node12path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 6)  -> (currentNode'=node12path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 7)  -> (currentNode'=node12path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 8)  -> (currentNode'=node12path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 9)  -> (currentNode'=node12path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 10)  -> (currentNode'=node12path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 11)  -> (currentNode'=node12path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 12)  -> (currentNode'=node12path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 13)  -> (currentNode'=node12path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 14)  -> (currentNode'=node12path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 15)  -> (currentNode'=node12path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 16)  -> (currentNode'=node12path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 17)  -> (currentNode'=node12path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 18)  -> (currentNode'=node12path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 19)  -> (currentNode'=node12path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 20)  -> (currentNode'=node12path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 21)  -> (currentNode'=node12path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 22)  -> (currentNode'=node12path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 23)  -> (currentNode'=node12path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 24)  -> (currentNode'=node12path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 25)  -> (currentNode'=node12path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 26)  -> (currentNode'=node12path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 27)  -> (currentNode'=node12path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 28)  -> (currentNode'=node12path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 29)  -> (currentNode'=node12path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 30)  -> (currentNode'=node12path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 31)  -> (currentNode'=node12path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 32)  -> (currentNode'=node12path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 33)  -> (currentNode'=node12path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 34)  -> (currentNode'=node12path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 35)  -> (currentNode'=node12path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 36)  -> (currentNode'=node12path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 37)  -> (currentNode'=node12path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 38)  -> (currentNode'=node12path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 39)  -> (currentNode'=node12path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 40)  -> (currentNode'=node12path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 41)  -> (currentNode'=node12path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 42)  -> (currentNode'=node12path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 43)  -> (currentNode'=node12path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 44)  -> (currentNode'=node12path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 45)  -> (currentNode'=node12path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 46)  -> (currentNode'=node12path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 47)  -> (currentNode'=node12path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 48)  -> (currentNode'=node12path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 49)  -> (currentNode'=node12path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 50)  -> (currentNode'=node12path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 51)  -> (currentNode'=node12path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 52)  -> (currentNode'=node12path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 53)  -> (currentNode'=node12path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 54)  -> (currentNode'=node12path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 55)  -> (currentNode'=node12path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 56)  -> (currentNode'=node12path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 57)  -> (currentNode'=node12path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 58)  -> (currentNode'=node12path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 59)  -> (currentNode'=node12path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 60)  -> (currentNode'=node12path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 61)  -> (currentNode'=node12path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 62)  -> (currentNode'=node12path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 63)  -> (currentNode'=node12path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 64)  -> (currentNode'=node12path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 65)  -> (currentNode'=node12path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 66)  -> (currentNode'=node12path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 67)  -> (currentNode'=node12path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 68)  -> (currentNode'=node12path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 69)  -> (currentNode'=node12path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 70)  -> (currentNode'=node12path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 71)  -> (currentNode'=node12path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 72)  -> (currentNode'=node12path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 73)  -> (currentNode'=node12path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 74)  -> (currentNode'=node12path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 75)  -> (currentNode'=node12path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 76)  -> (currentNode'=node12path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 77)  -> (currentNode'=node12path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 78)  -> (currentNode'=node12path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 79)  -> (currentNode'=node12path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 80)  -> (currentNode'=node12path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 81)  -> (currentNode'=node12path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 82)  -> (currentNode'=node12path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 83)  -> (currentNode'=node12path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 84)  -> (currentNode'=node12path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 85)  -> (currentNode'=node12path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 86)  -> (currentNode'=node12path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 87)  -> (currentNode'=node12path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 88)  -> (currentNode'=node12path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 89)  -> (currentNode'=node12path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 90)  -> (currentNode'=node12path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 91)  -> (currentNode'=node12path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 92)  -> (currentNode'=node12path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 93)  -> (currentNode'=node12path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 94)  -> (currentNode'=node12path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 95)  -> (currentNode'=node12path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 96)  -> (currentNode'=node12path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 97)  -> (currentNode'=node12path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 98)  -> (currentNode'=node12path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 99)  -> (currentNode'=node12path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 12) & (currentPath = 100)  -> (currentNode'=node12path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 1)  -> (currentNode'=node13path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 2)  -> (currentNode'=node13path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 3)  -> (currentNode'=node13path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 4)  -> (currentNode'=node13path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 5)  -> (currentNode'=node13path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 6)  -> (currentNode'=node13path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 7)  -> (currentNode'=node13path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 8)  -> (currentNode'=node13path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 9)  -> (currentNode'=node13path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 10)  -> (currentNode'=node13path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 11)  -> (currentNode'=node13path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 12)  -> (currentNode'=node13path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 13)  -> (currentNode'=node13path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 14)  -> (currentNode'=node13path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 15)  -> (currentNode'=node13path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 16)  -> (currentNode'=node13path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 17)  -> (currentNode'=node13path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 18)  -> (currentNode'=node13path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 19)  -> (currentNode'=node13path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 20)  -> (currentNode'=node13path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 21)  -> (currentNode'=node13path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 22)  -> (currentNode'=node13path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 23)  -> (currentNode'=node13path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 24)  -> (currentNode'=node13path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 25)  -> (currentNode'=node13path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 26)  -> (currentNode'=node13path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 27)  -> (currentNode'=node13path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 28)  -> (currentNode'=node13path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 29)  -> (currentNode'=node13path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 30)  -> (currentNode'=node13path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 31)  -> (currentNode'=node13path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 32)  -> (currentNode'=node13path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 33)  -> (currentNode'=node13path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 34)  -> (currentNode'=node13path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 35)  -> (currentNode'=node13path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 36)  -> (currentNode'=node13path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 37)  -> (currentNode'=node13path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 38)  -> (currentNode'=node13path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 39)  -> (currentNode'=node13path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 40)  -> (currentNode'=node13path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 41)  -> (currentNode'=node13path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 42)  -> (currentNode'=node13path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 43)  -> (currentNode'=node13path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 44)  -> (currentNode'=node13path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 45)  -> (currentNode'=node13path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 46)  -> (currentNode'=node13path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 47)  -> (currentNode'=node13path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 48)  -> (currentNode'=node13path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 49)  -> (currentNode'=node13path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 50)  -> (currentNode'=node13path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 51)  -> (currentNode'=node13path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 52)  -> (currentNode'=node13path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 53)  -> (currentNode'=node13path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 54)  -> (currentNode'=node13path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 55)  -> (currentNode'=node13path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 56)  -> (currentNode'=node13path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 57)  -> (currentNode'=node13path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 58)  -> (currentNode'=node13path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 59)  -> (currentNode'=node13path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 60)  -> (currentNode'=node13path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 61)  -> (currentNode'=node13path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 62)  -> (currentNode'=node13path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 63)  -> (currentNode'=node13path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 64)  -> (currentNode'=node13path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 65)  -> (currentNode'=node13path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 66)  -> (currentNode'=node13path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 67)  -> (currentNode'=node13path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 68)  -> (currentNode'=node13path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 69)  -> (currentNode'=node13path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 70)  -> (currentNode'=node13path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 71)  -> (currentNode'=node13path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 72)  -> (currentNode'=node13path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 73)  -> (currentNode'=node13path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 74)  -> (currentNode'=node13path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 75)  -> (currentNode'=node13path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 76)  -> (currentNode'=node13path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 77)  -> (currentNode'=node13path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 78)  -> (currentNode'=node13path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 79)  -> (currentNode'=node13path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 80)  -> (currentNode'=node13path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 81)  -> (currentNode'=node13path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 82)  -> (currentNode'=node13path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 83)  -> (currentNode'=node13path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 84)  -> (currentNode'=node13path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 85)  -> (currentNode'=node13path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 86)  -> (currentNode'=node13path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 87)  -> (currentNode'=node13path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 88)  -> (currentNode'=node13path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 89)  -> (currentNode'=node13path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 90)  -> (currentNode'=node13path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 91)  -> (currentNode'=node13path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 92)  -> (currentNode'=node13path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 93)  -> (currentNode'=node13path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 94)  -> (currentNode'=node13path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 95)  -> (currentNode'=node13path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 96)  -> (currentNode'=node13path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 97)  -> (currentNode'=node13path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 98)  -> (currentNode'=node13path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 99)  -> (currentNode'=node13path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 13) & (currentPath = 100)  -> (currentNode'=node13path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 1)  -> (currentNode'=node14path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 2)  -> (currentNode'=node14path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 3)  -> (currentNode'=node14path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 4)  -> (currentNode'=node14path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 5)  -> (currentNode'=node14path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 6)  -> (currentNode'=node14path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 7)  -> (currentNode'=node14path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 8)  -> (currentNode'=node14path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 9)  -> (currentNode'=node14path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 10)  -> (currentNode'=node14path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 11)  -> (currentNode'=node14path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 12)  -> (currentNode'=node14path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 13)  -> (currentNode'=node14path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 14)  -> (currentNode'=node14path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 15)  -> (currentNode'=node14path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 16)  -> (currentNode'=node14path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 17)  -> (currentNode'=node14path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 18)  -> (currentNode'=node14path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 19)  -> (currentNode'=node14path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 20)  -> (currentNode'=node14path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 21)  -> (currentNode'=node14path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 22)  -> (currentNode'=node14path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 23)  -> (currentNode'=node14path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 24)  -> (currentNode'=node14path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 25)  -> (currentNode'=node14path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 26)  -> (currentNode'=node14path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 27)  -> (currentNode'=node14path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 28)  -> (currentNode'=node14path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 29)  -> (currentNode'=node14path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 30)  -> (currentNode'=node14path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 31)  -> (currentNode'=node14path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 32)  -> (currentNode'=node14path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 33)  -> (currentNode'=node14path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 34)  -> (currentNode'=node14path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 35)  -> (currentNode'=node14path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 36)  -> (currentNode'=node14path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 37)  -> (currentNode'=node14path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 38)  -> (currentNode'=node14path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 39)  -> (currentNode'=node14path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 40)  -> (currentNode'=node14path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 41)  -> (currentNode'=node14path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 42)  -> (currentNode'=node14path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 43)  -> (currentNode'=node14path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 44)  -> (currentNode'=node14path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 45)  -> (currentNode'=node14path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 46)  -> (currentNode'=node14path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 47)  -> (currentNode'=node14path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 48)  -> (currentNode'=node14path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 49)  -> (currentNode'=node14path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 50)  -> (currentNode'=node14path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 51)  -> (currentNode'=node14path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 52)  -> (currentNode'=node14path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 53)  -> (currentNode'=node14path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 54)  -> (currentNode'=node14path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 55)  -> (currentNode'=node14path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 56)  -> (currentNode'=node14path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 57)  -> (currentNode'=node14path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 58)  -> (currentNode'=node14path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 59)  -> (currentNode'=node14path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 60)  -> (currentNode'=node14path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 61)  -> (currentNode'=node14path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 62)  -> (currentNode'=node14path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 63)  -> (currentNode'=node14path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 64)  -> (currentNode'=node14path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 65)  -> (currentNode'=node14path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 66)  -> (currentNode'=node14path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 67)  -> (currentNode'=node14path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 68)  -> (currentNode'=node14path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 69)  -> (currentNode'=node14path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 70)  -> (currentNode'=node14path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 71)  -> (currentNode'=node14path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 72)  -> (currentNode'=node14path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 73)  -> (currentNode'=node14path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 74)  -> (currentNode'=node14path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 75)  -> (currentNode'=node14path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 76)  -> (currentNode'=node14path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 77)  -> (currentNode'=node14path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 78)  -> (currentNode'=node14path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 79)  -> (currentNode'=node14path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 80)  -> (currentNode'=node14path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 81)  -> (currentNode'=node14path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 82)  -> (currentNode'=node14path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 83)  -> (currentNode'=node14path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 84)  -> (currentNode'=node14path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 85)  -> (currentNode'=node14path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 86)  -> (currentNode'=node14path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 87)  -> (currentNode'=node14path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 88)  -> (currentNode'=node14path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 89)  -> (currentNode'=node14path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 90)  -> (currentNode'=node14path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 91)  -> (currentNode'=node14path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 92)  -> (currentNode'=node14path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 93)  -> (currentNode'=node14path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 94)  -> (currentNode'=node14path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 95)  -> (currentNode'=node14path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 96)  -> (currentNode'=node14path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 97)  -> (currentNode'=node14path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 98)  -> (currentNode'=node14path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 99)  -> (currentNode'=node14path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 14) & (currentPath = 100)  -> (currentNode'=node14path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 1)  -> (currentNode'=node15path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 2)  -> (currentNode'=node15path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 3)  -> (currentNode'=node15path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 4)  -> (currentNode'=node15path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 5)  -> (currentNode'=node15path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 6)  -> (currentNode'=node15path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 7)  -> (currentNode'=node15path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 8)  -> (currentNode'=node15path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 9)  -> (currentNode'=node15path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 10)  -> (currentNode'=node15path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 11)  -> (currentNode'=node15path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 12)  -> (currentNode'=node15path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 13)  -> (currentNode'=node15path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 14)  -> (currentNode'=node15path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 15)  -> (currentNode'=node15path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 16)  -> (currentNode'=node15path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 17)  -> (currentNode'=node15path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 18)  -> (currentNode'=node15path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 19)  -> (currentNode'=node15path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 20)  -> (currentNode'=node15path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 21)  -> (currentNode'=node15path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 22)  -> (currentNode'=node15path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 23)  -> (currentNode'=node15path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 24)  -> (currentNode'=node15path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 25)  -> (currentNode'=node15path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 26)  -> (currentNode'=node15path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 27)  -> (currentNode'=node15path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 28)  -> (currentNode'=node15path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 29)  -> (currentNode'=node15path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 30)  -> (currentNode'=node15path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 31)  -> (currentNode'=node15path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 32)  -> (currentNode'=node15path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 33)  -> (currentNode'=node15path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 34)  -> (currentNode'=node15path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 35)  -> (currentNode'=node15path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 36)  -> (currentNode'=node15path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 37)  -> (currentNode'=node15path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 38)  -> (currentNode'=node15path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 39)  -> (currentNode'=node15path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 40)  -> (currentNode'=node15path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 41)  -> (currentNode'=node15path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 42)  -> (currentNode'=node15path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 43)  -> (currentNode'=node15path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 44)  -> (currentNode'=node15path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 45)  -> (currentNode'=node15path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 46)  -> (currentNode'=node15path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 47)  -> (currentNode'=node15path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 48)  -> (currentNode'=node15path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 49)  -> (currentNode'=node15path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 50)  -> (currentNode'=node15path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 51)  -> (currentNode'=node15path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 52)  -> (currentNode'=node15path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 53)  -> (currentNode'=node15path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 54)  -> (currentNode'=node15path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 55)  -> (currentNode'=node15path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 56)  -> (currentNode'=node15path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 57)  -> (currentNode'=node15path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 58)  -> (currentNode'=node15path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 59)  -> (currentNode'=node15path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 60)  -> (currentNode'=node15path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 61)  -> (currentNode'=node15path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 62)  -> (currentNode'=node15path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 63)  -> (currentNode'=node15path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 64)  -> (currentNode'=node15path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 65)  -> (currentNode'=node15path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 66)  -> (currentNode'=node15path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 67)  -> (currentNode'=node15path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 68)  -> (currentNode'=node15path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 69)  -> (currentNode'=node15path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 70)  -> (currentNode'=node15path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 71)  -> (currentNode'=node15path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 72)  -> (currentNode'=node15path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 73)  -> (currentNode'=node15path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 74)  -> (currentNode'=node15path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 75)  -> (currentNode'=node15path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 76)  -> (currentNode'=node15path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 77)  -> (currentNode'=node15path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 78)  -> (currentNode'=node15path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 79)  -> (currentNode'=node15path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 80)  -> (currentNode'=node15path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 81)  -> (currentNode'=node15path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 82)  -> (currentNode'=node15path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 83)  -> (currentNode'=node15path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 84)  -> (currentNode'=node15path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 85)  -> (currentNode'=node15path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 86)  -> (currentNode'=node15path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 87)  -> (currentNode'=node15path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 88)  -> (currentNode'=node15path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 89)  -> (currentNode'=node15path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 90)  -> (currentNode'=node15path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 91)  -> (currentNode'=node15path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 92)  -> (currentNode'=node15path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 93)  -> (currentNode'=node15path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 94)  -> (currentNode'=node15path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 95)  -> (currentNode'=node15path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 96)  -> (currentNode'=node15path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 97)  -> (currentNode'=node15path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 98)  -> (currentNode'=node15path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 99)  -> (currentNode'=node15path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 15) & (currentPath = 100)  -> (currentNode'=node15path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 1)  -> (currentNode'=node16path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 2)  -> (currentNode'=node16path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 3)  -> (currentNode'=node16path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 4)  -> (currentNode'=node16path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 5)  -> (currentNode'=node16path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 6)  -> (currentNode'=node16path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 7)  -> (currentNode'=node16path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 8)  -> (currentNode'=node16path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 9)  -> (currentNode'=node16path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 10)  -> (currentNode'=node16path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 11)  -> (currentNode'=node16path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 12)  -> (currentNode'=node16path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 13)  -> (currentNode'=node16path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 14)  -> (currentNode'=node16path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 15)  -> (currentNode'=node16path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 16)  -> (currentNode'=node16path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 17)  -> (currentNode'=node16path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 18)  -> (currentNode'=node16path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 19)  -> (currentNode'=node16path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 20)  -> (currentNode'=node16path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 21)  -> (currentNode'=node16path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 22)  -> (currentNode'=node16path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 23)  -> (currentNode'=node16path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 24)  -> (currentNode'=node16path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 25)  -> (currentNode'=node16path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 26)  -> (currentNode'=node16path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 27)  -> (currentNode'=node16path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 28)  -> (currentNode'=node16path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 29)  -> (currentNode'=node16path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 30)  -> (currentNode'=node16path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 31)  -> (currentNode'=node16path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 32)  -> (currentNode'=node16path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 33)  -> (currentNode'=node16path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 34)  -> (currentNode'=node16path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 35)  -> (currentNode'=node16path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 36)  -> (currentNode'=node16path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 37)  -> (currentNode'=node16path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 38)  -> (currentNode'=node16path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 39)  -> (currentNode'=node16path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 40)  -> (currentNode'=node16path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 41)  -> (currentNode'=node16path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 42)  -> (currentNode'=node16path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 43)  -> (currentNode'=node16path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 44)  -> (currentNode'=node16path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 45)  -> (currentNode'=node16path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 46)  -> (currentNode'=node16path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 47)  -> (currentNode'=node16path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 48)  -> (currentNode'=node16path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 49)  -> (currentNode'=node16path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 50)  -> (currentNode'=node16path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 51)  -> (currentNode'=node16path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 52)  -> (currentNode'=node16path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 53)  -> (currentNode'=node16path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 54)  -> (currentNode'=node16path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 55)  -> (currentNode'=node16path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 56)  -> (currentNode'=node16path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 57)  -> (currentNode'=node16path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 58)  -> (currentNode'=node16path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 59)  -> (currentNode'=node16path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 60)  -> (currentNode'=node16path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 61)  -> (currentNode'=node16path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 62)  -> (currentNode'=node16path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 63)  -> (currentNode'=node16path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 64)  -> (currentNode'=node16path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 65)  -> (currentNode'=node16path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 66)  -> (currentNode'=node16path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 67)  -> (currentNode'=node16path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 68)  -> (currentNode'=node16path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 69)  -> (currentNode'=node16path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 70)  -> (currentNode'=node16path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 71)  -> (currentNode'=node16path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 72)  -> (currentNode'=node16path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 73)  -> (currentNode'=node16path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 74)  -> (currentNode'=node16path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 75)  -> (currentNode'=node16path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 76)  -> (currentNode'=node16path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 77)  -> (currentNode'=node16path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 78)  -> (currentNode'=node16path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 79)  -> (currentNode'=node16path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 80)  -> (currentNode'=node16path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 81)  -> (currentNode'=node16path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 82)  -> (currentNode'=node16path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 83)  -> (currentNode'=node16path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 84)  -> (currentNode'=node16path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 85)  -> (currentNode'=node16path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 86)  -> (currentNode'=node16path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 87)  -> (currentNode'=node16path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 88)  -> (currentNode'=node16path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 89)  -> (currentNode'=node16path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 90)  -> (currentNode'=node16path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 91)  -> (currentNode'=node16path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 92)  -> (currentNode'=node16path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 93)  -> (currentNode'=node16path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 94)  -> (currentNode'=node16path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 95)  -> (currentNode'=node16path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 96)  -> (currentNode'=node16path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 97)  -> (currentNode'=node16path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 98)  -> (currentNode'=node16path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 99)  -> (currentNode'=node16path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 16) & (currentPath = 100)  -> (currentNode'=node16path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 1)  -> (currentNode'=node17path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 2)  -> (currentNode'=node17path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 3)  -> (currentNode'=node17path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 4)  -> (currentNode'=node17path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 5)  -> (currentNode'=node17path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 6)  -> (currentNode'=node17path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 7)  -> (currentNode'=node17path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 8)  -> (currentNode'=node17path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 9)  -> (currentNode'=node17path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 10)  -> (currentNode'=node17path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 11)  -> (currentNode'=node17path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 12)  -> (currentNode'=node17path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 13)  -> (currentNode'=node17path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 14)  -> (currentNode'=node17path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 15)  -> (currentNode'=node17path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 16)  -> (currentNode'=node17path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 17)  -> (currentNode'=node17path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 18)  -> (currentNode'=node17path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 19)  -> (currentNode'=node17path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 20)  -> (currentNode'=node17path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 21)  -> (currentNode'=node17path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 22)  -> (currentNode'=node17path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 23)  -> (currentNode'=node17path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 24)  -> (currentNode'=node17path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 25)  -> (currentNode'=node17path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 26)  -> (currentNode'=node17path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 27)  -> (currentNode'=node17path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 28)  -> (currentNode'=node17path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 29)  -> (currentNode'=node17path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 30)  -> (currentNode'=node17path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 31)  -> (currentNode'=node17path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 32)  -> (currentNode'=node17path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 33)  -> (currentNode'=node17path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 34)  -> (currentNode'=node17path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 35)  -> (currentNode'=node17path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 36)  -> (currentNode'=node17path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 37)  -> (currentNode'=node17path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 38)  -> (currentNode'=node17path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 39)  -> (currentNode'=node17path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 40)  -> (currentNode'=node17path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 41)  -> (currentNode'=node17path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 42)  -> (currentNode'=node17path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 43)  -> (currentNode'=node17path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 44)  -> (currentNode'=node17path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 45)  -> (currentNode'=node17path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 46)  -> (currentNode'=node17path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 47)  -> (currentNode'=node17path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 48)  -> (currentNode'=node17path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 49)  -> (currentNode'=node17path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 50)  -> (currentNode'=node17path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 51)  -> (currentNode'=node17path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 52)  -> (currentNode'=node17path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 53)  -> (currentNode'=node17path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 54)  -> (currentNode'=node17path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 55)  -> (currentNode'=node17path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 56)  -> (currentNode'=node17path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 57)  -> (currentNode'=node17path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 58)  -> (currentNode'=node17path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 59)  -> (currentNode'=node17path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 60)  -> (currentNode'=node17path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 61)  -> (currentNode'=node17path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 62)  -> (currentNode'=node17path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 63)  -> (currentNode'=node17path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 64)  -> (currentNode'=node17path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 65)  -> (currentNode'=node17path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 66)  -> (currentNode'=node17path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 67)  -> (currentNode'=node17path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 68)  -> (currentNode'=node17path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 69)  -> (currentNode'=node17path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 70)  -> (currentNode'=node17path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 71)  -> (currentNode'=node17path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 72)  -> (currentNode'=node17path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 73)  -> (currentNode'=node17path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 74)  -> (currentNode'=node17path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 75)  -> (currentNode'=node17path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 76)  -> (currentNode'=node17path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 77)  -> (currentNode'=node17path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 78)  -> (currentNode'=node17path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 79)  -> (currentNode'=node17path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 80)  -> (currentNode'=node17path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 81)  -> (currentNode'=node17path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 82)  -> (currentNode'=node17path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 83)  -> (currentNode'=node17path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 84)  -> (currentNode'=node17path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 85)  -> (currentNode'=node17path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 86)  -> (currentNode'=node17path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 87)  -> (currentNode'=node17path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 88)  -> (currentNode'=node17path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 89)  -> (currentNode'=node17path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 90)  -> (currentNode'=node17path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 91)  -> (currentNode'=node17path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 92)  -> (currentNode'=node17path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 93)  -> (currentNode'=node17path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 94)  -> (currentNode'=node17path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 95)  -> (currentNode'=node17path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 96)  -> (currentNode'=node17path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 97)  -> (currentNode'=node17path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 98)  -> (currentNode'=node17path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 99)  -> (currentNode'=node17path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 17) & (currentPath = 100)  -> (currentNode'=node17path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 1)  -> (currentNode'=node18path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 2)  -> (currentNode'=node18path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 3)  -> (currentNode'=node18path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 4)  -> (currentNode'=node18path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 5)  -> (currentNode'=node18path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 6)  -> (currentNode'=node18path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 7)  -> (currentNode'=node18path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 8)  -> (currentNode'=node18path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 9)  -> (currentNode'=node18path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 10)  -> (currentNode'=node18path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 11)  -> (currentNode'=node18path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 12)  -> (currentNode'=node18path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 13)  -> (currentNode'=node18path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 14)  -> (currentNode'=node18path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 15)  -> (currentNode'=node18path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 16)  -> (currentNode'=node18path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 17)  -> (currentNode'=node18path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 18)  -> (currentNode'=node18path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 19)  -> (currentNode'=node18path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 20)  -> (currentNode'=node18path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 21)  -> (currentNode'=node18path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 22)  -> (currentNode'=node18path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 23)  -> (currentNode'=node18path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 24)  -> (currentNode'=node18path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 25)  -> (currentNode'=node18path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 26)  -> (currentNode'=node18path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 27)  -> (currentNode'=node18path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 28)  -> (currentNode'=node18path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 29)  -> (currentNode'=node18path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 30)  -> (currentNode'=node18path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 31)  -> (currentNode'=node18path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 32)  -> (currentNode'=node18path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 33)  -> (currentNode'=node18path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 34)  -> (currentNode'=node18path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 35)  -> (currentNode'=node18path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 36)  -> (currentNode'=node18path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 37)  -> (currentNode'=node18path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 38)  -> (currentNode'=node18path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 39)  -> (currentNode'=node18path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 40)  -> (currentNode'=node18path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 41)  -> (currentNode'=node18path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 42)  -> (currentNode'=node18path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 43)  -> (currentNode'=node18path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 44)  -> (currentNode'=node18path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 45)  -> (currentNode'=node18path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 46)  -> (currentNode'=node18path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 47)  -> (currentNode'=node18path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 48)  -> (currentNode'=node18path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 49)  -> (currentNode'=node18path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 50)  -> (currentNode'=node18path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 51)  -> (currentNode'=node18path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 52)  -> (currentNode'=node18path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 53)  -> (currentNode'=node18path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 54)  -> (currentNode'=node18path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 55)  -> (currentNode'=node18path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 56)  -> (currentNode'=node18path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 57)  -> (currentNode'=node18path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 58)  -> (currentNode'=node18path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 59)  -> (currentNode'=node18path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 60)  -> (currentNode'=node18path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 61)  -> (currentNode'=node18path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 62)  -> (currentNode'=node18path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 63)  -> (currentNode'=node18path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 64)  -> (currentNode'=node18path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 65)  -> (currentNode'=node18path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 66)  -> (currentNode'=node18path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 67)  -> (currentNode'=node18path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 68)  -> (currentNode'=node18path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 69)  -> (currentNode'=node18path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 70)  -> (currentNode'=node18path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 71)  -> (currentNode'=node18path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 72)  -> (currentNode'=node18path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 73)  -> (currentNode'=node18path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 74)  -> (currentNode'=node18path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 75)  -> (currentNode'=node18path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 76)  -> (currentNode'=node18path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 77)  -> (currentNode'=node18path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 78)  -> (currentNode'=node18path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 79)  -> (currentNode'=node18path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 80)  -> (currentNode'=node18path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 81)  -> (currentNode'=node18path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 82)  -> (currentNode'=node18path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 83)  -> (currentNode'=node18path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 84)  -> (currentNode'=node18path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 85)  -> (currentNode'=node18path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 86)  -> (currentNode'=node18path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 87)  -> (currentNode'=node18path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 88)  -> (currentNode'=node18path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 89)  -> (currentNode'=node18path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 90)  -> (currentNode'=node18path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 91)  -> (currentNode'=node18path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 92)  -> (currentNode'=node18path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 93)  -> (currentNode'=node18path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 94)  -> (currentNode'=node18path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 95)  -> (currentNode'=node18path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 96)  -> (currentNode'=node18path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 97)  -> (currentNode'=node18path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 98)  -> (currentNode'=node18path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 99)  -> (currentNode'=node18path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 18) & (currentPath = 100)  -> (currentNode'=node18path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 1)  -> (currentNode'=node19path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 2)  -> (currentNode'=node19path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 3)  -> (currentNode'=node19path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 4)  -> (currentNode'=node19path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 5)  -> (currentNode'=node19path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 6)  -> (currentNode'=node19path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 7)  -> (currentNode'=node19path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 8)  -> (currentNode'=node19path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 9)  -> (currentNode'=node19path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 10)  -> (currentNode'=node19path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 11)  -> (currentNode'=node19path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 12)  -> (currentNode'=node19path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 13)  -> (currentNode'=node19path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 14)  -> (currentNode'=node19path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 15)  -> (currentNode'=node19path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 16)  -> (currentNode'=node19path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 17)  -> (currentNode'=node19path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 18)  -> (currentNode'=node19path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 19)  -> (currentNode'=node19path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 20)  -> (currentNode'=node19path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 21)  -> (currentNode'=node19path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 22)  -> (currentNode'=node19path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 23)  -> (currentNode'=node19path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 24)  -> (currentNode'=node19path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 25)  -> (currentNode'=node19path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 26)  -> (currentNode'=node19path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 27)  -> (currentNode'=node19path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 28)  -> (currentNode'=node19path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 29)  -> (currentNode'=node19path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 30)  -> (currentNode'=node19path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 31)  -> (currentNode'=node19path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 32)  -> (currentNode'=node19path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 33)  -> (currentNode'=node19path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 34)  -> (currentNode'=node19path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 35)  -> (currentNode'=node19path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 36)  -> (currentNode'=node19path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 37)  -> (currentNode'=node19path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 38)  -> (currentNode'=node19path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 39)  -> (currentNode'=node19path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 40)  -> (currentNode'=node19path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 41)  -> (currentNode'=node19path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 42)  -> (currentNode'=node19path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 43)  -> (currentNode'=node19path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 44)  -> (currentNode'=node19path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 45)  -> (currentNode'=node19path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 46)  -> (currentNode'=node19path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 47)  -> (currentNode'=node19path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 48)  -> (currentNode'=node19path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 49)  -> (currentNode'=node19path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 50)  -> (currentNode'=node19path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 51)  -> (currentNode'=node19path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 52)  -> (currentNode'=node19path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 53)  -> (currentNode'=node19path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 54)  -> (currentNode'=node19path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 55)  -> (currentNode'=node19path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 56)  -> (currentNode'=node19path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 57)  -> (currentNode'=node19path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 58)  -> (currentNode'=node19path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 59)  -> (currentNode'=node19path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 60)  -> (currentNode'=node19path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 61)  -> (currentNode'=node19path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 62)  -> (currentNode'=node19path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 63)  -> (currentNode'=node19path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 64)  -> (currentNode'=node19path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 65)  -> (currentNode'=node19path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 66)  -> (currentNode'=node19path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 67)  -> (currentNode'=node19path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 68)  -> (currentNode'=node19path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 69)  -> (currentNode'=node19path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 70)  -> (currentNode'=node19path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 71)  -> (currentNode'=node19path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 72)  -> (currentNode'=node19path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 73)  -> (currentNode'=node19path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 74)  -> (currentNode'=node19path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 75)  -> (currentNode'=node19path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 76)  -> (currentNode'=node19path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 77)  -> (currentNode'=node19path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 78)  -> (currentNode'=node19path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 79)  -> (currentNode'=node19path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 80)  -> (currentNode'=node19path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 81)  -> (currentNode'=node19path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 82)  -> (currentNode'=node19path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 83)  -> (currentNode'=node19path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 84)  -> (currentNode'=node19path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 85)  -> (currentNode'=node19path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 86)  -> (currentNode'=node19path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 87)  -> (currentNode'=node19path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 88)  -> (currentNode'=node19path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 89)  -> (currentNode'=node19path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 90)  -> (currentNode'=node19path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 91)  -> (currentNode'=node19path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 92)  -> (currentNode'=node19path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 93)  -> (currentNode'=node19path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 94)  -> (currentNode'=node19path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 95)  -> (currentNode'=node19path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 96)  -> (currentNode'=node19path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 97)  -> (currentNode'=node19path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 98)  -> (currentNode'=node19path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 99)  -> (currentNode'=node19path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 19) & (currentPath = 100)  -> (currentNode'=node19path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 1)  -> (currentNode'=node20path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 2)  -> (currentNode'=node20path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 3)  -> (currentNode'=node20path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 4)  -> (currentNode'=node20path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 5)  -> (currentNode'=node20path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 6)  -> (currentNode'=node20path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 7)  -> (currentNode'=node20path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 8)  -> (currentNode'=node20path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 9)  -> (currentNode'=node20path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 10)  -> (currentNode'=node20path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 11)  -> (currentNode'=node20path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 12)  -> (currentNode'=node20path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 13)  -> (currentNode'=node20path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 14)  -> (currentNode'=node20path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 15)  -> (currentNode'=node20path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 16)  -> (currentNode'=node20path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 17)  -> (currentNode'=node20path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 18)  -> (currentNode'=node20path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 19)  -> (currentNode'=node20path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 20)  -> (currentNode'=node20path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 21)  -> (currentNode'=node20path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 22)  -> (currentNode'=node20path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 23)  -> (currentNode'=node20path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 24)  -> (currentNode'=node20path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 25)  -> (currentNode'=node20path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 26)  -> (currentNode'=node20path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 27)  -> (currentNode'=node20path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 28)  -> (currentNode'=node20path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 29)  -> (currentNode'=node20path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 30)  -> (currentNode'=node20path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 31)  -> (currentNode'=node20path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 32)  -> (currentNode'=node20path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 33)  -> (currentNode'=node20path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 34)  -> (currentNode'=node20path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 35)  -> (currentNode'=node20path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 36)  -> (currentNode'=node20path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 37)  -> (currentNode'=node20path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 38)  -> (currentNode'=node20path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 39)  -> (currentNode'=node20path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 40)  -> (currentNode'=node20path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 41)  -> (currentNode'=node20path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 42)  -> (currentNode'=node20path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 43)  -> (currentNode'=node20path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 44)  -> (currentNode'=node20path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 45)  -> (currentNode'=node20path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 46)  -> (currentNode'=node20path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 47)  -> (currentNode'=node20path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 48)  -> (currentNode'=node20path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 49)  -> (currentNode'=node20path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 50)  -> (currentNode'=node20path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 51)  -> (currentNode'=node20path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 52)  -> (currentNode'=node20path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 53)  -> (currentNode'=node20path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 54)  -> (currentNode'=node20path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 55)  -> (currentNode'=node20path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 56)  -> (currentNode'=node20path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 57)  -> (currentNode'=node20path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 58)  -> (currentNode'=node20path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 59)  -> (currentNode'=node20path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 60)  -> (currentNode'=node20path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 61)  -> (currentNode'=node20path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 62)  -> (currentNode'=node20path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 63)  -> (currentNode'=node20path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 64)  -> (currentNode'=node20path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 65)  -> (currentNode'=node20path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 66)  -> (currentNode'=node20path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 67)  -> (currentNode'=node20path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 68)  -> (currentNode'=node20path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 69)  -> (currentNode'=node20path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 70)  -> (currentNode'=node20path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 71)  -> (currentNode'=node20path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 72)  -> (currentNode'=node20path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 73)  -> (currentNode'=node20path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 74)  -> (currentNode'=node20path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 75)  -> (currentNode'=node20path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 76)  -> (currentNode'=node20path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 77)  -> (currentNode'=node20path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 78)  -> (currentNode'=node20path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 79)  -> (currentNode'=node20path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 80)  -> (currentNode'=node20path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 81)  -> (currentNode'=node20path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 82)  -> (currentNode'=node20path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 83)  -> (currentNode'=node20path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 84)  -> (currentNode'=node20path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 85)  -> (currentNode'=node20path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 86)  -> (currentNode'=node20path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 87)  -> (currentNode'=node20path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 88)  -> (currentNode'=node20path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 89)  -> (currentNode'=node20path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 90)  -> (currentNode'=node20path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 91)  -> (currentNode'=node20path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 92)  -> (currentNode'=node20path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 93)  -> (currentNode'=node20path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 94)  -> (currentNode'=node20path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 95)  -> (currentNode'=node20path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 96)  -> (currentNode'=node20path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 97)  -> (currentNode'=node20path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 98)  -> (currentNode'=node20path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 99)  -> (currentNode'=node20path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 20) & (currentPath = 100)  -> (currentNode'=node20path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 1)  -> (currentNode'=node21path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 2)  -> (currentNode'=node21path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 3)  -> (currentNode'=node21path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 4)  -> (currentNode'=node21path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 5)  -> (currentNode'=node21path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 6)  -> (currentNode'=node21path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 7)  -> (currentNode'=node21path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 8)  -> (currentNode'=node21path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 9)  -> (currentNode'=node21path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 10)  -> (currentNode'=node21path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 11)  -> (currentNode'=node21path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 12)  -> (currentNode'=node21path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 13)  -> (currentNode'=node21path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 14)  -> (currentNode'=node21path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 15)  -> (currentNode'=node21path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 16)  -> (currentNode'=node21path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 17)  -> (currentNode'=node21path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 18)  -> (currentNode'=node21path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 19)  -> (currentNode'=node21path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 20)  -> (currentNode'=node21path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 21)  -> (currentNode'=node21path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 22)  -> (currentNode'=node21path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 23)  -> (currentNode'=node21path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 24)  -> (currentNode'=node21path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 25)  -> (currentNode'=node21path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 26)  -> (currentNode'=node21path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 27)  -> (currentNode'=node21path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 28)  -> (currentNode'=node21path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 29)  -> (currentNode'=node21path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 30)  -> (currentNode'=node21path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 31)  -> (currentNode'=node21path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 32)  -> (currentNode'=node21path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 33)  -> (currentNode'=node21path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 34)  -> (currentNode'=node21path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 35)  -> (currentNode'=node21path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 36)  -> (currentNode'=node21path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 37)  -> (currentNode'=node21path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 38)  -> (currentNode'=node21path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 39)  -> (currentNode'=node21path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 40)  -> (currentNode'=node21path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 41)  -> (currentNode'=node21path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 42)  -> (currentNode'=node21path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 43)  -> (currentNode'=node21path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 44)  -> (currentNode'=node21path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 45)  -> (currentNode'=node21path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 46)  -> (currentNode'=node21path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 47)  -> (currentNode'=node21path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 48)  -> (currentNode'=node21path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 49)  -> (currentNode'=node21path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 50)  -> (currentNode'=node21path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 51)  -> (currentNode'=node21path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 52)  -> (currentNode'=node21path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 53)  -> (currentNode'=node21path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 54)  -> (currentNode'=node21path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 55)  -> (currentNode'=node21path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 56)  -> (currentNode'=node21path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 57)  -> (currentNode'=node21path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 58)  -> (currentNode'=node21path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 59)  -> (currentNode'=node21path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 60)  -> (currentNode'=node21path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 61)  -> (currentNode'=node21path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 62)  -> (currentNode'=node21path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 63)  -> (currentNode'=node21path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 64)  -> (currentNode'=node21path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 65)  -> (currentNode'=node21path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 66)  -> (currentNode'=node21path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 67)  -> (currentNode'=node21path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 68)  -> (currentNode'=node21path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 69)  -> (currentNode'=node21path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 70)  -> (currentNode'=node21path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 71)  -> (currentNode'=node21path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 72)  -> (currentNode'=node21path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 73)  -> (currentNode'=node21path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 74)  -> (currentNode'=node21path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 75)  -> (currentNode'=node21path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 76)  -> (currentNode'=node21path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 77)  -> (currentNode'=node21path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 78)  -> (currentNode'=node21path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 79)  -> (currentNode'=node21path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 80)  -> (currentNode'=node21path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 81)  -> (currentNode'=node21path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 82)  -> (currentNode'=node21path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 83)  -> (currentNode'=node21path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 84)  -> (currentNode'=node21path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 85)  -> (currentNode'=node21path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 86)  -> (currentNode'=node21path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 87)  -> (currentNode'=node21path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 88)  -> (currentNode'=node21path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 89)  -> (currentNode'=node21path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 90)  -> (currentNode'=node21path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 91)  -> (currentNode'=node21path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 92)  -> (currentNode'=node21path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 93)  -> (currentNode'=node21path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 94)  -> (currentNode'=node21path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 95)  -> (currentNode'=node21path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 96)  -> (currentNode'=node21path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 97)  -> (currentNode'=node21path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 98)  -> (currentNode'=node21path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 99)  -> (currentNode'=node21path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 21) & (currentPath = 100)  -> (currentNode'=node21path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 1)  -> (currentNode'=node22path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 2)  -> (currentNode'=node22path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 3)  -> (currentNode'=node22path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 4)  -> (currentNode'=node22path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 5)  -> (currentNode'=node22path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 6)  -> (currentNode'=node22path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 7)  -> (currentNode'=node22path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 8)  -> (currentNode'=node22path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 9)  -> (currentNode'=node22path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 10)  -> (currentNode'=node22path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 11)  -> (currentNode'=node22path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 12)  -> (currentNode'=node22path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 13)  -> (currentNode'=node22path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 14)  -> (currentNode'=node22path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 15)  -> (currentNode'=node22path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 16)  -> (currentNode'=node22path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 17)  -> (currentNode'=node22path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 18)  -> (currentNode'=node22path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 19)  -> (currentNode'=node22path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 20)  -> (currentNode'=node22path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 21)  -> (currentNode'=node22path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 22)  -> (currentNode'=node22path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 23)  -> (currentNode'=node22path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 24)  -> (currentNode'=node22path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 25)  -> (currentNode'=node22path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 26)  -> (currentNode'=node22path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 27)  -> (currentNode'=node22path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 28)  -> (currentNode'=node22path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 29)  -> (currentNode'=node22path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 30)  -> (currentNode'=node22path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 31)  -> (currentNode'=node22path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 32)  -> (currentNode'=node22path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 33)  -> (currentNode'=node22path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 34)  -> (currentNode'=node22path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 35)  -> (currentNode'=node22path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 36)  -> (currentNode'=node22path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 37)  -> (currentNode'=node22path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 38)  -> (currentNode'=node22path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 39)  -> (currentNode'=node22path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 40)  -> (currentNode'=node22path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 41)  -> (currentNode'=node22path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 42)  -> (currentNode'=node22path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 43)  -> (currentNode'=node22path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 44)  -> (currentNode'=node22path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 45)  -> (currentNode'=node22path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 46)  -> (currentNode'=node22path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 47)  -> (currentNode'=node22path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 48)  -> (currentNode'=node22path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 49)  -> (currentNode'=node22path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 50)  -> (currentNode'=node22path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 51)  -> (currentNode'=node22path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 52)  -> (currentNode'=node22path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 53)  -> (currentNode'=node22path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 54)  -> (currentNode'=node22path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 55)  -> (currentNode'=node22path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 56)  -> (currentNode'=node22path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 57)  -> (currentNode'=node22path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 58)  -> (currentNode'=node22path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 59)  -> (currentNode'=node22path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 60)  -> (currentNode'=node22path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 61)  -> (currentNode'=node22path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 62)  -> (currentNode'=node22path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 63)  -> (currentNode'=node22path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 64)  -> (currentNode'=node22path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 65)  -> (currentNode'=node22path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 66)  -> (currentNode'=node22path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 67)  -> (currentNode'=node22path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 68)  -> (currentNode'=node22path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 69)  -> (currentNode'=node22path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 70)  -> (currentNode'=node22path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 71)  -> (currentNode'=node22path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 72)  -> (currentNode'=node22path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 73)  -> (currentNode'=node22path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 74)  -> (currentNode'=node22path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 75)  -> (currentNode'=node22path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 76)  -> (currentNode'=node22path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 77)  -> (currentNode'=node22path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 78)  -> (currentNode'=node22path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 79)  -> (currentNode'=node22path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 80)  -> (currentNode'=node22path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 81)  -> (currentNode'=node22path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 82)  -> (currentNode'=node22path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 83)  -> (currentNode'=node22path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 84)  -> (currentNode'=node22path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 85)  -> (currentNode'=node22path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 86)  -> (currentNode'=node22path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 87)  -> (currentNode'=node22path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 88)  -> (currentNode'=node22path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 89)  -> (currentNode'=node22path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 90)  -> (currentNode'=node22path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 91)  -> (currentNode'=node22path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 92)  -> (currentNode'=node22path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 93)  -> (currentNode'=node22path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 94)  -> (currentNode'=node22path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 95)  -> (currentNode'=node22path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 96)  -> (currentNode'=node22path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 97)  -> (currentNode'=node22path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 98)  -> (currentNode'=node22path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 99)  -> (currentNode'=node22path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 22) & (currentPath = 100)  -> (currentNode'=node22path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 1)  -> (currentNode'=node23path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 2)  -> (currentNode'=node23path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 3)  -> (currentNode'=node23path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 4)  -> (currentNode'=node23path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 5)  -> (currentNode'=node23path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 6)  -> (currentNode'=node23path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 7)  -> (currentNode'=node23path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 8)  -> (currentNode'=node23path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 9)  -> (currentNode'=node23path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 10)  -> (currentNode'=node23path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 11)  -> (currentNode'=node23path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 12)  -> (currentNode'=node23path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 13)  -> (currentNode'=node23path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 14)  -> (currentNode'=node23path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 15)  -> (currentNode'=node23path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 16)  -> (currentNode'=node23path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 17)  -> (currentNode'=node23path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 18)  -> (currentNode'=node23path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 19)  -> (currentNode'=node23path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 20)  -> (currentNode'=node23path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 21)  -> (currentNode'=node23path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 22)  -> (currentNode'=node23path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 23)  -> (currentNode'=node23path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 24)  -> (currentNode'=node23path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 25)  -> (currentNode'=node23path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 26)  -> (currentNode'=node23path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 27)  -> (currentNode'=node23path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 28)  -> (currentNode'=node23path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 29)  -> (currentNode'=node23path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 30)  -> (currentNode'=node23path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 31)  -> (currentNode'=node23path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 32)  -> (currentNode'=node23path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 33)  -> (currentNode'=node23path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 34)  -> (currentNode'=node23path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 35)  -> (currentNode'=node23path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 36)  -> (currentNode'=node23path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 37)  -> (currentNode'=node23path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 38)  -> (currentNode'=node23path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 39)  -> (currentNode'=node23path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 40)  -> (currentNode'=node23path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 41)  -> (currentNode'=node23path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 42)  -> (currentNode'=node23path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 43)  -> (currentNode'=node23path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 44)  -> (currentNode'=node23path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 45)  -> (currentNode'=node23path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 46)  -> (currentNode'=node23path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 47)  -> (currentNode'=node23path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 48)  -> (currentNode'=node23path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 49)  -> (currentNode'=node23path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 50)  -> (currentNode'=node23path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 51)  -> (currentNode'=node23path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 52)  -> (currentNode'=node23path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 53)  -> (currentNode'=node23path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 54)  -> (currentNode'=node23path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 55)  -> (currentNode'=node23path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 56)  -> (currentNode'=node23path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 57)  -> (currentNode'=node23path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 58)  -> (currentNode'=node23path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 59)  -> (currentNode'=node23path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 60)  -> (currentNode'=node23path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 61)  -> (currentNode'=node23path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 62)  -> (currentNode'=node23path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 63)  -> (currentNode'=node23path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 64)  -> (currentNode'=node23path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 65)  -> (currentNode'=node23path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 66)  -> (currentNode'=node23path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 67)  -> (currentNode'=node23path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 68)  -> (currentNode'=node23path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 69)  -> (currentNode'=node23path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 70)  -> (currentNode'=node23path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 71)  -> (currentNode'=node23path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 72)  -> (currentNode'=node23path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 73)  -> (currentNode'=node23path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 74)  -> (currentNode'=node23path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 75)  -> (currentNode'=node23path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 76)  -> (currentNode'=node23path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 77)  -> (currentNode'=node23path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 78)  -> (currentNode'=node23path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 79)  -> (currentNode'=node23path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 80)  -> (currentNode'=node23path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 81)  -> (currentNode'=node23path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 82)  -> (currentNode'=node23path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 83)  -> (currentNode'=node23path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 84)  -> (currentNode'=node23path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 85)  -> (currentNode'=node23path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 86)  -> (currentNode'=node23path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 87)  -> (currentNode'=node23path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 88)  -> (currentNode'=node23path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 89)  -> (currentNode'=node23path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 90)  -> (currentNode'=node23path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 91)  -> (currentNode'=node23path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 92)  -> (currentNode'=node23path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 93)  -> (currentNode'=node23path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 94)  -> (currentNode'=node23path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 95)  -> (currentNode'=node23path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 96)  -> (currentNode'=node23path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 97)  -> (currentNode'=node23path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 98)  -> (currentNode'=node23path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 99)  -> (currentNode'=node23path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 23) & (currentPath = 100)  -> (currentNode'=node23path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 1)  -> (currentNode'=node24path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 2)  -> (currentNode'=node24path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 3)  -> (currentNode'=node24path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 4)  -> (currentNode'=node24path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 5)  -> (currentNode'=node24path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 6)  -> (currentNode'=node24path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 7)  -> (currentNode'=node24path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 8)  -> (currentNode'=node24path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 9)  -> (currentNode'=node24path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 10)  -> (currentNode'=node24path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 11)  -> (currentNode'=node24path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 12)  -> (currentNode'=node24path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 13)  -> (currentNode'=node24path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 14)  -> (currentNode'=node24path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 15)  -> (currentNode'=node24path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 16)  -> (currentNode'=node24path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 17)  -> (currentNode'=node24path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 18)  -> (currentNode'=node24path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 19)  -> (currentNode'=node24path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 20)  -> (currentNode'=node24path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 21)  -> (currentNode'=node24path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 22)  -> (currentNode'=node24path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 23)  -> (currentNode'=node24path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 24)  -> (currentNode'=node24path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 25)  -> (currentNode'=node24path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 26)  -> (currentNode'=node24path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 27)  -> (currentNode'=node24path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 28)  -> (currentNode'=node24path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 29)  -> (currentNode'=node24path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 30)  -> (currentNode'=node24path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 31)  -> (currentNode'=node24path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 32)  -> (currentNode'=node24path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 33)  -> (currentNode'=node24path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 34)  -> (currentNode'=node24path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 35)  -> (currentNode'=node24path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 36)  -> (currentNode'=node24path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 37)  -> (currentNode'=node24path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 38)  -> (currentNode'=node24path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 39)  -> (currentNode'=node24path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 40)  -> (currentNode'=node24path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 41)  -> (currentNode'=node24path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 42)  -> (currentNode'=node24path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 43)  -> (currentNode'=node24path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 44)  -> (currentNode'=node24path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 45)  -> (currentNode'=node24path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 46)  -> (currentNode'=node24path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 47)  -> (currentNode'=node24path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 48)  -> (currentNode'=node24path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 49)  -> (currentNode'=node24path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 50)  -> (currentNode'=node24path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 51)  -> (currentNode'=node24path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 52)  -> (currentNode'=node24path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 53)  -> (currentNode'=node24path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 54)  -> (currentNode'=node24path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 55)  -> (currentNode'=node24path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 56)  -> (currentNode'=node24path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 57)  -> (currentNode'=node24path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 58)  -> (currentNode'=node24path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 59)  -> (currentNode'=node24path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 60)  -> (currentNode'=node24path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 61)  -> (currentNode'=node24path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 62)  -> (currentNode'=node24path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 63)  -> (currentNode'=node24path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 64)  -> (currentNode'=node24path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 65)  -> (currentNode'=node24path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 66)  -> (currentNode'=node24path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 67)  -> (currentNode'=node24path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 68)  -> (currentNode'=node24path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 69)  -> (currentNode'=node24path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 70)  -> (currentNode'=node24path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 71)  -> (currentNode'=node24path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 72)  -> (currentNode'=node24path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 73)  -> (currentNode'=node24path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 74)  -> (currentNode'=node24path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 75)  -> (currentNode'=node24path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 76)  -> (currentNode'=node24path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 77)  -> (currentNode'=node24path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 78)  -> (currentNode'=node24path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 79)  -> (currentNode'=node24path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 80)  -> (currentNode'=node24path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 81)  -> (currentNode'=node24path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 82)  -> (currentNode'=node24path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 83)  -> (currentNode'=node24path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 84)  -> (currentNode'=node24path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 85)  -> (currentNode'=node24path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 86)  -> (currentNode'=node24path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 87)  -> (currentNode'=node24path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 88)  -> (currentNode'=node24path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 89)  -> (currentNode'=node24path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 90)  -> (currentNode'=node24path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 91)  -> (currentNode'=node24path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 92)  -> (currentNode'=node24path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 93)  -> (currentNode'=node24path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 94)  -> (currentNode'=node24path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 95)  -> (currentNode'=node24path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 96)  -> (currentNode'=node24path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 97)  -> (currentNode'=node24path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 98)  -> (currentNode'=node24path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 99)  -> (currentNode'=node24path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 24) & (currentPath = 100)  -> (currentNode'=node24path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 1)  -> (currentNode'=node25path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 2)  -> (currentNode'=node25path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 3)  -> (currentNode'=node25path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 4)  -> (currentNode'=node25path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 5)  -> (currentNode'=node25path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 6)  -> (currentNode'=node25path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 7)  -> (currentNode'=node25path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 8)  -> (currentNode'=node25path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 9)  -> (currentNode'=node25path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 10)  -> (currentNode'=node25path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 11)  -> (currentNode'=node25path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 12)  -> (currentNode'=node25path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 13)  -> (currentNode'=node25path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 14)  -> (currentNode'=node25path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 15)  -> (currentNode'=node25path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 16)  -> (currentNode'=node25path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 17)  -> (currentNode'=node25path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 18)  -> (currentNode'=node25path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 19)  -> (currentNode'=node25path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 20)  -> (currentNode'=node25path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 21)  -> (currentNode'=node25path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 22)  -> (currentNode'=node25path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 23)  -> (currentNode'=node25path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 24)  -> (currentNode'=node25path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 25)  -> (currentNode'=node25path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 26)  -> (currentNode'=node25path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 27)  -> (currentNode'=node25path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 28)  -> (currentNode'=node25path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 29)  -> (currentNode'=node25path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 30)  -> (currentNode'=node25path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 31)  -> (currentNode'=node25path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 32)  -> (currentNode'=node25path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 33)  -> (currentNode'=node25path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 34)  -> (currentNode'=node25path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 35)  -> (currentNode'=node25path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 36)  -> (currentNode'=node25path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 37)  -> (currentNode'=node25path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 38)  -> (currentNode'=node25path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 39)  -> (currentNode'=node25path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 40)  -> (currentNode'=node25path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 41)  -> (currentNode'=node25path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 42)  -> (currentNode'=node25path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 43)  -> (currentNode'=node25path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 44)  -> (currentNode'=node25path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 45)  -> (currentNode'=node25path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 46)  -> (currentNode'=node25path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 47)  -> (currentNode'=node25path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 48)  -> (currentNode'=node25path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 49)  -> (currentNode'=node25path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 50)  -> (currentNode'=node25path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 51)  -> (currentNode'=node25path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 52)  -> (currentNode'=node25path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 53)  -> (currentNode'=node25path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 54)  -> (currentNode'=node25path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 55)  -> (currentNode'=node25path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 56)  -> (currentNode'=node25path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 57)  -> (currentNode'=node25path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 58)  -> (currentNode'=node25path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 59)  -> (currentNode'=node25path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 60)  -> (currentNode'=node25path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 61)  -> (currentNode'=node25path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 62)  -> (currentNode'=node25path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 63)  -> (currentNode'=node25path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 64)  -> (currentNode'=node25path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 65)  -> (currentNode'=node25path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 66)  -> (currentNode'=node25path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 67)  -> (currentNode'=node25path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 68)  -> (currentNode'=node25path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 69)  -> (currentNode'=node25path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 70)  -> (currentNode'=node25path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 71)  -> (currentNode'=node25path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 72)  -> (currentNode'=node25path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 73)  -> (currentNode'=node25path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 74)  -> (currentNode'=node25path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 75)  -> (currentNode'=node25path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 76)  -> (currentNode'=node25path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 77)  -> (currentNode'=node25path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 78)  -> (currentNode'=node25path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 79)  -> (currentNode'=node25path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 80)  -> (currentNode'=node25path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 81)  -> (currentNode'=node25path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 82)  -> (currentNode'=node25path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 83)  -> (currentNode'=node25path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 84)  -> (currentNode'=node25path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 85)  -> (currentNode'=node25path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 86)  -> (currentNode'=node25path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 87)  -> (currentNode'=node25path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 88)  -> (currentNode'=node25path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 89)  -> (currentNode'=node25path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 90)  -> (currentNode'=node25path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 91)  -> (currentNode'=node25path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 92)  -> (currentNode'=node25path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 93)  -> (currentNode'=node25path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 94)  -> (currentNode'=node25path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 95)  -> (currentNode'=node25path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 96)  -> (currentNode'=node25path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 97)  -> (currentNode'=node25path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 98)  -> (currentNode'=node25path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 99)  -> (currentNode'=node25path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 25) & (currentPath = 100)  -> (currentNode'=node25path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 1)  -> (currentNode'=node26path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 2)  -> (currentNode'=node26path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 3)  -> (currentNode'=node26path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 4)  -> (currentNode'=node26path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 5)  -> (currentNode'=node26path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 6)  -> (currentNode'=node26path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 7)  -> (currentNode'=node26path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 8)  -> (currentNode'=node26path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 9)  -> (currentNode'=node26path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 10)  -> (currentNode'=node26path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 11)  -> (currentNode'=node26path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 12)  -> (currentNode'=node26path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 13)  -> (currentNode'=node26path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 14)  -> (currentNode'=node26path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 15)  -> (currentNode'=node26path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 16)  -> (currentNode'=node26path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 17)  -> (currentNode'=node26path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 18)  -> (currentNode'=node26path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 19)  -> (currentNode'=node26path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 20)  -> (currentNode'=node26path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 21)  -> (currentNode'=node26path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 22)  -> (currentNode'=node26path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 23)  -> (currentNode'=node26path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 24)  -> (currentNode'=node26path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 25)  -> (currentNode'=node26path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 26)  -> (currentNode'=node26path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 27)  -> (currentNode'=node26path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 28)  -> (currentNode'=node26path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 29)  -> (currentNode'=node26path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 30)  -> (currentNode'=node26path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 31)  -> (currentNode'=node26path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 32)  -> (currentNode'=node26path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 33)  -> (currentNode'=node26path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 34)  -> (currentNode'=node26path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 35)  -> (currentNode'=node26path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 36)  -> (currentNode'=node26path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 37)  -> (currentNode'=node26path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 38)  -> (currentNode'=node26path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 39)  -> (currentNode'=node26path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 40)  -> (currentNode'=node26path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 41)  -> (currentNode'=node26path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 42)  -> (currentNode'=node26path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 43)  -> (currentNode'=node26path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 44)  -> (currentNode'=node26path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 45)  -> (currentNode'=node26path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 46)  -> (currentNode'=node26path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 47)  -> (currentNode'=node26path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 48)  -> (currentNode'=node26path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 49)  -> (currentNode'=node26path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 50)  -> (currentNode'=node26path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 51)  -> (currentNode'=node26path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 52)  -> (currentNode'=node26path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 53)  -> (currentNode'=node26path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 54)  -> (currentNode'=node26path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 55)  -> (currentNode'=node26path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 56)  -> (currentNode'=node26path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 57)  -> (currentNode'=node26path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 58)  -> (currentNode'=node26path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 59)  -> (currentNode'=node26path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 60)  -> (currentNode'=node26path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 61)  -> (currentNode'=node26path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 62)  -> (currentNode'=node26path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 63)  -> (currentNode'=node26path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 64)  -> (currentNode'=node26path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 65)  -> (currentNode'=node26path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 66)  -> (currentNode'=node26path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 67)  -> (currentNode'=node26path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 68)  -> (currentNode'=node26path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 69)  -> (currentNode'=node26path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 70)  -> (currentNode'=node26path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 71)  -> (currentNode'=node26path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 72)  -> (currentNode'=node26path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 73)  -> (currentNode'=node26path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 74)  -> (currentNode'=node26path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 75)  -> (currentNode'=node26path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 76)  -> (currentNode'=node26path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 77)  -> (currentNode'=node26path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 78)  -> (currentNode'=node26path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 79)  -> (currentNode'=node26path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 80)  -> (currentNode'=node26path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 81)  -> (currentNode'=node26path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 82)  -> (currentNode'=node26path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 83)  -> (currentNode'=node26path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 84)  -> (currentNode'=node26path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 85)  -> (currentNode'=node26path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 86)  -> (currentNode'=node26path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 87)  -> (currentNode'=node26path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 88)  -> (currentNode'=node26path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 89)  -> (currentNode'=node26path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 90)  -> (currentNode'=node26path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 91)  -> (currentNode'=node26path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 92)  -> (currentNode'=node26path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 93)  -> (currentNode'=node26path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 94)  -> (currentNode'=node26path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 95)  -> (currentNode'=node26path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 96)  -> (currentNode'=node26path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 97)  -> (currentNode'=node26path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 98)  -> (currentNode'=node26path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 99)  -> (currentNode'=node26path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 26) & (currentPath = 100)  -> (currentNode'=node26path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 1)  -> (currentNode'=node27path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 2)  -> (currentNode'=node27path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 3)  -> (currentNode'=node27path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 4)  -> (currentNode'=node27path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 5)  -> (currentNode'=node27path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 6)  -> (currentNode'=node27path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 7)  -> (currentNode'=node27path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 8)  -> (currentNode'=node27path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 9)  -> (currentNode'=node27path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 10)  -> (currentNode'=node27path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 11)  -> (currentNode'=node27path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 12)  -> (currentNode'=node27path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 13)  -> (currentNode'=node27path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 14)  -> (currentNode'=node27path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 15)  -> (currentNode'=node27path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 16)  -> (currentNode'=node27path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 17)  -> (currentNode'=node27path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 18)  -> (currentNode'=node27path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 19)  -> (currentNode'=node27path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 20)  -> (currentNode'=node27path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 21)  -> (currentNode'=node27path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 22)  -> (currentNode'=node27path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 23)  -> (currentNode'=node27path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 24)  -> (currentNode'=node27path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 25)  -> (currentNode'=node27path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 26)  -> (currentNode'=node27path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 27)  -> (currentNode'=node27path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 28)  -> (currentNode'=node27path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 29)  -> (currentNode'=node27path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 30)  -> (currentNode'=node27path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 31)  -> (currentNode'=node27path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 32)  -> (currentNode'=node27path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 33)  -> (currentNode'=node27path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 34)  -> (currentNode'=node27path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 35)  -> (currentNode'=node27path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 36)  -> (currentNode'=node27path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 37)  -> (currentNode'=node27path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 38)  -> (currentNode'=node27path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 39)  -> (currentNode'=node27path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 40)  -> (currentNode'=node27path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 41)  -> (currentNode'=node27path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 42)  -> (currentNode'=node27path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 43)  -> (currentNode'=node27path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 44)  -> (currentNode'=node27path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 45)  -> (currentNode'=node27path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 46)  -> (currentNode'=node27path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 47)  -> (currentNode'=node27path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 48)  -> (currentNode'=node27path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 49)  -> (currentNode'=node27path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 50)  -> (currentNode'=node27path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 51)  -> (currentNode'=node27path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 52)  -> (currentNode'=node27path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 53)  -> (currentNode'=node27path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 54)  -> (currentNode'=node27path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 55)  -> (currentNode'=node27path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 56)  -> (currentNode'=node27path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 57)  -> (currentNode'=node27path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 58)  -> (currentNode'=node27path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 59)  -> (currentNode'=node27path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 60)  -> (currentNode'=node27path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 61)  -> (currentNode'=node27path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 62)  -> (currentNode'=node27path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 63)  -> (currentNode'=node27path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 64)  -> (currentNode'=node27path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 65)  -> (currentNode'=node27path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 66)  -> (currentNode'=node27path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 67)  -> (currentNode'=node27path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 68)  -> (currentNode'=node27path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 69)  -> (currentNode'=node27path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 70)  -> (currentNode'=node27path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 71)  -> (currentNode'=node27path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 72)  -> (currentNode'=node27path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 73)  -> (currentNode'=node27path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 74)  -> (currentNode'=node27path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 75)  -> (currentNode'=node27path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 76)  -> (currentNode'=node27path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 77)  -> (currentNode'=node27path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 78)  -> (currentNode'=node27path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 79)  -> (currentNode'=node27path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 80)  -> (currentNode'=node27path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 81)  -> (currentNode'=node27path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 82)  -> (currentNode'=node27path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 83)  -> (currentNode'=node27path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 84)  -> (currentNode'=node27path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 85)  -> (currentNode'=node27path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 86)  -> (currentNode'=node27path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 87)  -> (currentNode'=node27path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 88)  -> (currentNode'=node27path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 89)  -> (currentNode'=node27path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 90)  -> (currentNode'=node27path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 91)  -> (currentNode'=node27path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 92)  -> (currentNode'=node27path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 93)  -> (currentNode'=node27path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 94)  -> (currentNode'=node27path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 95)  -> (currentNode'=node27path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 96)  -> (currentNode'=node27path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 97)  -> (currentNode'=node27path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 98)  -> (currentNode'=node27path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 99)  -> (currentNode'=node27path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 27) & (currentPath = 100)  -> (currentNode'=node27path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 1)  -> (currentNode'=node28path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 2)  -> (currentNode'=node28path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 3)  -> (currentNode'=node28path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 4)  -> (currentNode'=node28path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 5)  -> (currentNode'=node28path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 6)  -> (currentNode'=node28path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 7)  -> (currentNode'=node28path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 8)  -> (currentNode'=node28path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 9)  -> (currentNode'=node28path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 10)  -> (currentNode'=node28path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 11)  -> (currentNode'=node28path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 12)  -> (currentNode'=node28path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 13)  -> (currentNode'=node28path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 14)  -> (currentNode'=node28path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 15)  -> (currentNode'=node28path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 16)  -> (currentNode'=node28path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 17)  -> (currentNode'=node28path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 18)  -> (currentNode'=node28path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 19)  -> (currentNode'=node28path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 20)  -> (currentNode'=node28path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 21)  -> (currentNode'=node28path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 22)  -> (currentNode'=node28path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 23)  -> (currentNode'=node28path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 24)  -> (currentNode'=node28path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 25)  -> (currentNode'=node28path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 26)  -> (currentNode'=node28path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 27)  -> (currentNode'=node28path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 28)  -> (currentNode'=node28path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 29)  -> (currentNode'=node28path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 30)  -> (currentNode'=node28path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 31)  -> (currentNode'=node28path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 32)  -> (currentNode'=node28path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 33)  -> (currentNode'=node28path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 34)  -> (currentNode'=node28path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 35)  -> (currentNode'=node28path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 36)  -> (currentNode'=node28path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 37)  -> (currentNode'=node28path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 38)  -> (currentNode'=node28path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 39)  -> (currentNode'=node28path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 40)  -> (currentNode'=node28path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 41)  -> (currentNode'=node28path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 42)  -> (currentNode'=node28path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 43)  -> (currentNode'=node28path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 44)  -> (currentNode'=node28path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 45)  -> (currentNode'=node28path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 46)  -> (currentNode'=node28path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 47)  -> (currentNode'=node28path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 48)  -> (currentNode'=node28path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 49)  -> (currentNode'=node28path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 50)  -> (currentNode'=node28path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 51)  -> (currentNode'=node28path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 52)  -> (currentNode'=node28path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 53)  -> (currentNode'=node28path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 54)  -> (currentNode'=node28path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 55)  -> (currentNode'=node28path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 56)  -> (currentNode'=node28path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 57)  -> (currentNode'=node28path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 58)  -> (currentNode'=node28path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 59)  -> (currentNode'=node28path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 60)  -> (currentNode'=node28path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 61)  -> (currentNode'=node28path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 62)  -> (currentNode'=node28path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 63)  -> (currentNode'=node28path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 64)  -> (currentNode'=node28path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 65)  -> (currentNode'=node28path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 66)  -> (currentNode'=node28path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 67)  -> (currentNode'=node28path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 68)  -> (currentNode'=node28path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 69)  -> (currentNode'=node28path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 70)  -> (currentNode'=node28path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 71)  -> (currentNode'=node28path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 72)  -> (currentNode'=node28path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 73)  -> (currentNode'=node28path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 74)  -> (currentNode'=node28path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 75)  -> (currentNode'=node28path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 76)  -> (currentNode'=node28path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 77)  -> (currentNode'=node28path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 78)  -> (currentNode'=node28path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 79)  -> (currentNode'=node28path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 80)  -> (currentNode'=node28path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 81)  -> (currentNode'=node28path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 82)  -> (currentNode'=node28path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 83)  -> (currentNode'=node28path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 84)  -> (currentNode'=node28path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 85)  -> (currentNode'=node28path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 86)  -> (currentNode'=node28path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 87)  -> (currentNode'=node28path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 88)  -> (currentNode'=node28path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 89)  -> (currentNode'=node28path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 90)  -> (currentNode'=node28path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 91)  -> (currentNode'=node28path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 92)  -> (currentNode'=node28path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 93)  -> (currentNode'=node28path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 94)  -> (currentNode'=node28path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 95)  -> (currentNode'=node28path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 96)  -> (currentNode'=node28path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 97)  -> (currentNode'=node28path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 98)  -> (currentNode'=node28path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 99)  -> (currentNode'=node28path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 28) & (currentPath = 100)  -> (currentNode'=node28path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 1)  -> (currentNode'=node29path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 2)  -> (currentNode'=node29path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 3)  -> (currentNode'=node29path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 4)  -> (currentNode'=node29path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 5)  -> (currentNode'=node29path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 6)  -> (currentNode'=node29path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 7)  -> (currentNode'=node29path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 8)  -> (currentNode'=node29path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 9)  -> (currentNode'=node29path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 10)  -> (currentNode'=node29path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 11)  -> (currentNode'=node29path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 12)  -> (currentNode'=node29path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 13)  -> (currentNode'=node29path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 14)  -> (currentNode'=node29path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 15)  -> (currentNode'=node29path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 16)  -> (currentNode'=node29path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 17)  -> (currentNode'=node29path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 18)  -> (currentNode'=node29path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 19)  -> (currentNode'=node29path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 20)  -> (currentNode'=node29path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 21)  -> (currentNode'=node29path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 22)  -> (currentNode'=node29path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 23)  -> (currentNode'=node29path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 24)  -> (currentNode'=node29path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 25)  -> (currentNode'=node29path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 26)  -> (currentNode'=node29path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 27)  -> (currentNode'=node29path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 28)  -> (currentNode'=node29path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 29)  -> (currentNode'=node29path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 30)  -> (currentNode'=node29path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 31)  -> (currentNode'=node29path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 32)  -> (currentNode'=node29path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 33)  -> (currentNode'=node29path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 34)  -> (currentNode'=node29path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 35)  -> (currentNode'=node29path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 36)  -> (currentNode'=node29path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 37)  -> (currentNode'=node29path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 38)  -> (currentNode'=node29path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 39)  -> (currentNode'=node29path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 40)  -> (currentNode'=node29path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 41)  -> (currentNode'=node29path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 42)  -> (currentNode'=node29path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 43)  -> (currentNode'=node29path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 44)  -> (currentNode'=node29path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 45)  -> (currentNode'=node29path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 46)  -> (currentNode'=node29path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 47)  -> (currentNode'=node29path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 48)  -> (currentNode'=node29path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 49)  -> (currentNode'=node29path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 50)  -> (currentNode'=node29path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 51)  -> (currentNode'=node29path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 52)  -> (currentNode'=node29path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 53)  -> (currentNode'=node29path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 54)  -> (currentNode'=node29path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 55)  -> (currentNode'=node29path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 56)  -> (currentNode'=node29path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 57)  -> (currentNode'=node29path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 58)  -> (currentNode'=node29path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 59)  -> (currentNode'=node29path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 60)  -> (currentNode'=node29path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 61)  -> (currentNode'=node29path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 62)  -> (currentNode'=node29path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 63)  -> (currentNode'=node29path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 64)  -> (currentNode'=node29path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 65)  -> (currentNode'=node29path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 66)  -> (currentNode'=node29path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 67)  -> (currentNode'=node29path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 68)  -> (currentNode'=node29path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 69)  -> (currentNode'=node29path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 70)  -> (currentNode'=node29path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 71)  -> (currentNode'=node29path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 72)  -> (currentNode'=node29path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 73)  -> (currentNode'=node29path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 74)  -> (currentNode'=node29path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 75)  -> (currentNode'=node29path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 76)  -> (currentNode'=node29path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 77)  -> (currentNode'=node29path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 78)  -> (currentNode'=node29path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 79)  -> (currentNode'=node29path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 80)  -> (currentNode'=node29path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 81)  -> (currentNode'=node29path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 82)  -> (currentNode'=node29path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 83)  -> (currentNode'=node29path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 84)  -> (currentNode'=node29path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 85)  -> (currentNode'=node29path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 86)  -> (currentNode'=node29path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 87)  -> (currentNode'=node29path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 88)  -> (currentNode'=node29path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 89)  -> (currentNode'=node29path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 90)  -> (currentNode'=node29path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 91)  -> (currentNode'=node29path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 92)  -> (currentNode'=node29path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 93)  -> (currentNode'=node29path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 94)  -> (currentNode'=node29path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 95)  -> (currentNode'=node29path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 96)  -> (currentNode'=node29path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 97)  -> (currentNode'=node29path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 98)  -> (currentNode'=node29path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 99)  -> (currentNode'=node29path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 29) & (currentPath = 100)  -> (currentNode'=node29path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 1)  -> (currentNode'=node30path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 2)  -> (currentNode'=node30path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 3)  -> (currentNode'=node30path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 4)  -> (currentNode'=node30path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 5)  -> (currentNode'=node30path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 6)  -> (currentNode'=node30path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 7)  -> (currentNode'=node30path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 8)  -> (currentNode'=node30path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 9)  -> (currentNode'=node30path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 10)  -> (currentNode'=node30path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 11)  -> (currentNode'=node30path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 12)  -> (currentNode'=node30path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 13)  -> (currentNode'=node30path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 14)  -> (currentNode'=node30path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 15)  -> (currentNode'=node30path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 16)  -> (currentNode'=node30path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 17)  -> (currentNode'=node30path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 18)  -> (currentNode'=node30path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 19)  -> (currentNode'=node30path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 20)  -> (currentNode'=node30path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 21)  -> (currentNode'=node30path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 22)  -> (currentNode'=node30path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 23)  -> (currentNode'=node30path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 24)  -> (currentNode'=node30path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 25)  -> (currentNode'=node30path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 26)  -> (currentNode'=node30path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 27)  -> (currentNode'=node30path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 28)  -> (currentNode'=node30path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 29)  -> (currentNode'=node30path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 30)  -> (currentNode'=node30path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 31)  -> (currentNode'=node30path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 32)  -> (currentNode'=node30path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 33)  -> (currentNode'=node30path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 34)  -> (currentNode'=node30path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 35)  -> (currentNode'=node30path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 36)  -> (currentNode'=node30path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 37)  -> (currentNode'=node30path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 38)  -> (currentNode'=node30path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 39)  -> (currentNode'=node30path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 40)  -> (currentNode'=node30path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 41)  -> (currentNode'=node30path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 42)  -> (currentNode'=node30path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 43)  -> (currentNode'=node30path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 44)  -> (currentNode'=node30path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 45)  -> (currentNode'=node30path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 46)  -> (currentNode'=node30path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 47)  -> (currentNode'=node30path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 48)  -> (currentNode'=node30path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 49)  -> (currentNode'=node30path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 50)  -> (currentNode'=node30path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 51)  -> (currentNode'=node30path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 52)  -> (currentNode'=node30path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 53)  -> (currentNode'=node30path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 54)  -> (currentNode'=node30path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 55)  -> (currentNode'=node30path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 56)  -> (currentNode'=node30path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 57)  -> (currentNode'=node30path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 58)  -> (currentNode'=node30path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 59)  -> (currentNode'=node30path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 60)  -> (currentNode'=node30path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 61)  -> (currentNode'=node30path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 62)  -> (currentNode'=node30path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 63)  -> (currentNode'=node30path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 64)  -> (currentNode'=node30path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 65)  -> (currentNode'=node30path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 66)  -> (currentNode'=node30path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 67)  -> (currentNode'=node30path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 68)  -> (currentNode'=node30path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 69)  -> (currentNode'=node30path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 70)  -> (currentNode'=node30path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 71)  -> (currentNode'=node30path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 72)  -> (currentNode'=node30path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 73)  -> (currentNode'=node30path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 74)  -> (currentNode'=node30path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 75)  -> (currentNode'=node30path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 76)  -> (currentNode'=node30path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 77)  -> (currentNode'=node30path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 78)  -> (currentNode'=node30path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 79)  -> (currentNode'=node30path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 80)  -> (currentNode'=node30path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 81)  -> (currentNode'=node30path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 82)  -> (currentNode'=node30path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 83)  -> (currentNode'=node30path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 84)  -> (currentNode'=node30path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 85)  -> (currentNode'=node30path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 86)  -> (currentNode'=node30path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 87)  -> (currentNode'=node30path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 88)  -> (currentNode'=node30path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 89)  -> (currentNode'=node30path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 90)  -> (currentNode'=node30path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 91)  -> (currentNode'=node30path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 92)  -> (currentNode'=node30path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 93)  -> (currentNode'=node30path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 94)  -> (currentNode'=node30path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 95)  -> (currentNode'=node30path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 96)  -> (currentNode'=node30path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 97)  -> (currentNode'=node30path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 98)  -> (currentNode'=node30path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 99)  -> (currentNode'=node30path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 30) & (currentPath = 100)  -> (currentNode'=node30path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 1)  -> (currentNode'=node31path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 2)  -> (currentNode'=node31path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 3)  -> (currentNode'=node31path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 4)  -> (currentNode'=node31path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 5)  -> (currentNode'=node31path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 6)  -> (currentNode'=node31path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 7)  -> (currentNode'=node31path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 8)  -> (currentNode'=node31path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 9)  -> (currentNode'=node31path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 10)  -> (currentNode'=node31path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 11)  -> (currentNode'=node31path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 12)  -> (currentNode'=node31path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 13)  -> (currentNode'=node31path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 14)  -> (currentNode'=node31path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 15)  -> (currentNode'=node31path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 16)  -> (currentNode'=node31path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 17)  -> (currentNode'=node31path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 18)  -> (currentNode'=node31path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 19)  -> (currentNode'=node31path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 20)  -> (currentNode'=node31path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 21)  -> (currentNode'=node31path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 22)  -> (currentNode'=node31path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 23)  -> (currentNode'=node31path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 24)  -> (currentNode'=node31path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 25)  -> (currentNode'=node31path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 26)  -> (currentNode'=node31path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 27)  -> (currentNode'=node31path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 28)  -> (currentNode'=node31path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 29)  -> (currentNode'=node31path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 30)  -> (currentNode'=node31path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 31)  -> (currentNode'=node31path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 32)  -> (currentNode'=node31path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 33)  -> (currentNode'=node31path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 34)  -> (currentNode'=node31path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 35)  -> (currentNode'=node31path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 36)  -> (currentNode'=node31path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 37)  -> (currentNode'=node31path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 38)  -> (currentNode'=node31path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 39)  -> (currentNode'=node31path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 40)  -> (currentNode'=node31path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 41)  -> (currentNode'=node31path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 42)  -> (currentNode'=node31path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 43)  -> (currentNode'=node31path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 44)  -> (currentNode'=node31path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 45)  -> (currentNode'=node31path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 46)  -> (currentNode'=node31path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 47)  -> (currentNode'=node31path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 48)  -> (currentNode'=node31path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 49)  -> (currentNode'=node31path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 50)  -> (currentNode'=node31path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 51)  -> (currentNode'=node31path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 52)  -> (currentNode'=node31path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 53)  -> (currentNode'=node31path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 54)  -> (currentNode'=node31path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 55)  -> (currentNode'=node31path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 56)  -> (currentNode'=node31path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 57)  -> (currentNode'=node31path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 58)  -> (currentNode'=node31path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 59)  -> (currentNode'=node31path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 60)  -> (currentNode'=node31path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 61)  -> (currentNode'=node31path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 62)  -> (currentNode'=node31path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 63)  -> (currentNode'=node31path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 64)  -> (currentNode'=node31path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 65)  -> (currentNode'=node31path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 66)  -> (currentNode'=node31path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 67)  -> (currentNode'=node31path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 68)  -> (currentNode'=node31path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 69)  -> (currentNode'=node31path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 70)  -> (currentNode'=node31path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 71)  -> (currentNode'=node31path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 72)  -> (currentNode'=node31path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 73)  -> (currentNode'=node31path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 74)  -> (currentNode'=node31path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 75)  -> (currentNode'=node31path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 76)  -> (currentNode'=node31path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 77)  -> (currentNode'=node31path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 78)  -> (currentNode'=node31path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 79)  -> (currentNode'=node31path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 80)  -> (currentNode'=node31path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 81)  -> (currentNode'=node31path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 82)  -> (currentNode'=node31path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 83)  -> (currentNode'=node31path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 84)  -> (currentNode'=node31path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 85)  -> (currentNode'=node31path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 86)  -> (currentNode'=node31path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 87)  -> (currentNode'=node31path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 88)  -> (currentNode'=node31path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 89)  -> (currentNode'=node31path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 90)  -> (currentNode'=node31path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 91)  -> (currentNode'=node31path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 92)  -> (currentNode'=node31path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 93)  -> (currentNode'=node31path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 94)  -> (currentNode'=node31path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 95)  -> (currentNode'=node31path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 96)  -> (currentNode'=node31path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 97)  -> (currentNode'=node31path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 98)  -> (currentNode'=node31path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 99)  -> (currentNode'=node31path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 31) & (currentPath = 100)  -> (currentNode'=node31path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 1)  -> (currentNode'=node32path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 2)  -> (currentNode'=node32path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 3)  -> (currentNode'=node32path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 4)  -> (currentNode'=node32path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 5)  -> (currentNode'=node32path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 6)  -> (currentNode'=node32path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 7)  -> (currentNode'=node32path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 8)  -> (currentNode'=node32path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 9)  -> (currentNode'=node32path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 10)  -> (currentNode'=node32path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 11)  -> (currentNode'=node32path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 12)  -> (currentNode'=node32path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 13)  -> (currentNode'=node32path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 14)  -> (currentNode'=node32path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 15)  -> (currentNode'=node32path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 16)  -> (currentNode'=node32path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 17)  -> (currentNode'=node32path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 18)  -> (currentNode'=node32path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 19)  -> (currentNode'=node32path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 20)  -> (currentNode'=node32path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 21)  -> (currentNode'=node32path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 22)  -> (currentNode'=node32path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 23)  -> (currentNode'=node32path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 24)  -> (currentNode'=node32path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 25)  -> (currentNode'=node32path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 26)  -> (currentNode'=node32path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 27)  -> (currentNode'=node32path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 28)  -> (currentNode'=node32path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 29)  -> (currentNode'=node32path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 30)  -> (currentNode'=node32path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 31)  -> (currentNode'=node32path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 32)  -> (currentNode'=node32path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 33)  -> (currentNode'=node32path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 34)  -> (currentNode'=node32path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 35)  -> (currentNode'=node32path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 36)  -> (currentNode'=node32path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 37)  -> (currentNode'=node32path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 38)  -> (currentNode'=node32path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 39)  -> (currentNode'=node32path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 40)  -> (currentNode'=node32path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 41)  -> (currentNode'=node32path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 42)  -> (currentNode'=node32path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 43)  -> (currentNode'=node32path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 44)  -> (currentNode'=node32path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 45)  -> (currentNode'=node32path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 46)  -> (currentNode'=node32path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 47)  -> (currentNode'=node32path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 48)  -> (currentNode'=node32path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 49)  -> (currentNode'=node32path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 50)  -> (currentNode'=node32path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 51)  -> (currentNode'=node32path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 52)  -> (currentNode'=node32path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 53)  -> (currentNode'=node32path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 54)  -> (currentNode'=node32path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 55)  -> (currentNode'=node32path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 56)  -> (currentNode'=node32path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 57)  -> (currentNode'=node32path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 58)  -> (currentNode'=node32path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 59)  -> (currentNode'=node32path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 60)  -> (currentNode'=node32path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 61)  -> (currentNode'=node32path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 62)  -> (currentNode'=node32path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 63)  -> (currentNode'=node32path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 64)  -> (currentNode'=node32path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 65)  -> (currentNode'=node32path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 66)  -> (currentNode'=node32path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 67)  -> (currentNode'=node32path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 68)  -> (currentNode'=node32path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 69)  -> (currentNode'=node32path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 70)  -> (currentNode'=node32path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 71)  -> (currentNode'=node32path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 72)  -> (currentNode'=node32path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 73)  -> (currentNode'=node32path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 74)  -> (currentNode'=node32path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 75)  -> (currentNode'=node32path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 76)  -> (currentNode'=node32path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 77)  -> (currentNode'=node32path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 78)  -> (currentNode'=node32path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 79)  -> (currentNode'=node32path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 80)  -> (currentNode'=node32path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 81)  -> (currentNode'=node32path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 82)  -> (currentNode'=node32path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 83)  -> (currentNode'=node32path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 84)  -> (currentNode'=node32path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 85)  -> (currentNode'=node32path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 86)  -> (currentNode'=node32path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 87)  -> (currentNode'=node32path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 88)  -> (currentNode'=node32path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 89)  -> (currentNode'=node32path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 90)  -> (currentNode'=node32path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 91)  -> (currentNode'=node32path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 92)  -> (currentNode'=node32path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 93)  -> (currentNode'=node32path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 94)  -> (currentNode'=node32path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 95)  -> (currentNode'=node32path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 96)  -> (currentNode'=node32path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 97)  -> (currentNode'=node32path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 98)  -> (currentNode'=node32path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 99)  -> (currentNode'=node32path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 32) & (currentPath = 100)  -> (currentNode'=node32path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 1)  -> (currentNode'=node33path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 2)  -> (currentNode'=node33path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 3)  -> (currentNode'=node33path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 4)  -> (currentNode'=node33path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 5)  -> (currentNode'=node33path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 6)  -> (currentNode'=node33path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 7)  -> (currentNode'=node33path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 8)  -> (currentNode'=node33path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 9)  -> (currentNode'=node33path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 10)  -> (currentNode'=node33path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 11)  -> (currentNode'=node33path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 12)  -> (currentNode'=node33path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 13)  -> (currentNode'=node33path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 14)  -> (currentNode'=node33path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 15)  -> (currentNode'=node33path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 16)  -> (currentNode'=node33path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 17)  -> (currentNode'=node33path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 18)  -> (currentNode'=node33path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 19)  -> (currentNode'=node33path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 20)  -> (currentNode'=node33path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 21)  -> (currentNode'=node33path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 22)  -> (currentNode'=node33path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 23)  -> (currentNode'=node33path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 24)  -> (currentNode'=node33path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 25)  -> (currentNode'=node33path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 26)  -> (currentNode'=node33path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 27)  -> (currentNode'=node33path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 28)  -> (currentNode'=node33path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 29)  -> (currentNode'=node33path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 30)  -> (currentNode'=node33path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 31)  -> (currentNode'=node33path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 32)  -> (currentNode'=node33path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 33)  -> (currentNode'=node33path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 34)  -> (currentNode'=node33path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 35)  -> (currentNode'=node33path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 36)  -> (currentNode'=node33path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 37)  -> (currentNode'=node33path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 38)  -> (currentNode'=node33path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 39)  -> (currentNode'=node33path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 40)  -> (currentNode'=node33path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 41)  -> (currentNode'=node33path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 42)  -> (currentNode'=node33path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 43)  -> (currentNode'=node33path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 44)  -> (currentNode'=node33path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 45)  -> (currentNode'=node33path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 46)  -> (currentNode'=node33path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 47)  -> (currentNode'=node33path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 48)  -> (currentNode'=node33path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 49)  -> (currentNode'=node33path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 50)  -> (currentNode'=node33path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 51)  -> (currentNode'=node33path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 52)  -> (currentNode'=node33path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 53)  -> (currentNode'=node33path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 54)  -> (currentNode'=node33path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 55)  -> (currentNode'=node33path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 56)  -> (currentNode'=node33path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 57)  -> (currentNode'=node33path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 58)  -> (currentNode'=node33path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 59)  -> (currentNode'=node33path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 60)  -> (currentNode'=node33path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 61)  -> (currentNode'=node33path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 62)  -> (currentNode'=node33path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 63)  -> (currentNode'=node33path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 64)  -> (currentNode'=node33path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 65)  -> (currentNode'=node33path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 66)  -> (currentNode'=node33path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 67)  -> (currentNode'=node33path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 68)  -> (currentNode'=node33path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 69)  -> (currentNode'=node33path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 70)  -> (currentNode'=node33path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 71)  -> (currentNode'=node33path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 72)  -> (currentNode'=node33path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 73)  -> (currentNode'=node33path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 74)  -> (currentNode'=node33path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 75)  -> (currentNode'=node33path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 76)  -> (currentNode'=node33path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 77)  -> (currentNode'=node33path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 78)  -> (currentNode'=node33path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 79)  -> (currentNode'=node33path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 80)  -> (currentNode'=node33path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 81)  -> (currentNode'=node33path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 82)  -> (currentNode'=node33path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 83)  -> (currentNode'=node33path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 84)  -> (currentNode'=node33path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 85)  -> (currentNode'=node33path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 86)  -> (currentNode'=node33path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 87)  -> (currentNode'=node33path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 88)  -> (currentNode'=node33path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 89)  -> (currentNode'=node33path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 90)  -> (currentNode'=node33path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 91)  -> (currentNode'=node33path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 92)  -> (currentNode'=node33path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 93)  -> (currentNode'=node33path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 94)  -> (currentNode'=node33path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 95)  -> (currentNode'=node33path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 96)  -> (currentNode'=node33path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 97)  -> (currentNode'=node33path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 98)  -> (currentNode'=node33path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 99)  -> (currentNode'=node33path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 33) & (currentPath = 100)  -> (currentNode'=node33path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 1)  -> (currentNode'=node34path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 2)  -> (currentNode'=node34path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 3)  -> (currentNode'=node34path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 4)  -> (currentNode'=node34path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 5)  -> (currentNode'=node34path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 6)  -> (currentNode'=node34path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 7)  -> (currentNode'=node34path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 8)  -> (currentNode'=node34path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 9)  -> (currentNode'=node34path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 10)  -> (currentNode'=node34path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 11)  -> (currentNode'=node34path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 12)  -> (currentNode'=node34path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 13)  -> (currentNode'=node34path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 14)  -> (currentNode'=node34path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 15)  -> (currentNode'=node34path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 16)  -> (currentNode'=node34path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 17)  -> (currentNode'=node34path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 18)  -> (currentNode'=node34path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 19)  -> (currentNode'=node34path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 20)  -> (currentNode'=node34path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 21)  -> (currentNode'=node34path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 22)  -> (currentNode'=node34path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 23)  -> (currentNode'=node34path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 24)  -> (currentNode'=node34path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 25)  -> (currentNode'=node34path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 26)  -> (currentNode'=node34path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 27)  -> (currentNode'=node34path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 28)  -> (currentNode'=node34path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 29)  -> (currentNode'=node34path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 30)  -> (currentNode'=node34path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 31)  -> (currentNode'=node34path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 32)  -> (currentNode'=node34path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 33)  -> (currentNode'=node34path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 34)  -> (currentNode'=node34path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 35)  -> (currentNode'=node34path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 36)  -> (currentNode'=node34path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 37)  -> (currentNode'=node34path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 38)  -> (currentNode'=node34path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 39)  -> (currentNode'=node34path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 40)  -> (currentNode'=node34path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 41)  -> (currentNode'=node34path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 42)  -> (currentNode'=node34path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 43)  -> (currentNode'=node34path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 44)  -> (currentNode'=node34path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 45)  -> (currentNode'=node34path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 46)  -> (currentNode'=node34path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 47)  -> (currentNode'=node34path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 48)  -> (currentNode'=node34path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 49)  -> (currentNode'=node34path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 50)  -> (currentNode'=node34path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 51)  -> (currentNode'=node34path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 52)  -> (currentNode'=node34path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 53)  -> (currentNode'=node34path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 54)  -> (currentNode'=node34path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 55)  -> (currentNode'=node34path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 56)  -> (currentNode'=node34path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 57)  -> (currentNode'=node34path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 58)  -> (currentNode'=node34path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 59)  -> (currentNode'=node34path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 60)  -> (currentNode'=node34path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 61)  -> (currentNode'=node34path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 62)  -> (currentNode'=node34path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 63)  -> (currentNode'=node34path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 64)  -> (currentNode'=node34path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 65)  -> (currentNode'=node34path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 66)  -> (currentNode'=node34path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 67)  -> (currentNode'=node34path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 68)  -> (currentNode'=node34path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 69)  -> (currentNode'=node34path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 70)  -> (currentNode'=node34path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 71)  -> (currentNode'=node34path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 72)  -> (currentNode'=node34path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 73)  -> (currentNode'=node34path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 74)  -> (currentNode'=node34path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 75)  -> (currentNode'=node34path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 76)  -> (currentNode'=node34path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 77)  -> (currentNode'=node34path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 78)  -> (currentNode'=node34path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 79)  -> (currentNode'=node34path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 80)  -> (currentNode'=node34path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 81)  -> (currentNode'=node34path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 82)  -> (currentNode'=node34path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 83)  -> (currentNode'=node34path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 84)  -> (currentNode'=node34path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 85)  -> (currentNode'=node34path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 86)  -> (currentNode'=node34path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 87)  -> (currentNode'=node34path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 88)  -> (currentNode'=node34path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 89)  -> (currentNode'=node34path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 90)  -> (currentNode'=node34path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 91)  -> (currentNode'=node34path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 92)  -> (currentNode'=node34path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 93)  -> (currentNode'=node34path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 94)  -> (currentNode'=node34path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 95)  -> (currentNode'=node34path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 96)  -> (currentNode'=node34path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 97)  -> (currentNode'=node34path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 98)  -> (currentNode'=node34path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 99)  -> (currentNode'=node34path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 34) & (currentPath = 100)  -> (currentNode'=node34path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 1)  -> (currentNode'=node35path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 2)  -> (currentNode'=node35path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 3)  -> (currentNode'=node35path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 4)  -> (currentNode'=node35path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 5)  -> (currentNode'=node35path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 6)  -> (currentNode'=node35path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 7)  -> (currentNode'=node35path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 8)  -> (currentNode'=node35path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 9)  -> (currentNode'=node35path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 10)  -> (currentNode'=node35path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 11)  -> (currentNode'=node35path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 12)  -> (currentNode'=node35path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 13)  -> (currentNode'=node35path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 14)  -> (currentNode'=node35path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 15)  -> (currentNode'=node35path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 16)  -> (currentNode'=node35path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 17)  -> (currentNode'=node35path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 18)  -> (currentNode'=node35path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 19)  -> (currentNode'=node35path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 20)  -> (currentNode'=node35path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 21)  -> (currentNode'=node35path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 22)  -> (currentNode'=node35path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 23)  -> (currentNode'=node35path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 24)  -> (currentNode'=node35path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 25)  -> (currentNode'=node35path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 26)  -> (currentNode'=node35path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 27)  -> (currentNode'=node35path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 28)  -> (currentNode'=node35path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 29)  -> (currentNode'=node35path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 30)  -> (currentNode'=node35path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 31)  -> (currentNode'=node35path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 32)  -> (currentNode'=node35path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 33)  -> (currentNode'=node35path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 34)  -> (currentNode'=node35path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 35)  -> (currentNode'=node35path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 36)  -> (currentNode'=node35path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 37)  -> (currentNode'=node35path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 38)  -> (currentNode'=node35path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 39)  -> (currentNode'=node35path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 40)  -> (currentNode'=node35path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 41)  -> (currentNode'=node35path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 42)  -> (currentNode'=node35path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 43)  -> (currentNode'=node35path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 44)  -> (currentNode'=node35path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 45)  -> (currentNode'=node35path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 46)  -> (currentNode'=node35path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 47)  -> (currentNode'=node35path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 48)  -> (currentNode'=node35path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 49)  -> (currentNode'=node35path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 50)  -> (currentNode'=node35path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 51)  -> (currentNode'=node35path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 52)  -> (currentNode'=node35path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 53)  -> (currentNode'=node35path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 54)  -> (currentNode'=node35path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 55)  -> (currentNode'=node35path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 56)  -> (currentNode'=node35path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 57)  -> (currentNode'=node35path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 58)  -> (currentNode'=node35path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 59)  -> (currentNode'=node35path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 60)  -> (currentNode'=node35path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 61)  -> (currentNode'=node35path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 62)  -> (currentNode'=node35path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 63)  -> (currentNode'=node35path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 64)  -> (currentNode'=node35path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 65)  -> (currentNode'=node35path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 66)  -> (currentNode'=node35path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 67)  -> (currentNode'=node35path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 68)  -> (currentNode'=node35path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 69)  -> (currentNode'=node35path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 70)  -> (currentNode'=node35path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 71)  -> (currentNode'=node35path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 72)  -> (currentNode'=node35path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 73)  -> (currentNode'=node35path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 74)  -> (currentNode'=node35path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 75)  -> (currentNode'=node35path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 76)  -> (currentNode'=node35path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 77)  -> (currentNode'=node35path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 78)  -> (currentNode'=node35path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 79)  -> (currentNode'=node35path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 80)  -> (currentNode'=node35path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 81)  -> (currentNode'=node35path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 82)  -> (currentNode'=node35path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 83)  -> (currentNode'=node35path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 84)  -> (currentNode'=node35path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 85)  -> (currentNode'=node35path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 86)  -> (currentNode'=node35path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 87)  -> (currentNode'=node35path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 88)  -> (currentNode'=node35path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 89)  -> (currentNode'=node35path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 90)  -> (currentNode'=node35path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 91)  -> (currentNode'=node35path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 92)  -> (currentNode'=node35path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 93)  -> (currentNode'=node35path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 94)  -> (currentNode'=node35path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 95)  -> (currentNode'=node35path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 96)  -> (currentNode'=node35path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 97)  -> (currentNode'=node35path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 98)  -> (currentNode'=node35path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 99)  -> (currentNode'=node35path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 35) & (currentPath = 100)  -> (currentNode'=node35path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 1)  -> (currentNode'=node36path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 2)  -> (currentNode'=node36path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 3)  -> (currentNode'=node36path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 4)  -> (currentNode'=node36path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 5)  -> (currentNode'=node36path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 6)  -> (currentNode'=node36path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 7)  -> (currentNode'=node36path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 8)  -> (currentNode'=node36path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 9)  -> (currentNode'=node36path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 10)  -> (currentNode'=node36path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 11)  -> (currentNode'=node36path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 12)  -> (currentNode'=node36path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 13)  -> (currentNode'=node36path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 14)  -> (currentNode'=node36path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 15)  -> (currentNode'=node36path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 16)  -> (currentNode'=node36path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 17)  -> (currentNode'=node36path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 18)  -> (currentNode'=node36path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 19)  -> (currentNode'=node36path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 20)  -> (currentNode'=node36path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 21)  -> (currentNode'=node36path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 22)  -> (currentNode'=node36path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 23)  -> (currentNode'=node36path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 24)  -> (currentNode'=node36path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 25)  -> (currentNode'=node36path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 26)  -> (currentNode'=node36path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 27)  -> (currentNode'=node36path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 28)  -> (currentNode'=node36path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 29)  -> (currentNode'=node36path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 30)  -> (currentNode'=node36path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 31)  -> (currentNode'=node36path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 32)  -> (currentNode'=node36path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 33)  -> (currentNode'=node36path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 34)  -> (currentNode'=node36path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 35)  -> (currentNode'=node36path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 36)  -> (currentNode'=node36path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 37)  -> (currentNode'=node36path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 38)  -> (currentNode'=node36path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 39)  -> (currentNode'=node36path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 40)  -> (currentNode'=node36path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 41)  -> (currentNode'=node36path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 42)  -> (currentNode'=node36path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 43)  -> (currentNode'=node36path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 44)  -> (currentNode'=node36path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 45)  -> (currentNode'=node36path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 46)  -> (currentNode'=node36path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 47)  -> (currentNode'=node36path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 48)  -> (currentNode'=node36path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 49)  -> (currentNode'=node36path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 50)  -> (currentNode'=node36path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 51)  -> (currentNode'=node36path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 52)  -> (currentNode'=node36path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 53)  -> (currentNode'=node36path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 54)  -> (currentNode'=node36path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 55)  -> (currentNode'=node36path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 56)  -> (currentNode'=node36path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 57)  -> (currentNode'=node36path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 58)  -> (currentNode'=node36path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 59)  -> (currentNode'=node36path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 60)  -> (currentNode'=node36path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 61)  -> (currentNode'=node36path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 62)  -> (currentNode'=node36path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 63)  -> (currentNode'=node36path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 64)  -> (currentNode'=node36path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 65)  -> (currentNode'=node36path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 66)  -> (currentNode'=node36path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 67)  -> (currentNode'=node36path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 68)  -> (currentNode'=node36path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 69)  -> (currentNode'=node36path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 70)  -> (currentNode'=node36path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 71)  -> (currentNode'=node36path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 72)  -> (currentNode'=node36path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 73)  -> (currentNode'=node36path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 74)  -> (currentNode'=node36path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 75)  -> (currentNode'=node36path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 76)  -> (currentNode'=node36path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 77)  -> (currentNode'=node36path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 78)  -> (currentNode'=node36path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 79)  -> (currentNode'=node36path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 80)  -> (currentNode'=node36path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 81)  -> (currentNode'=node36path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 82)  -> (currentNode'=node36path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 83)  -> (currentNode'=node36path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 84)  -> (currentNode'=node36path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 85)  -> (currentNode'=node36path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 86)  -> (currentNode'=node36path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 87)  -> (currentNode'=node36path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 88)  -> (currentNode'=node36path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 89)  -> (currentNode'=node36path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 90)  -> (currentNode'=node36path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 91)  -> (currentNode'=node36path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 92)  -> (currentNode'=node36path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 93)  -> (currentNode'=node36path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 94)  -> (currentNode'=node36path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 95)  -> (currentNode'=node36path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 96)  -> (currentNode'=node36path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 97)  -> (currentNode'=node36path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 98)  -> (currentNode'=node36path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 99)  -> (currentNode'=node36path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 36) & (currentPath = 100)  -> (currentNode'=node36path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 1)  -> (currentNode'=node37path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 2)  -> (currentNode'=node37path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 3)  -> (currentNode'=node37path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 4)  -> (currentNode'=node37path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 5)  -> (currentNode'=node37path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 6)  -> (currentNode'=node37path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 7)  -> (currentNode'=node37path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 8)  -> (currentNode'=node37path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 9)  -> (currentNode'=node37path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 10)  -> (currentNode'=node37path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 11)  -> (currentNode'=node37path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 12)  -> (currentNode'=node37path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 13)  -> (currentNode'=node37path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 14)  -> (currentNode'=node37path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 15)  -> (currentNode'=node37path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 16)  -> (currentNode'=node37path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 17)  -> (currentNode'=node37path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 18)  -> (currentNode'=node37path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 19)  -> (currentNode'=node37path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 20)  -> (currentNode'=node37path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 21)  -> (currentNode'=node37path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 22)  -> (currentNode'=node37path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 23)  -> (currentNode'=node37path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 24)  -> (currentNode'=node37path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 25)  -> (currentNode'=node37path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 26)  -> (currentNode'=node37path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 27)  -> (currentNode'=node37path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 28)  -> (currentNode'=node37path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 29)  -> (currentNode'=node37path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 30)  -> (currentNode'=node37path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 31)  -> (currentNode'=node37path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 32)  -> (currentNode'=node37path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 33)  -> (currentNode'=node37path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 34)  -> (currentNode'=node37path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 35)  -> (currentNode'=node37path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 36)  -> (currentNode'=node37path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 37)  -> (currentNode'=node37path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 38)  -> (currentNode'=node37path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 39)  -> (currentNode'=node37path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 40)  -> (currentNode'=node37path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 41)  -> (currentNode'=node37path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 42)  -> (currentNode'=node37path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 43)  -> (currentNode'=node37path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 44)  -> (currentNode'=node37path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 45)  -> (currentNode'=node37path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 46)  -> (currentNode'=node37path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 47)  -> (currentNode'=node37path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 48)  -> (currentNode'=node37path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 49)  -> (currentNode'=node37path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 50)  -> (currentNode'=node37path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 51)  -> (currentNode'=node37path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 52)  -> (currentNode'=node37path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 53)  -> (currentNode'=node37path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 54)  -> (currentNode'=node37path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 55)  -> (currentNode'=node37path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 56)  -> (currentNode'=node37path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 57)  -> (currentNode'=node37path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 58)  -> (currentNode'=node37path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 59)  -> (currentNode'=node37path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 60)  -> (currentNode'=node37path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 61)  -> (currentNode'=node37path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 62)  -> (currentNode'=node37path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 63)  -> (currentNode'=node37path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 64)  -> (currentNode'=node37path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 65)  -> (currentNode'=node37path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 66)  -> (currentNode'=node37path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 67)  -> (currentNode'=node37path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 68)  -> (currentNode'=node37path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 69)  -> (currentNode'=node37path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 70)  -> (currentNode'=node37path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 71)  -> (currentNode'=node37path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 72)  -> (currentNode'=node37path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 73)  -> (currentNode'=node37path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 74)  -> (currentNode'=node37path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 75)  -> (currentNode'=node37path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 76)  -> (currentNode'=node37path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 77)  -> (currentNode'=node37path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 78)  -> (currentNode'=node37path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 79)  -> (currentNode'=node37path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 80)  -> (currentNode'=node37path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 81)  -> (currentNode'=node37path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 82)  -> (currentNode'=node37path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 83)  -> (currentNode'=node37path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 84)  -> (currentNode'=node37path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 85)  -> (currentNode'=node37path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 86)  -> (currentNode'=node37path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 87)  -> (currentNode'=node37path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 88)  -> (currentNode'=node37path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 89)  -> (currentNode'=node37path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 90)  -> (currentNode'=node37path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 91)  -> (currentNode'=node37path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 92)  -> (currentNode'=node37path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 93)  -> (currentNode'=node37path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 94)  -> (currentNode'=node37path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 95)  -> (currentNode'=node37path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 96)  -> (currentNode'=node37path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 97)  -> (currentNode'=node37path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 98)  -> (currentNode'=node37path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 99)  -> (currentNode'=node37path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 37) & (currentPath = 100)  -> (currentNode'=node37path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 1)  -> (currentNode'=node38path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 2)  -> (currentNode'=node38path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 3)  -> (currentNode'=node38path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 4)  -> (currentNode'=node38path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 5)  -> (currentNode'=node38path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 6)  -> (currentNode'=node38path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 7)  -> (currentNode'=node38path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 8)  -> (currentNode'=node38path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 9)  -> (currentNode'=node38path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 10)  -> (currentNode'=node38path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 11)  -> (currentNode'=node38path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 12)  -> (currentNode'=node38path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 13)  -> (currentNode'=node38path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 14)  -> (currentNode'=node38path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 15)  -> (currentNode'=node38path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 16)  -> (currentNode'=node38path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 17)  -> (currentNode'=node38path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 18)  -> (currentNode'=node38path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 19)  -> (currentNode'=node38path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 20)  -> (currentNode'=node38path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 21)  -> (currentNode'=node38path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 22)  -> (currentNode'=node38path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 23)  -> (currentNode'=node38path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 24)  -> (currentNode'=node38path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 25)  -> (currentNode'=node38path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 26)  -> (currentNode'=node38path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 27)  -> (currentNode'=node38path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 28)  -> (currentNode'=node38path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 29)  -> (currentNode'=node38path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 30)  -> (currentNode'=node38path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 31)  -> (currentNode'=node38path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 32)  -> (currentNode'=node38path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 33)  -> (currentNode'=node38path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 34)  -> (currentNode'=node38path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 35)  -> (currentNode'=node38path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 36)  -> (currentNode'=node38path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 37)  -> (currentNode'=node38path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 38)  -> (currentNode'=node38path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 39)  -> (currentNode'=node38path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 40)  -> (currentNode'=node38path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 41)  -> (currentNode'=node38path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 42)  -> (currentNode'=node38path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 43)  -> (currentNode'=node38path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 44)  -> (currentNode'=node38path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 45)  -> (currentNode'=node38path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 46)  -> (currentNode'=node38path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 47)  -> (currentNode'=node38path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 48)  -> (currentNode'=node38path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 49)  -> (currentNode'=node38path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 50)  -> (currentNode'=node38path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 51)  -> (currentNode'=node38path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 52)  -> (currentNode'=node38path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 53)  -> (currentNode'=node38path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 54)  -> (currentNode'=node38path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 55)  -> (currentNode'=node38path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 56)  -> (currentNode'=node38path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 57)  -> (currentNode'=node38path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 58)  -> (currentNode'=node38path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 59)  -> (currentNode'=node38path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 60)  -> (currentNode'=node38path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 61)  -> (currentNode'=node38path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 62)  -> (currentNode'=node38path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 63)  -> (currentNode'=node38path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 64)  -> (currentNode'=node38path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 65)  -> (currentNode'=node38path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 66)  -> (currentNode'=node38path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 67)  -> (currentNode'=node38path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 68)  -> (currentNode'=node38path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 69)  -> (currentNode'=node38path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 70)  -> (currentNode'=node38path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 71)  -> (currentNode'=node38path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 72)  -> (currentNode'=node38path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 73)  -> (currentNode'=node38path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 74)  -> (currentNode'=node38path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 75)  -> (currentNode'=node38path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 76)  -> (currentNode'=node38path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 77)  -> (currentNode'=node38path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 78)  -> (currentNode'=node38path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 79)  -> (currentNode'=node38path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 80)  -> (currentNode'=node38path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 81)  -> (currentNode'=node38path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 82)  -> (currentNode'=node38path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 83)  -> (currentNode'=node38path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 84)  -> (currentNode'=node38path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 85)  -> (currentNode'=node38path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 86)  -> (currentNode'=node38path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 87)  -> (currentNode'=node38path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 88)  -> (currentNode'=node38path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 89)  -> (currentNode'=node38path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 90)  -> (currentNode'=node38path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 91)  -> (currentNode'=node38path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 92)  -> (currentNode'=node38path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 93)  -> (currentNode'=node38path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 94)  -> (currentNode'=node38path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 95)  -> (currentNode'=node38path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 96)  -> (currentNode'=node38path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 97)  -> (currentNode'=node38path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 98)  -> (currentNode'=node38path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 99)  -> (currentNode'=node38path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 38) & (currentPath = 100)  -> (currentNode'=node38path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 1)  -> (currentNode'=node39path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 2)  -> (currentNode'=node39path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 3)  -> (currentNode'=node39path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 4)  -> (currentNode'=node39path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 5)  -> (currentNode'=node39path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 6)  -> (currentNode'=node39path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 7)  -> (currentNode'=node39path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 8)  -> (currentNode'=node39path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 9)  -> (currentNode'=node39path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 10)  -> (currentNode'=node39path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 11)  -> (currentNode'=node39path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 12)  -> (currentNode'=node39path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 13)  -> (currentNode'=node39path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 14)  -> (currentNode'=node39path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 15)  -> (currentNode'=node39path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 16)  -> (currentNode'=node39path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 17)  -> (currentNode'=node39path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 18)  -> (currentNode'=node39path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 19)  -> (currentNode'=node39path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 20)  -> (currentNode'=node39path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 21)  -> (currentNode'=node39path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 22)  -> (currentNode'=node39path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 23)  -> (currentNode'=node39path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 24)  -> (currentNode'=node39path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 25)  -> (currentNode'=node39path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 26)  -> (currentNode'=node39path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 27)  -> (currentNode'=node39path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 28)  -> (currentNode'=node39path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 29)  -> (currentNode'=node39path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 30)  -> (currentNode'=node39path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 31)  -> (currentNode'=node39path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 32)  -> (currentNode'=node39path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 33)  -> (currentNode'=node39path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 34)  -> (currentNode'=node39path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 35)  -> (currentNode'=node39path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 36)  -> (currentNode'=node39path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 37)  -> (currentNode'=node39path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 38)  -> (currentNode'=node39path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 39)  -> (currentNode'=node39path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 40)  -> (currentNode'=node39path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 41)  -> (currentNode'=node39path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 42)  -> (currentNode'=node39path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 43)  -> (currentNode'=node39path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 44)  -> (currentNode'=node39path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 45)  -> (currentNode'=node39path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 46)  -> (currentNode'=node39path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 47)  -> (currentNode'=node39path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 48)  -> (currentNode'=node39path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 49)  -> (currentNode'=node39path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 50)  -> (currentNode'=node39path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 51)  -> (currentNode'=node39path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 52)  -> (currentNode'=node39path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 53)  -> (currentNode'=node39path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 54)  -> (currentNode'=node39path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 55)  -> (currentNode'=node39path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 56)  -> (currentNode'=node39path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 57)  -> (currentNode'=node39path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 58)  -> (currentNode'=node39path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 59)  -> (currentNode'=node39path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 60)  -> (currentNode'=node39path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 61)  -> (currentNode'=node39path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 62)  -> (currentNode'=node39path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 63)  -> (currentNode'=node39path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 64)  -> (currentNode'=node39path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 65)  -> (currentNode'=node39path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 66)  -> (currentNode'=node39path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 67)  -> (currentNode'=node39path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 68)  -> (currentNode'=node39path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 69)  -> (currentNode'=node39path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 70)  -> (currentNode'=node39path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 71)  -> (currentNode'=node39path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 72)  -> (currentNode'=node39path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 73)  -> (currentNode'=node39path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 74)  -> (currentNode'=node39path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 75)  -> (currentNode'=node39path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 76)  -> (currentNode'=node39path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 77)  -> (currentNode'=node39path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 78)  -> (currentNode'=node39path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 79)  -> (currentNode'=node39path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 80)  -> (currentNode'=node39path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 81)  -> (currentNode'=node39path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 82)  -> (currentNode'=node39path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 83)  -> (currentNode'=node39path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 84)  -> (currentNode'=node39path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 85)  -> (currentNode'=node39path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 86)  -> (currentNode'=node39path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 87)  -> (currentNode'=node39path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 88)  -> (currentNode'=node39path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 89)  -> (currentNode'=node39path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 90)  -> (currentNode'=node39path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 91)  -> (currentNode'=node39path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 92)  -> (currentNode'=node39path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 93)  -> (currentNode'=node39path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 94)  -> (currentNode'=node39path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 95)  -> (currentNode'=node39path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 96)  -> (currentNode'=node39path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 97)  -> (currentNode'=node39path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 98)  -> (currentNode'=node39path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 99)  -> (currentNode'=node39path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 39) & (currentPath = 100)  -> (currentNode'=node39path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 1)  -> (currentNode'=node40path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 2)  -> (currentNode'=node40path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 3)  -> (currentNode'=node40path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 4)  -> (currentNode'=node40path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 5)  -> (currentNode'=node40path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 6)  -> (currentNode'=node40path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 7)  -> (currentNode'=node40path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 8)  -> (currentNode'=node40path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 9)  -> (currentNode'=node40path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 10)  -> (currentNode'=node40path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 11)  -> (currentNode'=node40path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 12)  -> (currentNode'=node40path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 13)  -> (currentNode'=node40path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 14)  -> (currentNode'=node40path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 15)  -> (currentNode'=node40path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 16)  -> (currentNode'=node40path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 17)  -> (currentNode'=node40path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 18)  -> (currentNode'=node40path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 19)  -> (currentNode'=node40path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 20)  -> (currentNode'=node40path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 21)  -> (currentNode'=node40path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 22)  -> (currentNode'=node40path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 23)  -> (currentNode'=node40path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 24)  -> (currentNode'=node40path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 25)  -> (currentNode'=node40path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 26)  -> (currentNode'=node40path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 27)  -> (currentNode'=node40path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 28)  -> (currentNode'=node40path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 29)  -> (currentNode'=node40path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 30)  -> (currentNode'=node40path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 31)  -> (currentNode'=node40path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 32)  -> (currentNode'=node40path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 33)  -> (currentNode'=node40path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 34)  -> (currentNode'=node40path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 35)  -> (currentNode'=node40path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 36)  -> (currentNode'=node40path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 37)  -> (currentNode'=node40path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 38)  -> (currentNode'=node40path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 39)  -> (currentNode'=node40path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 40)  -> (currentNode'=node40path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 41)  -> (currentNode'=node40path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 42)  -> (currentNode'=node40path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 43)  -> (currentNode'=node40path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 44)  -> (currentNode'=node40path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 45)  -> (currentNode'=node40path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 46)  -> (currentNode'=node40path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 47)  -> (currentNode'=node40path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 48)  -> (currentNode'=node40path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 49)  -> (currentNode'=node40path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 50)  -> (currentNode'=node40path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 51)  -> (currentNode'=node40path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 52)  -> (currentNode'=node40path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 53)  -> (currentNode'=node40path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 54)  -> (currentNode'=node40path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 55)  -> (currentNode'=node40path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 56)  -> (currentNode'=node40path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 57)  -> (currentNode'=node40path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 58)  -> (currentNode'=node40path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 59)  -> (currentNode'=node40path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 60)  -> (currentNode'=node40path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 61)  -> (currentNode'=node40path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 62)  -> (currentNode'=node40path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 63)  -> (currentNode'=node40path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 64)  -> (currentNode'=node40path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 65)  -> (currentNode'=node40path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 66)  -> (currentNode'=node40path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 67)  -> (currentNode'=node40path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 68)  -> (currentNode'=node40path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 69)  -> (currentNode'=node40path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 70)  -> (currentNode'=node40path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 71)  -> (currentNode'=node40path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 72)  -> (currentNode'=node40path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 73)  -> (currentNode'=node40path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 74)  -> (currentNode'=node40path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 75)  -> (currentNode'=node40path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 76)  -> (currentNode'=node40path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 77)  -> (currentNode'=node40path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 78)  -> (currentNode'=node40path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 79)  -> (currentNode'=node40path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 80)  -> (currentNode'=node40path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 81)  -> (currentNode'=node40path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 82)  -> (currentNode'=node40path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 83)  -> (currentNode'=node40path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 84)  -> (currentNode'=node40path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 85)  -> (currentNode'=node40path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 86)  -> (currentNode'=node40path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 87)  -> (currentNode'=node40path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 88)  -> (currentNode'=node40path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 89)  -> (currentNode'=node40path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 90)  -> (currentNode'=node40path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 91)  -> (currentNode'=node40path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 92)  -> (currentNode'=node40path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 93)  -> (currentNode'=node40path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 94)  -> (currentNode'=node40path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 95)  -> (currentNode'=node40path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 96)  -> (currentNode'=node40path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 97)  -> (currentNode'=node40path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 98)  -> (currentNode'=node40path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 99)  -> (currentNode'=node40path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 40) & (currentPath = 100)  -> (currentNode'=node40path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 1)  -> (currentNode'=node41path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 2)  -> (currentNode'=node41path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 3)  -> (currentNode'=node41path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 4)  -> (currentNode'=node41path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 5)  -> (currentNode'=node41path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 6)  -> (currentNode'=node41path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 7)  -> (currentNode'=node41path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 8)  -> (currentNode'=node41path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 9)  -> (currentNode'=node41path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 10)  -> (currentNode'=node41path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 11)  -> (currentNode'=node41path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 12)  -> (currentNode'=node41path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 13)  -> (currentNode'=node41path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 14)  -> (currentNode'=node41path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 15)  -> (currentNode'=node41path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 16)  -> (currentNode'=node41path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 17)  -> (currentNode'=node41path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 18)  -> (currentNode'=node41path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 19)  -> (currentNode'=node41path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 20)  -> (currentNode'=node41path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 21)  -> (currentNode'=node41path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 22)  -> (currentNode'=node41path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 23)  -> (currentNode'=node41path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 24)  -> (currentNode'=node41path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 25)  -> (currentNode'=node41path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 26)  -> (currentNode'=node41path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 27)  -> (currentNode'=node41path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 28)  -> (currentNode'=node41path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 29)  -> (currentNode'=node41path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 30)  -> (currentNode'=node41path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 31)  -> (currentNode'=node41path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 32)  -> (currentNode'=node41path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 33)  -> (currentNode'=node41path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 34)  -> (currentNode'=node41path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 35)  -> (currentNode'=node41path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 36)  -> (currentNode'=node41path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 37)  -> (currentNode'=node41path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 38)  -> (currentNode'=node41path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 39)  -> (currentNode'=node41path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 40)  -> (currentNode'=node41path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 41)  -> (currentNode'=node41path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 42)  -> (currentNode'=node41path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 43)  -> (currentNode'=node41path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 44)  -> (currentNode'=node41path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 45)  -> (currentNode'=node41path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 46)  -> (currentNode'=node41path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 47)  -> (currentNode'=node41path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 48)  -> (currentNode'=node41path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 49)  -> (currentNode'=node41path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 50)  -> (currentNode'=node41path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 51)  -> (currentNode'=node41path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 52)  -> (currentNode'=node41path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 53)  -> (currentNode'=node41path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 54)  -> (currentNode'=node41path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 55)  -> (currentNode'=node41path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 56)  -> (currentNode'=node41path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 57)  -> (currentNode'=node41path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 58)  -> (currentNode'=node41path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 59)  -> (currentNode'=node41path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 60)  -> (currentNode'=node41path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 61)  -> (currentNode'=node41path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 62)  -> (currentNode'=node41path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 63)  -> (currentNode'=node41path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 64)  -> (currentNode'=node41path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 65)  -> (currentNode'=node41path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 66)  -> (currentNode'=node41path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 67)  -> (currentNode'=node41path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 68)  -> (currentNode'=node41path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 69)  -> (currentNode'=node41path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 70)  -> (currentNode'=node41path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 71)  -> (currentNode'=node41path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 72)  -> (currentNode'=node41path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 73)  -> (currentNode'=node41path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 74)  -> (currentNode'=node41path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 75)  -> (currentNode'=node41path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 76)  -> (currentNode'=node41path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 77)  -> (currentNode'=node41path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 78)  -> (currentNode'=node41path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 79)  -> (currentNode'=node41path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 80)  -> (currentNode'=node41path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 81)  -> (currentNode'=node41path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 82)  -> (currentNode'=node41path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 83)  -> (currentNode'=node41path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 84)  -> (currentNode'=node41path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 85)  -> (currentNode'=node41path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 86)  -> (currentNode'=node41path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 87)  -> (currentNode'=node41path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 88)  -> (currentNode'=node41path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 89)  -> (currentNode'=node41path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 90)  -> (currentNode'=node41path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 91)  -> (currentNode'=node41path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 92)  -> (currentNode'=node41path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 93)  -> (currentNode'=node41path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 94)  -> (currentNode'=node41path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 95)  -> (currentNode'=node41path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 96)  -> (currentNode'=node41path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 97)  -> (currentNode'=node41path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 98)  -> (currentNode'=node41path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 99)  -> (currentNode'=node41path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 41) & (currentPath = 100)  -> (currentNode'=node41path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 1)  -> (currentNode'=node42path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 2)  -> (currentNode'=node42path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 3)  -> (currentNode'=node42path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 4)  -> (currentNode'=node42path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 5)  -> (currentNode'=node42path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 6)  -> (currentNode'=node42path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 7)  -> (currentNode'=node42path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 8)  -> (currentNode'=node42path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 9)  -> (currentNode'=node42path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 10)  -> (currentNode'=node42path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 11)  -> (currentNode'=node42path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 12)  -> (currentNode'=node42path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 13)  -> (currentNode'=node42path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 14)  -> (currentNode'=node42path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 15)  -> (currentNode'=node42path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 16)  -> (currentNode'=node42path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 17)  -> (currentNode'=node42path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 18)  -> (currentNode'=node42path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 19)  -> (currentNode'=node42path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 20)  -> (currentNode'=node42path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 21)  -> (currentNode'=node42path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 22)  -> (currentNode'=node42path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 23)  -> (currentNode'=node42path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 24)  -> (currentNode'=node42path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 25)  -> (currentNode'=node42path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 26)  -> (currentNode'=node42path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 27)  -> (currentNode'=node42path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 28)  -> (currentNode'=node42path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 29)  -> (currentNode'=node42path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 30)  -> (currentNode'=node42path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 31)  -> (currentNode'=node42path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 32)  -> (currentNode'=node42path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 33)  -> (currentNode'=node42path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 34)  -> (currentNode'=node42path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 35)  -> (currentNode'=node42path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 36)  -> (currentNode'=node42path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 37)  -> (currentNode'=node42path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 38)  -> (currentNode'=node42path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 39)  -> (currentNode'=node42path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 40)  -> (currentNode'=node42path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 41)  -> (currentNode'=node42path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 42)  -> (currentNode'=node42path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 43)  -> (currentNode'=node42path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 44)  -> (currentNode'=node42path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 45)  -> (currentNode'=node42path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 46)  -> (currentNode'=node42path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 47)  -> (currentNode'=node42path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 48)  -> (currentNode'=node42path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 49)  -> (currentNode'=node42path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 50)  -> (currentNode'=node42path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 51)  -> (currentNode'=node42path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 52)  -> (currentNode'=node42path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 53)  -> (currentNode'=node42path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 54)  -> (currentNode'=node42path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 55)  -> (currentNode'=node42path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 56)  -> (currentNode'=node42path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 57)  -> (currentNode'=node42path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 58)  -> (currentNode'=node42path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 59)  -> (currentNode'=node42path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 60)  -> (currentNode'=node42path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 61)  -> (currentNode'=node42path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 62)  -> (currentNode'=node42path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 63)  -> (currentNode'=node42path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 64)  -> (currentNode'=node42path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 65)  -> (currentNode'=node42path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 66)  -> (currentNode'=node42path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 67)  -> (currentNode'=node42path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 68)  -> (currentNode'=node42path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 69)  -> (currentNode'=node42path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 70)  -> (currentNode'=node42path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 71)  -> (currentNode'=node42path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 72)  -> (currentNode'=node42path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 73)  -> (currentNode'=node42path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 74)  -> (currentNode'=node42path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 75)  -> (currentNode'=node42path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 76)  -> (currentNode'=node42path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 77)  -> (currentNode'=node42path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 78)  -> (currentNode'=node42path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 79)  -> (currentNode'=node42path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 80)  -> (currentNode'=node42path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 81)  -> (currentNode'=node42path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 82)  -> (currentNode'=node42path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 83)  -> (currentNode'=node42path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 84)  -> (currentNode'=node42path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 85)  -> (currentNode'=node42path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 86)  -> (currentNode'=node42path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 87)  -> (currentNode'=node42path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 88)  -> (currentNode'=node42path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 89)  -> (currentNode'=node42path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 90)  -> (currentNode'=node42path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 91)  -> (currentNode'=node42path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 92)  -> (currentNode'=node42path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 93)  -> (currentNode'=node42path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 94)  -> (currentNode'=node42path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 95)  -> (currentNode'=node42path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 96)  -> (currentNode'=node42path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 97)  -> (currentNode'=node42path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 98)  -> (currentNode'=node42path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 99)  -> (currentNode'=node42path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 42) & (currentPath = 100)  -> (currentNode'=node42path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 1)  -> (currentNode'=node43path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 2)  -> (currentNode'=node43path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 3)  -> (currentNode'=node43path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 4)  -> (currentNode'=node43path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 5)  -> (currentNode'=node43path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 6)  -> (currentNode'=node43path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 7)  -> (currentNode'=node43path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 8)  -> (currentNode'=node43path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 9)  -> (currentNode'=node43path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 10)  -> (currentNode'=node43path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 11)  -> (currentNode'=node43path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 12)  -> (currentNode'=node43path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 13)  -> (currentNode'=node43path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 14)  -> (currentNode'=node43path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 15)  -> (currentNode'=node43path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 16)  -> (currentNode'=node43path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 17)  -> (currentNode'=node43path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 18)  -> (currentNode'=node43path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 19)  -> (currentNode'=node43path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 20)  -> (currentNode'=node43path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 21)  -> (currentNode'=node43path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 22)  -> (currentNode'=node43path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 23)  -> (currentNode'=node43path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 24)  -> (currentNode'=node43path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 25)  -> (currentNode'=node43path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 26)  -> (currentNode'=node43path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 27)  -> (currentNode'=node43path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 28)  -> (currentNode'=node43path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 29)  -> (currentNode'=node43path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 30)  -> (currentNode'=node43path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 31)  -> (currentNode'=node43path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 32)  -> (currentNode'=node43path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 33)  -> (currentNode'=node43path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 34)  -> (currentNode'=node43path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 35)  -> (currentNode'=node43path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 36)  -> (currentNode'=node43path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 37)  -> (currentNode'=node43path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 38)  -> (currentNode'=node43path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 39)  -> (currentNode'=node43path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 40)  -> (currentNode'=node43path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 41)  -> (currentNode'=node43path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 42)  -> (currentNode'=node43path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 43)  -> (currentNode'=node43path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 44)  -> (currentNode'=node43path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 45)  -> (currentNode'=node43path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 46)  -> (currentNode'=node43path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 47)  -> (currentNode'=node43path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 48)  -> (currentNode'=node43path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 49)  -> (currentNode'=node43path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 50)  -> (currentNode'=node43path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 51)  -> (currentNode'=node43path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 52)  -> (currentNode'=node43path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 53)  -> (currentNode'=node43path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 54)  -> (currentNode'=node43path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 55)  -> (currentNode'=node43path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 56)  -> (currentNode'=node43path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 57)  -> (currentNode'=node43path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 58)  -> (currentNode'=node43path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 59)  -> (currentNode'=node43path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 60)  -> (currentNode'=node43path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 61)  -> (currentNode'=node43path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 62)  -> (currentNode'=node43path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 63)  -> (currentNode'=node43path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 64)  -> (currentNode'=node43path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 65)  -> (currentNode'=node43path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 66)  -> (currentNode'=node43path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 67)  -> (currentNode'=node43path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 68)  -> (currentNode'=node43path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 69)  -> (currentNode'=node43path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 70)  -> (currentNode'=node43path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 71)  -> (currentNode'=node43path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 72)  -> (currentNode'=node43path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 73)  -> (currentNode'=node43path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 74)  -> (currentNode'=node43path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 75)  -> (currentNode'=node43path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 76)  -> (currentNode'=node43path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 77)  -> (currentNode'=node43path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 78)  -> (currentNode'=node43path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 79)  -> (currentNode'=node43path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 80)  -> (currentNode'=node43path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 81)  -> (currentNode'=node43path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 82)  -> (currentNode'=node43path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 83)  -> (currentNode'=node43path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 84)  -> (currentNode'=node43path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 85)  -> (currentNode'=node43path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 86)  -> (currentNode'=node43path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 87)  -> (currentNode'=node43path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 88)  -> (currentNode'=node43path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 89)  -> (currentNode'=node43path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 90)  -> (currentNode'=node43path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 91)  -> (currentNode'=node43path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 92)  -> (currentNode'=node43path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 93)  -> (currentNode'=node43path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 94)  -> (currentNode'=node43path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 95)  -> (currentNode'=node43path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 96)  -> (currentNode'=node43path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 97)  -> (currentNode'=node43path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 98)  -> (currentNode'=node43path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 99)  -> (currentNode'=node43path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 43) & (currentPath = 100)  -> (currentNode'=node43path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 1)  -> (currentNode'=node44path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 2)  -> (currentNode'=node44path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 3)  -> (currentNode'=node44path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 4)  -> (currentNode'=node44path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 5)  -> (currentNode'=node44path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 6)  -> (currentNode'=node44path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 7)  -> (currentNode'=node44path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 8)  -> (currentNode'=node44path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 9)  -> (currentNode'=node44path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 10)  -> (currentNode'=node44path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 11)  -> (currentNode'=node44path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 12)  -> (currentNode'=node44path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 13)  -> (currentNode'=node44path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 14)  -> (currentNode'=node44path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 15)  -> (currentNode'=node44path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 16)  -> (currentNode'=node44path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 17)  -> (currentNode'=node44path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 18)  -> (currentNode'=node44path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 19)  -> (currentNode'=node44path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 20)  -> (currentNode'=node44path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 21)  -> (currentNode'=node44path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 22)  -> (currentNode'=node44path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 23)  -> (currentNode'=node44path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 24)  -> (currentNode'=node44path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 25)  -> (currentNode'=node44path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 26)  -> (currentNode'=node44path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 27)  -> (currentNode'=node44path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 28)  -> (currentNode'=node44path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 29)  -> (currentNode'=node44path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 30)  -> (currentNode'=node44path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 31)  -> (currentNode'=node44path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 32)  -> (currentNode'=node44path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 33)  -> (currentNode'=node44path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 34)  -> (currentNode'=node44path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 35)  -> (currentNode'=node44path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 36)  -> (currentNode'=node44path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 37)  -> (currentNode'=node44path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 38)  -> (currentNode'=node44path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 39)  -> (currentNode'=node44path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 40)  -> (currentNode'=node44path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 41)  -> (currentNode'=node44path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 42)  -> (currentNode'=node44path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 43)  -> (currentNode'=node44path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 44)  -> (currentNode'=node44path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 45)  -> (currentNode'=node44path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 46)  -> (currentNode'=node44path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 47)  -> (currentNode'=node44path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 48)  -> (currentNode'=node44path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 49)  -> (currentNode'=node44path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 50)  -> (currentNode'=node44path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 51)  -> (currentNode'=node44path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 52)  -> (currentNode'=node44path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 53)  -> (currentNode'=node44path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 54)  -> (currentNode'=node44path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 55)  -> (currentNode'=node44path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 56)  -> (currentNode'=node44path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 57)  -> (currentNode'=node44path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 58)  -> (currentNode'=node44path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 59)  -> (currentNode'=node44path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 60)  -> (currentNode'=node44path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 61)  -> (currentNode'=node44path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 62)  -> (currentNode'=node44path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 63)  -> (currentNode'=node44path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 64)  -> (currentNode'=node44path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 65)  -> (currentNode'=node44path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 66)  -> (currentNode'=node44path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 67)  -> (currentNode'=node44path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 68)  -> (currentNode'=node44path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 69)  -> (currentNode'=node44path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 70)  -> (currentNode'=node44path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 71)  -> (currentNode'=node44path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 72)  -> (currentNode'=node44path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 73)  -> (currentNode'=node44path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 74)  -> (currentNode'=node44path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 75)  -> (currentNode'=node44path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 76)  -> (currentNode'=node44path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 77)  -> (currentNode'=node44path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 78)  -> (currentNode'=node44path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 79)  -> (currentNode'=node44path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 80)  -> (currentNode'=node44path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 81)  -> (currentNode'=node44path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 82)  -> (currentNode'=node44path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 83)  -> (currentNode'=node44path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 84)  -> (currentNode'=node44path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 85)  -> (currentNode'=node44path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 86)  -> (currentNode'=node44path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 87)  -> (currentNode'=node44path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 88)  -> (currentNode'=node44path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 89)  -> (currentNode'=node44path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 90)  -> (currentNode'=node44path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 91)  -> (currentNode'=node44path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 92)  -> (currentNode'=node44path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 93)  -> (currentNode'=node44path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 94)  -> (currentNode'=node44path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 95)  -> (currentNode'=node44path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 96)  -> (currentNode'=node44path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 97)  -> (currentNode'=node44path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 98)  -> (currentNode'=node44path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 99)  -> (currentNode'=node44path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 44) & (currentPath = 100)  -> (currentNode'=node44path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 1)  -> (currentNode'=node45path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 2)  -> (currentNode'=node45path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 3)  -> (currentNode'=node45path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 4)  -> (currentNode'=node45path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 5)  -> (currentNode'=node45path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 6)  -> (currentNode'=node45path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 7)  -> (currentNode'=node45path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 8)  -> (currentNode'=node45path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 9)  -> (currentNode'=node45path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 10)  -> (currentNode'=node45path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 11)  -> (currentNode'=node45path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 12)  -> (currentNode'=node45path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 13)  -> (currentNode'=node45path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 14)  -> (currentNode'=node45path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 15)  -> (currentNode'=node45path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 16)  -> (currentNode'=node45path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 17)  -> (currentNode'=node45path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 18)  -> (currentNode'=node45path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 19)  -> (currentNode'=node45path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 20)  -> (currentNode'=node45path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 21)  -> (currentNode'=node45path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 22)  -> (currentNode'=node45path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 23)  -> (currentNode'=node45path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 24)  -> (currentNode'=node45path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 25)  -> (currentNode'=node45path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 26)  -> (currentNode'=node45path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 27)  -> (currentNode'=node45path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 28)  -> (currentNode'=node45path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 29)  -> (currentNode'=node45path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 30)  -> (currentNode'=node45path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 31)  -> (currentNode'=node45path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 32)  -> (currentNode'=node45path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 33)  -> (currentNode'=node45path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 34)  -> (currentNode'=node45path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 35)  -> (currentNode'=node45path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 36)  -> (currentNode'=node45path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 37)  -> (currentNode'=node45path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 38)  -> (currentNode'=node45path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 39)  -> (currentNode'=node45path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 40)  -> (currentNode'=node45path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 41)  -> (currentNode'=node45path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 42)  -> (currentNode'=node45path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 43)  -> (currentNode'=node45path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 44)  -> (currentNode'=node45path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 45)  -> (currentNode'=node45path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 46)  -> (currentNode'=node45path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 47)  -> (currentNode'=node45path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 48)  -> (currentNode'=node45path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 49)  -> (currentNode'=node45path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 50)  -> (currentNode'=node45path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 51)  -> (currentNode'=node45path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 52)  -> (currentNode'=node45path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 53)  -> (currentNode'=node45path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 54)  -> (currentNode'=node45path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 55)  -> (currentNode'=node45path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 56)  -> (currentNode'=node45path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 57)  -> (currentNode'=node45path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 58)  -> (currentNode'=node45path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 59)  -> (currentNode'=node45path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 60)  -> (currentNode'=node45path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 61)  -> (currentNode'=node45path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 62)  -> (currentNode'=node45path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 63)  -> (currentNode'=node45path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 64)  -> (currentNode'=node45path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 65)  -> (currentNode'=node45path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 66)  -> (currentNode'=node45path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 67)  -> (currentNode'=node45path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 68)  -> (currentNode'=node45path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 69)  -> (currentNode'=node45path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 70)  -> (currentNode'=node45path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 71)  -> (currentNode'=node45path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 72)  -> (currentNode'=node45path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 73)  -> (currentNode'=node45path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 74)  -> (currentNode'=node45path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 75)  -> (currentNode'=node45path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 76)  -> (currentNode'=node45path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 77)  -> (currentNode'=node45path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 78)  -> (currentNode'=node45path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 79)  -> (currentNode'=node45path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 80)  -> (currentNode'=node45path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 81)  -> (currentNode'=node45path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 82)  -> (currentNode'=node45path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 83)  -> (currentNode'=node45path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 84)  -> (currentNode'=node45path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 85)  -> (currentNode'=node45path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 86)  -> (currentNode'=node45path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 87)  -> (currentNode'=node45path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 88)  -> (currentNode'=node45path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 89)  -> (currentNode'=node45path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 90)  -> (currentNode'=node45path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 91)  -> (currentNode'=node45path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 92)  -> (currentNode'=node45path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 93)  -> (currentNode'=node45path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 94)  -> (currentNode'=node45path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 95)  -> (currentNode'=node45path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 96)  -> (currentNode'=node45path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 97)  -> (currentNode'=node45path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 98)  -> (currentNode'=node45path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 99)  -> (currentNode'=node45path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 45) & (currentPath = 100)  -> (currentNode'=node45path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 1)  -> (currentNode'=node46path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 2)  -> (currentNode'=node46path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 3)  -> (currentNode'=node46path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 4)  -> (currentNode'=node46path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 5)  -> (currentNode'=node46path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 6)  -> (currentNode'=node46path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 7)  -> (currentNode'=node46path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 8)  -> (currentNode'=node46path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 9)  -> (currentNode'=node46path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 10)  -> (currentNode'=node46path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 11)  -> (currentNode'=node46path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 12)  -> (currentNode'=node46path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 13)  -> (currentNode'=node46path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 14)  -> (currentNode'=node46path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 15)  -> (currentNode'=node46path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 16)  -> (currentNode'=node46path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 17)  -> (currentNode'=node46path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 18)  -> (currentNode'=node46path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 19)  -> (currentNode'=node46path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 20)  -> (currentNode'=node46path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 21)  -> (currentNode'=node46path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 22)  -> (currentNode'=node46path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 23)  -> (currentNode'=node46path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 24)  -> (currentNode'=node46path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 25)  -> (currentNode'=node46path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 26)  -> (currentNode'=node46path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 27)  -> (currentNode'=node46path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 28)  -> (currentNode'=node46path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 29)  -> (currentNode'=node46path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 30)  -> (currentNode'=node46path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 31)  -> (currentNode'=node46path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 32)  -> (currentNode'=node46path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 33)  -> (currentNode'=node46path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 34)  -> (currentNode'=node46path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 35)  -> (currentNode'=node46path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 36)  -> (currentNode'=node46path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 37)  -> (currentNode'=node46path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 38)  -> (currentNode'=node46path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 39)  -> (currentNode'=node46path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 40)  -> (currentNode'=node46path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 41)  -> (currentNode'=node46path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 42)  -> (currentNode'=node46path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 43)  -> (currentNode'=node46path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 44)  -> (currentNode'=node46path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 45)  -> (currentNode'=node46path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 46)  -> (currentNode'=node46path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 47)  -> (currentNode'=node46path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 48)  -> (currentNode'=node46path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 49)  -> (currentNode'=node46path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 50)  -> (currentNode'=node46path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 51)  -> (currentNode'=node46path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 52)  -> (currentNode'=node46path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 53)  -> (currentNode'=node46path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 54)  -> (currentNode'=node46path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 55)  -> (currentNode'=node46path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 56)  -> (currentNode'=node46path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 57)  -> (currentNode'=node46path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 58)  -> (currentNode'=node46path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 59)  -> (currentNode'=node46path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 60)  -> (currentNode'=node46path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 61)  -> (currentNode'=node46path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 62)  -> (currentNode'=node46path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 63)  -> (currentNode'=node46path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 64)  -> (currentNode'=node46path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 65)  -> (currentNode'=node46path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 66)  -> (currentNode'=node46path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 67)  -> (currentNode'=node46path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 68)  -> (currentNode'=node46path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 69)  -> (currentNode'=node46path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 70)  -> (currentNode'=node46path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 71)  -> (currentNode'=node46path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 72)  -> (currentNode'=node46path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 73)  -> (currentNode'=node46path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 74)  -> (currentNode'=node46path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 75)  -> (currentNode'=node46path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 76)  -> (currentNode'=node46path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 77)  -> (currentNode'=node46path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 78)  -> (currentNode'=node46path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 79)  -> (currentNode'=node46path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 80)  -> (currentNode'=node46path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 81)  -> (currentNode'=node46path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 82)  -> (currentNode'=node46path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 83)  -> (currentNode'=node46path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 84)  -> (currentNode'=node46path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 85)  -> (currentNode'=node46path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 86)  -> (currentNode'=node46path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 87)  -> (currentNode'=node46path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 88)  -> (currentNode'=node46path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 89)  -> (currentNode'=node46path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 90)  -> (currentNode'=node46path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 91)  -> (currentNode'=node46path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 92)  -> (currentNode'=node46path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 93)  -> (currentNode'=node46path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 94)  -> (currentNode'=node46path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 95)  -> (currentNode'=node46path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 96)  -> (currentNode'=node46path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 97)  -> (currentNode'=node46path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 98)  -> (currentNode'=node46path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 99)  -> (currentNode'=node46path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 46) & (currentPath = 100)  -> (currentNode'=node46path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 1)  -> (currentNode'=node47path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 2)  -> (currentNode'=node47path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 3)  -> (currentNode'=node47path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 4)  -> (currentNode'=node47path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 5)  -> (currentNode'=node47path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 6)  -> (currentNode'=node47path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 7)  -> (currentNode'=node47path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 8)  -> (currentNode'=node47path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 9)  -> (currentNode'=node47path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 10)  -> (currentNode'=node47path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 11)  -> (currentNode'=node47path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 12)  -> (currentNode'=node47path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 13)  -> (currentNode'=node47path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 14)  -> (currentNode'=node47path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 15)  -> (currentNode'=node47path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 16)  -> (currentNode'=node47path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 17)  -> (currentNode'=node47path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 18)  -> (currentNode'=node47path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 19)  -> (currentNode'=node47path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 20)  -> (currentNode'=node47path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 21)  -> (currentNode'=node47path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 22)  -> (currentNode'=node47path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 23)  -> (currentNode'=node47path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 24)  -> (currentNode'=node47path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 25)  -> (currentNode'=node47path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 26)  -> (currentNode'=node47path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 27)  -> (currentNode'=node47path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 28)  -> (currentNode'=node47path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 29)  -> (currentNode'=node47path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 30)  -> (currentNode'=node47path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 31)  -> (currentNode'=node47path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 32)  -> (currentNode'=node47path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 33)  -> (currentNode'=node47path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 34)  -> (currentNode'=node47path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 35)  -> (currentNode'=node47path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 36)  -> (currentNode'=node47path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 37)  -> (currentNode'=node47path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 38)  -> (currentNode'=node47path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 39)  -> (currentNode'=node47path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 40)  -> (currentNode'=node47path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 41)  -> (currentNode'=node47path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 42)  -> (currentNode'=node47path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 43)  -> (currentNode'=node47path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 44)  -> (currentNode'=node47path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 45)  -> (currentNode'=node47path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 46)  -> (currentNode'=node47path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 47)  -> (currentNode'=node47path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 48)  -> (currentNode'=node47path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 49)  -> (currentNode'=node47path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 50)  -> (currentNode'=node47path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 51)  -> (currentNode'=node47path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 52)  -> (currentNode'=node47path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 53)  -> (currentNode'=node47path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 54)  -> (currentNode'=node47path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 55)  -> (currentNode'=node47path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 56)  -> (currentNode'=node47path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 57)  -> (currentNode'=node47path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 58)  -> (currentNode'=node47path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 59)  -> (currentNode'=node47path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 60)  -> (currentNode'=node47path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 61)  -> (currentNode'=node47path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 62)  -> (currentNode'=node47path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 63)  -> (currentNode'=node47path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 64)  -> (currentNode'=node47path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 65)  -> (currentNode'=node47path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 66)  -> (currentNode'=node47path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 67)  -> (currentNode'=node47path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 68)  -> (currentNode'=node47path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 69)  -> (currentNode'=node47path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 70)  -> (currentNode'=node47path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 71)  -> (currentNode'=node47path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 72)  -> (currentNode'=node47path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 73)  -> (currentNode'=node47path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 74)  -> (currentNode'=node47path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 75)  -> (currentNode'=node47path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 76)  -> (currentNode'=node47path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 77)  -> (currentNode'=node47path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 78)  -> (currentNode'=node47path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 79)  -> (currentNode'=node47path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 80)  -> (currentNode'=node47path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 81)  -> (currentNode'=node47path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 82)  -> (currentNode'=node47path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 83)  -> (currentNode'=node47path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 84)  -> (currentNode'=node47path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 85)  -> (currentNode'=node47path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 86)  -> (currentNode'=node47path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 87)  -> (currentNode'=node47path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 88)  -> (currentNode'=node47path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 89)  -> (currentNode'=node47path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 90)  -> (currentNode'=node47path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 91)  -> (currentNode'=node47path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 92)  -> (currentNode'=node47path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 93)  -> (currentNode'=node47path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 94)  -> (currentNode'=node47path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 95)  -> (currentNode'=node47path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 96)  -> (currentNode'=node47path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 97)  -> (currentNode'=node47path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 98)  -> (currentNode'=node47path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 99)  -> (currentNode'=node47path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 47) & (currentPath = 100)  -> (currentNode'=node47path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 1)  -> (currentNode'=node48path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 2)  -> (currentNode'=node48path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 3)  -> (currentNode'=node48path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 4)  -> (currentNode'=node48path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 5)  -> (currentNode'=node48path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 6)  -> (currentNode'=node48path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 7)  -> (currentNode'=node48path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 8)  -> (currentNode'=node48path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 9)  -> (currentNode'=node48path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 10)  -> (currentNode'=node48path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 11)  -> (currentNode'=node48path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 12)  -> (currentNode'=node48path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 13)  -> (currentNode'=node48path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 14)  -> (currentNode'=node48path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 15)  -> (currentNode'=node48path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 16)  -> (currentNode'=node48path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 17)  -> (currentNode'=node48path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 18)  -> (currentNode'=node48path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 19)  -> (currentNode'=node48path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 20)  -> (currentNode'=node48path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 21)  -> (currentNode'=node48path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 22)  -> (currentNode'=node48path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 23)  -> (currentNode'=node48path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 24)  -> (currentNode'=node48path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 25)  -> (currentNode'=node48path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 26)  -> (currentNode'=node48path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 27)  -> (currentNode'=node48path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 28)  -> (currentNode'=node48path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 29)  -> (currentNode'=node48path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 30)  -> (currentNode'=node48path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 31)  -> (currentNode'=node48path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 32)  -> (currentNode'=node48path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 33)  -> (currentNode'=node48path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 34)  -> (currentNode'=node48path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 35)  -> (currentNode'=node48path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 36)  -> (currentNode'=node48path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 37)  -> (currentNode'=node48path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 38)  -> (currentNode'=node48path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 39)  -> (currentNode'=node48path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 40)  -> (currentNode'=node48path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 41)  -> (currentNode'=node48path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 42)  -> (currentNode'=node48path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 43)  -> (currentNode'=node48path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 44)  -> (currentNode'=node48path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 45)  -> (currentNode'=node48path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 46)  -> (currentNode'=node48path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 47)  -> (currentNode'=node48path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 48)  -> (currentNode'=node48path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 49)  -> (currentNode'=node48path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 50)  -> (currentNode'=node48path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 51)  -> (currentNode'=node48path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 52)  -> (currentNode'=node48path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 53)  -> (currentNode'=node48path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 54)  -> (currentNode'=node48path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 55)  -> (currentNode'=node48path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 56)  -> (currentNode'=node48path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 57)  -> (currentNode'=node48path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 58)  -> (currentNode'=node48path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 59)  -> (currentNode'=node48path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 60)  -> (currentNode'=node48path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 61)  -> (currentNode'=node48path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 62)  -> (currentNode'=node48path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 63)  -> (currentNode'=node48path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 64)  -> (currentNode'=node48path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 65)  -> (currentNode'=node48path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 66)  -> (currentNode'=node48path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 67)  -> (currentNode'=node48path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 68)  -> (currentNode'=node48path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 69)  -> (currentNode'=node48path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 70)  -> (currentNode'=node48path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 71)  -> (currentNode'=node48path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 72)  -> (currentNode'=node48path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 73)  -> (currentNode'=node48path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 74)  -> (currentNode'=node48path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 75)  -> (currentNode'=node48path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 76)  -> (currentNode'=node48path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 77)  -> (currentNode'=node48path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 78)  -> (currentNode'=node48path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 79)  -> (currentNode'=node48path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 80)  -> (currentNode'=node48path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 81)  -> (currentNode'=node48path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 82)  -> (currentNode'=node48path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 83)  -> (currentNode'=node48path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 84)  -> (currentNode'=node48path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 85)  -> (currentNode'=node48path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 86)  -> (currentNode'=node48path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 87)  -> (currentNode'=node48path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 88)  -> (currentNode'=node48path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 89)  -> (currentNode'=node48path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 90)  -> (currentNode'=node48path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 91)  -> (currentNode'=node48path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 92)  -> (currentNode'=node48path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 93)  -> (currentNode'=node48path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 94)  -> (currentNode'=node48path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 95)  -> (currentNode'=node48path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 96)  -> (currentNode'=node48path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 97)  -> (currentNode'=node48path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 98)  -> (currentNode'=node48path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 99)  -> (currentNode'=node48path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 48) & (currentPath = 100)  -> (currentNode'=node48path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 1)  -> (currentNode'=node49path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 2)  -> (currentNode'=node49path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 3)  -> (currentNode'=node49path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 4)  -> (currentNode'=node49path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 5)  -> (currentNode'=node49path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 6)  -> (currentNode'=node49path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 7)  -> (currentNode'=node49path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 8)  -> (currentNode'=node49path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 9)  -> (currentNode'=node49path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 10)  -> (currentNode'=node49path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 11)  -> (currentNode'=node49path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 12)  -> (currentNode'=node49path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 13)  -> (currentNode'=node49path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 14)  -> (currentNode'=node49path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 15)  -> (currentNode'=node49path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 16)  -> (currentNode'=node49path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 17)  -> (currentNode'=node49path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 18)  -> (currentNode'=node49path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 19)  -> (currentNode'=node49path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 20)  -> (currentNode'=node49path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 21)  -> (currentNode'=node49path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 22)  -> (currentNode'=node49path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 23)  -> (currentNode'=node49path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 24)  -> (currentNode'=node49path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 25)  -> (currentNode'=node49path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 26)  -> (currentNode'=node49path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 27)  -> (currentNode'=node49path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 28)  -> (currentNode'=node49path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 29)  -> (currentNode'=node49path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 30)  -> (currentNode'=node49path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 31)  -> (currentNode'=node49path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 32)  -> (currentNode'=node49path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 33)  -> (currentNode'=node49path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 34)  -> (currentNode'=node49path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 35)  -> (currentNode'=node49path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 36)  -> (currentNode'=node49path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 37)  -> (currentNode'=node49path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 38)  -> (currentNode'=node49path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 39)  -> (currentNode'=node49path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 40)  -> (currentNode'=node49path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 41)  -> (currentNode'=node49path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 42)  -> (currentNode'=node49path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 43)  -> (currentNode'=node49path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 44)  -> (currentNode'=node49path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 45)  -> (currentNode'=node49path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 46)  -> (currentNode'=node49path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 47)  -> (currentNode'=node49path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 48)  -> (currentNode'=node49path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 49)  -> (currentNode'=node49path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 50)  -> (currentNode'=node49path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 51)  -> (currentNode'=node49path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 52)  -> (currentNode'=node49path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 53)  -> (currentNode'=node49path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 54)  -> (currentNode'=node49path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 55)  -> (currentNode'=node49path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 56)  -> (currentNode'=node49path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 57)  -> (currentNode'=node49path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 58)  -> (currentNode'=node49path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 59)  -> (currentNode'=node49path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 60)  -> (currentNode'=node49path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 61)  -> (currentNode'=node49path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 62)  -> (currentNode'=node49path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 63)  -> (currentNode'=node49path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 64)  -> (currentNode'=node49path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 65)  -> (currentNode'=node49path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 66)  -> (currentNode'=node49path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 67)  -> (currentNode'=node49path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 68)  -> (currentNode'=node49path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 69)  -> (currentNode'=node49path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 70)  -> (currentNode'=node49path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 71)  -> (currentNode'=node49path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 72)  -> (currentNode'=node49path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 73)  -> (currentNode'=node49path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 74)  -> (currentNode'=node49path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 75)  -> (currentNode'=node49path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 76)  -> (currentNode'=node49path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 77)  -> (currentNode'=node49path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 78)  -> (currentNode'=node49path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 79)  -> (currentNode'=node49path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 80)  -> (currentNode'=node49path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 81)  -> (currentNode'=node49path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 82)  -> (currentNode'=node49path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 83)  -> (currentNode'=node49path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 84)  -> (currentNode'=node49path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 85)  -> (currentNode'=node49path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 86)  -> (currentNode'=node49path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 87)  -> (currentNode'=node49path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 88)  -> (currentNode'=node49path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 89)  -> (currentNode'=node49path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 90)  -> (currentNode'=node49path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 91)  -> (currentNode'=node49path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 92)  -> (currentNode'=node49path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 93)  -> (currentNode'=node49path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 94)  -> (currentNode'=node49path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 95)  -> (currentNode'=node49path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 96)  -> (currentNode'=node49path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 97)  -> (currentNode'=node49path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 98)  -> (currentNode'=node49path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 99)  -> (currentNode'=node49path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 49) & (currentPath = 100)  -> (currentNode'=node49path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 1)  -> (currentNode'=node50path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 2)  -> (currentNode'=node50path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 3)  -> (currentNode'=node50path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 4)  -> (currentNode'=node50path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 5)  -> (currentNode'=node50path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 6)  -> (currentNode'=node50path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 7)  -> (currentNode'=node50path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 8)  -> (currentNode'=node50path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 9)  -> (currentNode'=node50path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 10)  -> (currentNode'=node50path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 11)  -> (currentNode'=node50path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 12)  -> (currentNode'=node50path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 13)  -> (currentNode'=node50path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 14)  -> (currentNode'=node50path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 15)  -> (currentNode'=node50path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 16)  -> (currentNode'=node50path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 17)  -> (currentNode'=node50path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 18)  -> (currentNode'=node50path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 19)  -> (currentNode'=node50path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 20)  -> (currentNode'=node50path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 21)  -> (currentNode'=node50path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 22)  -> (currentNode'=node50path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 23)  -> (currentNode'=node50path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 24)  -> (currentNode'=node50path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 25)  -> (currentNode'=node50path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 26)  -> (currentNode'=node50path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 27)  -> (currentNode'=node50path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 28)  -> (currentNode'=node50path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 29)  -> (currentNode'=node50path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 30)  -> (currentNode'=node50path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 31)  -> (currentNode'=node50path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 32)  -> (currentNode'=node50path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 33)  -> (currentNode'=node50path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 34)  -> (currentNode'=node50path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 35)  -> (currentNode'=node50path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 36)  -> (currentNode'=node50path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 37)  -> (currentNode'=node50path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 38)  -> (currentNode'=node50path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 39)  -> (currentNode'=node50path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 40)  -> (currentNode'=node50path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 41)  -> (currentNode'=node50path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 42)  -> (currentNode'=node50path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 43)  -> (currentNode'=node50path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 44)  -> (currentNode'=node50path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 45)  -> (currentNode'=node50path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 46)  -> (currentNode'=node50path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 47)  -> (currentNode'=node50path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 48)  -> (currentNode'=node50path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 49)  -> (currentNode'=node50path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 50)  -> (currentNode'=node50path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 51)  -> (currentNode'=node50path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 52)  -> (currentNode'=node50path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 53)  -> (currentNode'=node50path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 54)  -> (currentNode'=node50path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 55)  -> (currentNode'=node50path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 56)  -> (currentNode'=node50path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 57)  -> (currentNode'=node50path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 58)  -> (currentNode'=node50path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 59)  -> (currentNode'=node50path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 60)  -> (currentNode'=node50path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 61)  -> (currentNode'=node50path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 62)  -> (currentNode'=node50path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 63)  -> (currentNode'=node50path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 64)  -> (currentNode'=node50path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 65)  -> (currentNode'=node50path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 66)  -> (currentNode'=node50path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 67)  -> (currentNode'=node50path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 68)  -> (currentNode'=node50path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 69)  -> (currentNode'=node50path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 70)  -> (currentNode'=node50path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 71)  -> (currentNode'=node50path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 72)  -> (currentNode'=node50path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 73)  -> (currentNode'=node50path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 74)  -> (currentNode'=node50path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 75)  -> (currentNode'=node50path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 76)  -> (currentNode'=node50path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 77)  -> (currentNode'=node50path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 78)  -> (currentNode'=node50path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 79)  -> (currentNode'=node50path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 80)  -> (currentNode'=node50path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 81)  -> (currentNode'=node50path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 82)  -> (currentNode'=node50path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 83)  -> (currentNode'=node50path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 84)  -> (currentNode'=node50path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 85)  -> (currentNode'=node50path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 86)  -> (currentNode'=node50path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 87)  -> (currentNode'=node50path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 88)  -> (currentNode'=node50path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 89)  -> (currentNode'=node50path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 90)  -> (currentNode'=node50path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 91)  -> (currentNode'=node50path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 92)  -> (currentNode'=node50path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 93)  -> (currentNode'=node50path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 94)  -> (currentNode'=node50path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 95)  -> (currentNode'=node50path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 96)  -> (currentNode'=node50path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 97)  -> (currentNode'=node50path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 98)  -> (currentNode'=node50path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 99)  -> (currentNode'=node50path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 50) & (currentPath = 100)  -> (currentNode'=node50path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 1)  -> (currentNode'=node51path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 2)  -> (currentNode'=node51path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 3)  -> (currentNode'=node51path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 4)  -> (currentNode'=node51path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 5)  -> (currentNode'=node51path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 6)  -> (currentNode'=node51path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 7)  -> (currentNode'=node51path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 8)  -> (currentNode'=node51path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 9)  -> (currentNode'=node51path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 10)  -> (currentNode'=node51path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 11)  -> (currentNode'=node51path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 12)  -> (currentNode'=node51path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 13)  -> (currentNode'=node51path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 14)  -> (currentNode'=node51path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 15)  -> (currentNode'=node51path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 16)  -> (currentNode'=node51path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 17)  -> (currentNode'=node51path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 18)  -> (currentNode'=node51path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 19)  -> (currentNode'=node51path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 20)  -> (currentNode'=node51path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 21)  -> (currentNode'=node51path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 22)  -> (currentNode'=node51path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 23)  -> (currentNode'=node51path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 24)  -> (currentNode'=node51path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 25)  -> (currentNode'=node51path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 26)  -> (currentNode'=node51path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 27)  -> (currentNode'=node51path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 28)  -> (currentNode'=node51path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 29)  -> (currentNode'=node51path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 30)  -> (currentNode'=node51path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 31)  -> (currentNode'=node51path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 32)  -> (currentNode'=node51path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 33)  -> (currentNode'=node51path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 34)  -> (currentNode'=node51path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 35)  -> (currentNode'=node51path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 36)  -> (currentNode'=node51path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 37)  -> (currentNode'=node51path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 38)  -> (currentNode'=node51path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 39)  -> (currentNode'=node51path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 40)  -> (currentNode'=node51path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 41)  -> (currentNode'=node51path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 42)  -> (currentNode'=node51path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 43)  -> (currentNode'=node51path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 44)  -> (currentNode'=node51path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 45)  -> (currentNode'=node51path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 46)  -> (currentNode'=node51path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 47)  -> (currentNode'=node51path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 48)  -> (currentNode'=node51path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 49)  -> (currentNode'=node51path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 50)  -> (currentNode'=node51path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 51)  -> (currentNode'=node51path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 52)  -> (currentNode'=node51path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 53)  -> (currentNode'=node51path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 54)  -> (currentNode'=node51path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 55)  -> (currentNode'=node51path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 56)  -> (currentNode'=node51path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 57)  -> (currentNode'=node51path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 58)  -> (currentNode'=node51path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 59)  -> (currentNode'=node51path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 60)  -> (currentNode'=node51path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 61)  -> (currentNode'=node51path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 62)  -> (currentNode'=node51path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 63)  -> (currentNode'=node51path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 64)  -> (currentNode'=node51path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 65)  -> (currentNode'=node51path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 66)  -> (currentNode'=node51path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 67)  -> (currentNode'=node51path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 68)  -> (currentNode'=node51path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 69)  -> (currentNode'=node51path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 70)  -> (currentNode'=node51path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 71)  -> (currentNode'=node51path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 72)  -> (currentNode'=node51path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 73)  -> (currentNode'=node51path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 74)  -> (currentNode'=node51path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 75)  -> (currentNode'=node51path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 76)  -> (currentNode'=node51path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 77)  -> (currentNode'=node51path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 78)  -> (currentNode'=node51path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 79)  -> (currentNode'=node51path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 80)  -> (currentNode'=node51path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 81)  -> (currentNode'=node51path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 82)  -> (currentNode'=node51path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 83)  -> (currentNode'=node51path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 84)  -> (currentNode'=node51path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 85)  -> (currentNode'=node51path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 86)  -> (currentNode'=node51path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 87)  -> (currentNode'=node51path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 88)  -> (currentNode'=node51path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 89)  -> (currentNode'=node51path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 90)  -> (currentNode'=node51path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 91)  -> (currentNode'=node51path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 92)  -> (currentNode'=node51path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 93)  -> (currentNode'=node51path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 94)  -> (currentNode'=node51path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 95)  -> (currentNode'=node51path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 96)  -> (currentNode'=node51path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 97)  -> (currentNode'=node51path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 98)  -> (currentNode'=node51path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 99)  -> (currentNode'=node51path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 51) & (currentPath = 100)  -> (currentNode'=node51path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 1)  -> (currentNode'=node52path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 2)  -> (currentNode'=node52path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 3)  -> (currentNode'=node52path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 4)  -> (currentNode'=node52path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 5)  -> (currentNode'=node52path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 6)  -> (currentNode'=node52path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 7)  -> (currentNode'=node52path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 8)  -> (currentNode'=node52path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 9)  -> (currentNode'=node52path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 10)  -> (currentNode'=node52path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 11)  -> (currentNode'=node52path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 12)  -> (currentNode'=node52path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 13)  -> (currentNode'=node52path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 14)  -> (currentNode'=node52path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 15)  -> (currentNode'=node52path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 16)  -> (currentNode'=node52path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 17)  -> (currentNode'=node52path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 18)  -> (currentNode'=node52path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 19)  -> (currentNode'=node52path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 20)  -> (currentNode'=node52path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 21)  -> (currentNode'=node52path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 22)  -> (currentNode'=node52path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 23)  -> (currentNode'=node52path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 24)  -> (currentNode'=node52path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 25)  -> (currentNode'=node52path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 26)  -> (currentNode'=node52path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 27)  -> (currentNode'=node52path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 28)  -> (currentNode'=node52path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 29)  -> (currentNode'=node52path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 30)  -> (currentNode'=node52path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 31)  -> (currentNode'=node52path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 32)  -> (currentNode'=node52path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 33)  -> (currentNode'=node52path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 34)  -> (currentNode'=node52path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 35)  -> (currentNode'=node52path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 36)  -> (currentNode'=node52path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 37)  -> (currentNode'=node52path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 38)  -> (currentNode'=node52path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 39)  -> (currentNode'=node52path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 40)  -> (currentNode'=node52path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 41)  -> (currentNode'=node52path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 42)  -> (currentNode'=node52path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 43)  -> (currentNode'=node52path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 44)  -> (currentNode'=node52path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 45)  -> (currentNode'=node52path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 46)  -> (currentNode'=node52path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 47)  -> (currentNode'=node52path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 48)  -> (currentNode'=node52path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 49)  -> (currentNode'=node52path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 50)  -> (currentNode'=node52path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 51)  -> (currentNode'=node52path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 52)  -> (currentNode'=node52path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 53)  -> (currentNode'=node52path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 54)  -> (currentNode'=node52path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 55)  -> (currentNode'=node52path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 56)  -> (currentNode'=node52path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 57)  -> (currentNode'=node52path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 58)  -> (currentNode'=node52path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 59)  -> (currentNode'=node52path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 60)  -> (currentNode'=node52path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 61)  -> (currentNode'=node52path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 62)  -> (currentNode'=node52path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 63)  -> (currentNode'=node52path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 64)  -> (currentNode'=node52path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 65)  -> (currentNode'=node52path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 66)  -> (currentNode'=node52path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 67)  -> (currentNode'=node52path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 68)  -> (currentNode'=node52path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 69)  -> (currentNode'=node52path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 70)  -> (currentNode'=node52path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 71)  -> (currentNode'=node52path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 72)  -> (currentNode'=node52path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 73)  -> (currentNode'=node52path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 74)  -> (currentNode'=node52path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 75)  -> (currentNode'=node52path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 76)  -> (currentNode'=node52path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 77)  -> (currentNode'=node52path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 78)  -> (currentNode'=node52path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 79)  -> (currentNode'=node52path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 80)  -> (currentNode'=node52path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 81)  -> (currentNode'=node52path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 82)  -> (currentNode'=node52path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 83)  -> (currentNode'=node52path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 84)  -> (currentNode'=node52path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 85)  -> (currentNode'=node52path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 86)  -> (currentNode'=node52path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 87)  -> (currentNode'=node52path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 88)  -> (currentNode'=node52path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 89)  -> (currentNode'=node52path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 90)  -> (currentNode'=node52path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 91)  -> (currentNode'=node52path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 92)  -> (currentNode'=node52path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 93)  -> (currentNode'=node52path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 94)  -> (currentNode'=node52path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 95)  -> (currentNode'=node52path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 96)  -> (currentNode'=node52path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 97)  -> (currentNode'=node52path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 98)  -> (currentNode'=node52path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 99)  -> (currentNode'=node52path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 52) & (currentPath = 100)  -> (currentNode'=node52path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 1)  -> (currentNode'=node53path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 2)  -> (currentNode'=node53path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 3)  -> (currentNode'=node53path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 4)  -> (currentNode'=node53path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 5)  -> (currentNode'=node53path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 6)  -> (currentNode'=node53path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 7)  -> (currentNode'=node53path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 8)  -> (currentNode'=node53path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 9)  -> (currentNode'=node53path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 10)  -> (currentNode'=node53path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 11)  -> (currentNode'=node53path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 12)  -> (currentNode'=node53path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 13)  -> (currentNode'=node53path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 14)  -> (currentNode'=node53path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 15)  -> (currentNode'=node53path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 16)  -> (currentNode'=node53path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 17)  -> (currentNode'=node53path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 18)  -> (currentNode'=node53path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 19)  -> (currentNode'=node53path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 20)  -> (currentNode'=node53path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 21)  -> (currentNode'=node53path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 22)  -> (currentNode'=node53path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 23)  -> (currentNode'=node53path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 24)  -> (currentNode'=node53path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 25)  -> (currentNode'=node53path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 26)  -> (currentNode'=node53path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 27)  -> (currentNode'=node53path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 28)  -> (currentNode'=node53path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 29)  -> (currentNode'=node53path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 30)  -> (currentNode'=node53path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 31)  -> (currentNode'=node53path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 32)  -> (currentNode'=node53path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 33)  -> (currentNode'=node53path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 34)  -> (currentNode'=node53path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 35)  -> (currentNode'=node53path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 36)  -> (currentNode'=node53path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 37)  -> (currentNode'=node53path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 38)  -> (currentNode'=node53path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 39)  -> (currentNode'=node53path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 40)  -> (currentNode'=node53path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 41)  -> (currentNode'=node53path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 42)  -> (currentNode'=node53path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 43)  -> (currentNode'=node53path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 44)  -> (currentNode'=node53path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 45)  -> (currentNode'=node53path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 46)  -> (currentNode'=node53path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 47)  -> (currentNode'=node53path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 48)  -> (currentNode'=node53path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 49)  -> (currentNode'=node53path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 50)  -> (currentNode'=node53path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 51)  -> (currentNode'=node53path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 52)  -> (currentNode'=node53path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 53)  -> (currentNode'=node53path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 54)  -> (currentNode'=node53path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 55)  -> (currentNode'=node53path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 56)  -> (currentNode'=node53path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 57)  -> (currentNode'=node53path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 58)  -> (currentNode'=node53path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 59)  -> (currentNode'=node53path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 60)  -> (currentNode'=node53path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 61)  -> (currentNode'=node53path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 62)  -> (currentNode'=node53path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 63)  -> (currentNode'=node53path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 64)  -> (currentNode'=node53path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 65)  -> (currentNode'=node53path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 66)  -> (currentNode'=node53path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 67)  -> (currentNode'=node53path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 68)  -> (currentNode'=node53path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 69)  -> (currentNode'=node53path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 70)  -> (currentNode'=node53path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 71)  -> (currentNode'=node53path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 72)  -> (currentNode'=node53path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 73)  -> (currentNode'=node53path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 74)  -> (currentNode'=node53path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 75)  -> (currentNode'=node53path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 76)  -> (currentNode'=node53path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 77)  -> (currentNode'=node53path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 78)  -> (currentNode'=node53path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 79)  -> (currentNode'=node53path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 80)  -> (currentNode'=node53path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 81)  -> (currentNode'=node53path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 82)  -> (currentNode'=node53path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 83)  -> (currentNode'=node53path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 84)  -> (currentNode'=node53path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 85)  -> (currentNode'=node53path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 86)  -> (currentNode'=node53path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 87)  -> (currentNode'=node53path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 88)  -> (currentNode'=node53path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 89)  -> (currentNode'=node53path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 90)  -> (currentNode'=node53path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 91)  -> (currentNode'=node53path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 92)  -> (currentNode'=node53path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 93)  -> (currentNode'=node53path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 94)  -> (currentNode'=node53path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 95)  -> (currentNode'=node53path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 96)  -> (currentNode'=node53path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 97)  -> (currentNode'=node53path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 98)  -> (currentNode'=node53path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 99)  -> (currentNode'=node53path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 53) & (currentPath = 100)  -> (currentNode'=node53path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 1)  -> (currentNode'=node54path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 2)  -> (currentNode'=node54path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 3)  -> (currentNode'=node54path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 4)  -> (currentNode'=node54path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 5)  -> (currentNode'=node54path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 6)  -> (currentNode'=node54path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 7)  -> (currentNode'=node54path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 8)  -> (currentNode'=node54path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 9)  -> (currentNode'=node54path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 10)  -> (currentNode'=node54path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 11)  -> (currentNode'=node54path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 12)  -> (currentNode'=node54path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 13)  -> (currentNode'=node54path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 14)  -> (currentNode'=node54path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 15)  -> (currentNode'=node54path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 16)  -> (currentNode'=node54path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 17)  -> (currentNode'=node54path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 18)  -> (currentNode'=node54path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 19)  -> (currentNode'=node54path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 20)  -> (currentNode'=node54path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 21)  -> (currentNode'=node54path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 22)  -> (currentNode'=node54path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 23)  -> (currentNode'=node54path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 24)  -> (currentNode'=node54path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 25)  -> (currentNode'=node54path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 26)  -> (currentNode'=node54path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 27)  -> (currentNode'=node54path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 28)  -> (currentNode'=node54path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 29)  -> (currentNode'=node54path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 30)  -> (currentNode'=node54path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 31)  -> (currentNode'=node54path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 32)  -> (currentNode'=node54path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 33)  -> (currentNode'=node54path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 34)  -> (currentNode'=node54path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 35)  -> (currentNode'=node54path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 36)  -> (currentNode'=node54path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 37)  -> (currentNode'=node54path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 38)  -> (currentNode'=node54path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 39)  -> (currentNode'=node54path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 40)  -> (currentNode'=node54path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 41)  -> (currentNode'=node54path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 42)  -> (currentNode'=node54path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 43)  -> (currentNode'=node54path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 44)  -> (currentNode'=node54path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 45)  -> (currentNode'=node54path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 46)  -> (currentNode'=node54path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 47)  -> (currentNode'=node54path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 48)  -> (currentNode'=node54path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 49)  -> (currentNode'=node54path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 50)  -> (currentNode'=node54path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 51)  -> (currentNode'=node54path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 52)  -> (currentNode'=node54path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 53)  -> (currentNode'=node54path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 54)  -> (currentNode'=node54path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 55)  -> (currentNode'=node54path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 56)  -> (currentNode'=node54path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 57)  -> (currentNode'=node54path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 58)  -> (currentNode'=node54path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 59)  -> (currentNode'=node54path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 60)  -> (currentNode'=node54path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 61)  -> (currentNode'=node54path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 62)  -> (currentNode'=node54path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 63)  -> (currentNode'=node54path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 64)  -> (currentNode'=node54path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 65)  -> (currentNode'=node54path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 66)  -> (currentNode'=node54path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 67)  -> (currentNode'=node54path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 68)  -> (currentNode'=node54path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 69)  -> (currentNode'=node54path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 70)  -> (currentNode'=node54path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 71)  -> (currentNode'=node54path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 72)  -> (currentNode'=node54path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 73)  -> (currentNode'=node54path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 74)  -> (currentNode'=node54path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 75)  -> (currentNode'=node54path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 76)  -> (currentNode'=node54path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 77)  -> (currentNode'=node54path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 78)  -> (currentNode'=node54path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 79)  -> (currentNode'=node54path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 80)  -> (currentNode'=node54path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 81)  -> (currentNode'=node54path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 82)  -> (currentNode'=node54path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 83)  -> (currentNode'=node54path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 84)  -> (currentNode'=node54path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 85)  -> (currentNode'=node54path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 86)  -> (currentNode'=node54path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 87)  -> (currentNode'=node54path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 88)  -> (currentNode'=node54path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 89)  -> (currentNode'=node54path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 90)  -> (currentNode'=node54path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 91)  -> (currentNode'=node54path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 92)  -> (currentNode'=node54path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 93)  -> (currentNode'=node54path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 94)  -> (currentNode'=node54path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 95)  -> (currentNode'=node54path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 96)  -> (currentNode'=node54path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 97)  -> (currentNode'=node54path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 98)  -> (currentNode'=node54path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 99)  -> (currentNode'=node54path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 54) & (currentPath = 100)  -> (currentNode'=node54path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 1)  -> (currentNode'=node55path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 2)  -> (currentNode'=node55path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 3)  -> (currentNode'=node55path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 4)  -> (currentNode'=node55path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 5)  -> (currentNode'=node55path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 6)  -> (currentNode'=node55path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 7)  -> (currentNode'=node55path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 8)  -> (currentNode'=node55path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 9)  -> (currentNode'=node55path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 10)  -> (currentNode'=node55path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 11)  -> (currentNode'=node55path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 12)  -> (currentNode'=node55path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 13)  -> (currentNode'=node55path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 14)  -> (currentNode'=node55path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 15)  -> (currentNode'=node55path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 16)  -> (currentNode'=node55path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 17)  -> (currentNode'=node55path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 18)  -> (currentNode'=node55path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 19)  -> (currentNode'=node55path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 20)  -> (currentNode'=node55path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 21)  -> (currentNode'=node55path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 22)  -> (currentNode'=node55path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 23)  -> (currentNode'=node55path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 24)  -> (currentNode'=node55path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 25)  -> (currentNode'=node55path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 26)  -> (currentNode'=node55path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 27)  -> (currentNode'=node55path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 28)  -> (currentNode'=node55path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 29)  -> (currentNode'=node55path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 30)  -> (currentNode'=node55path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 31)  -> (currentNode'=node55path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 32)  -> (currentNode'=node55path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 33)  -> (currentNode'=node55path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 34)  -> (currentNode'=node55path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 35)  -> (currentNode'=node55path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 36)  -> (currentNode'=node55path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 37)  -> (currentNode'=node55path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 38)  -> (currentNode'=node55path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 39)  -> (currentNode'=node55path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 40)  -> (currentNode'=node55path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 41)  -> (currentNode'=node55path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 42)  -> (currentNode'=node55path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 43)  -> (currentNode'=node55path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 44)  -> (currentNode'=node55path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 45)  -> (currentNode'=node55path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 46)  -> (currentNode'=node55path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 47)  -> (currentNode'=node55path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 48)  -> (currentNode'=node55path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 49)  -> (currentNode'=node55path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 50)  -> (currentNode'=node55path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 51)  -> (currentNode'=node55path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 52)  -> (currentNode'=node55path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 53)  -> (currentNode'=node55path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 54)  -> (currentNode'=node55path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 55)  -> (currentNode'=node55path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 56)  -> (currentNode'=node55path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 57)  -> (currentNode'=node55path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 58)  -> (currentNode'=node55path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 59)  -> (currentNode'=node55path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 60)  -> (currentNode'=node55path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 61)  -> (currentNode'=node55path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 62)  -> (currentNode'=node55path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 63)  -> (currentNode'=node55path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 64)  -> (currentNode'=node55path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 65)  -> (currentNode'=node55path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 66)  -> (currentNode'=node55path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 67)  -> (currentNode'=node55path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 68)  -> (currentNode'=node55path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 69)  -> (currentNode'=node55path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 70)  -> (currentNode'=node55path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 71)  -> (currentNode'=node55path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 72)  -> (currentNode'=node55path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 73)  -> (currentNode'=node55path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 74)  -> (currentNode'=node55path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 75)  -> (currentNode'=node55path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 76)  -> (currentNode'=node55path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 77)  -> (currentNode'=node55path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 78)  -> (currentNode'=node55path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 79)  -> (currentNode'=node55path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 80)  -> (currentNode'=node55path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 81)  -> (currentNode'=node55path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 82)  -> (currentNode'=node55path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 83)  -> (currentNode'=node55path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 84)  -> (currentNode'=node55path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 85)  -> (currentNode'=node55path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 86)  -> (currentNode'=node55path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 87)  -> (currentNode'=node55path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 88)  -> (currentNode'=node55path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 89)  -> (currentNode'=node55path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 90)  -> (currentNode'=node55path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 91)  -> (currentNode'=node55path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 92)  -> (currentNode'=node55path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 93)  -> (currentNode'=node55path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 94)  -> (currentNode'=node55path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 95)  -> (currentNode'=node55path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 96)  -> (currentNode'=node55path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 97)  -> (currentNode'=node55path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 98)  -> (currentNode'=node55path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 99)  -> (currentNode'=node55path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 55) & (currentPath = 100)  -> (currentNode'=node55path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 1)  -> (currentNode'=node56path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 2)  -> (currentNode'=node56path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 3)  -> (currentNode'=node56path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 4)  -> (currentNode'=node56path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 5)  -> (currentNode'=node56path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 6)  -> (currentNode'=node56path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 7)  -> (currentNode'=node56path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 8)  -> (currentNode'=node56path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 9)  -> (currentNode'=node56path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 10)  -> (currentNode'=node56path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 11)  -> (currentNode'=node56path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 12)  -> (currentNode'=node56path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 13)  -> (currentNode'=node56path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 14)  -> (currentNode'=node56path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 15)  -> (currentNode'=node56path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 16)  -> (currentNode'=node56path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 17)  -> (currentNode'=node56path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 18)  -> (currentNode'=node56path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 19)  -> (currentNode'=node56path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 20)  -> (currentNode'=node56path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 21)  -> (currentNode'=node56path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 22)  -> (currentNode'=node56path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 23)  -> (currentNode'=node56path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 24)  -> (currentNode'=node56path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 25)  -> (currentNode'=node56path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 26)  -> (currentNode'=node56path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 27)  -> (currentNode'=node56path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 28)  -> (currentNode'=node56path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 29)  -> (currentNode'=node56path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 30)  -> (currentNode'=node56path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 31)  -> (currentNode'=node56path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 32)  -> (currentNode'=node56path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 33)  -> (currentNode'=node56path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 34)  -> (currentNode'=node56path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 35)  -> (currentNode'=node56path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 36)  -> (currentNode'=node56path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 37)  -> (currentNode'=node56path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 38)  -> (currentNode'=node56path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 39)  -> (currentNode'=node56path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 40)  -> (currentNode'=node56path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 41)  -> (currentNode'=node56path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 42)  -> (currentNode'=node56path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 43)  -> (currentNode'=node56path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 44)  -> (currentNode'=node56path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 45)  -> (currentNode'=node56path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 46)  -> (currentNode'=node56path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 47)  -> (currentNode'=node56path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 48)  -> (currentNode'=node56path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 49)  -> (currentNode'=node56path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 50)  -> (currentNode'=node56path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 51)  -> (currentNode'=node56path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 52)  -> (currentNode'=node56path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 53)  -> (currentNode'=node56path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 54)  -> (currentNode'=node56path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 55)  -> (currentNode'=node56path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 56)  -> (currentNode'=node56path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 57)  -> (currentNode'=node56path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 58)  -> (currentNode'=node56path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 59)  -> (currentNode'=node56path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 60)  -> (currentNode'=node56path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 61)  -> (currentNode'=node56path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 62)  -> (currentNode'=node56path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 63)  -> (currentNode'=node56path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 64)  -> (currentNode'=node56path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 65)  -> (currentNode'=node56path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 66)  -> (currentNode'=node56path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 67)  -> (currentNode'=node56path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 68)  -> (currentNode'=node56path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 69)  -> (currentNode'=node56path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 70)  -> (currentNode'=node56path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 71)  -> (currentNode'=node56path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 72)  -> (currentNode'=node56path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 73)  -> (currentNode'=node56path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 74)  -> (currentNode'=node56path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 75)  -> (currentNode'=node56path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 76)  -> (currentNode'=node56path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 77)  -> (currentNode'=node56path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 78)  -> (currentNode'=node56path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 79)  -> (currentNode'=node56path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 80)  -> (currentNode'=node56path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 81)  -> (currentNode'=node56path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 82)  -> (currentNode'=node56path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 83)  -> (currentNode'=node56path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 84)  -> (currentNode'=node56path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 85)  -> (currentNode'=node56path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 86)  -> (currentNode'=node56path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 87)  -> (currentNode'=node56path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 88)  -> (currentNode'=node56path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 89)  -> (currentNode'=node56path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 90)  -> (currentNode'=node56path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 91)  -> (currentNode'=node56path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 92)  -> (currentNode'=node56path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 93)  -> (currentNode'=node56path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 94)  -> (currentNode'=node56path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 95)  -> (currentNode'=node56path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 96)  -> (currentNode'=node56path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 97)  -> (currentNode'=node56path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 98)  -> (currentNode'=node56path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 99)  -> (currentNode'=node56path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 56) & (currentPath = 100)  -> (currentNode'=node56path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 1)  -> (currentNode'=node57path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 2)  -> (currentNode'=node57path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 3)  -> (currentNode'=node57path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 4)  -> (currentNode'=node57path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 5)  -> (currentNode'=node57path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 6)  -> (currentNode'=node57path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 7)  -> (currentNode'=node57path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 8)  -> (currentNode'=node57path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 9)  -> (currentNode'=node57path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 10)  -> (currentNode'=node57path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 11)  -> (currentNode'=node57path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 12)  -> (currentNode'=node57path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 13)  -> (currentNode'=node57path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 14)  -> (currentNode'=node57path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 15)  -> (currentNode'=node57path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 16)  -> (currentNode'=node57path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 17)  -> (currentNode'=node57path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 18)  -> (currentNode'=node57path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 19)  -> (currentNode'=node57path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 20)  -> (currentNode'=node57path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 21)  -> (currentNode'=node57path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 22)  -> (currentNode'=node57path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 23)  -> (currentNode'=node57path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 24)  -> (currentNode'=node57path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 25)  -> (currentNode'=node57path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 26)  -> (currentNode'=node57path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 27)  -> (currentNode'=node57path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 28)  -> (currentNode'=node57path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 29)  -> (currentNode'=node57path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 30)  -> (currentNode'=node57path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 31)  -> (currentNode'=node57path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 32)  -> (currentNode'=node57path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 33)  -> (currentNode'=node57path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 34)  -> (currentNode'=node57path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 35)  -> (currentNode'=node57path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 36)  -> (currentNode'=node57path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 37)  -> (currentNode'=node57path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 38)  -> (currentNode'=node57path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 39)  -> (currentNode'=node57path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 40)  -> (currentNode'=node57path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 41)  -> (currentNode'=node57path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 42)  -> (currentNode'=node57path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 43)  -> (currentNode'=node57path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 44)  -> (currentNode'=node57path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 45)  -> (currentNode'=node57path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 46)  -> (currentNode'=node57path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 47)  -> (currentNode'=node57path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 48)  -> (currentNode'=node57path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 49)  -> (currentNode'=node57path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 50)  -> (currentNode'=node57path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 51)  -> (currentNode'=node57path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 52)  -> (currentNode'=node57path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 53)  -> (currentNode'=node57path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 54)  -> (currentNode'=node57path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 55)  -> (currentNode'=node57path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 56)  -> (currentNode'=node57path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 57)  -> (currentNode'=node57path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 58)  -> (currentNode'=node57path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 59)  -> (currentNode'=node57path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 60)  -> (currentNode'=node57path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 61)  -> (currentNode'=node57path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 62)  -> (currentNode'=node57path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 63)  -> (currentNode'=node57path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 64)  -> (currentNode'=node57path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 65)  -> (currentNode'=node57path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 66)  -> (currentNode'=node57path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 67)  -> (currentNode'=node57path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 68)  -> (currentNode'=node57path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 69)  -> (currentNode'=node57path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 70)  -> (currentNode'=node57path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 71)  -> (currentNode'=node57path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 72)  -> (currentNode'=node57path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 73)  -> (currentNode'=node57path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 74)  -> (currentNode'=node57path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 75)  -> (currentNode'=node57path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 76)  -> (currentNode'=node57path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 77)  -> (currentNode'=node57path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 78)  -> (currentNode'=node57path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 79)  -> (currentNode'=node57path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 80)  -> (currentNode'=node57path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 81)  -> (currentNode'=node57path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 82)  -> (currentNode'=node57path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 83)  -> (currentNode'=node57path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 84)  -> (currentNode'=node57path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 85)  -> (currentNode'=node57path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 86)  -> (currentNode'=node57path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 87)  -> (currentNode'=node57path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 88)  -> (currentNode'=node57path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 89)  -> (currentNode'=node57path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 90)  -> (currentNode'=node57path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 91)  -> (currentNode'=node57path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 92)  -> (currentNode'=node57path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 93)  -> (currentNode'=node57path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 94)  -> (currentNode'=node57path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 95)  -> (currentNode'=node57path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 96)  -> (currentNode'=node57path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 97)  -> (currentNode'=node57path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 98)  -> (currentNode'=node57path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 99)  -> (currentNode'=node57path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 57) & (currentPath = 100)  -> (currentNode'=node57path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 1)  -> (currentNode'=node58path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 2)  -> (currentNode'=node58path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 3)  -> (currentNode'=node58path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 4)  -> (currentNode'=node58path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 5)  -> (currentNode'=node58path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 6)  -> (currentNode'=node58path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 7)  -> (currentNode'=node58path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 8)  -> (currentNode'=node58path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 9)  -> (currentNode'=node58path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 10)  -> (currentNode'=node58path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 11)  -> (currentNode'=node58path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 12)  -> (currentNode'=node58path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 13)  -> (currentNode'=node58path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 14)  -> (currentNode'=node58path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 15)  -> (currentNode'=node58path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 16)  -> (currentNode'=node58path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 17)  -> (currentNode'=node58path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 18)  -> (currentNode'=node58path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 19)  -> (currentNode'=node58path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 20)  -> (currentNode'=node58path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 21)  -> (currentNode'=node58path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 22)  -> (currentNode'=node58path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 23)  -> (currentNode'=node58path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 24)  -> (currentNode'=node58path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 25)  -> (currentNode'=node58path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 26)  -> (currentNode'=node58path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 27)  -> (currentNode'=node58path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 28)  -> (currentNode'=node58path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 29)  -> (currentNode'=node58path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 30)  -> (currentNode'=node58path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 31)  -> (currentNode'=node58path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 32)  -> (currentNode'=node58path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 33)  -> (currentNode'=node58path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 34)  -> (currentNode'=node58path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 35)  -> (currentNode'=node58path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 36)  -> (currentNode'=node58path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 37)  -> (currentNode'=node58path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 38)  -> (currentNode'=node58path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 39)  -> (currentNode'=node58path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 40)  -> (currentNode'=node58path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 41)  -> (currentNode'=node58path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 42)  -> (currentNode'=node58path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 43)  -> (currentNode'=node58path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 44)  -> (currentNode'=node58path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 45)  -> (currentNode'=node58path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 46)  -> (currentNode'=node58path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 47)  -> (currentNode'=node58path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 48)  -> (currentNode'=node58path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 49)  -> (currentNode'=node58path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 50)  -> (currentNode'=node58path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 51)  -> (currentNode'=node58path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 52)  -> (currentNode'=node58path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 53)  -> (currentNode'=node58path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 54)  -> (currentNode'=node58path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 55)  -> (currentNode'=node58path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 56)  -> (currentNode'=node58path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 57)  -> (currentNode'=node58path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 58)  -> (currentNode'=node58path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 59)  -> (currentNode'=node58path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 60)  -> (currentNode'=node58path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 61)  -> (currentNode'=node58path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 62)  -> (currentNode'=node58path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 63)  -> (currentNode'=node58path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 64)  -> (currentNode'=node58path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 65)  -> (currentNode'=node58path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 66)  -> (currentNode'=node58path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 67)  -> (currentNode'=node58path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 68)  -> (currentNode'=node58path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 69)  -> (currentNode'=node58path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 70)  -> (currentNode'=node58path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 71)  -> (currentNode'=node58path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 72)  -> (currentNode'=node58path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 73)  -> (currentNode'=node58path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 74)  -> (currentNode'=node58path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 75)  -> (currentNode'=node58path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 76)  -> (currentNode'=node58path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 77)  -> (currentNode'=node58path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 78)  -> (currentNode'=node58path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 79)  -> (currentNode'=node58path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 80)  -> (currentNode'=node58path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 81)  -> (currentNode'=node58path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 82)  -> (currentNode'=node58path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 83)  -> (currentNode'=node58path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 84)  -> (currentNode'=node58path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 85)  -> (currentNode'=node58path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 86)  -> (currentNode'=node58path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 87)  -> (currentNode'=node58path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 88)  -> (currentNode'=node58path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 89)  -> (currentNode'=node58path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 90)  -> (currentNode'=node58path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 91)  -> (currentNode'=node58path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 92)  -> (currentNode'=node58path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 93)  -> (currentNode'=node58path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 94)  -> (currentNode'=node58path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 95)  -> (currentNode'=node58path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 96)  -> (currentNode'=node58path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 97)  -> (currentNode'=node58path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 98)  -> (currentNode'=node58path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 99)  -> (currentNode'=node58path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 58) & (currentPath = 100)  -> (currentNode'=node58path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 1)  -> (currentNode'=node59path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 2)  -> (currentNode'=node59path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 3)  -> (currentNode'=node59path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 4)  -> (currentNode'=node59path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 5)  -> (currentNode'=node59path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 6)  -> (currentNode'=node59path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 7)  -> (currentNode'=node59path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 8)  -> (currentNode'=node59path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 9)  -> (currentNode'=node59path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 10)  -> (currentNode'=node59path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 11)  -> (currentNode'=node59path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 12)  -> (currentNode'=node59path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 13)  -> (currentNode'=node59path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 14)  -> (currentNode'=node59path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 15)  -> (currentNode'=node59path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 16)  -> (currentNode'=node59path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 17)  -> (currentNode'=node59path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 18)  -> (currentNode'=node59path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 19)  -> (currentNode'=node59path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 20)  -> (currentNode'=node59path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 21)  -> (currentNode'=node59path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 22)  -> (currentNode'=node59path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 23)  -> (currentNode'=node59path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 24)  -> (currentNode'=node59path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 25)  -> (currentNode'=node59path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 26)  -> (currentNode'=node59path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 27)  -> (currentNode'=node59path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 28)  -> (currentNode'=node59path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 29)  -> (currentNode'=node59path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 30)  -> (currentNode'=node59path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 31)  -> (currentNode'=node59path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 32)  -> (currentNode'=node59path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 33)  -> (currentNode'=node59path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 34)  -> (currentNode'=node59path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 35)  -> (currentNode'=node59path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 36)  -> (currentNode'=node59path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 37)  -> (currentNode'=node59path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 38)  -> (currentNode'=node59path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 39)  -> (currentNode'=node59path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 40)  -> (currentNode'=node59path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 41)  -> (currentNode'=node59path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 42)  -> (currentNode'=node59path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 43)  -> (currentNode'=node59path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 44)  -> (currentNode'=node59path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 45)  -> (currentNode'=node59path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 46)  -> (currentNode'=node59path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 47)  -> (currentNode'=node59path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 48)  -> (currentNode'=node59path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 49)  -> (currentNode'=node59path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 50)  -> (currentNode'=node59path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 51)  -> (currentNode'=node59path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 52)  -> (currentNode'=node59path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 53)  -> (currentNode'=node59path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 54)  -> (currentNode'=node59path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 55)  -> (currentNode'=node59path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 56)  -> (currentNode'=node59path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 57)  -> (currentNode'=node59path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 58)  -> (currentNode'=node59path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 59)  -> (currentNode'=node59path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 60)  -> (currentNode'=node59path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 61)  -> (currentNode'=node59path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 62)  -> (currentNode'=node59path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 63)  -> (currentNode'=node59path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 64)  -> (currentNode'=node59path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 65)  -> (currentNode'=node59path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 66)  -> (currentNode'=node59path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 67)  -> (currentNode'=node59path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 68)  -> (currentNode'=node59path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 69)  -> (currentNode'=node59path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 70)  -> (currentNode'=node59path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 71)  -> (currentNode'=node59path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 72)  -> (currentNode'=node59path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 73)  -> (currentNode'=node59path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 74)  -> (currentNode'=node59path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 75)  -> (currentNode'=node59path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 76)  -> (currentNode'=node59path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 77)  -> (currentNode'=node59path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 78)  -> (currentNode'=node59path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 79)  -> (currentNode'=node59path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 80)  -> (currentNode'=node59path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 81)  -> (currentNode'=node59path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 82)  -> (currentNode'=node59path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 83)  -> (currentNode'=node59path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 84)  -> (currentNode'=node59path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 85)  -> (currentNode'=node59path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 86)  -> (currentNode'=node59path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 87)  -> (currentNode'=node59path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 88)  -> (currentNode'=node59path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 89)  -> (currentNode'=node59path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 90)  -> (currentNode'=node59path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 91)  -> (currentNode'=node59path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 92)  -> (currentNode'=node59path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 93)  -> (currentNode'=node59path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 94)  -> (currentNode'=node59path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 95)  -> (currentNode'=node59path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 96)  -> (currentNode'=node59path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 97)  -> (currentNode'=node59path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 98)  -> (currentNode'=node59path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 99)  -> (currentNode'=node59path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 59) & (currentPath = 100)  -> (currentNode'=node59path100) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 1)  -> (currentNode'=node60path1) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 2)  -> (currentNode'=node60path2) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 3)  -> (currentNode'=node60path3) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 4)  -> (currentNode'=node60path4) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 5)  -> (currentNode'=node60path5) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 6)  -> (currentNode'=node60path6) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 7)  -> (currentNode'=node60path7) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 8)  -> (currentNode'=node60path8) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 9)  -> (currentNode'=node60path9) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 10)  -> (currentNode'=node60path10) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 11)  -> (currentNode'=node60path11) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 12)  -> (currentNode'=node60path12) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 13)  -> (currentNode'=node60path13) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 14)  -> (currentNode'=node60path14) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 15)  -> (currentNode'=node60path15) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 16)  -> (currentNode'=node60path16) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 17)  -> (currentNode'=node60path17) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 18)  -> (currentNode'=node60path18) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 19)  -> (currentNode'=node60path19) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 20)  -> (currentNode'=node60path20) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 21)  -> (currentNode'=node60path21) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 22)  -> (currentNode'=node60path22) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 23)  -> (currentNode'=node60path23) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 24)  -> (currentNode'=node60path24) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 25)  -> (currentNode'=node60path25) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 26)  -> (currentNode'=node60path26) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 27)  -> (currentNode'=node60path27) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 28)  -> (currentNode'=node60path28) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 29)  -> (currentNode'=node60path29) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 30)  -> (currentNode'=node60path30) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 31)  -> (currentNode'=node60path31) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 32)  -> (currentNode'=node60path32) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 33)  -> (currentNode'=node60path33) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 34)  -> (currentNode'=node60path34) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 35)  -> (currentNode'=node60path35) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 36)  -> (currentNode'=node60path36) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 37)  -> (currentNode'=node60path37) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 38)  -> (currentNode'=node60path38) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 39)  -> (currentNode'=node60path39) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 40)  -> (currentNode'=node60path40) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 41)  -> (currentNode'=node60path41) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 42)  -> (currentNode'=node60path42) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 43)  -> (currentNode'=node60path43) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 44)  -> (currentNode'=node60path44) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 45)  -> (currentNode'=node60path45) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 46)  -> (currentNode'=node60path46) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 47)  -> (currentNode'=node60path47) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 48)  -> (currentNode'=node60path48) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 49)  -> (currentNode'=node60path49) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 50)  -> (currentNode'=node60path50) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 51)  -> (currentNode'=node60path51) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 52)  -> (currentNode'=node60path52) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 53)  -> (currentNode'=node60path53) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 54)  -> (currentNode'=node60path54) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 55)  -> (currentNode'=node60path55) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 56)  -> (currentNode'=node60path56) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 57)  -> (currentNode'=node60path57) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 58)  -> (currentNode'=node60path58) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 59)  -> (currentNode'=node60path59) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 60)  -> (currentNode'=node60path60) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 61)  -> (currentNode'=node60path61) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 62)  -> (currentNode'=node60path62) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 63)  -> (currentNode'=node60path63) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 64)  -> (currentNode'=node60path64) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 65)  -> (currentNode'=node60path65) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 66)  -> (currentNode'=node60path66) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 67)  -> (currentNode'=node60path67) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 68)  -> (currentNode'=node60path68) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 69)  -> (currentNode'=node60path69) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 70)  -> (currentNode'=node60path70) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 71)  -> (currentNode'=node60path71) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 72)  -> (currentNode'=node60path72) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 73)  -> (currentNode'=node60path73) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 74)  -> (currentNode'=node60path74) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 75)  -> (currentNode'=node60path75) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 76)  -> (currentNode'=node60path76) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 77)  -> (currentNode'=node60path77) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 78)  -> (currentNode'=node60path78) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 79)  -> (currentNode'=node60path79) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 80)  -> (currentNode'=node60path80) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 81)  -> (currentNode'=node60path81) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 82)  -> (currentNode'=node60path82) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 83)  -> (currentNode'=node60path83) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 84)  -> (currentNode'=node60path84) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 85)  -> (currentNode'=node60path85) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 86)  -> (currentNode'=node60path86) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 87)  -> (currentNode'=node60path87) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 88)  -> (currentNode'=node60path88) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 89)  -> (currentNode'=node60path89) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 90)  -> (currentNode'=node60path90) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 91)  -> (currentNode'=node60path91) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 92)  -> (currentNode'=node60path92) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 93)  -> (currentNode'=node60path93) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 94)  -> (currentNode'=node60path94) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 95)  -> (currentNode'=node60path95) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 96)  -> (currentNode'=node60path96) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 97)  -> (currentNode'=node60path97) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 98)  -> (currentNode'=node60path98) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 99)  -> (currentNode'=node60path99) & (bad'=false) & (end'=true);
[] bad & (currentNode = 60) & (currentPath = 100)  -> (currentNode'=node60path100) & (bad'=false) & (end'=true);



[] good & (currentNode = 1) ->
 numPathsInv: (currentNode'=(node1path1 * min(1,node1path1) - currentNode*(min(1, node1path1) - 1))) &  (currentPath'=(1 * min(1, node1path1) - currentPath*(min(1,node1path1) - 1))) & (success'=min(1, node1path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path2 * min(1,node1path2) - currentNode*(min(1, node1path2) - 1))) &  (currentPath'=(2 * min(1, node1path2) - currentPath*(min(1,node1path2) - 1))) & (success'=min(1, node1path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path3 * min(1,node1path3) - currentNode*(min(1, node1path3) - 1))) &  (currentPath'=(3 * min(1, node1path3) - currentPath*(min(1,node1path3) - 1))) & (success'=min(1, node1path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path4 * min(1,node1path4) - currentNode*(min(1, node1path4) - 1))) &  (currentPath'=(4 * min(1, node1path4) - currentPath*(min(1,node1path4) - 1))) & (success'=min(1, node1path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path5 * min(1,node1path5) - currentNode*(min(1, node1path5) - 1))) &  (currentPath'=(5 * min(1, node1path5) - currentPath*(min(1,node1path5) - 1))) & (success'=min(1, node1path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path6 * min(1,node1path6) - currentNode*(min(1, node1path6) - 1))) &  (currentPath'=(6 * min(1, node1path6) - currentPath*(min(1,node1path6) - 1))) & (success'=min(1, node1path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path7 * min(1,node1path7) - currentNode*(min(1, node1path7) - 1))) &  (currentPath'=(7 * min(1, node1path7) - currentPath*(min(1,node1path7) - 1))) & (success'=min(1, node1path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path8 * min(1,node1path8) - currentNode*(min(1, node1path8) - 1))) &  (currentPath'=(8 * min(1, node1path8) - currentPath*(min(1,node1path8) - 1))) & (success'=min(1, node1path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path9 * min(1,node1path9) - currentNode*(min(1, node1path9) - 1))) &  (currentPath'=(9 * min(1, node1path9) - currentPath*(min(1,node1path9) - 1))) & (success'=min(1, node1path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path10 * min(1,node1path10) - currentNode*(min(1, node1path10) - 1))) &  (currentPath'=(10 * min(1, node1path10) - currentPath*(min(1,node1path10) - 1))) & (success'=min(1, node1path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path11 * min(1,node1path11) - currentNode*(min(1, node1path11) - 1))) &  (currentPath'=(11 * min(1, node1path11) - currentPath*(min(1,node1path11) - 1))) & (success'=min(1, node1path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path12 * min(1,node1path12) - currentNode*(min(1, node1path12) - 1))) &  (currentPath'=(12 * min(1, node1path12) - currentPath*(min(1,node1path12) - 1))) & (success'=min(1, node1path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path13 * min(1,node1path13) - currentNode*(min(1, node1path13) - 1))) &  (currentPath'=(13 * min(1, node1path13) - currentPath*(min(1,node1path13) - 1))) & (success'=min(1, node1path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path14 * min(1,node1path14) - currentNode*(min(1, node1path14) - 1))) &  (currentPath'=(14 * min(1, node1path14) - currentPath*(min(1,node1path14) - 1))) & (success'=min(1, node1path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path15 * min(1,node1path15) - currentNode*(min(1, node1path15) - 1))) &  (currentPath'=(15 * min(1, node1path15) - currentPath*(min(1,node1path15) - 1))) & (success'=min(1, node1path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path16 * min(1,node1path16) - currentNode*(min(1, node1path16) - 1))) &  (currentPath'=(16 * min(1, node1path16) - currentPath*(min(1,node1path16) - 1))) & (success'=min(1, node1path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path17 * min(1,node1path17) - currentNode*(min(1, node1path17) - 1))) &  (currentPath'=(17 * min(1, node1path17) - currentPath*(min(1,node1path17) - 1))) & (success'=min(1, node1path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path18 * min(1,node1path18) - currentNode*(min(1, node1path18) - 1))) &  (currentPath'=(18 * min(1, node1path18) - currentPath*(min(1,node1path18) - 1))) & (success'=min(1, node1path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path19 * min(1,node1path19) - currentNode*(min(1, node1path19) - 1))) &  (currentPath'=(19 * min(1, node1path19) - currentPath*(min(1,node1path19) - 1))) & (success'=min(1, node1path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path20 * min(1,node1path20) - currentNode*(min(1, node1path20) - 1))) &  (currentPath'=(20 * min(1, node1path20) - currentPath*(min(1,node1path20) - 1))) & (success'=min(1, node1path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path21 * min(1,node1path21) - currentNode*(min(1, node1path21) - 1))) &  (currentPath'=(21 * min(1, node1path21) - currentPath*(min(1,node1path21) - 1))) & (success'=min(1, node1path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path22 * min(1,node1path22) - currentNode*(min(1, node1path22) - 1))) &  (currentPath'=(22 * min(1, node1path22) - currentPath*(min(1,node1path22) - 1))) & (success'=min(1, node1path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path23 * min(1,node1path23) - currentNode*(min(1, node1path23) - 1))) &  (currentPath'=(23 * min(1, node1path23) - currentPath*(min(1,node1path23) - 1))) & (success'=min(1, node1path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path24 * min(1,node1path24) - currentNode*(min(1, node1path24) - 1))) &  (currentPath'=(24 * min(1, node1path24) - currentPath*(min(1,node1path24) - 1))) & (success'=min(1, node1path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path25 * min(1,node1path25) - currentNode*(min(1, node1path25) - 1))) &  (currentPath'=(25 * min(1, node1path25) - currentPath*(min(1,node1path25) - 1))) & (success'=min(1, node1path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path26 * min(1,node1path26) - currentNode*(min(1, node1path26) - 1))) &  (currentPath'=(26 * min(1, node1path26) - currentPath*(min(1,node1path26) - 1))) & (success'=min(1, node1path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path27 * min(1,node1path27) - currentNode*(min(1, node1path27) - 1))) &  (currentPath'=(27 * min(1, node1path27) - currentPath*(min(1,node1path27) - 1))) & (success'=min(1, node1path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path28 * min(1,node1path28) - currentNode*(min(1, node1path28) - 1))) &  (currentPath'=(28 * min(1, node1path28) - currentPath*(min(1,node1path28) - 1))) & (success'=min(1, node1path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path29 * min(1,node1path29) - currentNode*(min(1, node1path29) - 1))) &  (currentPath'=(29 * min(1, node1path29) - currentPath*(min(1,node1path29) - 1))) & (success'=min(1, node1path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path30 * min(1,node1path30) - currentNode*(min(1, node1path30) - 1))) &  (currentPath'=(30 * min(1, node1path30) - currentPath*(min(1,node1path30) - 1))) & (success'=min(1, node1path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path31 * min(1,node1path31) - currentNode*(min(1, node1path31) - 1))) &  (currentPath'=(31 * min(1, node1path31) - currentPath*(min(1,node1path31) - 1))) & (success'=min(1, node1path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path32 * min(1,node1path32) - currentNode*(min(1, node1path32) - 1))) &  (currentPath'=(32 * min(1, node1path32) - currentPath*(min(1,node1path32) - 1))) & (success'=min(1, node1path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path33 * min(1,node1path33) - currentNode*(min(1, node1path33) - 1))) &  (currentPath'=(33 * min(1, node1path33) - currentPath*(min(1,node1path33) - 1))) & (success'=min(1, node1path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path34 * min(1,node1path34) - currentNode*(min(1, node1path34) - 1))) &  (currentPath'=(34 * min(1, node1path34) - currentPath*(min(1,node1path34) - 1))) & (success'=min(1, node1path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path35 * min(1,node1path35) - currentNode*(min(1, node1path35) - 1))) &  (currentPath'=(35 * min(1, node1path35) - currentPath*(min(1,node1path35) - 1))) & (success'=min(1, node1path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path36 * min(1,node1path36) - currentNode*(min(1, node1path36) - 1))) &  (currentPath'=(36 * min(1, node1path36) - currentPath*(min(1,node1path36) - 1))) & (success'=min(1, node1path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path37 * min(1,node1path37) - currentNode*(min(1, node1path37) - 1))) &  (currentPath'=(37 * min(1, node1path37) - currentPath*(min(1,node1path37) - 1))) & (success'=min(1, node1path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path38 * min(1,node1path38) - currentNode*(min(1, node1path38) - 1))) &  (currentPath'=(38 * min(1, node1path38) - currentPath*(min(1,node1path38) - 1))) & (success'=min(1, node1path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path39 * min(1,node1path39) - currentNode*(min(1, node1path39) - 1))) &  (currentPath'=(39 * min(1, node1path39) - currentPath*(min(1,node1path39) - 1))) & (success'=min(1, node1path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path40 * min(1,node1path40) - currentNode*(min(1, node1path40) - 1))) &  (currentPath'=(40 * min(1, node1path40) - currentPath*(min(1,node1path40) - 1))) & (success'=min(1, node1path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path41 * min(1,node1path41) - currentNode*(min(1, node1path41) - 1))) &  (currentPath'=(41 * min(1, node1path41) - currentPath*(min(1,node1path41) - 1))) & (success'=min(1, node1path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path42 * min(1,node1path42) - currentNode*(min(1, node1path42) - 1))) &  (currentPath'=(42 * min(1, node1path42) - currentPath*(min(1,node1path42) - 1))) & (success'=min(1, node1path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path43 * min(1,node1path43) - currentNode*(min(1, node1path43) - 1))) &  (currentPath'=(43 * min(1, node1path43) - currentPath*(min(1,node1path43) - 1))) & (success'=min(1, node1path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path44 * min(1,node1path44) - currentNode*(min(1, node1path44) - 1))) &  (currentPath'=(44 * min(1, node1path44) - currentPath*(min(1,node1path44) - 1))) & (success'=min(1, node1path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path45 * min(1,node1path45) - currentNode*(min(1, node1path45) - 1))) &  (currentPath'=(45 * min(1, node1path45) - currentPath*(min(1,node1path45) - 1))) & (success'=min(1, node1path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path46 * min(1,node1path46) - currentNode*(min(1, node1path46) - 1))) &  (currentPath'=(46 * min(1, node1path46) - currentPath*(min(1,node1path46) - 1))) & (success'=min(1, node1path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path47 * min(1,node1path47) - currentNode*(min(1, node1path47) - 1))) &  (currentPath'=(47 * min(1, node1path47) - currentPath*(min(1,node1path47) - 1))) & (success'=min(1, node1path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path48 * min(1,node1path48) - currentNode*(min(1, node1path48) - 1))) &  (currentPath'=(48 * min(1, node1path48) - currentPath*(min(1,node1path48) - 1))) & (success'=min(1, node1path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path49 * min(1,node1path49) - currentNode*(min(1, node1path49) - 1))) &  (currentPath'=(49 * min(1, node1path49) - currentPath*(min(1,node1path49) - 1))) & (success'=min(1, node1path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path50 * min(1,node1path50) - currentNode*(min(1, node1path50) - 1))) &  (currentPath'=(50 * min(1, node1path50) - currentPath*(min(1,node1path50) - 1))) & (success'=min(1, node1path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path51 * min(1,node1path51) - currentNode*(min(1, node1path51) - 1))) &  (currentPath'=(51 * min(1, node1path51) - currentPath*(min(1,node1path51) - 1))) & (success'=min(1, node1path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path52 * min(1,node1path52) - currentNode*(min(1, node1path52) - 1))) &  (currentPath'=(52 * min(1, node1path52) - currentPath*(min(1,node1path52) - 1))) & (success'=min(1, node1path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path53 * min(1,node1path53) - currentNode*(min(1, node1path53) - 1))) &  (currentPath'=(53 * min(1, node1path53) - currentPath*(min(1,node1path53) - 1))) & (success'=min(1, node1path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path54 * min(1,node1path54) - currentNode*(min(1, node1path54) - 1))) &  (currentPath'=(54 * min(1, node1path54) - currentPath*(min(1,node1path54) - 1))) & (success'=min(1, node1path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path55 * min(1,node1path55) - currentNode*(min(1, node1path55) - 1))) &  (currentPath'=(55 * min(1, node1path55) - currentPath*(min(1,node1path55) - 1))) & (success'=min(1, node1path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path56 * min(1,node1path56) - currentNode*(min(1, node1path56) - 1))) &  (currentPath'=(56 * min(1, node1path56) - currentPath*(min(1,node1path56) - 1))) & (success'=min(1, node1path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path57 * min(1,node1path57) - currentNode*(min(1, node1path57) - 1))) &  (currentPath'=(57 * min(1, node1path57) - currentPath*(min(1,node1path57) - 1))) & (success'=min(1, node1path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path58 * min(1,node1path58) - currentNode*(min(1, node1path58) - 1))) &  (currentPath'=(58 * min(1, node1path58) - currentPath*(min(1,node1path58) - 1))) & (success'=min(1, node1path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path59 * min(1,node1path59) - currentNode*(min(1, node1path59) - 1))) &  (currentPath'=(59 * min(1, node1path59) - currentPath*(min(1,node1path59) - 1))) & (success'=min(1, node1path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path60 * min(1,node1path60) - currentNode*(min(1, node1path60) - 1))) &  (currentPath'=(60 * min(1, node1path60) - currentPath*(min(1,node1path60) - 1))) & (success'=min(1, node1path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path61 * min(1,node1path61) - currentNode*(min(1, node1path61) - 1))) &  (currentPath'=(61 * min(1, node1path61) - currentPath*(min(1,node1path61) - 1))) & (success'=min(1, node1path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path62 * min(1,node1path62) - currentNode*(min(1, node1path62) - 1))) &  (currentPath'=(62 * min(1, node1path62) - currentPath*(min(1,node1path62) - 1))) & (success'=min(1, node1path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path63 * min(1,node1path63) - currentNode*(min(1, node1path63) - 1))) &  (currentPath'=(63 * min(1, node1path63) - currentPath*(min(1,node1path63) - 1))) & (success'=min(1, node1path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path64 * min(1,node1path64) - currentNode*(min(1, node1path64) - 1))) &  (currentPath'=(64 * min(1, node1path64) - currentPath*(min(1,node1path64) - 1))) & (success'=min(1, node1path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path65 * min(1,node1path65) - currentNode*(min(1, node1path65) - 1))) &  (currentPath'=(65 * min(1, node1path65) - currentPath*(min(1,node1path65) - 1))) & (success'=min(1, node1path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path66 * min(1,node1path66) - currentNode*(min(1, node1path66) - 1))) &  (currentPath'=(66 * min(1, node1path66) - currentPath*(min(1,node1path66) - 1))) & (success'=min(1, node1path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path67 * min(1,node1path67) - currentNode*(min(1, node1path67) - 1))) &  (currentPath'=(67 * min(1, node1path67) - currentPath*(min(1,node1path67) - 1))) & (success'=min(1, node1path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path68 * min(1,node1path68) - currentNode*(min(1, node1path68) - 1))) &  (currentPath'=(68 * min(1, node1path68) - currentPath*(min(1,node1path68) - 1))) & (success'=min(1, node1path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path69 * min(1,node1path69) - currentNode*(min(1, node1path69) - 1))) &  (currentPath'=(69 * min(1, node1path69) - currentPath*(min(1,node1path69) - 1))) & (success'=min(1, node1path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path70 * min(1,node1path70) - currentNode*(min(1, node1path70) - 1))) &  (currentPath'=(70 * min(1, node1path70) - currentPath*(min(1,node1path70) - 1))) & (success'=min(1, node1path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path71 * min(1,node1path71) - currentNode*(min(1, node1path71) - 1))) &  (currentPath'=(71 * min(1, node1path71) - currentPath*(min(1,node1path71) - 1))) & (success'=min(1, node1path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path72 * min(1,node1path72) - currentNode*(min(1, node1path72) - 1))) &  (currentPath'=(72 * min(1, node1path72) - currentPath*(min(1,node1path72) - 1))) & (success'=min(1, node1path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path73 * min(1,node1path73) - currentNode*(min(1, node1path73) - 1))) &  (currentPath'=(73 * min(1, node1path73) - currentPath*(min(1,node1path73) - 1))) & (success'=min(1, node1path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path74 * min(1,node1path74) - currentNode*(min(1, node1path74) - 1))) &  (currentPath'=(74 * min(1, node1path74) - currentPath*(min(1,node1path74) - 1))) & (success'=min(1, node1path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path75 * min(1,node1path75) - currentNode*(min(1, node1path75) - 1))) &  (currentPath'=(75 * min(1, node1path75) - currentPath*(min(1,node1path75) - 1))) & (success'=min(1, node1path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path76 * min(1,node1path76) - currentNode*(min(1, node1path76) - 1))) &  (currentPath'=(76 * min(1, node1path76) - currentPath*(min(1,node1path76) - 1))) & (success'=min(1, node1path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path77 * min(1,node1path77) - currentNode*(min(1, node1path77) - 1))) &  (currentPath'=(77 * min(1, node1path77) - currentPath*(min(1,node1path77) - 1))) & (success'=min(1, node1path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path78 * min(1,node1path78) - currentNode*(min(1, node1path78) - 1))) &  (currentPath'=(78 * min(1, node1path78) - currentPath*(min(1,node1path78) - 1))) & (success'=min(1, node1path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path79 * min(1,node1path79) - currentNode*(min(1, node1path79) - 1))) &  (currentPath'=(79 * min(1, node1path79) - currentPath*(min(1,node1path79) - 1))) & (success'=min(1, node1path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path80 * min(1,node1path80) - currentNode*(min(1, node1path80) - 1))) &  (currentPath'=(80 * min(1, node1path80) - currentPath*(min(1,node1path80) - 1))) & (success'=min(1, node1path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path81 * min(1,node1path81) - currentNode*(min(1, node1path81) - 1))) &  (currentPath'=(81 * min(1, node1path81) - currentPath*(min(1,node1path81) - 1))) & (success'=min(1, node1path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path82 * min(1,node1path82) - currentNode*(min(1, node1path82) - 1))) &  (currentPath'=(82 * min(1, node1path82) - currentPath*(min(1,node1path82) - 1))) & (success'=min(1, node1path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path83 * min(1,node1path83) - currentNode*(min(1, node1path83) - 1))) &  (currentPath'=(83 * min(1, node1path83) - currentPath*(min(1,node1path83) - 1))) & (success'=min(1, node1path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path84 * min(1,node1path84) - currentNode*(min(1, node1path84) - 1))) &  (currentPath'=(84 * min(1, node1path84) - currentPath*(min(1,node1path84) - 1))) & (success'=min(1, node1path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path85 * min(1,node1path85) - currentNode*(min(1, node1path85) - 1))) &  (currentPath'=(85 * min(1, node1path85) - currentPath*(min(1,node1path85) - 1))) & (success'=min(1, node1path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path86 * min(1,node1path86) - currentNode*(min(1, node1path86) - 1))) &  (currentPath'=(86 * min(1, node1path86) - currentPath*(min(1,node1path86) - 1))) & (success'=min(1, node1path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path87 * min(1,node1path87) - currentNode*(min(1, node1path87) - 1))) &  (currentPath'=(87 * min(1, node1path87) - currentPath*(min(1,node1path87) - 1))) & (success'=min(1, node1path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path88 * min(1,node1path88) - currentNode*(min(1, node1path88) - 1))) &  (currentPath'=(88 * min(1, node1path88) - currentPath*(min(1,node1path88) - 1))) & (success'=min(1, node1path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path89 * min(1,node1path89) - currentNode*(min(1, node1path89) - 1))) &  (currentPath'=(89 * min(1, node1path89) - currentPath*(min(1,node1path89) - 1))) & (success'=min(1, node1path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path90 * min(1,node1path90) - currentNode*(min(1, node1path90) - 1))) &  (currentPath'=(90 * min(1, node1path90) - currentPath*(min(1,node1path90) - 1))) & (success'=min(1, node1path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path91 * min(1,node1path91) - currentNode*(min(1, node1path91) - 1))) &  (currentPath'=(91 * min(1, node1path91) - currentPath*(min(1,node1path91) - 1))) & (success'=min(1, node1path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path92 * min(1,node1path92) - currentNode*(min(1, node1path92) - 1))) &  (currentPath'=(92 * min(1, node1path92) - currentPath*(min(1,node1path92) - 1))) & (success'=min(1, node1path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path93 * min(1,node1path93) - currentNode*(min(1, node1path93) - 1))) &  (currentPath'=(93 * min(1, node1path93) - currentPath*(min(1,node1path93) - 1))) & (success'=min(1, node1path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path94 * min(1,node1path94) - currentNode*(min(1, node1path94) - 1))) &  (currentPath'=(94 * min(1, node1path94) - currentPath*(min(1,node1path94) - 1))) & (success'=min(1, node1path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path95 * min(1,node1path95) - currentNode*(min(1, node1path95) - 1))) &  (currentPath'=(95 * min(1, node1path95) - currentPath*(min(1,node1path95) - 1))) & (success'=min(1, node1path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path96 * min(1,node1path96) - currentNode*(min(1, node1path96) - 1))) &  (currentPath'=(96 * min(1, node1path96) - currentPath*(min(1,node1path96) - 1))) & (success'=min(1, node1path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path97 * min(1,node1path97) - currentNode*(min(1, node1path97) - 1))) &  (currentPath'=(97 * min(1, node1path97) - currentPath*(min(1,node1path97) - 1))) & (success'=min(1, node1path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path98 * min(1,node1path98) - currentNode*(min(1, node1path98) - 1))) &  (currentPath'=(98 * min(1, node1path98) - currentPath*(min(1,node1path98) - 1))) & (success'=min(1, node1path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path99 * min(1,node1path99) - currentNode*(min(1, node1path99) - 1))) &  (currentPath'=(99 * min(1, node1path99) - currentPath*(min(1,node1path99) - 1))) & (success'=min(1, node1path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node1path100 * min(1,node1path100) - currentNode*(min(1, node1path100) - 1))) &  (currentPath'=(100 * min(1, node1path100) - currentPath*(min(1,node1path100) - 1))) & (success'=min(1, node1path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 2) ->
 numPathsInv: (currentNode'=(node2path1 * min(1,node2path1) - currentNode*(min(1, node2path1) - 1))) &  (currentPath'=(1 * min(1, node2path1) - currentPath*(min(1,node2path1) - 1))) & (success'=min(1, node2path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path2 * min(1,node2path2) - currentNode*(min(1, node2path2) - 1))) &  (currentPath'=(2 * min(1, node2path2) - currentPath*(min(1,node2path2) - 1))) & (success'=min(1, node2path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path3 * min(1,node2path3) - currentNode*(min(1, node2path3) - 1))) &  (currentPath'=(3 * min(1, node2path3) - currentPath*(min(1,node2path3) - 1))) & (success'=min(1, node2path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path4 * min(1,node2path4) - currentNode*(min(1, node2path4) - 1))) &  (currentPath'=(4 * min(1, node2path4) - currentPath*(min(1,node2path4) - 1))) & (success'=min(1, node2path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path5 * min(1,node2path5) - currentNode*(min(1, node2path5) - 1))) &  (currentPath'=(5 * min(1, node2path5) - currentPath*(min(1,node2path5) - 1))) & (success'=min(1, node2path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path6 * min(1,node2path6) - currentNode*(min(1, node2path6) - 1))) &  (currentPath'=(6 * min(1, node2path6) - currentPath*(min(1,node2path6) - 1))) & (success'=min(1, node2path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path7 * min(1,node2path7) - currentNode*(min(1, node2path7) - 1))) &  (currentPath'=(7 * min(1, node2path7) - currentPath*(min(1,node2path7) - 1))) & (success'=min(1, node2path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path8 * min(1,node2path8) - currentNode*(min(1, node2path8) - 1))) &  (currentPath'=(8 * min(1, node2path8) - currentPath*(min(1,node2path8) - 1))) & (success'=min(1, node2path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path9 * min(1,node2path9) - currentNode*(min(1, node2path9) - 1))) &  (currentPath'=(9 * min(1, node2path9) - currentPath*(min(1,node2path9) - 1))) & (success'=min(1, node2path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path10 * min(1,node2path10) - currentNode*(min(1, node2path10) - 1))) &  (currentPath'=(10 * min(1, node2path10) - currentPath*(min(1,node2path10) - 1))) & (success'=min(1, node2path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path11 * min(1,node2path11) - currentNode*(min(1, node2path11) - 1))) &  (currentPath'=(11 * min(1, node2path11) - currentPath*(min(1,node2path11) - 1))) & (success'=min(1, node2path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path12 * min(1,node2path12) - currentNode*(min(1, node2path12) - 1))) &  (currentPath'=(12 * min(1, node2path12) - currentPath*(min(1,node2path12) - 1))) & (success'=min(1, node2path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path13 * min(1,node2path13) - currentNode*(min(1, node2path13) - 1))) &  (currentPath'=(13 * min(1, node2path13) - currentPath*(min(1,node2path13) - 1))) & (success'=min(1, node2path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path14 * min(1,node2path14) - currentNode*(min(1, node2path14) - 1))) &  (currentPath'=(14 * min(1, node2path14) - currentPath*(min(1,node2path14) - 1))) & (success'=min(1, node2path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path15 * min(1,node2path15) - currentNode*(min(1, node2path15) - 1))) &  (currentPath'=(15 * min(1, node2path15) - currentPath*(min(1,node2path15) - 1))) & (success'=min(1, node2path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path16 * min(1,node2path16) - currentNode*(min(1, node2path16) - 1))) &  (currentPath'=(16 * min(1, node2path16) - currentPath*(min(1,node2path16) - 1))) & (success'=min(1, node2path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path17 * min(1,node2path17) - currentNode*(min(1, node2path17) - 1))) &  (currentPath'=(17 * min(1, node2path17) - currentPath*(min(1,node2path17) - 1))) & (success'=min(1, node2path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path18 * min(1,node2path18) - currentNode*(min(1, node2path18) - 1))) &  (currentPath'=(18 * min(1, node2path18) - currentPath*(min(1,node2path18) - 1))) & (success'=min(1, node2path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path19 * min(1,node2path19) - currentNode*(min(1, node2path19) - 1))) &  (currentPath'=(19 * min(1, node2path19) - currentPath*(min(1,node2path19) - 1))) & (success'=min(1, node2path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path20 * min(1,node2path20) - currentNode*(min(1, node2path20) - 1))) &  (currentPath'=(20 * min(1, node2path20) - currentPath*(min(1,node2path20) - 1))) & (success'=min(1, node2path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path21 * min(1,node2path21) - currentNode*(min(1, node2path21) - 1))) &  (currentPath'=(21 * min(1, node2path21) - currentPath*(min(1,node2path21) - 1))) & (success'=min(1, node2path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path22 * min(1,node2path22) - currentNode*(min(1, node2path22) - 1))) &  (currentPath'=(22 * min(1, node2path22) - currentPath*(min(1,node2path22) - 1))) & (success'=min(1, node2path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path23 * min(1,node2path23) - currentNode*(min(1, node2path23) - 1))) &  (currentPath'=(23 * min(1, node2path23) - currentPath*(min(1,node2path23) - 1))) & (success'=min(1, node2path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path24 * min(1,node2path24) - currentNode*(min(1, node2path24) - 1))) &  (currentPath'=(24 * min(1, node2path24) - currentPath*(min(1,node2path24) - 1))) & (success'=min(1, node2path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path25 * min(1,node2path25) - currentNode*(min(1, node2path25) - 1))) &  (currentPath'=(25 * min(1, node2path25) - currentPath*(min(1,node2path25) - 1))) & (success'=min(1, node2path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path26 * min(1,node2path26) - currentNode*(min(1, node2path26) - 1))) &  (currentPath'=(26 * min(1, node2path26) - currentPath*(min(1,node2path26) - 1))) & (success'=min(1, node2path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path27 * min(1,node2path27) - currentNode*(min(1, node2path27) - 1))) &  (currentPath'=(27 * min(1, node2path27) - currentPath*(min(1,node2path27) - 1))) & (success'=min(1, node2path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path28 * min(1,node2path28) - currentNode*(min(1, node2path28) - 1))) &  (currentPath'=(28 * min(1, node2path28) - currentPath*(min(1,node2path28) - 1))) & (success'=min(1, node2path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path29 * min(1,node2path29) - currentNode*(min(1, node2path29) - 1))) &  (currentPath'=(29 * min(1, node2path29) - currentPath*(min(1,node2path29) - 1))) & (success'=min(1, node2path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path30 * min(1,node2path30) - currentNode*(min(1, node2path30) - 1))) &  (currentPath'=(30 * min(1, node2path30) - currentPath*(min(1,node2path30) - 1))) & (success'=min(1, node2path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path31 * min(1,node2path31) - currentNode*(min(1, node2path31) - 1))) &  (currentPath'=(31 * min(1, node2path31) - currentPath*(min(1,node2path31) - 1))) & (success'=min(1, node2path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path32 * min(1,node2path32) - currentNode*(min(1, node2path32) - 1))) &  (currentPath'=(32 * min(1, node2path32) - currentPath*(min(1,node2path32) - 1))) & (success'=min(1, node2path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path33 * min(1,node2path33) - currentNode*(min(1, node2path33) - 1))) &  (currentPath'=(33 * min(1, node2path33) - currentPath*(min(1,node2path33) - 1))) & (success'=min(1, node2path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path34 * min(1,node2path34) - currentNode*(min(1, node2path34) - 1))) &  (currentPath'=(34 * min(1, node2path34) - currentPath*(min(1,node2path34) - 1))) & (success'=min(1, node2path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path35 * min(1,node2path35) - currentNode*(min(1, node2path35) - 1))) &  (currentPath'=(35 * min(1, node2path35) - currentPath*(min(1,node2path35) - 1))) & (success'=min(1, node2path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path36 * min(1,node2path36) - currentNode*(min(1, node2path36) - 1))) &  (currentPath'=(36 * min(1, node2path36) - currentPath*(min(1,node2path36) - 1))) & (success'=min(1, node2path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path37 * min(1,node2path37) - currentNode*(min(1, node2path37) - 1))) &  (currentPath'=(37 * min(1, node2path37) - currentPath*(min(1,node2path37) - 1))) & (success'=min(1, node2path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path38 * min(1,node2path38) - currentNode*(min(1, node2path38) - 1))) &  (currentPath'=(38 * min(1, node2path38) - currentPath*(min(1,node2path38) - 1))) & (success'=min(1, node2path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path39 * min(1,node2path39) - currentNode*(min(1, node2path39) - 1))) &  (currentPath'=(39 * min(1, node2path39) - currentPath*(min(1,node2path39) - 1))) & (success'=min(1, node2path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path40 * min(1,node2path40) - currentNode*(min(1, node2path40) - 1))) &  (currentPath'=(40 * min(1, node2path40) - currentPath*(min(1,node2path40) - 1))) & (success'=min(1, node2path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path41 * min(1,node2path41) - currentNode*(min(1, node2path41) - 1))) &  (currentPath'=(41 * min(1, node2path41) - currentPath*(min(1,node2path41) - 1))) & (success'=min(1, node2path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path42 * min(1,node2path42) - currentNode*(min(1, node2path42) - 1))) &  (currentPath'=(42 * min(1, node2path42) - currentPath*(min(1,node2path42) - 1))) & (success'=min(1, node2path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path43 * min(1,node2path43) - currentNode*(min(1, node2path43) - 1))) &  (currentPath'=(43 * min(1, node2path43) - currentPath*(min(1,node2path43) - 1))) & (success'=min(1, node2path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path44 * min(1,node2path44) - currentNode*(min(1, node2path44) - 1))) &  (currentPath'=(44 * min(1, node2path44) - currentPath*(min(1,node2path44) - 1))) & (success'=min(1, node2path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path45 * min(1,node2path45) - currentNode*(min(1, node2path45) - 1))) &  (currentPath'=(45 * min(1, node2path45) - currentPath*(min(1,node2path45) - 1))) & (success'=min(1, node2path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path46 * min(1,node2path46) - currentNode*(min(1, node2path46) - 1))) &  (currentPath'=(46 * min(1, node2path46) - currentPath*(min(1,node2path46) - 1))) & (success'=min(1, node2path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path47 * min(1,node2path47) - currentNode*(min(1, node2path47) - 1))) &  (currentPath'=(47 * min(1, node2path47) - currentPath*(min(1,node2path47) - 1))) & (success'=min(1, node2path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path48 * min(1,node2path48) - currentNode*(min(1, node2path48) - 1))) &  (currentPath'=(48 * min(1, node2path48) - currentPath*(min(1,node2path48) - 1))) & (success'=min(1, node2path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path49 * min(1,node2path49) - currentNode*(min(1, node2path49) - 1))) &  (currentPath'=(49 * min(1, node2path49) - currentPath*(min(1,node2path49) - 1))) & (success'=min(1, node2path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path50 * min(1,node2path50) - currentNode*(min(1, node2path50) - 1))) &  (currentPath'=(50 * min(1, node2path50) - currentPath*(min(1,node2path50) - 1))) & (success'=min(1, node2path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path51 * min(1,node2path51) - currentNode*(min(1, node2path51) - 1))) &  (currentPath'=(51 * min(1, node2path51) - currentPath*(min(1,node2path51) - 1))) & (success'=min(1, node2path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path52 * min(1,node2path52) - currentNode*(min(1, node2path52) - 1))) &  (currentPath'=(52 * min(1, node2path52) - currentPath*(min(1,node2path52) - 1))) & (success'=min(1, node2path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path53 * min(1,node2path53) - currentNode*(min(1, node2path53) - 1))) &  (currentPath'=(53 * min(1, node2path53) - currentPath*(min(1,node2path53) - 1))) & (success'=min(1, node2path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path54 * min(1,node2path54) - currentNode*(min(1, node2path54) - 1))) &  (currentPath'=(54 * min(1, node2path54) - currentPath*(min(1,node2path54) - 1))) & (success'=min(1, node2path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path55 * min(1,node2path55) - currentNode*(min(1, node2path55) - 1))) &  (currentPath'=(55 * min(1, node2path55) - currentPath*(min(1,node2path55) - 1))) & (success'=min(1, node2path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path56 * min(1,node2path56) - currentNode*(min(1, node2path56) - 1))) &  (currentPath'=(56 * min(1, node2path56) - currentPath*(min(1,node2path56) - 1))) & (success'=min(1, node2path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path57 * min(1,node2path57) - currentNode*(min(1, node2path57) - 1))) &  (currentPath'=(57 * min(1, node2path57) - currentPath*(min(1,node2path57) - 1))) & (success'=min(1, node2path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path58 * min(1,node2path58) - currentNode*(min(1, node2path58) - 1))) &  (currentPath'=(58 * min(1, node2path58) - currentPath*(min(1,node2path58) - 1))) & (success'=min(1, node2path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path59 * min(1,node2path59) - currentNode*(min(1, node2path59) - 1))) &  (currentPath'=(59 * min(1, node2path59) - currentPath*(min(1,node2path59) - 1))) & (success'=min(1, node2path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path60 * min(1,node2path60) - currentNode*(min(1, node2path60) - 1))) &  (currentPath'=(60 * min(1, node2path60) - currentPath*(min(1,node2path60) - 1))) & (success'=min(1, node2path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path61 * min(1,node2path61) - currentNode*(min(1, node2path61) - 1))) &  (currentPath'=(61 * min(1, node2path61) - currentPath*(min(1,node2path61) - 1))) & (success'=min(1, node2path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path62 * min(1,node2path62) - currentNode*(min(1, node2path62) - 1))) &  (currentPath'=(62 * min(1, node2path62) - currentPath*(min(1,node2path62) - 1))) & (success'=min(1, node2path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path63 * min(1,node2path63) - currentNode*(min(1, node2path63) - 1))) &  (currentPath'=(63 * min(1, node2path63) - currentPath*(min(1,node2path63) - 1))) & (success'=min(1, node2path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path64 * min(1,node2path64) - currentNode*(min(1, node2path64) - 1))) &  (currentPath'=(64 * min(1, node2path64) - currentPath*(min(1,node2path64) - 1))) & (success'=min(1, node2path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path65 * min(1,node2path65) - currentNode*(min(1, node2path65) - 1))) &  (currentPath'=(65 * min(1, node2path65) - currentPath*(min(1,node2path65) - 1))) & (success'=min(1, node2path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path66 * min(1,node2path66) - currentNode*(min(1, node2path66) - 1))) &  (currentPath'=(66 * min(1, node2path66) - currentPath*(min(1,node2path66) - 1))) & (success'=min(1, node2path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path67 * min(1,node2path67) - currentNode*(min(1, node2path67) - 1))) &  (currentPath'=(67 * min(1, node2path67) - currentPath*(min(1,node2path67) - 1))) & (success'=min(1, node2path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path68 * min(1,node2path68) - currentNode*(min(1, node2path68) - 1))) &  (currentPath'=(68 * min(1, node2path68) - currentPath*(min(1,node2path68) - 1))) & (success'=min(1, node2path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path69 * min(1,node2path69) - currentNode*(min(1, node2path69) - 1))) &  (currentPath'=(69 * min(1, node2path69) - currentPath*(min(1,node2path69) - 1))) & (success'=min(1, node2path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path70 * min(1,node2path70) - currentNode*(min(1, node2path70) - 1))) &  (currentPath'=(70 * min(1, node2path70) - currentPath*(min(1,node2path70) - 1))) & (success'=min(1, node2path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path71 * min(1,node2path71) - currentNode*(min(1, node2path71) - 1))) &  (currentPath'=(71 * min(1, node2path71) - currentPath*(min(1,node2path71) - 1))) & (success'=min(1, node2path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path72 * min(1,node2path72) - currentNode*(min(1, node2path72) - 1))) &  (currentPath'=(72 * min(1, node2path72) - currentPath*(min(1,node2path72) - 1))) & (success'=min(1, node2path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path73 * min(1,node2path73) - currentNode*(min(1, node2path73) - 1))) &  (currentPath'=(73 * min(1, node2path73) - currentPath*(min(1,node2path73) - 1))) & (success'=min(1, node2path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path74 * min(1,node2path74) - currentNode*(min(1, node2path74) - 1))) &  (currentPath'=(74 * min(1, node2path74) - currentPath*(min(1,node2path74) - 1))) & (success'=min(1, node2path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path75 * min(1,node2path75) - currentNode*(min(1, node2path75) - 1))) &  (currentPath'=(75 * min(1, node2path75) - currentPath*(min(1,node2path75) - 1))) & (success'=min(1, node2path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path76 * min(1,node2path76) - currentNode*(min(1, node2path76) - 1))) &  (currentPath'=(76 * min(1, node2path76) - currentPath*(min(1,node2path76) - 1))) & (success'=min(1, node2path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path77 * min(1,node2path77) - currentNode*(min(1, node2path77) - 1))) &  (currentPath'=(77 * min(1, node2path77) - currentPath*(min(1,node2path77) - 1))) & (success'=min(1, node2path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path78 * min(1,node2path78) - currentNode*(min(1, node2path78) - 1))) &  (currentPath'=(78 * min(1, node2path78) - currentPath*(min(1,node2path78) - 1))) & (success'=min(1, node2path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path79 * min(1,node2path79) - currentNode*(min(1, node2path79) - 1))) &  (currentPath'=(79 * min(1, node2path79) - currentPath*(min(1,node2path79) - 1))) & (success'=min(1, node2path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path80 * min(1,node2path80) - currentNode*(min(1, node2path80) - 1))) &  (currentPath'=(80 * min(1, node2path80) - currentPath*(min(1,node2path80) - 1))) & (success'=min(1, node2path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path81 * min(1,node2path81) - currentNode*(min(1, node2path81) - 1))) &  (currentPath'=(81 * min(1, node2path81) - currentPath*(min(1,node2path81) - 1))) & (success'=min(1, node2path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path82 * min(1,node2path82) - currentNode*(min(1, node2path82) - 1))) &  (currentPath'=(82 * min(1, node2path82) - currentPath*(min(1,node2path82) - 1))) & (success'=min(1, node2path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path83 * min(1,node2path83) - currentNode*(min(1, node2path83) - 1))) &  (currentPath'=(83 * min(1, node2path83) - currentPath*(min(1,node2path83) - 1))) & (success'=min(1, node2path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path84 * min(1,node2path84) - currentNode*(min(1, node2path84) - 1))) &  (currentPath'=(84 * min(1, node2path84) - currentPath*(min(1,node2path84) - 1))) & (success'=min(1, node2path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path85 * min(1,node2path85) - currentNode*(min(1, node2path85) - 1))) &  (currentPath'=(85 * min(1, node2path85) - currentPath*(min(1,node2path85) - 1))) & (success'=min(1, node2path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path86 * min(1,node2path86) - currentNode*(min(1, node2path86) - 1))) &  (currentPath'=(86 * min(1, node2path86) - currentPath*(min(1,node2path86) - 1))) & (success'=min(1, node2path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path87 * min(1,node2path87) - currentNode*(min(1, node2path87) - 1))) &  (currentPath'=(87 * min(1, node2path87) - currentPath*(min(1,node2path87) - 1))) & (success'=min(1, node2path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path88 * min(1,node2path88) - currentNode*(min(1, node2path88) - 1))) &  (currentPath'=(88 * min(1, node2path88) - currentPath*(min(1,node2path88) - 1))) & (success'=min(1, node2path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path89 * min(1,node2path89) - currentNode*(min(1, node2path89) - 1))) &  (currentPath'=(89 * min(1, node2path89) - currentPath*(min(1,node2path89) - 1))) & (success'=min(1, node2path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path90 * min(1,node2path90) - currentNode*(min(1, node2path90) - 1))) &  (currentPath'=(90 * min(1, node2path90) - currentPath*(min(1,node2path90) - 1))) & (success'=min(1, node2path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path91 * min(1,node2path91) - currentNode*(min(1, node2path91) - 1))) &  (currentPath'=(91 * min(1, node2path91) - currentPath*(min(1,node2path91) - 1))) & (success'=min(1, node2path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path92 * min(1,node2path92) - currentNode*(min(1, node2path92) - 1))) &  (currentPath'=(92 * min(1, node2path92) - currentPath*(min(1,node2path92) - 1))) & (success'=min(1, node2path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path93 * min(1,node2path93) - currentNode*(min(1, node2path93) - 1))) &  (currentPath'=(93 * min(1, node2path93) - currentPath*(min(1,node2path93) - 1))) & (success'=min(1, node2path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path94 * min(1,node2path94) - currentNode*(min(1, node2path94) - 1))) &  (currentPath'=(94 * min(1, node2path94) - currentPath*(min(1,node2path94) - 1))) & (success'=min(1, node2path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path95 * min(1,node2path95) - currentNode*(min(1, node2path95) - 1))) &  (currentPath'=(95 * min(1, node2path95) - currentPath*(min(1,node2path95) - 1))) & (success'=min(1, node2path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path96 * min(1,node2path96) - currentNode*(min(1, node2path96) - 1))) &  (currentPath'=(96 * min(1, node2path96) - currentPath*(min(1,node2path96) - 1))) & (success'=min(1, node2path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path97 * min(1,node2path97) - currentNode*(min(1, node2path97) - 1))) &  (currentPath'=(97 * min(1, node2path97) - currentPath*(min(1,node2path97) - 1))) & (success'=min(1, node2path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path98 * min(1,node2path98) - currentNode*(min(1, node2path98) - 1))) &  (currentPath'=(98 * min(1, node2path98) - currentPath*(min(1,node2path98) - 1))) & (success'=min(1, node2path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path99 * min(1,node2path99) - currentNode*(min(1, node2path99) - 1))) &  (currentPath'=(99 * min(1, node2path99) - currentPath*(min(1,node2path99) - 1))) & (success'=min(1, node2path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node2path100 * min(1,node2path100) - currentNode*(min(1, node2path100) - 1))) &  (currentPath'=(100 * min(1, node2path100) - currentPath*(min(1,node2path100) - 1))) & (success'=min(1, node2path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 3) ->
 numPathsInv: (currentNode'=(node3path1 * min(1,node3path1) - currentNode*(min(1, node3path1) - 1))) &  (currentPath'=(1 * min(1, node3path1) - currentPath*(min(1,node3path1) - 1))) & (success'=min(1, node3path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path2 * min(1,node3path2) - currentNode*(min(1, node3path2) - 1))) &  (currentPath'=(2 * min(1, node3path2) - currentPath*(min(1,node3path2) - 1))) & (success'=min(1, node3path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path3 * min(1,node3path3) - currentNode*(min(1, node3path3) - 1))) &  (currentPath'=(3 * min(1, node3path3) - currentPath*(min(1,node3path3) - 1))) & (success'=min(1, node3path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path4 * min(1,node3path4) - currentNode*(min(1, node3path4) - 1))) &  (currentPath'=(4 * min(1, node3path4) - currentPath*(min(1,node3path4) - 1))) & (success'=min(1, node3path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path5 * min(1,node3path5) - currentNode*(min(1, node3path5) - 1))) &  (currentPath'=(5 * min(1, node3path5) - currentPath*(min(1,node3path5) - 1))) & (success'=min(1, node3path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path6 * min(1,node3path6) - currentNode*(min(1, node3path6) - 1))) &  (currentPath'=(6 * min(1, node3path6) - currentPath*(min(1,node3path6) - 1))) & (success'=min(1, node3path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path7 * min(1,node3path7) - currentNode*(min(1, node3path7) - 1))) &  (currentPath'=(7 * min(1, node3path7) - currentPath*(min(1,node3path7) - 1))) & (success'=min(1, node3path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path8 * min(1,node3path8) - currentNode*(min(1, node3path8) - 1))) &  (currentPath'=(8 * min(1, node3path8) - currentPath*(min(1,node3path8) - 1))) & (success'=min(1, node3path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path9 * min(1,node3path9) - currentNode*(min(1, node3path9) - 1))) &  (currentPath'=(9 * min(1, node3path9) - currentPath*(min(1,node3path9) - 1))) & (success'=min(1, node3path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path10 * min(1,node3path10) - currentNode*(min(1, node3path10) - 1))) &  (currentPath'=(10 * min(1, node3path10) - currentPath*(min(1,node3path10) - 1))) & (success'=min(1, node3path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path11 * min(1,node3path11) - currentNode*(min(1, node3path11) - 1))) &  (currentPath'=(11 * min(1, node3path11) - currentPath*(min(1,node3path11) - 1))) & (success'=min(1, node3path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path12 * min(1,node3path12) - currentNode*(min(1, node3path12) - 1))) &  (currentPath'=(12 * min(1, node3path12) - currentPath*(min(1,node3path12) - 1))) & (success'=min(1, node3path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path13 * min(1,node3path13) - currentNode*(min(1, node3path13) - 1))) &  (currentPath'=(13 * min(1, node3path13) - currentPath*(min(1,node3path13) - 1))) & (success'=min(1, node3path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path14 * min(1,node3path14) - currentNode*(min(1, node3path14) - 1))) &  (currentPath'=(14 * min(1, node3path14) - currentPath*(min(1,node3path14) - 1))) & (success'=min(1, node3path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path15 * min(1,node3path15) - currentNode*(min(1, node3path15) - 1))) &  (currentPath'=(15 * min(1, node3path15) - currentPath*(min(1,node3path15) - 1))) & (success'=min(1, node3path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path16 * min(1,node3path16) - currentNode*(min(1, node3path16) - 1))) &  (currentPath'=(16 * min(1, node3path16) - currentPath*(min(1,node3path16) - 1))) & (success'=min(1, node3path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path17 * min(1,node3path17) - currentNode*(min(1, node3path17) - 1))) &  (currentPath'=(17 * min(1, node3path17) - currentPath*(min(1,node3path17) - 1))) & (success'=min(1, node3path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path18 * min(1,node3path18) - currentNode*(min(1, node3path18) - 1))) &  (currentPath'=(18 * min(1, node3path18) - currentPath*(min(1,node3path18) - 1))) & (success'=min(1, node3path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path19 * min(1,node3path19) - currentNode*(min(1, node3path19) - 1))) &  (currentPath'=(19 * min(1, node3path19) - currentPath*(min(1,node3path19) - 1))) & (success'=min(1, node3path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path20 * min(1,node3path20) - currentNode*(min(1, node3path20) - 1))) &  (currentPath'=(20 * min(1, node3path20) - currentPath*(min(1,node3path20) - 1))) & (success'=min(1, node3path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path21 * min(1,node3path21) - currentNode*(min(1, node3path21) - 1))) &  (currentPath'=(21 * min(1, node3path21) - currentPath*(min(1,node3path21) - 1))) & (success'=min(1, node3path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path22 * min(1,node3path22) - currentNode*(min(1, node3path22) - 1))) &  (currentPath'=(22 * min(1, node3path22) - currentPath*(min(1,node3path22) - 1))) & (success'=min(1, node3path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path23 * min(1,node3path23) - currentNode*(min(1, node3path23) - 1))) &  (currentPath'=(23 * min(1, node3path23) - currentPath*(min(1,node3path23) - 1))) & (success'=min(1, node3path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path24 * min(1,node3path24) - currentNode*(min(1, node3path24) - 1))) &  (currentPath'=(24 * min(1, node3path24) - currentPath*(min(1,node3path24) - 1))) & (success'=min(1, node3path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path25 * min(1,node3path25) - currentNode*(min(1, node3path25) - 1))) &  (currentPath'=(25 * min(1, node3path25) - currentPath*(min(1,node3path25) - 1))) & (success'=min(1, node3path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path26 * min(1,node3path26) - currentNode*(min(1, node3path26) - 1))) &  (currentPath'=(26 * min(1, node3path26) - currentPath*(min(1,node3path26) - 1))) & (success'=min(1, node3path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path27 * min(1,node3path27) - currentNode*(min(1, node3path27) - 1))) &  (currentPath'=(27 * min(1, node3path27) - currentPath*(min(1,node3path27) - 1))) & (success'=min(1, node3path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path28 * min(1,node3path28) - currentNode*(min(1, node3path28) - 1))) &  (currentPath'=(28 * min(1, node3path28) - currentPath*(min(1,node3path28) - 1))) & (success'=min(1, node3path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path29 * min(1,node3path29) - currentNode*(min(1, node3path29) - 1))) &  (currentPath'=(29 * min(1, node3path29) - currentPath*(min(1,node3path29) - 1))) & (success'=min(1, node3path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path30 * min(1,node3path30) - currentNode*(min(1, node3path30) - 1))) &  (currentPath'=(30 * min(1, node3path30) - currentPath*(min(1,node3path30) - 1))) & (success'=min(1, node3path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path31 * min(1,node3path31) - currentNode*(min(1, node3path31) - 1))) &  (currentPath'=(31 * min(1, node3path31) - currentPath*(min(1,node3path31) - 1))) & (success'=min(1, node3path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path32 * min(1,node3path32) - currentNode*(min(1, node3path32) - 1))) &  (currentPath'=(32 * min(1, node3path32) - currentPath*(min(1,node3path32) - 1))) & (success'=min(1, node3path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path33 * min(1,node3path33) - currentNode*(min(1, node3path33) - 1))) &  (currentPath'=(33 * min(1, node3path33) - currentPath*(min(1,node3path33) - 1))) & (success'=min(1, node3path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path34 * min(1,node3path34) - currentNode*(min(1, node3path34) - 1))) &  (currentPath'=(34 * min(1, node3path34) - currentPath*(min(1,node3path34) - 1))) & (success'=min(1, node3path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path35 * min(1,node3path35) - currentNode*(min(1, node3path35) - 1))) &  (currentPath'=(35 * min(1, node3path35) - currentPath*(min(1,node3path35) - 1))) & (success'=min(1, node3path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path36 * min(1,node3path36) - currentNode*(min(1, node3path36) - 1))) &  (currentPath'=(36 * min(1, node3path36) - currentPath*(min(1,node3path36) - 1))) & (success'=min(1, node3path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path37 * min(1,node3path37) - currentNode*(min(1, node3path37) - 1))) &  (currentPath'=(37 * min(1, node3path37) - currentPath*(min(1,node3path37) - 1))) & (success'=min(1, node3path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path38 * min(1,node3path38) - currentNode*(min(1, node3path38) - 1))) &  (currentPath'=(38 * min(1, node3path38) - currentPath*(min(1,node3path38) - 1))) & (success'=min(1, node3path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path39 * min(1,node3path39) - currentNode*(min(1, node3path39) - 1))) &  (currentPath'=(39 * min(1, node3path39) - currentPath*(min(1,node3path39) - 1))) & (success'=min(1, node3path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path40 * min(1,node3path40) - currentNode*(min(1, node3path40) - 1))) &  (currentPath'=(40 * min(1, node3path40) - currentPath*(min(1,node3path40) - 1))) & (success'=min(1, node3path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path41 * min(1,node3path41) - currentNode*(min(1, node3path41) - 1))) &  (currentPath'=(41 * min(1, node3path41) - currentPath*(min(1,node3path41) - 1))) & (success'=min(1, node3path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path42 * min(1,node3path42) - currentNode*(min(1, node3path42) - 1))) &  (currentPath'=(42 * min(1, node3path42) - currentPath*(min(1,node3path42) - 1))) & (success'=min(1, node3path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path43 * min(1,node3path43) - currentNode*(min(1, node3path43) - 1))) &  (currentPath'=(43 * min(1, node3path43) - currentPath*(min(1,node3path43) - 1))) & (success'=min(1, node3path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path44 * min(1,node3path44) - currentNode*(min(1, node3path44) - 1))) &  (currentPath'=(44 * min(1, node3path44) - currentPath*(min(1,node3path44) - 1))) & (success'=min(1, node3path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path45 * min(1,node3path45) - currentNode*(min(1, node3path45) - 1))) &  (currentPath'=(45 * min(1, node3path45) - currentPath*(min(1,node3path45) - 1))) & (success'=min(1, node3path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path46 * min(1,node3path46) - currentNode*(min(1, node3path46) - 1))) &  (currentPath'=(46 * min(1, node3path46) - currentPath*(min(1,node3path46) - 1))) & (success'=min(1, node3path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path47 * min(1,node3path47) - currentNode*(min(1, node3path47) - 1))) &  (currentPath'=(47 * min(1, node3path47) - currentPath*(min(1,node3path47) - 1))) & (success'=min(1, node3path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path48 * min(1,node3path48) - currentNode*(min(1, node3path48) - 1))) &  (currentPath'=(48 * min(1, node3path48) - currentPath*(min(1,node3path48) - 1))) & (success'=min(1, node3path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path49 * min(1,node3path49) - currentNode*(min(1, node3path49) - 1))) &  (currentPath'=(49 * min(1, node3path49) - currentPath*(min(1,node3path49) - 1))) & (success'=min(1, node3path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path50 * min(1,node3path50) - currentNode*(min(1, node3path50) - 1))) &  (currentPath'=(50 * min(1, node3path50) - currentPath*(min(1,node3path50) - 1))) & (success'=min(1, node3path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path51 * min(1,node3path51) - currentNode*(min(1, node3path51) - 1))) &  (currentPath'=(51 * min(1, node3path51) - currentPath*(min(1,node3path51) - 1))) & (success'=min(1, node3path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path52 * min(1,node3path52) - currentNode*(min(1, node3path52) - 1))) &  (currentPath'=(52 * min(1, node3path52) - currentPath*(min(1,node3path52) - 1))) & (success'=min(1, node3path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path53 * min(1,node3path53) - currentNode*(min(1, node3path53) - 1))) &  (currentPath'=(53 * min(1, node3path53) - currentPath*(min(1,node3path53) - 1))) & (success'=min(1, node3path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path54 * min(1,node3path54) - currentNode*(min(1, node3path54) - 1))) &  (currentPath'=(54 * min(1, node3path54) - currentPath*(min(1,node3path54) - 1))) & (success'=min(1, node3path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path55 * min(1,node3path55) - currentNode*(min(1, node3path55) - 1))) &  (currentPath'=(55 * min(1, node3path55) - currentPath*(min(1,node3path55) - 1))) & (success'=min(1, node3path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path56 * min(1,node3path56) - currentNode*(min(1, node3path56) - 1))) &  (currentPath'=(56 * min(1, node3path56) - currentPath*(min(1,node3path56) - 1))) & (success'=min(1, node3path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path57 * min(1,node3path57) - currentNode*(min(1, node3path57) - 1))) &  (currentPath'=(57 * min(1, node3path57) - currentPath*(min(1,node3path57) - 1))) & (success'=min(1, node3path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path58 * min(1,node3path58) - currentNode*(min(1, node3path58) - 1))) &  (currentPath'=(58 * min(1, node3path58) - currentPath*(min(1,node3path58) - 1))) & (success'=min(1, node3path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path59 * min(1,node3path59) - currentNode*(min(1, node3path59) - 1))) &  (currentPath'=(59 * min(1, node3path59) - currentPath*(min(1,node3path59) - 1))) & (success'=min(1, node3path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path60 * min(1,node3path60) - currentNode*(min(1, node3path60) - 1))) &  (currentPath'=(60 * min(1, node3path60) - currentPath*(min(1,node3path60) - 1))) & (success'=min(1, node3path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path61 * min(1,node3path61) - currentNode*(min(1, node3path61) - 1))) &  (currentPath'=(61 * min(1, node3path61) - currentPath*(min(1,node3path61) - 1))) & (success'=min(1, node3path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path62 * min(1,node3path62) - currentNode*(min(1, node3path62) - 1))) &  (currentPath'=(62 * min(1, node3path62) - currentPath*(min(1,node3path62) - 1))) & (success'=min(1, node3path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path63 * min(1,node3path63) - currentNode*(min(1, node3path63) - 1))) &  (currentPath'=(63 * min(1, node3path63) - currentPath*(min(1,node3path63) - 1))) & (success'=min(1, node3path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path64 * min(1,node3path64) - currentNode*(min(1, node3path64) - 1))) &  (currentPath'=(64 * min(1, node3path64) - currentPath*(min(1,node3path64) - 1))) & (success'=min(1, node3path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path65 * min(1,node3path65) - currentNode*(min(1, node3path65) - 1))) &  (currentPath'=(65 * min(1, node3path65) - currentPath*(min(1,node3path65) - 1))) & (success'=min(1, node3path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path66 * min(1,node3path66) - currentNode*(min(1, node3path66) - 1))) &  (currentPath'=(66 * min(1, node3path66) - currentPath*(min(1,node3path66) - 1))) & (success'=min(1, node3path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path67 * min(1,node3path67) - currentNode*(min(1, node3path67) - 1))) &  (currentPath'=(67 * min(1, node3path67) - currentPath*(min(1,node3path67) - 1))) & (success'=min(1, node3path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path68 * min(1,node3path68) - currentNode*(min(1, node3path68) - 1))) &  (currentPath'=(68 * min(1, node3path68) - currentPath*(min(1,node3path68) - 1))) & (success'=min(1, node3path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path69 * min(1,node3path69) - currentNode*(min(1, node3path69) - 1))) &  (currentPath'=(69 * min(1, node3path69) - currentPath*(min(1,node3path69) - 1))) & (success'=min(1, node3path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path70 * min(1,node3path70) - currentNode*(min(1, node3path70) - 1))) &  (currentPath'=(70 * min(1, node3path70) - currentPath*(min(1,node3path70) - 1))) & (success'=min(1, node3path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path71 * min(1,node3path71) - currentNode*(min(1, node3path71) - 1))) &  (currentPath'=(71 * min(1, node3path71) - currentPath*(min(1,node3path71) - 1))) & (success'=min(1, node3path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path72 * min(1,node3path72) - currentNode*(min(1, node3path72) - 1))) &  (currentPath'=(72 * min(1, node3path72) - currentPath*(min(1,node3path72) - 1))) & (success'=min(1, node3path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path73 * min(1,node3path73) - currentNode*(min(1, node3path73) - 1))) &  (currentPath'=(73 * min(1, node3path73) - currentPath*(min(1,node3path73) - 1))) & (success'=min(1, node3path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path74 * min(1,node3path74) - currentNode*(min(1, node3path74) - 1))) &  (currentPath'=(74 * min(1, node3path74) - currentPath*(min(1,node3path74) - 1))) & (success'=min(1, node3path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path75 * min(1,node3path75) - currentNode*(min(1, node3path75) - 1))) &  (currentPath'=(75 * min(1, node3path75) - currentPath*(min(1,node3path75) - 1))) & (success'=min(1, node3path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path76 * min(1,node3path76) - currentNode*(min(1, node3path76) - 1))) &  (currentPath'=(76 * min(1, node3path76) - currentPath*(min(1,node3path76) - 1))) & (success'=min(1, node3path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path77 * min(1,node3path77) - currentNode*(min(1, node3path77) - 1))) &  (currentPath'=(77 * min(1, node3path77) - currentPath*(min(1,node3path77) - 1))) & (success'=min(1, node3path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path78 * min(1,node3path78) - currentNode*(min(1, node3path78) - 1))) &  (currentPath'=(78 * min(1, node3path78) - currentPath*(min(1,node3path78) - 1))) & (success'=min(1, node3path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path79 * min(1,node3path79) - currentNode*(min(1, node3path79) - 1))) &  (currentPath'=(79 * min(1, node3path79) - currentPath*(min(1,node3path79) - 1))) & (success'=min(1, node3path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path80 * min(1,node3path80) - currentNode*(min(1, node3path80) - 1))) &  (currentPath'=(80 * min(1, node3path80) - currentPath*(min(1,node3path80) - 1))) & (success'=min(1, node3path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path81 * min(1,node3path81) - currentNode*(min(1, node3path81) - 1))) &  (currentPath'=(81 * min(1, node3path81) - currentPath*(min(1,node3path81) - 1))) & (success'=min(1, node3path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path82 * min(1,node3path82) - currentNode*(min(1, node3path82) - 1))) &  (currentPath'=(82 * min(1, node3path82) - currentPath*(min(1,node3path82) - 1))) & (success'=min(1, node3path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path83 * min(1,node3path83) - currentNode*(min(1, node3path83) - 1))) &  (currentPath'=(83 * min(1, node3path83) - currentPath*(min(1,node3path83) - 1))) & (success'=min(1, node3path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path84 * min(1,node3path84) - currentNode*(min(1, node3path84) - 1))) &  (currentPath'=(84 * min(1, node3path84) - currentPath*(min(1,node3path84) - 1))) & (success'=min(1, node3path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path85 * min(1,node3path85) - currentNode*(min(1, node3path85) - 1))) &  (currentPath'=(85 * min(1, node3path85) - currentPath*(min(1,node3path85) - 1))) & (success'=min(1, node3path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path86 * min(1,node3path86) - currentNode*(min(1, node3path86) - 1))) &  (currentPath'=(86 * min(1, node3path86) - currentPath*(min(1,node3path86) - 1))) & (success'=min(1, node3path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path87 * min(1,node3path87) - currentNode*(min(1, node3path87) - 1))) &  (currentPath'=(87 * min(1, node3path87) - currentPath*(min(1,node3path87) - 1))) & (success'=min(1, node3path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path88 * min(1,node3path88) - currentNode*(min(1, node3path88) - 1))) &  (currentPath'=(88 * min(1, node3path88) - currentPath*(min(1,node3path88) - 1))) & (success'=min(1, node3path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path89 * min(1,node3path89) - currentNode*(min(1, node3path89) - 1))) &  (currentPath'=(89 * min(1, node3path89) - currentPath*(min(1,node3path89) - 1))) & (success'=min(1, node3path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path90 * min(1,node3path90) - currentNode*(min(1, node3path90) - 1))) &  (currentPath'=(90 * min(1, node3path90) - currentPath*(min(1,node3path90) - 1))) & (success'=min(1, node3path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path91 * min(1,node3path91) - currentNode*(min(1, node3path91) - 1))) &  (currentPath'=(91 * min(1, node3path91) - currentPath*(min(1,node3path91) - 1))) & (success'=min(1, node3path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path92 * min(1,node3path92) - currentNode*(min(1, node3path92) - 1))) &  (currentPath'=(92 * min(1, node3path92) - currentPath*(min(1,node3path92) - 1))) & (success'=min(1, node3path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path93 * min(1,node3path93) - currentNode*(min(1, node3path93) - 1))) &  (currentPath'=(93 * min(1, node3path93) - currentPath*(min(1,node3path93) - 1))) & (success'=min(1, node3path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path94 * min(1,node3path94) - currentNode*(min(1, node3path94) - 1))) &  (currentPath'=(94 * min(1, node3path94) - currentPath*(min(1,node3path94) - 1))) & (success'=min(1, node3path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path95 * min(1,node3path95) - currentNode*(min(1, node3path95) - 1))) &  (currentPath'=(95 * min(1, node3path95) - currentPath*(min(1,node3path95) - 1))) & (success'=min(1, node3path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path96 * min(1,node3path96) - currentNode*(min(1, node3path96) - 1))) &  (currentPath'=(96 * min(1, node3path96) - currentPath*(min(1,node3path96) - 1))) & (success'=min(1, node3path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path97 * min(1,node3path97) - currentNode*(min(1, node3path97) - 1))) &  (currentPath'=(97 * min(1, node3path97) - currentPath*(min(1,node3path97) - 1))) & (success'=min(1, node3path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path98 * min(1,node3path98) - currentNode*(min(1, node3path98) - 1))) &  (currentPath'=(98 * min(1, node3path98) - currentPath*(min(1,node3path98) - 1))) & (success'=min(1, node3path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path99 * min(1,node3path99) - currentNode*(min(1, node3path99) - 1))) &  (currentPath'=(99 * min(1, node3path99) - currentPath*(min(1,node3path99) - 1))) & (success'=min(1, node3path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node3path100 * min(1,node3path100) - currentNode*(min(1, node3path100) - 1))) &  (currentPath'=(100 * min(1, node3path100) - currentPath*(min(1,node3path100) - 1))) & (success'=min(1, node3path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 4) ->
 numPathsInv: (currentNode'=(node4path1 * min(1,node4path1) - currentNode*(min(1, node4path1) - 1))) &  (currentPath'=(1 * min(1, node4path1) - currentPath*(min(1,node4path1) - 1))) & (success'=min(1, node4path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path2 * min(1,node4path2) - currentNode*(min(1, node4path2) - 1))) &  (currentPath'=(2 * min(1, node4path2) - currentPath*(min(1,node4path2) - 1))) & (success'=min(1, node4path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path3 * min(1,node4path3) - currentNode*(min(1, node4path3) - 1))) &  (currentPath'=(3 * min(1, node4path3) - currentPath*(min(1,node4path3) - 1))) & (success'=min(1, node4path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path4 * min(1,node4path4) - currentNode*(min(1, node4path4) - 1))) &  (currentPath'=(4 * min(1, node4path4) - currentPath*(min(1,node4path4) - 1))) & (success'=min(1, node4path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path5 * min(1,node4path5) - currentNode*(min(1, node4path5) - 1))) &  (currentPath'=(5 * min(1, node4path5) - currentPath*(min(1,node4path5) - 1))) & (success'=min(1, node4path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path6 * min(1,node4path6) - currentNode*(min(1, node4path6) - 1))) &  (currentPath'=(6 * min(1, node4path6) - currentPath*(min(1,node4path6) - 1))) & (success'=min(1, node4path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path7 * min(1,node4path7) - currentNode*(min(1, node4path7) - 1))) &  (currentPath'=(7 * min(1, node4path7) - currentPath*(min(1,node4path7) - 1))) & (success'=min(1, node4path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path8 * min(1,node4path8) - currentNode*(min(1, node4path8) - 1))) &  (currentPath'=(8 * min(1, node4path8) - currentPath*(min(1,node4path8) - 1))) & (success'=min(1, node4path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path9 * min(1,node4path9) - currentNode*(min(1, node4path9) - 1))) &  (currentPath'=(9 * min(1, node4path9) - currentPath*(min(1,node4path9) - 1))) & (success'=min(1, node4path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path10 * min(1,node4path10) - currentNode*(min(1, node4path10) - 1))) &  (currentPath'=(10 * min(1, node4path10) - currentPath*(min(1,node4path10) - 1))) & (success'=min(1, node4path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path11 * min(1,node4path11) - currentNode*(min(1, node4path11) - 1))) &  (currentPath'=(11 * min(1, node4path11) - currentPath*(min(1,node4path11) - 1))) & (success'=min(1, node4path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path12 * min(1,node4path12) - currentNode*(min(1, node4path12) - 1))) &  (currentPath'=(12 * min(1, node4path12) - currentPath*(min(1,node4path12) - 1))) & (success'=min(1, node4path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path13 * min(1,node4path13) - currentNode*(min(1, node4path13) - 1))) &  (currentPath'=(13 * min(1, node4path13) - currentPath*(min(1,node4path13) - 1))) & (success'=min(1, node4path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path14 * min(1,node4path14) - currentNode*(min(1, node4path14) - 1))) &  (currentPath'=(14 * min(1, node4path14) - currentPath*(min(1,node4path14) - 1))) & (success'=min(1, node4path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path15 * min(1,node4path15) - currentNode*(min(1, node4path15) - 1))) &  (currentPath'=(15 * min(1, node4path15) - currentPath*(min(1,node4path15) - 1))) & (success'=min(1, node4path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path16 * min(1,node4path16) - currentNode*(min(1, node4path16) - 1))) &  (currentPath'=(16 * min(1, node4path16) - currentPath*(min(1,node4path16) - 1))) & (success'=min(1, node4path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path17 * min(1,node4path17) - currentNode*(min(1, node4path17) - 1))) &  (currentPath'=(17 * min(1, node4path17) - currentPath*(min(1,node4path17) - 1))) & (success'=min(1, node4path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path18 * min(1,node4path18) - currentNode*(min(1, node4path18) - 1))) &  (currentPath'=(18 * min(1, node4path18) - currentPath*(min(1,node4path18) - 1))) & (success'=min(1, node4path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path19 * min(1,node4path19) - currentNode*(min(1, node4path19) - 1))) &  (currentPath'=(19 * min(1, node4path19) - currentPath*(min(1,node4path19) - 1))) & (success'=min(1, node4path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path20 * min(1,node4path20) - currentNode*(min(1, node4path20) - 1))) &  (currentPath'=(20 * min(1, node4path20) - currentPath*(min(1,node4path20) - 1))) & (success'=min(1, node4path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path21 * min(1,node4path21) - currentNode*(min(1, node4path21) - 1))) &  (currentPath'=(21 * min(1, node4path21) - currentPath*(min(1,node4path21) - 1))) & (success'=min(1, node4path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path22 * min(1,node4path22) - currentNode*(min(1, node4path22) - 1))) &  (currentPath'=(22 * min(1, node4path22) - currentPath*(min(1,node4path22) - 1))) & (success'=min(1, node4path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path23 * min(1,node4path23) - currentNode*(min(1, node4path23) - 1))) &  (currentPath'=(23 * min(1, node4path23) - currentPath*(min(1,node4path23) - 1))) & (success'=min(1, node4path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path24 * min(1,node4path24) - currentNode*(min(1, node4path24) - 1))) &  (currentPath'=(24 * min(1, node4path24) - currentPath*(min(1,node4path24) - 1))) & (success'=min(1, node4path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path25 * min(1,node4path25) - currentNode*(min(1, node4path25) - 1))) &  (currentPath'=(25 * min(1, node4path25) - currentPath*(min(1,node4path25) - 1))) & (success'=min(1, node4path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path26 * min(1,node4path26) - currentNode*(min(1, node4path26) - 1))) &  (currentPath'=(26 * min(1, node4path26) - currentPath*(min(1,node4path26) - 1))) & (success'=min(1, node4path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path27 * min(1,node4path27) - currentNode*(min(1, node4path27) - 1))) &  (currentPath'=(27 * min(1, node4path27) - currentPath*(min(1,node4path27) - 1))) & (success'=min(1, node4path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path28 * min(1,node4path28) - currentNode*(min(1, node4path28) - 1))) &  (currentPath'=(28 * min(1, node4path28) - currentPath*(min(1,node4path28) - 1))) & (success'=min(1, node4path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path29 * min(1,node4path29) - currentNode*(min(1, node4path29) - 1))) &  (currentPath'=(29 * min(1, node4path29) - currentPath*(min(1,node4path29) - 1))) & (success'=min(1, node4path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path30 * min(1,node4path30) - currentNode*(min(1, node4path30) - 1))) &  (currentPath'=(30 * min(1, node4path30) - currentPath*(min(1,node4path30) - 1))) & (success'=min(1, node4path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path31 * min(1,node4path31) - currentNode*(min(1, node4path31) - 1))) &  (currentPath'=(31 * min(1, node4path31) - currentPath*(min(1,node4path31) - 1))) & (success'=min(1, node4path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path32 * min(1,node4path32) - currentNode*(min(1, node4path32) - 1))) &  (currentPath'=(32 * min(1, node4path32) - currentPath*(min(1,node4path32) - 1))) & (success'=min(1, node4path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path33 * min(1,node4path33) - currentNode*(min(1, node4path33) - 1))) &  (currentPath'=(33 * min(1, node4path33) - currentPath*(min(1,node4path33) - 1))) & (success'=min(1, node4path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path34 * min(1,node4path34) - currentNode*(min(1, node4path34) - 1))) &  (currentPath'=(34 * min(1, node4path34) - currentPath*(min(1,node4path34) - 1))) & (success'=min(1, node4path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path35 * min(1,node4path35) - currentNode*(min(1, node4path35) - 1))) &  (currentPath'=(35 * min(1, node4path35) - currentPath*(min(1,node4path35) - 1))) & (success'=min(1, node4path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path36 * min(1,node4path36) - currentNode*(min(1, node4path36) - 1))) &  (currentPath'=(36 * min(1, node4path36) - currentPath*(min(1,node4path36) - 1))) & (success'=min(1, node4path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path37 * min(1,node4path37) - currentNode*(min(1, node4path37) - 1))) &  (currentPath'=(37 * min(1, node4path37) - currentPath*(min(1,node4path37) - 1))) & (success'=min(1, node4path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path38 * min(1,node4path38) - currentNode*(min(1, node4path38) - 1))) &  (currentPath'=(38 * min(1, node4path38) - currentPath*(min(1,node4path38) - 1))) & (success'=min(1, node4path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path39 * min(1,node4path39) - currentNode*(min(1, node4path39) - 1))) &  (currentPath'=(39 * min(1, node4path39) - currentPath*(min(1,node4path39) - 1))) & (success'=min(1, node4path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path40 * min(1,node4path40) - currentNode*(min(1, node4path40) - 1))) &  (currentPath'=(40 * min(1, node4path40) - currentPath*(min(1,node4path40) - 1))) & (success'=min(1, node4path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path41 * min(1,node4path41) - currentNode*(min(1, node4path41) - 1))) &  (currentPath'=(41 * min(1, node4path41) - currentPath*(min(1,node4path41) - 1))) & (success'=min(1, node4path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path42 * min(1,node4path42) - currentNode*(min(1, node4path42) - 1))) &  (currentPath'=(42 * min(1, node4path42) - currentPath*(min(1,node4path42) - 1))) & (success'=min(1, node4path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path43 * min(1,node4path43) - currentNode*(min(1, node4path43) - 1))) &  (currentPath'=(43 * min(1, node4path43) - currentPath*(min(1,node4path43) - 1))) & (success'=min(1, node4path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path44 * min(1,node4path44) - currentNode*(min(1, node4path44) - 1))) &  (currentPath'=(44 * min(1, node4path44) - currentPath*(min(1,node4path44) - 1))) & (success'=min(1, node4path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path45 * min(1,node4path45) - currentNode*(min(1, node4path45) - 1))) &  (currentPath'=(45 * min(1, node4path45) - currentPath*(min(1,node4path45) - 1))) & (success'=min(1, node4path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path46 * min(1,node4path46) - currentNode*(min(1, node4path46) - 1))) &  (currentPath'=(46 * min(1, node4path46) - currentPath*(min(1,node4path46) - 1))) & (success'=min(1, node4path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path47 * min(1,node4path47) - currentNode*(min(1, node4path47) - 1))) &  (currentPath'=(47 * min(1, node4path47) - currentPath*(min(1,node4path47) - 1))) & (success'=min(1, node4path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path48 * min(1,node4path48) - currentNode*(min(1, node4path48) - 1))) &  (currentPath'=(48 * min(1, node4path48) - currentPath*(min(1,node4path48) - 1))) & (success'=min(1, node4path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path49 * min(1,node4path49) - currentNode*(min(1, node4path49) - 1))) &  (currentPath'=(49 * min(1, node4path49) - currentPath*(min(1,node4path49) - 1))) & (success'=min(1, node4path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path50 * min(1,node4path50) - currentNode*(min(1, node4path50) - 1))) &  (currentPath'=(50 * min(1, node4path50) - currentPath*(min(1,node4path50) - 1))) & (success'=min(1, node4path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path51 * min(1,node4path51) - currentNode*(min(1, node4path51) - 1))) &  (currentPath'=(51 * min(1, node4path51) - currentPath*(min(1,node4path51) - 1))) & (success'=min(1, node4path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path52 * min(1,node4path52) - currentNode*(min(1, node4path52) - 1))) &  (currentPath'=(52 * min(1, node4path52) - currentPath*(min(1,node4path52) - 1))) & (success'=min(1, node4path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path53 * min(1,node4path53) - currentNode*(min(1, node4path53) - 1))) &  (currentPath'=(53 * min(1, node4path53) - currentPath*(min(1,node4path53) - 1))) & (success'=min(1, node4path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path54 * min(1,node4path54) - currentNode*(min(1, node4path54) - 1))) &  (currentPath'=(54 * min(1, node4path54) - currentPath*(min(1,node4path54) - 1))) & (success'=min(1, node4path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path55 * min(1,node4path55) - currentNode*(min(1, node4path55) - 1))) &  (currentPath'=(55 * min(1, node4path55) - currentPath*(min(1,node4path55) - 1))) & (success'=min(1, node4path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path56 * min(1,node4path56) - currentNode*(min(1, node4path56) - 1))) &  (currentPath'=(56 * min(1, node4path56) - currentPath*(min(1,node4path56) - 1))) & (success'=min(1, node4path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path57 * min(1,node4path57) - currentNode*(min(1, node4path57) - 1))) &  (currentPath'=(57 * min(1, node4path57) - currentPath*(min(1,node4path57) - 1))) & (success'=min(1, node4path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path58 * min(1,node4path58) - currentNode*(min(1, node4path58) - 1))) &  (currentPath'=(58 * min(1, node4path58) - currentPath*(min(1,node4path58) - 1))) & (success'=min(1, node4path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path59 * min(1,node4path59) - currentNode*(min(1, node4path59) - 1))) &  (currentPath'=(59 * min(1, node4path59) - currentPath*(min(1,node4path59) - 1))) & (success'=min(1, node4path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path60 * min(1,node4path60) - currentNode*(min(1, node4path60) - 1))) &  (currentPath'=(60 * min(1, node4path60) - currentPath*(min(1,node4path60) - 1))) & (success'=min(1, node4path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path61 * min(1,node4path61) - currentNode*(min(1, node4path61) - 1))) &  (currentPath'=(61 * min(1, node4path61) - currentPath*(min(1,node4path61) - 1))) & (success'=min(1, node4path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path62 * min(1,node4path62) - currentNode*(min(1, node4path62) - 1))) &  (currentPath'=(62 * min(1, node4path62) - currentPath*(min(1,node4path62) - 1))) & (success'=min(1, node4path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path63 * min(1,node4path63) - currentNode*(min(1, node4path63) - 1))) &  (currentPath'=(63 * min(1, node4path63) - currentPath*(min(1,node4path63) - 1))) & (success'=min(1, node4path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path64 * min(1,node4path64) - currentNode*(min(1, node4path64) - 1))) &  (currentPath'=(64 * min(1, node4path64) - currentPath*(min(1,node4path64) - 1))) & (success'=min(1, node4path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path65 * min(1,node4path65) - currentNode*(min(1, node4path65) - 1))) &  (currentPath'=(65 * min(1, node4path65) - currentPath*(min(1,node4path65) - 1))) & (success'=min(1, node4path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path66 * min(1,node4path66) - currentNode*(min(1, node4path66) - 1))) &  (currentPath'=(66 * min(1, node4path66) - currentPath*(min(1,node4path66) - 1))) & (success'=min(1, node4path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path67 * min(1,node4path67) - currentNode*(min(1, node4path67) - 1))) &  (currentPath'=(67 * min(1, node4path67) - currentPath*(min(1,node4path67) - 1))) & (success'=min(1, node4path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path68 * min(1,node4path68) - currentNode*(min(1, node4path68) - 1))) &  (currentPath'=(68 * min(1, node4path68) - currentPath*(min(1,node4path68) - 1))) & (success'=min(1, node4path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path69 * min(1,node4path69) - currentNode*(min(1, node4path69) - 1))) &  (currentPath'=(69 * min(1, node4path69) - currentPath*(min(1,node4path69) - 1))) & (success'=min(1, node4path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path70 * min(1,node4path70) - currentNode*(min(1, node4path70) - 1))) &  (currentPath'=(70 * min(1, node4path70) - currentPath*(min(1,node4path70) - 1))) & (success'=min(1, node4path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path71 * min(1,node4path71) - currentNode*(min(1, node4path71) - 1))) &  (currentPath'=(71 * min(1, node4path71) - currentPath*(min(1,node4path71) - 1))) & (success'=min(1, node4path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path72 * min(1,node4path72) - currentNode*(min(1, node4path72) - 1))) &  (currentPath'=(72 * min(1, node4path72) - currentPath*(min(1,node4path72) - 1))) & (success'=min(1, node4path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path73 * min(1,node4path73) - currentNode*(min(1, node4path73) - 1))) &  (currentPath'=(73 * min(1, node4path73) - currentPath*(min(1,node4path73) - 1))) & (success'=min(1, node4path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path74 * min(1,node4path74) - currentNode*(min(1, node4path74) - 1))) &  (currentPath'=(74 * min(1, node4path74) - currentPath*(min(1,node4path74) - 1))) & (success'=min(1, node4path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path75 * min(1,node4path75) - currentNode*(min(1, node4path75) - 1))) &  (currentPath'=(75 * min(1, node4path75) - currentPath*(min(1,node4path75) - 1))) & (success'=min(1, node4path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path76 * min(1,node4path76) - currentNode*(min(1, node4path76) - 1))) &  (currentPath'=(76 * min(1, node4path76) - currentPath*(min(1,node4path76) - 1))) & (success'=min(1, node4path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path77 * min(1,node4path77) - currentNode*(min(1, node4path77) - 1))) &  (currentPath'=(77 * min(1, node4path77) - currentPath*(min(1,node4path77) - 1))) & (success'=min(1, node4path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path78 * min(1,node4path78) - currentNode*(min(1, node4path78) - 1))) &  (currentPath'=(78 * min(1, node4path78) - currentPath*(min(1,node4path78) - 1))) & (success'=min(1, node4path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path79 * min(1,node4path79) - currentNode*(min(1, node4path79) - 1))) &  (currentPath'=(79 * min(1, node4path79) - currentPath*(min(1,node4path79) - 1))) & (success'=min(1, node4path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path80 * min(1,node4path80) - currentNode*(min(1, node4path80) - 1))) &  (currentPath'=(80 * min(1, node4path80) - currentPath*(min(1,node4path80) - 1))) & (success'=min(1, node4path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path81 * min(1,node4path81) - currentNode*(min(1, node4path81) - 1))) &  (currentPath'=(81 * min(1, node4path81) - currentPath*(min(1,node4path81) - 1))) & (success'=min(1, node4path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path82 * min(1,node4path82) - currentNode*(min(1, node4path82) - 1))) &  (currentPath'=(82 * min(1, node4path82) - currentPath*(min(1,node4path82) - 1))) & (success'=min(1, node4path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path83 * min(1,node4path83) - currentNode*(min(1, node4path83) - 1))) &  (currentPath'=(83 * min(1, node4path83) - currentPath*(min(1,node4path83) - 1))) & (success'=min(1, node4path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path84 * min(1,node4path84) - currentNode*(min(1, node4path84) - 1))) &  (currentPath'=(84 * min(1, node4path84) - currentPath*(min(1,node4path84) - 1))) & (success'=min(1, node4path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path85 * min(1,node4path85) - currentNode*(min(1, node4path85) - 1))) &  (currentPath'=(85 * min(1, node4path85) - currentPath*(min(1,node4path85) - 1))) & (success'=min(1, node4path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path86 * min(1,node4path86) - currentNode*(min(1, node4path86) - 1))) &  (currentPath'=(86 * min(1, node4path86) - currentPath*(min(1,node4path86) - 1))) & (success'=min(1, node4path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path87 * min(1,node4path87) - currentNode*(min(1, node4path87) - 1))) &  (currentPath'=(87 * min(1, node4path87) - currentPath*(min(1,node4path87) - 1))) & (success'=min(1, node4path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path88 * min(1,node4path88) - currentNode*(min(1, node4path88) - 1))) &  (currentPath'=(88 * min(1, node4path88) - currentPath*(min(1,node4path88) - 1))) & (success'=min(1, node4path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path89 * min(1,node4path89) - currentNode*(min(1, node4path89) - 1))) &  (currentPath'=(89 * min(1, node4path89) - currentPath*(min(1,node4path89) - 1))) & (success'=min(1, node4path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path90 * min(1,node4path90) - currentNode*(min(1, node4path90) - 1))) &  (currentPath'=(90 * min(1, node4path90) - currentPath*(min(1,node4path90) - 1))) & (success'=min(1, node4path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path91 * min(1,node4path91) - currentNode*(min(1, node4path91) - 1))) &  (currentPath'=(91 * min(1, node4path91) - currentPath*(min(1,node4path91) - 1))) & (success'=min(1, node4path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path92 * min(1,node4path92) - currentNode*(min(1, node4path92) - 1))) &  (currentPath'=(92 * min(1, node4path92) - currentPath*(min(1,node4path92) - 1))) & (success'=min(1, node4path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path93 * min(1,node4path93) - currentNode*(min(1, node4path93) - 1))) &  (currentPath'=(93 * min(1, node4path93) - currentPath*(min(1,node4path93) - 1))) & (success'=min(1, node4path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path94 * min(1,node4path94) - currentNode*(min(1, node4path94) - 1))) &  (currentPath'=(94 * min(1, node4path94) - currentPath*(min(1,node4path94) - 1))) & (success'=min(1, node4path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path95 * min(1,node4path95) - currentNode*(min(1, node4path95) - 1))) &  (currentPath'=(95 * min(1, node4path95) - currentPath*(min(1,node4path95) - 1))) & (success'=min(1, node4path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path96 * min(1,node4path96) - currentNode*(min(1, node4path96) - 1))) &  (currentPath'=(96 * min(1, node4path96) - currentPath*(min(1,node4path96) - 1))) & (success'=min(1, node4path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path97 * min(1,node4path97) - currentNode*(min(1, node4path97) - 1))) &  (currentPath'=(97 * min(1, node4path97) - currentPath*(min(1,node4path97) - 1))) & (success'=min(1, node4path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path98 * min(1,node4path98) - currentNode*(min(1, node4path98) - 1))) &  (currentPath'=(98 * min(1, node4path98) - currentPath*(min(1,node4path98) - 1))) & (success'=min(1, node4path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path99 * min(1,node4path99) - currentNode*(min(1, node4path99) - 1))) &  (currentPath'=(99 * min(1, node4path99) - currentPath*(min(1,node4path99) - 1))) & (success'=min(1, node4path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node4path100 * min(1,node4path100) - currentNode*(min(1, node4path100) - 1))) &  (currentPath'=(100 * min(1, node4path100) - currentPath*(min(1,node4path100) - 1))) & (success'=min(1, node4path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 5) ->
 numPathsInv: (currentNode'=(node5path1 * min(1,node5path1) - currentNode*(min(1, node5path1) - 1))) &  (currentPath'=(1 * min(1, node5path1) - currentPath*(min(1,node5path1) - 1))) & (success'=min(1, node5path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path2 * min(1,node5path2) - currentNode*(min(1, node5path2) - 1))) &  (currentPath'=(2 * min(1, node5path2) - currentPath*(min(1,node5path2) - 1))) & (success'=min(1, node5path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path3 * min(1,node5path3) - currentNode*(min(1, node5path3) - 1))) &  (currentPath'=(3 * min(1, node5path3) - currentPath*(min(1,node5path3) - 1))) & (success'=min(1, node5path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path4 * min(1,node5path4) - currentNode*(min(1, node5path4) - 1))) &  (currentPath'=(4 * min(1, node5path4) - currentPath*(min(1,node5path4) - 1))) & (success'=min(1, node5path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path5 * min(1,node5path5) - currentNode*(min(1, node5path5) - 1))) &  (currentPath'=(5 * min(1, node5path5) - currentPath*(min(1,node5path5) - 1))) & (success'=min(1, node5path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path6 * min(1,node5path6) - currentNode*(min(1, node5path6) - 1))) &  (currentPath'=(6 * min(1, node5path6) - currentPath*(min(1,node5path6) - 1))) & (success'=min(1, node5path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path7 * min(1,node5path7) - currentNode*(min(1, node5path7) - 1))) &  (currentPath'=(7 * min(1, node5path7) - currentPath*(min(1,node5path7) - 1))) & (success'=min(1, node5path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path8 * min(1,node5path8) - currentNode*(min(1, node5path8) - 1))) &  (currentPath'=(8 * min(1, node5path8) - currentPath*(min(1,node5path8) - 1))) & (success'=min(1, node5path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path9 * min(1,node5path9) - currentNode*(min(1, node5path9) - 1))) &  (currentPath'=(9 * min(1, node5path9) - currentPath*(min(1,node5path9) - 1))) & (success'=min(1, node5path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path10 * min(1,node5path10) - currentNode*(min(1, node5path10) - 1))) &  (currentPath'=(10 * min(1, node5path10) - currentPath*(min(1,node5path10) - 1))) & (success'=min(1, node5path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path11 * min(1,node5path11) - currentNode*(min(1, node5path11) - 1))) &  (currentPath'=(11 * min(1, node5path11) - currentPath*(min(1,node5path11) - 1))) & (success'=min(1, node5path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path12 * min(1,node5path12) - currentNode*(min(1, node5path12) - 1))) &  (currentPath'=(12 * min(1, node5path12) - currentPath*(min(1,node5path12) - 1))) & (success'=min(1, node5path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path13 * min(1,node5path13) - currentNode*(min(1, node5path13) - 1))) &  (currentPath'=(13 * min(1, node5path13) - currentPath*(min(1,node5path13) - 1))) & (success'=min(1, node5path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path14 * min(1,node5path14) - currentNode*(min(1, node5path14) - 1))) &  (currentPath'=(14 * min(1, node5path14) - currentPath*(min(1,node5path14) - 1))) & (success'=min(1, node5path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path15 * min(1,node5path15) - currentNode*(min(1, node5path15) - 1))) &  (currentPath'=(15 * min(1, node5path15) - currentPath*(min(1,node5path15) - 1))) & (success'=min(1, node5path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path16 * min(1,node5path16) - currentNode*(min(1, node5path16) - 1))) &  (currentPath'=(16 * min(1, node5path16) - currentPath*(min(1,node5path16) - 1))) & (success'=min(1, node5path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path17 * min(1,node5path17) - currentNode*(min(1, node5path17) - 1))) &  (currentPath'=(17 * min(1, node5path17) - currentPath*(min(1,node5path17) - 1))) & (success'=min(1, node5path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path18 * min(1,node5path18) - currentNode*(min(1, node5path18) - 1))) &  (currentPath'=(18 * min(1, node5path18) - currentPath*(min(1,node5path18) - 1))) & (success'=min(1, node5path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path19 * min(1,node5path19) - currentNode*(min(1, node5path19) - 1))) &  (currentPath'=(19 * min(1, node5path19) - currentPath*(min(1,node5path19) - 1))) & (success'=min(1, node5path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path20 * min(1,node5path20) - currentNode*(min(1, node5path20) - 1))) &  (currentPath'=(20 * min(1, node5path20) - currentPath*(min(1,node5path20) - 1))) & (success'=min(1, node5path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path21 * min(1,node5path21) - currentNode*(min(1, node5path21) - 1))) &  (currentPath'=(21 * min(1, node5path21) - currentPath*(min(1,node5path21) - 1))) & (success'=min(1, node5path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path22 * min(1,node5path22) - currentNode*(min(1, node5path22) - 1))) &  (currentPath'=(22 * min(1, node5path22) - currentPath*(min(1,node5path22) - 1))) & (success'=min(1, node5path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path23 * min(1,node5path23) - currentNode*(min(1, node5path23) - 1))) &  (currentPath'=(23 * min(1, node5path23) - currentPath*(min(1,node5path23) - 1))) & (success'=min(1, node5path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path24 * min(1,node5path24) - currentNode*(min(1, node5path24) - 1))) &  (currentPath'=(24 * min(1, node5path24) - currentPath*(min(1,node5path24) - 1))) & (success'=min(1, node5path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path25 * min(1,node5path25) - currentNode*(min(1, node5path25) - 1))) &  (currentPath'=(25 * min(1, node5path25) - currentPath*(min(1,node5path25) - 1))) & (success'=min(1, node5path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path26 * min(1,node5path26) - currentNode*(min(1, node5path26) - 1))) &  (currentPath'=(26 * min(1, node5path26) - currentPath*(min(1,node5path26) - 1))) & (success'=min(1, node5path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path27 * min(1,node5path27) - currentNode*(min(1, node5path27) - 1))) &  (currentPath'=(27 * min(1, node5path27) - currentPath*(min(1,node5path27) - 1))) & (success'=min(1, node5path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path28 * min(1,node5path28) - currentNode*(min(1, node5path28) - 1))) &  (currentPath'=(28 * min(1, node5path28) - currentPath*(min(1,node5path28) - 1))) & (success'=min(1, node5path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path29 * min(1,node5path29) - currentNode*(min(1, node5path29) - 1))) &  (currentPath'=(29 * min(1, node5path29) - currentPath*(min(1,node5path29) - 1))) & (success'=min(1, node5path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path30 * min(1,node5path30) - currentNode*(min(1, node5path30) - 1))) &  (currentPath'=(30 * min(1, node5path30) - currentPath*(min(1,node5path30) - 1))) & (success'=min(1, node5path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path31 * min(1,node5path31) - currentNode*(min(1, node5path31) - 1))) &  (currentPath'=(31 * min(1, node5path31) - currentPath*(min(1,node5path31) - 1))) & (success'=min(1, node5path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path32 * min(1,node5path32) - currentNode*(min(1, node5path32) - 1))) &  (currentPath'=(32 * min(1, node5path32) - currentPath*(min(1,node5path32) - 1))) & (success'=min(1, node5path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path33 * min(1,node5path33) - currentNode*(min(1, node5path33) - 1))) &  (currentPath'=(33 * min(1, node5path33) - currentPath*(min(1,node5path33) - 1))) & (success'=min(1, node5path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path34 * min(1,node5path34) - currentNode*(min(1, node5path34) - 1))) &  (currentPath'=(34 * min(1, node5path34) - currentPath*(min(1,node5path34) - 1))) & (success'=min(1, node5path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path35 * min(1,node5path35) - currentNode*(min(1, node5path35) - 1))) &  (currentPath'=(35 * min(1, node5path35) - currentPath*(min(1,node5path35) - 1))) & (success'=min(1, node5path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path36 * min(1,node5path36) - currentNode*(min(1, node5path36) - 1))) &  (currentPath'=(36 * min(1, node5path36) - currentPath*(min(1,node5path36) - 1))) & (success'=min(1, node5path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path37 * min(1,node5path37) - currentNode*(min(1, node5path37) - 1))) &  (currentPath'=(37 * min(1, node5path37) - currentPath*(min(1,node5path37) - 1))) & (success'=min(1, node5path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path38 * min(1,node5path38) - currentNode*(min(1, node5path38) - 1))) &  (currentPath'=(38 * min(1, node5path38) - currentPath*(min(1,node5path38) - 1))) & (success'=min(1, node5path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path39 * min(1,node5path39) - currentNode*(min(1, node5path39) - 1))) &  (currentPath'=(39 * min(1, node5path39) - currentPath*(min(1,node5path39) - 1))) & (success'=min(1, node5path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path40 * min(1,node5path40) - currentNode*(min(1, node5path40) - 1))) &  (currentPath'=(40 * min(1, node5path40) - currentPath*(min(1,node5path40) - 1))) & (success'=min(1, node5path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path41 * min(1,node5path41) - currentNode*(min(1, node5path41) - 1))) &  (currentPath'=(41 * min(1, node5path41) - currentPath*(min(1,node5path41) - 1))) & (success'=min(1, node5path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path42 * min(1,node5path42) - currentNode*(min(1, node5path42) - 1))) &  (currentPath'=(42 * min(1, node5path42) - currentPath*(min(1,node5path42) - 1))) & (success'=min(1, node5path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path43 * min(1,node5path43) - currentNode*(min(1, node5path43) - 1))) &  (currentPath'=(43 * min(1, node5path43) - currentPath*(min(1,node5path43) - 1))) & (success'=min(1, node5path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path44 * min(1,node5path44) - currentNode*(min(1, node5path44) - 1))) &  (currentPath'=(44 * min(1, node5path44) - currentPath*(min(1,node5path44) - 1))) & (success'=min(1, node5path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path45 * min(1,node5path45) - currentNode*(min(1, node5path45) - 1))) &  (currentPath'=(45 * min(1, node5path45) - currentPath*(min(1,node5path45) - 1))) & (success'=min(1, node5path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path46 * min(1,node5path46) - currentNode*(min(1, node5path46) - 1))) &  (currentPath'=(46 * min(1, node5path46) - currentPath*(min(1,node5path46) - 1))) & (success'=min(1, node5path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path47 * min(1,node5path47) - currentNode*(min(1, node5path47) - 1))) &  (currentPath'=(47 * min(1, node5path47) - currentPath*(min(1,node5path47) - 1))) & (success'=min(1, node5path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path48 * min(1,node5path48) - currentNode*(min(1, node5path48) - 1))) &  (currentPath'=(48 * min(1, node5path48) - currentPath*(min(1,node5path48) - 1))) & (success'=min(1, node5path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path49 * min(1,node5path49) - currentNode*(min(1, node5path49) - 1))) &  (currentPath'=(49 * min(1, node5path49) - currentPath*(min(1,node5path49) - 1))) & (success'=min(1, node5path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path50 * min(1,node5path50) - currentNode*(min(1, node5path50) - 1))) &  (currentPath'=(50 * min(1, node5path50) - currentPath*(min(1,node5path50) - 1))) & (success'=min(1, node5path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path51 * min(1,node5path51) - currentNode*(min(1, node5path51) - 1))) &  (currentPath'=(51 * min(1, node5path51) - currentPath*(min(1,node5path51) - 1))) & (success'=min(1, node5path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path52 * min(1,node5path52) - currentNode*(min(1, node5path52) - 1))) &  (currentPath'=(52 * min(1, node5path52) - currentPath*(min(1,node5path52) - 1))) & (success'=min(1, node5path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path53 * min(1,node5path53) - currentNode*(min(1, node5path53) - 1))) &  (currentPath'=(53 * min(1, node5path53) - currentPath*(min(1,node5path53) - 1))) & (success'=min(1, node5path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path54 * min(1,node5path54) - currentNode*(min(1, node5path54) - 1))) &  (currentPath'=(54 * min(1, node5path54) - currentPath*(min(1,node5path54) - 1))) & (success'=min(1, node5path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path55 * min(1,node5path55) - currentNode*(min(1, node5path55) - 1))) &  (currentPath'=(55 * min(1, node5path55) - currentPath*(min(1,node5path55) - 1))) & (success'=min(1, node5path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path56 * min(1,node5path56) - currentNode*(min(1, node5path56) - 1))) &  (currentPath'=(56 * min(1, node5path56) - currentPath*(min(1,node5path56) - 1))) & (success'=min(1, node5path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path57 * min(1,node5path57) - currentNode*(min(1, node5path57) - 1))) &  (currentPath'=(57 * min(1, node5path57) - currentPath*(min(1,node5path57) - 1))) & (success'=min(1, node5path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path58 * min(1,node5path58) - currentNode*(min(1, node5path58) - 1))) &  (currentPath'=(58 * min(1, node5path58) - currentPath*(min(1,node5path58) - 1))) & (success'=min(1, node5path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path59 * min(1,node5path59) - currentNode*(min(1, node5path59) - 1))) &  (currentPath'=(59 * min(1, node5path59) - currentPath*(min(1,node5path59) - 1))) & (success'=min(1, node5path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path60 * min(1,node5path60) - currentNode*(min(1, node5path60) - 1))) &  (currentPath'=(60 * min(1, node5path60) - currentPath*(min(1,node5path60) - 1))) & (success'=min(1, node5path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path61 * min(1,node5path61) - currentNode*(min(1, node5path61) - 1))) &  (currentPath'=(61 * min(1, node5path61) - currentPath*(min(1,node5path61) - 1))) & (success'=min(1, node5path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path62 * min(1,node5path62) - currentNode*(min(1, node5path62) - 1))) &  (currentPath'=(62 * min(1, node5path62) - currentPath*(min(1,node5path62) - 1))) & (success'=min(1, node5path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path63 * min(1,node5path63) - currentNode*(min(1, node5path63) - 1))) &  (currentPath'=(63 * min(1, node5path63) - currentPath*(min(1,node5path63) - 1))) & (success'=min(1, node5path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path64 * min(1,node5path64) - currentNode*(min(1, node5path64) - 1))) &  (currentPath'=(64 * min(1, node5path64) - currentPath*(min(1,node5path64) - 1))) & (success'=min(1, node5path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path65 * min(1,node5path65) - currentNode*(min(1, node5path65) - 1))) &  (currentPath'=(65 * min(1, node5path65) - currentPath*(min(1,node5path65) - 1))) & (success'=min(1, node5path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path66 * min(1,node5path66) - currentNode*(min(1, node5path66) - 1))) &  (currentPath'=(66 * min(1, node5path66) - currentPath*(min(1,node5path66) - 1))) & (success'=min(1, node5path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path67 * min(1,node5path67) - currentNode*(min(1, node5path67) - 1))) &  (currentPath'=(67 * min(1, node5path67) - currentPath*(min(1,node5path67) - 1))) & (success'=min(1, node5path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path68 * min(1,node5path68) - currentNode*(min(1, node5path68) - 1))) &  (currentPath'=(68 * min(1, node5path68) - currentPath*(min(1,node5path68) - 1))) & (success'=min(1, node5path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path69 * min(1,node5path69) - currentNode*(min(1, node5path69) - 1))) &  (currentPath'=(69 * min(1, node5path69) - currentPath*(min(1,node5path69) - 1))) & (success'=min(1, node5path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path70 * min(1,node5path70) - currentNode*(min(1, node5path70) - 1))) &  (currentPath'=(70 * min(1, node5path70) - currentPath*(min(1,node5path70) - 1))) & (success'=min(1, node5path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path71 * min(1,node5path71) - currentNode*(min(1, node5path71) - 1))) &  (currentPath'=(71 * min(1, node5path71) - currentPath*(min(1,node5path71) - 1))) & (success'=min(1, node5path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path72 * min(1,node5path72) - currentNode*(min(1, node5path72) - 1))) &  (currentPath'=(72 * min(1, node5path72) - currentPath*(min(1,node5path72) - 1))) & (success'=min(1, node5path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path73 * min(1,node5path73) - currentNode*(min(1, node5path73) - 1))) &  (currentPath'=(73 * min(1, node5path73) - currentPath*(min(1,node5path73) - 1))) & (success'=min(1, node5path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path74 * min(1,node5path74) - currentNode*(min(1, node5path74) - 1))) &  (currentPath'=(74 * min(1, node5path74) - currentPath*(min(1,node5path74) - 1))) & (success'=min(1, node5path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path75 * min(1,node5path75) - currentNode*(min(1, node5path75) - 1))) &  (currentPath'=(75 * min(1, node5path75) - currentPath*(min(1,node5path75) - 1))) & (success'=min(1, node5path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path76 * min(1,node5path76) - currentNode*(min(1, node5path76) - 1))) &  (currentPath'=(76 * min(1, node5path76) - currentPath*(min(1,node5path76) - 1))) & (success'=min(1, node5path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path77 * min(1,node5path77) - currentNode*(min(1, node5path77) - 1))) &  (currentPath'=(77 * min(1, node5path77) - currentPath*(min(1,node5path77) - 1))) & (success'=min(1, node5path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path78 * min(1,node5path78) - currentNode*(min(1, node5path78) - 1))) &  (currentPath'=(78 * min(1, node5path78) - currentPath*(min(1,node5path78) - 1))) & (success'=min(1, node5path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path79 * min(1,node5path79) - currentNode*(min(1, node5path79) - 1))) &  (currentPath'=(79 * min(1, node5path79) - currentPath*(min(1,node5path79) - 1))) & (success'=min(1, node5path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path80 * min(1,node5path80) - currentNode*(min(1, node5path80) - 1))) &  (currentPath'=(80 * min(1, node5path80) - currentPath*(min(1,node5path80) - 1))) & (success'=min(1, node5path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path81 * min(1,node5path81) - currentNode*(min(1, node5path81) - 1))) &  (currentPath'=(81 * min(1, node5path81) - currentPath*(min(1,node5path81) - 1))) & (success'=min(1, node5path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path82 * min(1,node5path82) - currentNode*(min(1, node5path82) - 1))) &  (currentPath'=(82 * min(1, node5path82) - currentPath*(min(1,node5path82) - 1))) & (success'=min(1, node5path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path83 * min(1,node5path83) - currentNode*(min(1, node5path83) - 1))) &  (currentPath'=(83 * min(1, node5path83) - currentPath*(min(1,node5path83) - 1))) & (success'=min(1, node5path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path84 * min(1,node5path84) - currentNode*(min(1, node5path84) - 1))) &  (currentPath'=(84 * min(1, node5path84) - currentPath*(min(1,node5path84) - 1))) & (success'=min(1, node5path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path85 * min(1,node5path85) - currentNode*(min(1, node5path85) - 1))) &  (currentPath'=(85 * min(1, node5path85) - currentPath*(min(1,node5path85) - 1))) & (success'=min(1, node5path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path86 * min(1,node5path86) - currentNode*(min(1, node5path86) - 1))) &  (currentPath'=(86 * min(1, node5path86) - currentPath*(min(1,node5path86) - 1))) & (success'=min(1, node5path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path87 * min(1,node5path87) - currentNode*(min(1, node5path87) - 1))) &  (currentPath'=(87 * min(1, node5path87) - currentPath*(min(1,node5path87) - 1))) & (success'=min(1, node5path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path88 * min(1,node5path88) - currentNode*(min(1, node5path88) - 1))) &  (currentPath'=(88 * min(1, node5path88) - currentPath*(min(1,node5path88) - 1))) & (success'=min(1, node5path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path89 * min(1,node5path89) - currentNode*(min(1, node5path89) - 1))) &  (currentPath'=(89 * min(1, node5path89) - currentPath*(min(1,node5path89) - 1))) & (success'=min(1, node5path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path90 * min(1,node5path90) - currentNode*(min(1, node5path90) - 1))) &  (currentPath'=(90 * min(1, node5path90) - currentPath*(min(1,node5path90) - 1))) & (success'=min(1, node5path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path91 * min(1,node5path91) - currentNode*(min(1, node5path91) - 1))) &  (currentPath'=(91 * min(1, node5path91) - currentPath*(min(1,node5path91) - 1))) & (success'=min(1, node5path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path92 * min(1,node5path92) - currentNode*(min(1, node5path92) - 1))) &  (currentPath'=(92 * min(1, node5path92) - currentPath*(min(1,node5path92) - 1))) & (success'=min(1, node5path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path93 * min(1,node5path93) - currentNode*(min(1, node5path93) - 1))) &  (currentPath'=(93 * min(1, node5path93) - currentPath*(min(1,node5path93) - 1))) & (success'=min(1, node5path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path94 * min(1,node5path94) - currentNode*(min(1, node5path94) - 1))) &  (currentPath'=(94 * min(1, node5path94) - currentPath*(min(1,node5path94) - 1))) & (success'=min(1, node5path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path95 * min(1,node5path95) - currentNode*(min(1, node5path95) - 1))) &  (currentPath'=(95 * min(1, node5path95) - currentPath*(min(1,node5path95) - 1))) & (success'=min(1, node5path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path96 * min(1,node5path96) - currentNode*(min(1, node5path96) - 1))) &  (currentPath'=(96 * min(1, node5path96) - currentPath*(min(1,node5path96) - 1))) & (success'=min(1, node5path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path97 * min(1,node5path97) - currentNode*(min(1, node5path97) - 1))) &  (currentPath'=(97 * min(1, node5path97) - currentPath*(min(1,node5path97) - 1))) & (success'=min(1, node5path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path98 * min(1,node5path98) - currentNode*(min(1, node5path98) - 1))) &  (currentPath'=(98 * min(1, node5path98) - currentPath*(min(1,node5path98) - 1))) & (success'=min(1, node5path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path99 * min(1,node5path99) - currentNode*(min(1, node5path99) - 1))) &  (currentPath'=(99 * min(1, node5path99) - currentPath*(min(1,node5path99) - 1))) & (success'=min(1, node5path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node5path100 * min(1,node5path100) - currentNode*(min(1, node5path100) - 1))) &  (currentPath'=(100 * min(1, node5path100) - currentPath*(min(1,node5path100) - 1))) & (success'=min(1, node5path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 6) ->
 numPathsInv: (currentNode'=(node6path1 * min(1,node6path1) - currentNode*(min(1, node6path1) - 1))) &  (currentPath'=(1 * min(1, node6path1) - currentPath*(min(1,node6path1) - 1))) & (success'=min(1, node6path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path2 * min(1,node6path2) - currentNode*(min(1, node6path2) - 1))) &  (currentPath'=(2 * min(1, node6path2) - currentPath*(min(1,node6path2) - 1))) & (success'=min(1, node6path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path3 * min(1,node6path3) - currentNode*(min(1, node6path3) - 1))) &  (currentPath'=(3 * min(1, node6path3) - currentPath*(min(1,node6path3) - 1))) & (success'=min(1, node6path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path4 * min(1,node6path4) - currentNode*(min(1, node6path4) - 1))) &  (currentPath'=(4 * min(1, node6path4) - currentPath*(min(1,node6path4) - 1))) & (success'=min(1, node6path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path5 * min(1,node6path5) - currentNode*(min(1, node6path5) - 1))) &  (currentPath'=(5 * min(1, node6path5) - currentPath*(min(1,node6path5) - 1))) & (success'=min(1, node6path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path6 * min(1,node6path6) - currentNode*(min(1, node6path6) - 1))) &  (currentPath'=(6 * min(1, node6path6) - currentPath*(min(1,node6path6) - 1))) & (success'=min(1, node6path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path7 * min(1,node6path7) - currentNode*(min(1, node6path7) - 1))) &  (currentPath'=(7 * min(1, node6path7) - currentPath*(min(1,node6path7) - 1))) & (success'=min(1, node6path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path8 * min(1,node6path8) - currentNode*(min(1, node6path8) - 1))) &  (currentPath'=(8 * min(1, node6path8) - currentPath*(min(1,node6path8) - 1))) & (success'=min(1, node6path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path9 * min(1,node6path9) - currentNode*(min(1, node6path9) - 1))) &  (currentPath'=(9 * min(1, node6path9) - currentPath*(min(1,node6path9) - 1))) & (success'=min(1, node6path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path10 * min(1,node6path10) - currentNode*(min(1, node6path10) - 1))) &  (currentPath'=(10 * min(1, node6path10) - currentPath*(min(1,node6path10) - 1))) & (success'=min(1, node6path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path11 * min(1,node6path11) - currentNode*(min(1, node6path11) - 1))) &  (currentPath'=(11 * min(1, node6path11) - currentPath*(min(1,node6path11) - 1))) & (success'=min(1, node6path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path12 * min(1,node6path12) - currentNode*(min(1, node6path12) - 1))) &  (currentPath'=(12 * min(1, node6path12) - currentPath*(min(1,node6path12) - 1))) & (success'=min(1, node6path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path13 * min(1,node6path13) - currentNode*(min(1, node6path13) - 1))) &  (currentPath'=(13 * min(1, node6path13) - currentPath*(min(1,node6path13) - 1))) & (success'=min(1, node6path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path14 * min(1,node6path14) - currentNode*(min(1, node6path14) - 1))) &  (currentPath'=(14 * min(1, node6path14) - currentPath*(min(1,node6path14) - 1))) & (success'=min(1, node6path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path15 * min(1,node6path15) - currentNode*(min(1, node6path15) - 1))) &  (currentPath'=(15 * min(1, node6path15) - currentPath*(min(1,node6path15) - 1))) & (success'=min(1, node6path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path16 * min(1,node6path16) - currentNode*(min(1, node6path16) - 1))) &  (currentPath'=(16 * min(1, node6path16) - currentPath*(min(1,node6path16) - 1))) & (success'=min(1, node6path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path17 * min(1,node6path17) - currentNode*(min(1, node6path17) - 1))) &  (currentPath'=(17 * min(1, node6path17) - currentPath*(min(1,node6path17) - 1))) & (success'=min(1, node6path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path18 * min(1,node6path18) - currentNode*(min(1, node6path18) - 1))) &  (currentPath'=(18 * min(1, node6path18) - currentPath*(min(1,node6path18) - 1))) & (success'=min(1, node6path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path19 * min(1,node6path19) - currentNode*(min(1, node6path19) - 1))) &  (currentPath'=(19 * min(1, node6path19) - currentPath*(min(1,node6path19) - 1))) & (success'=min(1, node6path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path20 * min(1,node6path20) - currentNode*(min(1, node6path20) - 1))) &  (currentPath'=(20 * min(1, node6path20) - currentPath*(min(1,node6path20) - 1))) & (success'=min(1, node6path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path21 * min(1,node6path21) - currentNode*(min(1, node6path21) - 1))) &  (currentPath'=(21 * min(1, node6path21) - currentPath*(min(1,node6path21) - 1))) & (success'=min(1, node6path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path22 * min(1,node6path22) - currentNode*(min(1, node6path22) - 1))) &  (currentPath'=(22 * min(1, node6path22) - currentPath*(min(1,node6path22) - 1))) & (success'=min(1, node6path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path23 * min(1,node6path23) - currentNode*(min(1, node6path23) - 1))) &  (currentPath'=(23 * min(1, node6path23) - currentPath*(min(1,node6path23) - 1))) & (success'=min(1, node6path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path24 * min(1,node6path24) - currentNode*(min(1, node6path24) - 1))) &  (currentPath'=(24 * min(1, node6path24) - currentPath*(min(1,node6path24) - 1))) & (success'=min(1, node6path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path25 * min(1,node6path25) - currentNode*(min(1, node6path25) - 1))) &  (currentPath'=(25 * min(1, node6path25) - currentPath*(min(1,node6path25) - 1))) & (success'=min(1, node6path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path26 * min(1,node6path26) - currentNode*(min(1, node6path26) - 1))) &  (currentPath'=(26 * min(1, node6path26) - currentPath*(min(1,node6path26) - 1))) & (success'=min(1, node6path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path27 * min(1,node6path27) - currentNode*(min(1, node6path27) - 1))) &  (currentPath'=(27 * min(1, node6path27) - currentPath*(min(1,node6path27) - 1))) & (success'=min(1, node6path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path28 * min(1,node6path28) - currentNode*(min(1, node6path28) - 1))) &  (currentPath'=(28 * min(1, node6path28) - currentPath*(min(1,node6path28) - 1))) & (success'=min(1, node6path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path29 * min(1,node6path29) - currentNode*(min(1, node6path29) - 1))) &  (currentPath'=(29 * min(1, node6path29) - currentPath*(min(1,node6path29) - 1))) & (success'=min(1, node6path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path30 * min(1,node6path30) - currentNode*(min(1, node6path30) - 1))) &  (currentPath'=(30 * min(1, node6path30) - currentPath*(min(1,node6path30) - 1))) & (success'=min(1, node6path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path31 * min(1,node6path31) - currentNode*(min(1, node6path31) - 1))) &  (currentPath'=(31 * min(1, node6path31) - currentPath*(min(1,node6path31) - 1))) & (success'=min(1, node6path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path32 * min(1,node6path32) - currentNode*(min(1, node6path32) - 1))) &  (currentPath'=(32 * min(1, node6path32) - currentPath*(min(1,node6path32) - 1))) & (success'=min(1, node6path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path33 * min(1,node6path33) - currentNode*(min(1, node6path33) - 1))) &  (currentPath'=(33 * min(1, node6path33) - currentPath*(min(1,node6path33) - 1))) & (success'=min(1, node6path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path34 * min(1,node6path34) - currentNode*(min(1, node6path34) - 1))) &  (currentPath'=(34 * min(1, node6path34) - currentPath*(min(1,node6path34) - 1))) & (success'=min(1, node6path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path35 * min(1,node6path35) - currentNode*(min(1, node6path35) - 1))) &  (currentPath'=(35 * min(1, node6path35) - currentPath*(min(1,node6path35) - 1))) & (success'=min(1, node6path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path36 * min(1,node6path36) - currentNode*(min(1, node6path36) - 1))) &  (currentPath'=(36 * min(1, node6path36) - currentPath*(min(1,node6path36) - 1))) & (success'=min(1, node6path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path37 * min(1,node6path37) - currentNode*(min(1, node6path37) - 1))) &  (currentPath'=(37 * min(1, node6path37) - currentPath*(min(1,node6path37) - 1))) & (success'=min(1, node6path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path38 * min(1,node6path38) - currentNode*(min(1, node6path38) - 1))) &  (currentPath'=(38 * min(1, node6path38) - currentPath*(min(1,node6path38) - 1))) & (success'=min(1, node6path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path39 * min(1,node6path39) - currentNode*(min(1, node6path39) - 1))) &  (currentPath'=(39 * min(1, node6path39) - currentPath*(min(1,node6path39) - 1))) & (success'=min(1, node6path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path40 * min(1,node6path40) - currentNode*(min(1, node6path40) - 1))) &  (currentPath'=(40 * min(1, node6path40) - currentPath*(min(1,node6path40) - 1))) & (success'=min(1, node6path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path41 * min(1,node6path41) - currentNode*(min(1, node6path41) - 1))) &  (currentPath'=(41 * min(1, node6path41) - currentPath*(min(1,node6path41) - 1))) & (success'=min(1, node6path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path42 * min(1,node6path42) - currentNode*(min(1, node6path42) - 1))) &  (currentPath'=(42 * min(1, node6path42) - currentPath*(min(1,node6path42) - 1))) & (success'=min(1, node6path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path43 * min(1,node6path43) - currentNode*(min(1, node6path43) - 1))) &  (currentPath'=(43 * min(1, node6path43) - currentPath*(min(1,node6path43) - 1))) & (success'=min(1, node6path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path44 * min(1,node6path44) - currentNode*(min(1, node6path44) - 1))) &  (currentPath'=(44 * min(1, node6path44) - currentPath*(min(1,node6path44) - 1))) & (success'=min(1, node6path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path45 * min(1,node6path45) - currentNode*(min(1, node6path45) - 1))) &  (currentPath'=(45 * min(1, node6path45) - currentPath*(min(1,node6path45) - 1))) & (success'=min(1, node6path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path46 * min(1,node6path46) - currentNode*(min(1, node6path46) - 1))) &  (currentPath'=(46 * min(1, node6path46) - currentPath*(min(1,node6path46) - 1))) & (success'=min(1, node6path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path47 * min(1,node6path47) - currentNode*(min(1, node6path47) - 1))) &  (currentPath'=(47 * min(1, node6path47) - currentPath*(min(1,node6path47) - 1))) & (success'=min(1, node6path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path48 * min(1,node6path48) - currentNode*(min(1, node6path48) - 1))) &  (currentPath'=(48 * min(1, node6path48) - currentPath*(min(1,node6path48) - 1))) & (success'=min(1, node6path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path49 * min(1,node6path49) - currentNode*(min(1, node6path49) - 1))) &  (currentPath'=(49 * min(1, node6path49) - currentPath*(min(1,node6path49) - 1))) & (success'=min(1, node6path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path50 * min(1,node6path50) - currentNode*(min(1, node6path50) - 1))) &  (currentPath'=(50 * min(1, node6path50) - currentPath*(min(1,node6path50) - 1))) & (success'=min(1, node6path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path51 * min(1,node6path51) - currentNode*(min(1, node6path51) - 1))) &  (currentPath'=(51 * min(1, node6path51) - currentPath*(min(1,node6path51) - 1))) & (success'=min(1, node6path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path52 * min(1,node6path52) - currentNode*(min(1, node6path52) - 1))) &  (currentPath'=(52 * min(1, node6path52) - currentPath*(min(1,node6path52) - 1))) & (success'=min(1, node6path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path53 * min(1,node6path53) - currentNode*(min(1, node6path53) - 1))) &  (currentPath'=(53 * min(1, node6path53) - currentPath*(min(1,node6path53) - 1))) & (success'=min(1, node6path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path54 * min(1,node6path54) - currentNode*(min(1, node6path54) - 1))) &  (currentPath'=(54 * min(1, node6path54) - currentPath*(min(1,node6path54) - 1))) & (success'=min(1, node6path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path55 * min(1,node6path55) - currentNode*(min(1, node6path55) - 1))) &  (currentPath'=(55 * min(1, node6path55) - currentPath*(min(1,node6path55) - 1))) & (success'=min(1, node6path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path56 * min(1,node6path56) - currentNode*(min(1, node6path56) - 1))) &  (currentPath'=(56 * min(1, node6path56) - currentPath*(min(1,node6path56) - 1))) & (success'=min(1, node6path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path57 * min(1,node6path57) - currentNode*(min(1, node6path57) - 1))) &  (currentPath'=(57 * min(1, node6path57) - currentPath*(min(1,node6path57) - 1))) & (success'=min(1, node6path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path58 * min(1,node6path58) - currentNode*(min(1, node6path58) - 1))) &  (currentPath'=(58 * min(1, node6path58) - currentPath*(min(1,node6path58) - 1))) & (success'=min(1, node6path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path59 * min(1,node6path59) - currentNode*(min(1, node6path59) - 1))) &  (currentPath'=(59 * min(1, node6path59) - currentPath*(min(1,node6path59) - 1))) & (success'=min(1, node6path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path60 * min(1,node6path60) - currentNode*(min(1, node6path60) - 1))) &  (currentPath'=(60 * min(1, node6path60) - currentPath*(min(1,node6path60) - 1))) & (success'=min(1, node6path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path61 * min(1,node6path61) - currentNode*(min(1, node6path61) - 1))) &  (currentPath'=(61 * min(1, node6path61) - currentPath*(min(1,node6path61) - 1))) & (success'=min(1, node6path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path62 * min(1,node6path62) - currentNode*(min(1, node6path62) - 1))) &  (currentPath'=(62 * min(1, node6path62) - currentPath*(min(1,node6path62) - 1))) & (success'=min(1, node6path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path63 * min(1,node6path63) - currentNode*(min(1, node6path63) - 1))) &  (currentPath'=(63 * min(1, node6path63) - currentPath*(min(1,node6path63) - 1))) & (success'=min(1, node6path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path64 * min(1,node6path64) - currentNode*(min(1, node6path64) - 1))) &  (currentPath'=(64 * min(1, node6path64) - currentPath*(min(1,node6path64) - 1))) & (success'=min(1, node6path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path65 * min(1,node6path65) - currentNode*(min(1, node6path65) - 1))) &  (currentPath'=(65 * min(1, node6path65) - currentPath*(min(1,node6path65) - 1))) & (success'=min(1, node6path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path66 * min(1,node6path66) - currentNode*(min(1, node6path66) - 1))) &  (currentPath'=(66 * min(1, node6path66) - currentPath*(min(1,node6path66) - 1))) & (success'=min(1, node6path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path67 * min(1,node6path67) - currentNode*(min(1, node6path67) - 1))) &  (currentPath'=(67 * min(1, node6path67) - currentPath*(min(1,node6path67) - 1))) & (success'=min(1, node6path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path68 * min(1,node6path68) - currentNode*(min(1, node6path68) - 1))) &  (currentPath'=(68 * min(1, node6path68) - currentPath*(min(1,node6path68) - 1))) & (success'=min(1, node6path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path69 * min(1,node6path69) - currentNode*(min(1, node6path69) - 1))) &  (currentPath'=(69 * min(1, node6path69) - currentPath*(min(1,node6path69) - 1))) & (success'=min(1, node6path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path70 * min(1,node6path70) - currentNode*(min(1, node6path70) - 1))) &  (currentPath'=(70 * min(1, node6path70) - currentPath*(min(1,node6path70) - 1))) & (success'=min(1, node6path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path71 * min(1,node6path71) - currentNode*(min(1, node6path71) - 1))) &  (currentPath'=(71 * min(1, node6path71) - currentPath*(min(1,node6path71) - 1))) & (success'=min(1, node6path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path72 * min(1,node6path72) - currentNode*(min(1, node6path72) - 1))) &  (currentPath'=(72 * min(1, node6path72) - currentPath*(min(1,node6path72) - 1))) & (success'=min(1, node6path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path73 * min(1,node6path73) - currentNode*(min(1, node6path73) - 1))) &  (currentPath'=(73 * min(1, node6path73) - currentPath*(min(1,node6path73) - 1))) & (success'=min(1, node6path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path74 * min(1,node6path74) - currentNode*(min(1, node6path74) - 1))) &  (currentPath'=(74 * min(1, node6path74) - currentPath*(min(1,node6path74) - 1))) & (success'=min(1, node6path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path75 * min(1,node6path75) - currentNode*(min(1, node6path75) - 1))) &  (currentPath'=(75 * min(1, node6path75) - currentPath*(min(1,node6path75) - 1))) & (success'=min(1, node6path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path76 * min(1,node6path76) - currentNode*(min(1, node6path76) - 1))) &  (currentPath'=(76 * min(1, node6path76) - currentPath*(min(1,node6path76) - 1))) & (success'=min(1, node6path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path77 * min(1,node6path77) - currentNode*(min(1, node6path77) - 1))) &  (currentPath'=(77 * min(1, node6path77) - currentPath*(min(1,node6path77) - 1))) & (success'=min(1, node6path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path78 * min(1,node6path78) - currentNode*(min(1, node6path78) - 1))) &  (currentPath'=(78 * min(1, node6path78) - currentPath*(min(1,node6path78) - 1))) & (success'=min(1, node6path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path79 * min(1,node6path79) - currentNode*(min(1, node6path79) - 1))) &  (currentPath'=(79 * min(1, node6path79) - currentPath*(min(1,node6path79) - 1))) & (success'=min(1, node6path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path80 * min(1,node6path80) - currentNode*(min(1, node6path80) - 1))) &  (currentPath'=(80 * min(1, node6path80) - currentPath*(min(1,node6path80) - 1))) & (success'=min(1, node6path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path81 * min(1,node6path81) - currentNode*(min(1, node6path81) - 1))) &  (currentPath'=(81 * min(1, node6path81) - currentPath*(min(1,node6path81) - 1))) & (success'=min(1, node6path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path82 * min(1,node6path82) - currentNode*(min(1, node6path82) - 1))) &  (currentPath'=(82 * min(1, node6path82) - currentPath*(min(1,node6path82) - 1))) & (success'=min(1, node6path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path83 * min(1,node6path83) - currentNode*(min(1, node6path83) - 1))) &  (currentPath'=(83 * min(1, node6path83) - currentPath*(min(1,node6path83) - 1))) & (success'=min(1, node6path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path84 * min(1,node6path84) - currentNode*(min(1, node6path84) - 1))) &  (currentPath'=(84 * min(1, node6path84) - currentPath*(min(1,node6path84) - 1))) & (success'=min(1, node6path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path85 * min(1,node6path85) - currentNode*(min(1, node6path85) - 1))) &  (currentPath'=(85 * min(1, node6path85) - currentPath*(min(1,node6path85) - 1))) & (success'=min(1, node6path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path86 * min(1,node6path86) - currentNode*(min(1, node6path86) - 1))) &  (currentPath'=(86 * min(1, node6path86) - currentPath*(min(1,node6path86) - 1))) & (success'=min(1, node6path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path87 * min(1,node6path87) - currentNode*(min(1, node6path87) - 1))) &  (currentPath'=(87 * min(1, node6path87) - currentPath*(min(1,node6path87) - 1))) & (success'=min(1, node6path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path88 * min(1,node6path88) - currentNode*(min(1, node6path88) - 1))) &  (currentPath'=(88 * min(1, node6path88) - currentPath*(min(1,node6path88) - 1))) & (success'=min(1, node6path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path89 * min(1,node6path89) - currentNode*(min(1, node6path89) - 1))) &  (currentPath'=(89 * min(1, node6path89) - currentPath*(min(1,node6path89) - 1))) & (success'=min(1, node6path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path90 * min(1,node6path90) - currentNode*(min(1, node6path90) - 1))) &  (currentPath'=(90 * min(1, node6path90) - currentPath*(min(1,node6path90) - 1))) & (success'=min(1, node6path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path91 * min(1,node6path91) - currentNode*(min(1, node6path91) - 1))) &  (currentPath'=(91 * min(1, node6path91) - currentPath*(min(1,node6path91) - 1))) & (success'=min(1, node6path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path92 * min(1,node6path92) - currentNode*(min(1, node6path92) - 1))) &  (currentPath'=(92 * min(1, node6path92) - currentPath*(min(1,node6path92) - 1))) & (success'=min(1, node6path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path93 * min(1,node6path93) - currentNode*(min(1, node6path93) - 1))) &  (currentPath'=(93 * min(1, node6path93) - currentPath*(min(1,node6path93) - 1))) & (success'=min(1, node6path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path94 * min(1,node6path94) - currentNode*(min(1, node6path94) - 1))) &  (currentPath'=(94 * min(1, node6path94) - currentPath*(min(1,node6path94) - 1))) & (success'=min(1, node6path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path95 * min(1,node6path95) - currentNode*(min(1, node6path95) - 1))) &  (currentPath'=(95 * min(1, node6path95) - currentPath*(min(1,node6path95) - 1))) & (success'=min(1, node6path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path96 * min(1,node6path96) - currentNode*(min(1, node6path96) - 1))) &  (currentPath'=(96 * min(1, node6path96) - currentPath*(min(1,node6path96) - 1))) & (success'=min(1, node6path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path97 * min(1,node6path97) - currentNode*(min(1, node6path97) - 1))) &  (currentPath'=(97 * min(1, node6path97) - currentPath*(min(1,node6path97) - 1))) & (success'=min(1, node6path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path98 * min(1,node6path98) - currentNode*(min(1, node6path98) - 1))) &  (currentPath'=(98 * min(1, node6path98) - currentPath*(min(1,node6path98) - 1))) & (success'=min(1, node6path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path99 * min(1,node6path99) - currentNode*(min(1, node6path99) - 1))) &  (currentPath'=(99 * min(1, node6path99) - currentPath*(min(1,node6path99) - 1))) & (success'=min(1, node6path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node6path100 * min(1,node6path100) - currentNode*(min(1, node6path100) - 1))) &  (currentPath'=(100 * min(1, node6path100) - currentPath*(min(1,node6path100) - 1))) & (success'=min(1, node6path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 7) ->
 numPathsInv: (currentNode'=(node7path1 * min(1,node7path1) - currentNode*(min(1, node7path1) - 1))) &  (currentPath'=(1 * min(1, node7path1) - currentPath*(min(1,node7path1) - 1))) & (success'=min(1, node7path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path2 * min(1,node7path2) - currentNode*(min(1, node7path2) - 1))) &  (currentPath'=(2 * min(1, node7path2) - currentPath*(min(1,node7path2) - 1))) & (success'=min(1, node7path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path3 * min(1,node7path3) - currentNode*(min(1, node7path3) - 1))) &  (currentPath'=(3 * min(1, node7path3) - currentPath*(min(1,node7path3) - 1))) & (success'=min(1, node7path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path4 * min(1,node7path4) - currentNode*(min(1, node7path4) - 1))) &  (currentPath'=(4 * min(1, node7path4) - currentPath*(min(1,node7path4) - 1))) & (success'=min(1, node7path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path5 * min(1,node7path5) - currentNode*(min(1, node7path5) - 1))) &  (currentPath'=(5 * min(1, node7path5) - currentPath*(min(1,node7path5) - 1))) & (success'=min(1, node7path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path6 * min(1,node7path6) - currentNode*(min(1, node7path6) - 1))) &  (currentPath'=(6 * min(1, node7path6) - currentPath*(min(1,node7path6) - 1))) & (success'=min(1, node7path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path7 * min(1,node7path7) - currentNode*(min(1, node7path7) - 1))) &  (currentPath'=(7 * min(1, node7path7) - currentPath*(min(1,node7path7) - 1))) & (success'=min(1, node7path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path8 * min(1,node7path8) - currentNode*(min(1, node7path8) - 1))) &  (currentPath'=(8 * min(1, node7path8) - currentPath*(min(1,node7path8) - 1))) & (success'=min(1, node7path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path9 * min(1,node7path9) - currentNode*(min(1, node7path9) - 1))) &  (currentPath'=(9 * min(1, node7path9) - currentPath*(min(1,node7path9) - 1))) & (success'=min(1, node7path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path10 * min(1,node7path10) - currentNode*(min(1, node7path10) - 1))) &  (currentPath'=(10 * min(1, node7path10) - currentPath*(min(1,node7path10) - 1))) & (success'=min(1, node7path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path11 * min(1,node7path11) - currentNode*(min(1, node7path11) - 1))) &  (currentPath'=(11 * min(1, node7path11) - currentPath*(min(1,node7path11) - 1))) & (success'=min(1, node7path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path12 * min(1,node7path12) - currentNode*(min(1, node7path12) - 1))) &  (currentPath'=(12 * min(1, node7path12) - currentPath*(min(1,node7path12) - 1))) & (success'=min(1, node7path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path13 * min(1,node7path13) - currentNode*(min(1, node7path13) - 1))) &  (currentPath'=(13 * min(1, node7path13) - currentPath*(min(1,node7path13) - 1))) & (success'=min(1, node7path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path14 * min(1,node7path14) - currentNode*(min(1, node7path14) - 1))) &  (currentPath'=(14 * min(1, node7path14) - currentPath*(min(1,node7path14) - 1))) & (success'=min(1, node7path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path15 * min(1,node7path15) - currentNode*(min(1, node7path15) - 1))) &  (currentPath'=(15 * min(1, node7path15) - currentPath*(min(1,node7path15) - 1))) & (success'=min(1, node7path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path16 * min(1,node7path16) - currentNode*(min(1, node7path16) - 1))) &  (currentPath'=(16 * min(1, node7path16) - currentPath*(min(1,node7path16) - 1))) & (success'=min(1, node7path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path17 * min(1,node7path17) - currentNode*(min(1, node7path17) - 1))) &  (currentPath'=(17 * min(1, node7path17) - currentPath*(min(1,node7path17) - 1))) & (success'=min(1, node7path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path18 * min(1,node7path18) - currentNode*(min(1, node7path18) - 1))) &  (currentPath'=(18 * min(1, node7path18) - currentPath*(min(1,node7path18) - 1))) & (success'=min(1, node7path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path19 * min(1,node7path19) - currentNode*(min(1, node7path19) - 1))) &  (currentPath'=(19 * min(1, node7path19) - currentPath*(min(1,node7path19) - 1))) & (success'=min(1, node7path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path20 * min(1,node7path20) - currentNode*(min(1, node7path20) - 1))) &  (currentPath'=(20 * min(1, node7path20) - currentPath*(min(1,node7path20) - 1))) & (success'=min(1, node7path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path21 * min(1,node7path21) - currentNode*(min(1, node7path21) - 1))) &  (currentPath'=(21 * min(1, node7path21) - currentPath*(min(1,node7path21) - 1))) & (success'=min(1, node7path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path22 * min(1,node7path22) - currentNode*(min(1, node7path22) - 1))) &  (currentPath'=(22 * min(1, node7path22) - currentPath*(min(1,node7path22) - 1))) & (success'=min(1, node7path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path23 * min(1,node7path23) - currentNode*(min(1, node7path23) - 1))) &  (currentPath'=(23 * min(1, node7path23) - currentPath*(min(1,node7path23) - 1))) & (success'=min(1, node7path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path24 * min(1,node7path24) - currentNode*(min(1, node7path24) - 1))) &  (currentPath'=(24 * min(1, node7path24) - currentPath*(min(1,node7path24) - 1))) & (success'=min(1, node7path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path25 * min(1,node7path25) - currentNode*(min(1, node7path25) - 1))) &  (currentPath'=(25 * min(1, node7path25) - currentPath*(min(1,node7path25) - 1))) & (success'=min(1, node7path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path26 * min(1,node7path26) - currentNode*(min(1, node7path26) - 1))) &  (currentPath'=(26 * min(1, node7path26) - currentPath*(min(1,node7path26) - 1))) & (success'=min(1, node7path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path27 * min(1,node7path27) - currentNode*(min(1, node7path27) - 1))) &  (currentPath'=(27 * min(1, node7path27) - currentPath*(min(1,node7path27) - 1))) & (success'=min(1, node7path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path28 * min(1,node7path28) - currentNode*(min(1, node7path28) - 1))) &  (currentPath'=(28 * min(1, node7path28) - currentPath*(min(1,node7path28) - 1))) & (success'=min(1, node7path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path29 * min(1,node7path29) - currentNode*(min(1, node7path29) - 1))) &  (currentPath'=(29 * min(1, node7path29) - currentPath*(min(1,node7path29) - 1))) & (success'=min(1, node7path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path30 * min(1,node7path30) - currentNode*(min(1, node7path30) - 1))) &  (currentPath'=(30 * min(1, node7path30) - currentPath*(min(1,node7path30) - 1))) & (success'=min(1, node7path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path31 * min(1,node7path31) - currentNode*(min(1, node7path31) - 1))) &  (currentPath'=(31 * min(1, node7path31) - currentPath*(min(1,node7path31) - 1))) & (success'=min(1, node7path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path32 * min(1,node7path32) - currentNode*(min(1, node7path32) - 1))) &  (currentPath'=(32 * min(1, node7path32) - currentPath*(min(1,node7path32) - 1))) & (success'=min(1, node7path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path33 * min(1,node7path33) - currentNode*(min(1, node7path33) - 1))) &  (currentPath'=(33 * min(1, node7path33) - currentPath*(min(1,node7path33) - 1))) & (success'=min(1, node7path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path34 * min(1,node7path34) - currentNode*(min(1, node7path34) - 1))) &  (currentPath'=(34 * min(1, node7path34) - currentPath*(min(1,node7path34) - 1))) & (success'=min(1, node7path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path35 * min(1,node7path35) - currentNode*(min(1, node7path35) - 1))) &  (currentPath'=(35 * min(1, node7path35) - currentPath*(min(1,node7path35) - 1))) & (success'=min(1, node7path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path36 * min(1,node7path36) - currentNode*(min(1, node7path36) - 1))) &  (currentPath'=(36 * min(1, node7path36) - currentPath*(min(1,node7path36) - 1))) & (success'=min(1, node7path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path37 * min(1,node7path37) - currentNode*(min(1, node7path37) - 1))) &  (currentPath'=(37 * min(1, node7path37) - currentPath*(min(1,node7path37) - 1))) & (success'=min(1, node7path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path38 * min(1,node7path38) - currentNode*(min(1, node7path38) - 1))) &  (currentPath'=(38 * min(1, node7path38) - currentPath*(min(1,node7path38) - 1))) & (success'=min(1, node7path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path39 * min(1,node7path39) - currentNode*(min(1, node7path39) - 1))) &  (currentPath'=(39 * min(1, node7path39) - currentPath*(min(1,node7path39) - 1))) & (success'=min(1, node7path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path40 * min(1,node7path40) - currentNode*(min(1, node7path40) - 1))) &  (currentPath'=(40 * min(1, node7path40) - currentPath*(min(1,node7path40) - 1))) & (success'=min(1, node7path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path41 * min(1,node7path41) - currentNode*(min(1, node7path41) - 1))) &  (currentPath'=(41 * min(1, node7path41) - currentPath*(min(1,node7path41) - 1))) & (success'=min(1, node7path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path42 * min(1,node7path42) - currentNode*(min(1, node7path42) - 1))) &  (currentPath'=(42 * min(1, node7path42) - currentPath*(min(1,node7path42) - 1))) & (success'=min(1, node7path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path43 * min(1,node7path43) - currentNode*(min(1, node7path43) - 1))) &  (currentPath'=(43 * min(1, node7path43) - currentPath*(min(1,node7path43) - 1))) & (success'=min(1, node7path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path44 * min(1,node7path44) - currentNode*(min(1, node7path44) - 1))) &  (currentPath'=(44 * min(1, node7path44) - currentPath*(min(1,node7path44) - 1))) & (success'=min(1, node7path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path45 * min(1,node7path45) - currentNode*(min(1, node7path45) - 1))) &  (currentPath'=(45 * min(1, node7path45) - currentPath*(min(1,node7path45) - 1))) & (success'=min(1, node7path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path46 * min(1,node7path46) - currentNode*(min(1, node7path46) - 1))) &  (currentPath'=(46 * min(1, node7path46) - currentPath*(min(1,node7path46) - 1))) & (success'=min(1, node7path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path47 * min(1,node7path47) - currentNode*(min(1, node7path47) - 1))) &  (currentPath'=(47 * min(1, node7path47) - currentPath*(min(1,node7path47) - 1))) & (success'=min(1, node7path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path48 * min(1,node7path48) - currentNode*(min(1, node7path48) - 1))) &  (currentPath'=(48 * min(1, node7path48) - currentPath*(min(1,node7path48) - 1))) & (success'=min(1, node7path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path49 * min(1,node7path49) - currentNode*(min(1, node7path49) - 1))) &  (currentPath'=(49 * min(1, node7path49) - currentPath*(min(1,node7path49) - 1))) & (success'=min(1, node7path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path50 * min(1,node7path50) - currentNode*(min(1, node7path50) - 1))) &  (currentPath'=(50 * min(1, node7path50) - currentPath*(min(1,node7path50) - 1))) & (success'=min(1, node7path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path51 * min(1,node7path51) - currentNode*(min(1, node7path51) - 1))) &  (currentPath'=(51 * min(1, node7path51) - currentPath*(min(1,node7path51) - 1))) & (success'=min(1, node7path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path52 * min(1,node7path52) - currentNode*(min(1, node7path52) - 1))) &  (currentPath'=(52 * min(1, node7path52) - currentPath*(min(1,node7path52) - 1))) & (success'=min(1, node7path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path53 * min(1,node7path53) - currentNode*(min(1, node7path53) - 1))) &  (currentPath'=(53 * min(1, node7path53) - currentPath*(min(1,node7path53) - 1))) & (success'=min(1, node7path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path54 * min(1,node7path54) - currentNode*(min(1, node7path54) - 1))) &  (currentPath'=(54 * min(1, node7path54) - currentPath*(min(1,node7path54) - 1))) & (success'=min(1, node7path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path55 * min(1,node7path55) - currentNode*(min(1, node7path55) - 1))) &  (currentPath'=(55 * min(1, node7path55) - currentPath*(min(1,node7path55) - 1))) & (success'=min(1, node7path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path56 * min(1,node7path56) - currentNode*(min(1, node7path56) - 1))) &  (currentPath'=(56 * min(1, node7path56) - currentPath*(min(1,node7path56) - 1))) & (success'=min(1, node7path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path57 * min(1,node7path57) - currentNode*(min(1, node7path57) - 1))) &  (currentPath'=(57 * min(1, node7path57) - currentPath*(min(1,node7path57) - 1))) & (success'=min(1, node7path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path58 * min(1,node7path58) - currentNode*(min(1, node7path58) - 1))) &  (currentPath'=(58 * min(1, node7path58) - currentPath*(min(1,node7path58) - 1))) & (success'=min(1, node7path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path59 * min(1,node7path59) - currentNode*(min(1, node7path59) - 1))) &  (currentPath'=(59 * min(1, node7path59) - currentPath*(min(1,node7path59) - 1))) & (success'=min(1, node7path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path60 * min(1,node7path60) - currentNode*(min(1, node7path60) - 1))) &  (currentPath'=(60 * min(1, node7path60) - currentPath*(min(1,node7path60) - 1))) & (success'=min(1, node7path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path61 * min(1,node7path61) - currentNode*(min(1, node7path61) - 1))) &  (currentPath'=(61 * min(1, node7path61) - currentPath*(min(1,node7path61) - 1))) & (success'=min(1, node7path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path62 * min(1,node7path62) - currentNode*(min(1, node7path62) - 1))) &  (currentPath'=(62 * min(1, node7path62) - currentPath*(min(1,node7path62) - 1))) & (success'=min(1, node7path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path63 * min(1,node7path63) - currentNode*(min(1, node7path63) - 1))) &  (currentPath'=(63 * min(1, node7path63) - currentPath*(min(1,node7path63) - 1))) & (success'=min(1, node7path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path64 * min(1,node7path64) - currentNode*(min(1, node7path64) - 1))) &  (currentPath'=(64 * min(1, node7path64) - currentPath*(min(1,node7path64) - 1))) & (success'=min(1, node7path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path65 * min(1,node7path65) - currentNode*(min(1, node7path65) - 1))) &  (currentPath'=(65 * min(1, node7path65) - currentPath*(min(1,node7path65) - 1))) & (success'=min(1, node7path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path66 * min(1,node7path66) - currentNode*(min(1, node7path66) - 1))) &  (currentPath'=(66 * min(1, node7path66) - currentPath*(min(1,node7path66) - 1))) & (success'=min(1, node7path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path67 * min(1,node7path67) - currentNode*(min(1, node7path67) - 1))) &  (currentPath'=(67 * min(1, node7path67) - currentPath*(min(1,node7path67) - 1))) & (success'=min(1, node7path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path68 * min(1,node7path68) - currentNode*(min(1, node7path68) - 1))) &  (currentPath'=(68 * min(1, node7path68) - currentPath*(min(1,node7path68) - 1))) & (success'=min(1, node7path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path69 * min(1,node7path69) - currentNode*(min(1, node7path69) - 1))) &  (currentPath'=(69 * min(1, node7path69) - currentPath*(min(1,node7path69) - 1))) & (success'=min(1, node7path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path70 * min(1,node7path70) - currentNode*(min(1, node7path70) - 1))) &  (currentPath'=(70 * min(1, node7path70) - currentPath*(min(1,node7path70) - 1))) & (success'=min(1, node7path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path71 * min(1,node7path71) - currentNode*(min(1, node7path71) - 1))) &  (currentPath'=(71 * min(1, node7path71) - currentPath*(min(1,node7path71) - 1))) & (success'=min(1, node7path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path72 * min(1,node7path72) - currentNode*(min(1, node7path72) - 1))) &  (currentPath'=(72 * min(1, node7path72) - currentPath*(min(1,node7path72) - 1))) & (success'=min(1, node7path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path73 * min(1,node7path73) - currentNode*(min(1, node7path73) - 1))) &  (currentPath'=(73 * min(1, node7path73) - currentPath*(min(1,node7path73) - 1))) & (success'=min(1, node7path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path74 * min(1,node7path74) - currentNode*(min(1, node7path74) - 1))) &  (currentPath'=(74 * min(1, node7path74) - currentPath*(min(1,node7path74) - 1))) & (success'=min(1, node7path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path75 * min(1,node7path75) - currentNode*(min(1, node7path75) - 1))) &  (currentPath'=(75 * min(1, node7path75) - currentPath*(min(1,node7path75) - 1))) & (success'=min(1, node7path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path76 * min(1,node7path76) - currentNode*(min(1, node7path76) - 1))) &  (currentPath'=(76 * min(1, node7path76) - currentPath*(min(1,node7path76) - 1))) & (success'=min(1, node7path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path77 * min(1,node7path77) - currentNode*(min(1, node7path77) - 1))) &  (currentPath'=(77 * min(1, node7path77) - currentPath*(min(1,node7path77) - 1))) & (success'=min(1, node7path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path78 * min(1,node7path78) - currentNode*(min(1, node7path78) - 1))) &  (currentPath'=(78 * min(1, node7path78) - currentPath*(min(1,node7path78) - 1))) & (success'=min(1, node7path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path79 * min(1,node7path79) - currentNode*(min(1, node7path79) - 1))) &  (currentPath'=(79 * min(1, node7path79) - currentPath*(min(1,node7path79) - 1))) & (success'=min(1, node7path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path80 * min(1,node7path80) - currentNode*(min(1, node7path80) - 1))) &  (currentPath'=(80 * min(1, node7path80) - currentPath*(min(1,node7path80) - 1))) & (success'=min(1, node7path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path81 * min(1,node7path81) - currentNode*(min(1, node7path81) - 1))) &  (currentPath'=(81 * min(1, node7path81) - currentPath*(min(1,node7path81) - 1))) & (success'=min(1, node7path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path82 * min(1,node7path82) - currentNode*(min(1, node7path82) - 1))) &  (currentPath'=(82 * min(1, node7path82) - currentPath*(min(1,node7path82) - 1))) & (success'=min(1, node7path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path83 * min(1,node7path83) - currentNode*(min(1, node7path83) - 1))) &  (currentPath'=(83 * min(1, node7path83) - currentPath*(min(1,node7path83) - 1))) & (success'=min(1, node7path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path84 * min(1,node7path84) - currentNode*(min(1, node7path84) - 1))) &  (currentPath'=(84 * min(1, node7path84) - currentPath*(min(1,node7path84) - 1))) & (success'=min(1, node7path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path85 * min(1,node7path85) - currentNode*(min(1, node7path85) - 1))) &  (currentPath'=(85 * min(1, node7path85) - currentPath*(min(1,node7path85) - 1))) & (success'=min(1, node7path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path86 * min(1,node7path86) - currentNode*(min(1, node7path86) - 1))) &  (currentPath'=(86 * min(1, node7path86) - currentPath*(min(1,node7path86) - 1))) & (success'=min(1, node7path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path87 * min(1,node7path87) - currentNode*(min(1, node7path87) - 1))) &  (currentPath'=(87 * min(1, node7path87) - currentPath*(min(1,node7path87) - 1))) & (success'=min(1, node7path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path88 * min(1,node7path88) - currentNode*(min(1, node7path88) - 1))) &  (currentPath'=(88 * min(1, node7path88) - currentPath*(min(1,node7path88) - 1))) & (success'=min(1, node7path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path89 * min(1,node7path89) - currentNode*(min(1, node7path89) - 1))) &  (currentPath'=(89 * min(1, node7path89) - currentPath*(min(1,node7path89) - 1))) & (success'=min(1, node7path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path90 * min(1,node7path90) - currentNode*(min(1, node7path90) - 1))) &  (currentPath'=(90 * min(1, node7path90) - currentPath*(min(1,node7path90) - 1))) & (success'=min(1, node7path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path91 * min(1,node7path91) - currentNode*(min(1, node7path91) - 1))) &  (currentPath'=(91 * min(1, node7path91) - currentPath*(min(1,node7path91) - 1))) & (success'=min(1, node7path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path92 * min(1,node7path92) - currentNode*(min(1, node7path92) - 1))) &  (currentPath'=(92 * min(1, node7path92) - currentPath*(min(1,node7path92) - 1))) & (success'=min(1, node7path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path93 * min(1,node7path93) - currentNode*(min(1, node7path93) - 1))) &  (currentPath'=(93 * min(1, node7path93) - currentPath*(min(1,node7path93) - 1))) & (success'=min(1, node7path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path94 * min(1,node7path94) - currentNode*(min(1, node7path94) - 1))) &  (currentPath'=(94 * min(1, node7path94) - currentPath*(min(1,node7path94) - 1))) & (success'=min(1, node7path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path95 * min(1,node7path95) - currentNode*(min(1, node7path95) - 1))) &  (currentPath'=(95 * min(1, node7path95) - currentPath*(min(1,node7path95) - 1))) & (success'=min(1, node7path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path96 * min(1,node7path96) - currentNode*(min(1, node7path96) - 1))) &  (currentPath'=(96 * min(1, node7path96) - currentPath*(min(1,node7path96) - 1))) & (success'=min(1, node7path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path97 * min(1,node7path97) - currentNode*(min(1, node7path97) - 1))) &  (currentPath'=(97 * min(1, node7path97) - currentPath*(min(1,node7path97) - 1))) & (success'=min(1, node7path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path98 * min(1,node7path98) - currentNode*(min(1, node7path98) - 1))) &  (currentPath'=(98 * min(1, node7path98) - currentPath*(min(1,node7path98) - 1))) & (success'=min(1, node7path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path99 * min(1,node7path99) - currentNode*(min(1, node7path99) - 1))) &  (currentPath'=(99 * min(1, node7path99) - currentPath*(min(1,node7path99) - 1))) & (success'=min(1, node7path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node7path100 * min(1,node7path100) - currentNode*(min(1, node7path100) - 1))) &  (currentPath'=(100 * min(1, node7path100) - currentPath*(min(1,node7path100) - 1))) & (success'=min(1, node7path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 8) ->
 numPathsInv: (currentNode'=(node8path1 * min(1,node8path1) - currentNode*(min(1, node8path1) - 1))) &  (currentPath'=(1 * min(1, node8path1) - currentPath*(min(1,node8path1) - 1))) & (success'=min(1, node8path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path2 * min(1,node8path2) - currentNode*(min(1, node8path2) - 1))) &  (currentPath'=(2 * min(1, node8path2) - currentPath*(min(1,node8path2) - 1))) & (success'=min(1, node8path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path3 * min(1,node8path3) - currentNode*(min(1, node8path3) - 1))) &  (currentPath'=(3 * min(1, node8path3) - currentPath*(min(1,node8path3) - 1))) & (success'=min(1, node8path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path4 * min(1,node8path4) - currentNode*(min(1, node8path4) - 1))) &  (currentPath'=(4 * min(1, node8path4) - currentPath*(min(1,node8path4) - 1))) & (success'=min(1, node8path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path5 * min(1,node8path5) - currentNode*(min(1, node8path5) - 1))) &  (currentPath'=(5 * min(1, node8path5) - currentPath*(min(1,node8path5) - 1))) & (success'=min(1, node8path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path6 * min(1,node8path6) - currentNode*(min(1, node8path6) - 1))) &  (currentPath'=(6 * min(1, node8path6) - currentPath*(min(1,node8path6) - 1))) & (success'=min(1, node8path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path7 * min(1,node8path7) - currentNode*(min(1, node8path7) - 1))) &  (currentPath'=(7 * min(1, node8path7) - currentPath*(min(1,node8path7) - 1))) & (success'=min(1, node8path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path8 * min(1,node8path8) - currentNode*(min(1, node8path8) - 1))) &  (currentPath'=(8 * min(1, node8path8) - currentPath*(min(1,node8path8) - 1))) & (success'=min(1, node8path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path9 * min(1,node8path9) - currentNode*(min(1, node8path9) - 1))) &  (currentPath'=(9 * min(1, node8path9) - currentPath*(min(1,node8path9) - 1))) & (success'=min(1, node8path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path10 * min(1,node8path10) - currentNode*(min(1, node8path10) - 1))) &  (currentPath'=(10 * min(1, node8path10) - currentPath*(min(1,node8path10) - 1))) & (success'=min(1, node8path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path11 * min(1,node8path11) - currentNode*(min(1, node8path11) - 1))) &  (currentPath'=(11 * min(1, node8path11) - currentPath*(min(1,node8path11) - 1))) & (success'=min(1, node8path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path12 * min(1,node8path12) - currentNode*(min(1, node8path12) - 1))) &  (currentPath'=(12 * min(1, node8path12) - currentPath*(min(1,node8path12) - 1))) & (success'=min(1, node8path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path13 * min(1,node8path13) - currentNode*(min(1, node8path13) - 1))) &  (currentPath'=(13 * min(1, node8path13) - currentPath*(min(1,node8path13) - 1))) & (success'=min(1, node8path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path14 * min(1,node8path14) - currentNode*(min(1, node8path14) - 1))) &  (currentPath'=(14 * min(1, node8path14) - currentPath*(min(1,node8path14) - 1))) & (success'=min(1, node8path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path15 * min(1,node8path15) - currentNode*(min(1, node8path15) - 1))) &  (currentPath'=(15 * min(1, node8path15) - currentPath*(min(1,node8path15) - 1))) & (success'=min(1, node8path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path16 * min(1,node8path16) - currentNode*(min(1, node8path16) - 1))) &  (currentPath'=(16 * min(1, node8path16) - currentPath*(min(1,node8path16) - 1))) & (success'=min(1, node8path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path17 * min(1,node8path17) - currentNode*(min(1, node8path17) - 1))) &  (currentPath'=(17 * min(1, node8path17) - currentPath*(min(1,node8path17) - 1))) & (success'=min(1, node8path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path18 * min(1,node8path18) - currentNode*(min(1, node8path18) - 1))) &  (currentPath'=(18 * min(1, node8path18) - currentPath*(min(1,node8path18) - 1))) & (success'=min(1, node8path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path19 * min(1,node8path19) - currentNode*(min(1, node8path19) - 1))) &  (currentPath'=(19 * min(1, node8path19) - currentPath*(min(1,node8path19) - 1))) & (success'=min(1, node8path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path20 * min(1,node8path20) - currentNode*(min(1, node8path20) - 1))) &  (currentPath'=(20 * min(1, node8path20) - currentPath*(min(1,node8path20) - 1))) & (success'=min(1, node8path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path21 * min(1,node8path21) - currentNode*(min(1, node8path21) - 1))) &  (currentPath'=(21 * min(1, node8path21) - currentPath*(min(1,node8path21) - 1))) & (success'=min(1, node8path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path22 * min(1,node8path22) - currentNode*(min(1, node8path22) - 1))) &  (currentPath'=(22 * min(1, node8path22) - currentPath*(min(1,node8path22) - 1))) & (success'=min(1, node8path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path23 * min(1,node8path23) - currentNode*(min(1, node8path23) - 1))) &  (currentPath'=(23 * min(1, node8path23) - currentPath*(min(1,node8path23) - 1))) & (success'=min(1, node8path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path24 * min(1,node8path24) - currentNode*(min(1, node8path24) - 1))) &  (currentPath'=(24 * min(1, node8path24) - currentPath*(min(1,node8path24) - 1))) & (success'=min(1, node8path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path25 * min(1,node8path25) - currentNode*(min(1, node8path25) - 1))) &  (currentPath'=(25 * min(1, node8path25) - currentPath*(min(1,node8path25) - 1))) & (success'=min(1, node8path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path26 * min(1,node8path26) - currentNode*(min(1, node8path26) - 1))) &  (currentPath'=(26 * min(1, node8path26) - currentPath*(min(1,node8path26) - 1))) & (success'=min(1, node8path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path27 * min(1,node8path27) - currentNode*(min(1, node8path27) - 1))) &  (currentPath'=(27 * min(1, node8path27) - currentPath*(min(1,node8path27) - 1))) & (success'=min(1, node8path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path28 * min(1,node8path28) - currentNode*(min(1, node8path28) - 1))) &  (currentPath'=(28 * min(1, node8path28) - currentPath*(min(1,node8path28) - 1))) & (success'=min(1, node8path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path29 * min(1,node8path29) - currentNode*(min(1, node8path29) - 1))) &  (currentPath'=(29 * min(1, node8path29) - currentPath*(min(1,node8path29) - 1))) & (success'=min(1, node8path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path30 * min(1,node8path30) - currentNode*(min(1, node8path30) - 1))) &  (currentPath'=(30 * min(1, node8path30) - currentPath*(min(1,node8path30) - 1))) & (success'=min(1, node8path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path31 * min(1,node8path31) - currentNode*(min(1, node8path31) - 1))) &  (currentPath'=(31 * min(1, node8path31) - currentPath*(min(1,node8path31) - 1))) & (success'=min(1, node8path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path32 * min(1,node8path32) - currentNode*(min(1, node8path32) - 1))) &  (currentPath'=(32 * min(1, node8path32) - currentPath*(min(1,node8path32) - 1))) & (success'=min(1, node8path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path33 * min(1,node8path33) - currentNode*(min(1, node8path33) - 1))) &  (currentPath'=(33 * min(1, node8path33) - currentPath*(min(1,node8path33) - 1))) & (success'=min(1, node8path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path34 * min(1,node8path34) - currentNode*(min(1, node8path34) - 1))) &  (currentPath'=(34 * min(1, node8path34) - currentPath*(min(1,node8path34) - 1))) & (success'=min(1, node8path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path35 * min(1,node8path35) - currentNode*(min(1, node8path35) - 1))) &  (currentPath'=(35 * min(1, node8path35) - currentPath*(min(1,node8path35) - 1))) & (success'=min(1, node8path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path36 * min(1,node8path36) - currentNode*(min(1, node8path36) - 1))) &  (currentPath'=(36 * min(1, node8path36) - currentPath*(min(1,node8path36) - 1))) & (success'=min(1, node8path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path37 * min(1,node8path37) - currentNode*(min(1, node8path37) - 1))) &  (currentPath'=(37 * min(1, node8path37) - currentPath*(min(1,node8path37) - 1))) & (success'=min(1, node8path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path38 * min(1,node8path38) - currentNode*(min(1, node8path38) - 1))) &  (currentPath'=(38 * min(1, node8path38) - currentPath*(min(1,node8path38) - 1))) & (success'=min(1, node8path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path39 * min(1,node8path39) - currentNode*(min(1, node8path39) - 1))) &  (currentPath'=(39 * min(1, node8path39) - currentPath*(min(1,node8path39) - 1))) & (success'=min(1, node8path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path40 * min(1,node8path40) - currentNode*(min(1, node8path40) - 1))) &  (currentPath'=(40 * min(1, node8path40) - currentPath*(min(1,node8path40) - 1))) & (success'=min(1, node8path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path41 * min(1,node8path41) - currentNode*(min(1, node8path41) - 1))) &  (currentPath'=(41 * min(1, node8path41) - currentPath*(min(1,node8path41) - 1))) & (success'=min(1, node8path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path42 * min(1,node8path42) - currentNode*(min(1, node8path42) - 1))) &  (currentPath'=(42 * min(1, node8path42) - currentPath*(min(1,node8path42) - 1))) & (success'=min(1, node8path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path43 * min(1,node8path43) - currentNode*(min(1, node8path43) - 1))) &  (currentPath'=(43 * min(1, node8path43) - currentPath*(min(1,node8path43) - 1))) & (success'=min(1, node8path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path44 * min(1,node8path44) - currentNode*(min(1, node8path44) - 1))) &  (currentPath'=(44 * min(1, node8path44) - currentPath*(min(1,node8path44) - 1))) & (success'=min(1, node8path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path45 * min(1,node8path45) - currentNode*(min(1, node8path45) - 1))) &  (currentPath'=(45 * min(1, node8path45) - currentPath*(min(1,node8path45) - 1))) & (success'=min(1, node8path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path46 * min(1,node8path46) - currentNode*(min(1, node8path46) - 1))) &  (currentPath'=(46 * min(1, node8path46) - currentPath*(min(1,node8path46) - 1))) & (success'=min(1, node8path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path47 * min(1,node8path47) - currentNode*(min(1, node8path47) - 1))) &  (currentPath'=(47 * min(1, node8path47) - currentPath*(min(1,node8path47) - 1))) & (success'=min(1, node8path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path48 * min(1,node8path48) - currentNode*(min(1, node8path48) - 1))) &  (currentPath'=(48 * min(1, node8path48) - currentPath*(min(1,node8path48) - 1))) & (success'=min(1, node8path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path49 * min(1,node8path49) - currentNode*(min(1, node8path49) - 1))) &  (currentPath'=(49 * min(1, node8path49) - currentPath*(min(1,node8path49) - 1))) & (success'=min(1, node8path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path50 * min(1,node8path50) - currentNode*(min(1, node8path50) - 1))) &  (currentPath'=(50 * min(1, node8path50) - currentPath*(min(1,node8path50) - 1))) & (success'=min(1, node8path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path51 * min(1,node8path51) - currentNode*(min(1, node8path51) - 1))) &  (currentPath'=(51 * min(1, node8path51) - currentPath*(min(1,node8path51) - 1))) & (success'=min(1, node8path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path52 * min(1,node8path52) - currentNode*(min(1, node8path52) - 1))) &  (currentPath'=(52 * min(1, node8path52) - currentPath*(min(1,node8path52) - 1))) & (success'=min(1, node8path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path53 * min(1,node8path53) - currentNode*(min(1, node8path53) - 1))) &  (currentPath'=(53 * min(1, node8path53) - currentPath*(min(1,node8path53) - 1))) & (success'=min(1, node8path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path54 * min(1,node8path54) - currentNode*(min(1, node8path54) - 1))) &  (currentPath'=(54 * min(1, node8path54) - currentPath*(min(1,node8path54) - 1))) & (success'=min(1, node8path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path55 * min(1,node8path55) - currentNode*(min(1, node8path55) - 1))) &  (currentPath'=(55 * min(1, node8path55) - currentPath*(min(1,node8path55) - 1))) & (success'=min(1, node8path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path56 * min(1,node8path56) - currentNode*(min(1, node8path56) - 1))) &  (currentPath'=(56 * min(1, node8path56) - currentPath*(min(1,node8path56) - 1))) & (success'=min(1, node8path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path57 * min(1,node8path57) - currentNode*(min(1, node8path57) - 1))) &  (currentPath'=(57 * min(1, node8path57) - currentPath*(min(1,node8path57) - 1))) & (success'=min(1, node8path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path58 * min(1,node8path58) - currentNode*(min(1, node8path58) - 1))) &  (currentPath'=(58 * min(1, node8path58) - currentPath*(min(1,node8path58) - 1))) & (success'=min(1, node8path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path59 * min(1,node8path59) - currentNode*(min(1, node8path59) - 1))) &  (currentPath'=(59 * min(1, node8path59) - currentPath*(min(1,node8path59) - 1))) & (success'=min(1, node8path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path60 * min(1,node8path60) - currentNode*(min(1, node8path60) - 1))) &  (currentPath'=(60 * min(1, node8path60) - currentPath*(min(1,node8path60) - 1))) & (success'=min(1, node8path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path61 * min(1,node8path61) - currentNode*(min(1, node8path61) - 1))) &  (currentPath'=(61 * min(1, node8path61) - currentPath*(min(1,node8path61) - 1))) & (success'=min(1, node8path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path62 * min(1,node8path62) - currentNode*(min(1, node8path62) - 1))) &  (currentPath'=(62 * min(1, node8path62) - currentPath*(min(1,node8path62) - 1))) & (success'=min(1, node8path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path63 * min(1,node8path63) - currentNode*(min(1, node8path63) - 1))) &  (currentPath'=(63 * min(1, node8path63) - currentPath*(min(1,node8path63) - 1))) & (success'=min(1, node8path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path64 * min(1,node8path64) - currentNode*(min(1, node8path64) - 1))) &  (currentPath'=(64 * min(1, node8path64) - currentPath*(min(1,node8path64) - 1))) & (success'=min(1, node8path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path65 * min(1,node8path65) - currentNode*(min(1, node8path65) - 1))) &  (currentPath'=(65 * min(1, node8path65) - currentPath*(min(1,node8path65) - 1))) & (success'=min(1, node8path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path66 * min(1,node8path66) - currentNode*(min(1, node8path66) - 1))) &  (currentPath'=(66 * min(1, node8path66) - currentPath*(min(1,node8path66) - 1))) & (success'=min(1, node8path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path67 * min(1,node8path67) - currentNode*(min(1, node8path67) - 1))) &  (currentPath'=(67 * min(1, node8path67) - currentPath*(min(1,node8path67) - 1))) & (success'=min(1, node8path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path68 * min(1,node8path68) - currentNode*(min(1, node8path68) - 1))) &  (currentPath'=(68 * min(1, node8path68) - currentPath*(min(1,node8path68) - 1))) & (success'=min(1, node8path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path69 * min(1,node8path69) - currentNode*(min(1, node8path69) - 1))) &  (currentPath'=(69 * min(1, node8path69) - currentPath*(min(1,node8path69) - 1))) & (success'=min(1, node8path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path70 * min(1,node8path70) - currentNode*(min(1, node8path70) - 1))) &  (currentPath'=(70 * min(1, node8path70) - currentPath*(min(1,node8path70) - 1))) & (success'=min(1, node8path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path71 * min(1,node8path71) - currentNode*(min(1, node8path71) - 1))) &  (currentPath'=(71 * min(1, node8path71) - currentPath*(min(1,node8path71) - 1))) & (success'=min(1, node8path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path72 * min(1,node8path72) - currentNode*(min(1, node8path72) - 1))) &  (currentPath'=(72 * min(1, node8path72) - currentPath*(min(1,node8path72) - 1))) & (success'=min(1, node8path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path73 * min(1,node8path73) - currentNode*(min(1, node8path73) - 1))) &  (currentPath'=(73 * min(1, node8path73) - currentPath*(min(1,node8path73) - 1))) & (success'=min(1, node8path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path74 * min(1,node8path74) - currentNode*(min(1, node8path74) - 1))) &  (currentPath'=(74 * min(1, node8path74) - currentPath*(min(1,node8path74) - 1))) & (success'=min(1, node8path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path75 * min(1,node8path75) - currentNode*(min(1, node8path75) - 1))) &  (currentPath'=(75 * min(1, node8path75) - currentPath*(min(1,node8path75) - 1))) & (success'=min(1, node8path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path76 * min(1,node8path76) - currentNode*(min(1, node8path76) - 1))) &  (currentPath'=(76 * min(1, node8path76) - currentPath*(min(1,node8path76) - 1))) & (success'=min(1, node8path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path77 * min(1,node8path77) - currentNode*(min(1, node8path77) - 1))) &  (currentPath'=(77 * min(1, node8path77) - currentPath*(min(1,node8path77) - 1))) & (success'=min(1, node8path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path78 * min(1,node8path78) - currentNode*(min(1, node8path78) - 1))) &  (currentPath'=(78 * min(1, node8path78) - currentPath*(min(1,node8path78) - 1))) & (success'=min(1, node8path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path79 * min(1,node8path79) - currentNode*(min(1, node8path79) - 1))) &  (currentPath'=(79 * min(1, node8path79) - currentPath*(min(1,node8path79) - 1))) & (success'=min(1, node8path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path80 * min(1,node8path80) - currentNode*(min(1, node8path80) - 1))) &  (currentPath'=(80 * min(1, node8path80) - currentPath*(min(1,node8path80) - 1))) & (success'=min(1, node8path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path81 * min(1,node8path81) - currentNode*(min(1, node8path81) - 1))) &  (currentPath'=(81 * min(1, node8path81) - currentPath*(min(1,node8path81) - 1))) & (success'=min(1, node8path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path82 * min(1,node8path82) - currentNode*(min(1, node8path82) - 1))) &  (currentPath'=(82 * min(1, node8path82) - currentPath*(min(1,node8path82) - 1))) & (success'=min(1, node8path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path83 * min(1,node8path83) - currentNode*(min(1, node8path83) - 1))) &  (currentPath'=(83 * min(1, node8path83) - currentPath*(min(1,node8path83) - 1))) & (success'=min(1, node8path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path84 * min(1,node8path84) - currentNode*(min(1, node8path84) - 1))) &  (currentPath'=(84 * min(1, node8path84) - currentPath*(min(1,node8path84) - 1))) & (success'=min(1, node8path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path85 * min(1,node8path85) - currentNode*(min(1, node8path85) - 1))) &  (currentPath'=(85 * min(1, node8path85) - currentPath*(min(1,node8path85) - 1))) & (success'=min(1, node8path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path86 * min(1,node8path86) - currentNode*(min(1, node8path86) - 1))) &  (currentPath'=(86 * min(1, node8path86) - currentPath*(min(1,node8path86) - 1))) & (success'=min(1, node8path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path87 * min(1,node8path87) - currentNode*(min(1, node8path87) - 1))) &  (currentPath'=(87 * min(1, node8path87) - currentPath*(min(1,node8path87) - 1))) & (success'=min(1, node8path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path88 * min(1,node8path88) - currentNode*(min(1, node8path88) - 1))) &  (currentPath'=(88 * min(1, node8path88) - currentPath*(min(1,node8path88) - 1))) & (success'=min(1, node8path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path89 * min(1,node8path89) - currentNode*(min(1, node8path89) - 1))) &  (currentPath'=(89 * min(1, node8path89) - currentPath*(min(1,node8path89) - 1))) & (success'=min(1, node8path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path90 * min(1,node8path90) - currentNode*(min(1, node8path90) - 1))) &  (currentPath'=(90 * min(1, node8path90) - currentPath*(min(1,node8path90) - 1))) & (success'=min(1, node8path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path91 * min(1,node8path91) - currentNode*(min(1, node8path91) - 1))) &  (currentPath'=(91 * min(1, node8path91) - currentPath*(min(1,node8path91) - 1))) & (success'=min(1, node8path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path92 * min(1,node8path92) - currentNode*(min(1, node8path92) - 1))) &  (currentPath'=(92 * min(1, node8path92) - currentPath*(min(1,node8path92) - 1))) & (success'=min(1, node8path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path93 * min(1,node8path93) - currentNode*(min(1, node8path93) - 1))) &  (currentPath'=(93 * min(1, node8path93) - currentPath*(min(1,node8path93) - 1))) & (success'=min(1, node8path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path94 * min(1,node8path94) - currentNode*(min(1, node8path94) - 1))) &  (currentPath'=(94 * min(1, node8path94) - currentPath*(min(1,node8path94) - 1))) & (success'=min(1, node8path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path95 * min(1,node8path95) - currentNode*(min(1, node8path95) - 1))) &  (currentPath'=(95 * min(1, node8path95) - currentPath*(min(1,node8path95) - 1))) & (success'=min(1, node8path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path96 * min(1,node8path96) - currentNode*(min(1, node8path96) - 1))) &  (currentPath'=(96 * min(1, node8path96) - currentPath*(min(1,node8path96) - 1))) & (success'=min(1, node8path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path97 * min(1,node8path97) - currentNode*(min(1, node8path97) - 1))) &  (currentPath'=(97 * min(1, node8path97) - currentPath*(min(1,node8path97) - 1))) & (success'=min(1, node8path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path98 * min(1,node8path98) - currentNode*(min(1, node8path98) - 1))) &  (currentPath'=(98 * min(1, node8path98) - currentPath*(min(1,node8path98) - 1))) & (success'=min(1, node8path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path99 * min(1,node8path99) - currentNode*(min(1, node8path99) - 1))) &  (currentPath'=(99 * min(1, node8path99) - currentPath*(min(1,node8path99) - 1))) & (success'=min(1, node8path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node8path100 * min(1,node8path100) - currentNode*(min(1, node8path100) - 1))) &  (currentPath'=(100 * min(1, node8path100) - currentPath*(min(1,node8path100) - 1))) & (success'=min(1, node8path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 9) ->
 numPathsInv: (currentNode'=(node9path1 * min(1,node9path1) - currentNode*(min(1, node9path1) - 1))) &  (currentPath'=(1 * min(1, node9path1) - currentPath*(min(1,node9path1) - 1))) & (success'=min(1, node9path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path2 * min(1,node9path2) - currentNode*(min(1, node9path2) - 1))) &  (currentPath'=(2 * min(1, node9path2) - currentPath*(min(1,node9path2) - 1))) & (success'=min(1, node9path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path3 * min(1,node9path3) - currentNode*(min(1, node9path3) - 1))) &  (currentPath'=(3 * min(1, node9path3) - currentPath*(min(1,node9path3) - 1))) & (success'=min(1, node9path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path4 * min(1,node9path4) - currentNode*(min(1, node9path4) - 1))) &  (currentPath'=(4 * min(1, node9path4) - currentPath*(min(1,node9path4) - 1))) & (success'=min(1, node9path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path5 * min(1,node9path5) - currentNode*(min(1, node9path5) - 1))) &  (currentPath'=(5 * min(1, node9path5) - currentPath*(min(1,node9path5) - 1))) & (success'=min(1, node9path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path6 * min(1,node9path6) - currentNode*(min(1, node9path6) - 1))) &  (currentPath'=(6 * min(1, node9path6) - currentPath*(min(1,node9path6) - 1))) & (success'=min(1, node9path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path7 * min(1,node9path7) - currentNode*(min(1, node9path7) - 1))) &  (currentPath'=(7 * min(1, node9path7) - currentPath*(min(1,node9path7) - 1))) & (success'=min(1, node9path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path8 * min(1,node9path8) - currentNode*(min(1, node9path8) - 1))) &  (currentPath'=(8 * min(1, node9path8) - currentPath*(min(1,node9path8) - 1))) & (success'=min(1, node9path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path9 * min(1,node9path9) - currentNode*(min(1, node9path9) - 1))) &  (currentPath'=(9 * min(1, node9path9) - currentPath*(min(1,node9path9) - 1))) & (success'=min(1, node9path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path10 * min(1,node9path10) - currentNode*(min(1, node9path10) - 1))) &  (currentPath'=(10 * min(1, node9path10) - currentPath*(min(1,node9path10) - 1))) & (success'=min(1, node9path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path11 * min(1,node9path11) - currentNode*(min(1, node9path11) - 1))) &  (currentPath'=(11 * min(1, node9path11) - currentPath*(min(1,node9path11) - 1))) & (success'=min(1, node9path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path12 * min(1,node9path12) - currentNode*(min(1, node9path12) - 1))) &  (currentPath'=(12 * min(1, node9path12) - currentPath*(min(1,node9path12) - 1))) & (success'=min(1, node9path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path13 * min(1,node9path13) - currentNode*(min(1, node9path13) - 1))) &  (currentPath'=(13 * min(1, node9path13) - currentPath*(min(1,node9path13) - 1))) & (success'=min(1, node9path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path14 * min(1,node9path14) - currentNode*(min(1, node9path14) - 1))) &  (currentPath'=(14 * min(1, node9path14) - currentPath*(min(1,node9path14) - 1))) & (success'=min(1, node9path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path15 * min(1,node9path15) - currentNode*(min(1, node9path15) - 1))) &  (currentPath'=(15 * min(1, node9path15) - currentPath*(min(1,node9path15) - 1))) & (success'=min(1, node9path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path16 * min(1,node9path16) - currentNode*(min(1, node9path16) - 1))) &  (currentPath'=(16 * min(1, node9path16) - currentPath*(min(1,node9path16) - 1))) & (success'=min(1, node9path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path17 * min(1,node9path17) - currentNode*(min(1, node9path17) - 1))) &  (currentPath'=(17 * min(1, node9path17) - currentPath*(min(1,node9path17) - 1))) & (success'=min(1, node9path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path18 * min(1,node9path18) - currentNode*(min(1, node9path18) - 1))) &  (currentPath'=(18 * min(1, node9path18) - currentPath*(min(1,node9path18) - 1))) & (success'=min(1, node9path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path19 * min(1,node9path19) - currentNode*(min(1, node9path19) - 1))) &  (currentPath'=(19 * min(1, node9path19) - currentPath*(min(1,node9path19) - 1))) & (success'=min(1, node9path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path20 * min(1,node9path20) - currentNode*(min(1, node9path20) - 1))) &  (currentPath'=(20 * min(1, node9path20) - currentPath*(min(1,node9path20) - 1))) & (success'=min(1, node9path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path21 * min(1,node9path21) - currentNode*(min(1, node9path21) - 1))) &  (currentPath'=(21 * min(1, node9path21) - currentPath*(min(1,node9path21) - 1))) & (success'=min(1, node9path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path22 * min(1,node9path22) - currentNode*(min(1, node9path22) - 1))) &  (currentPath'=(22 * min(1, node9path22) - currentPath*(min(1,node9path22) - 1))) & (success'=min(1, node9path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path23 * min(1,node9path23) - currentNode*(min(1, node9path23) - 1))) &  (currentPath'=(23 * min(1, node9path23) - currentPath*(min(1,node9path23) - 1))) & (success'=min(1, node9path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path24 * min(1,node9path24) - currentNode*(min(1, node9path24) - 1))) &  (currentPath'=(24 * min(1, node9path24) - currentPath*(min(1,node9path24) - 1))) & (success'=min(1, node9path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path25 * min(1,node9path25) - currentNode*(min(1, node9path25) - 1))) &  (currentPath'=(25 * min(1, node9path25) - currentPath*(min(1,node9path25) - 1))) & (success'=min(1, node9path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path26 * min(1,node9path26) - currentNode*(min(1, node9path26) - 1))) &  (currentPath'=(26 * min(1, node9path26) - currentPath*(min(1,node9path26) - 1))) & (success'=min(1, node9path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path27 * min(1,node9path27) - currentNode*(min(1, node9path27) - 1))) &  (currentPath'=(27 * min(1, node9path27) - currentPath*(min(1,node9path27) - 1))) & (success'=min(1, node9path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path28 * min(1,node9path28) - currentNode*(min(1, node9path28) - 1))) &  (currentPath'=(28 * min(1, node9path28) - currentPath*(min(1,node9path28) - 1))) & (success'=min(1, node9path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path29 * min(1,node9path29) - currentNode*(min(1, node9path29) - 1))) &  (currentPath'=(29 * min(1, node9path29) - currentPath*(min(1,node9path29) - 1))) & (success'=min(1, node9path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path30 * min(1,node9path30) - currentNode*(min(1, node9path30) - 1))) &  (currentPath'=(30 * min(1, node9path30) - currentPath*(min(1,node9path30) - 1))) & (success'=min(1, node9path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path31 * min(1,node9path31) - currentNode*(min(1, node9path31) - 1))) &  (currentPath'=(31 * min(1, node9path31) - currentPath*(min(1,node9path31) - 1))) & (success'=min(1, node9path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path32 * min(1,node9path32) - currentNode*(min(1, node9path32) - 1))) &  (currentPath'=(32 * min(1, node9path32) - currentPath*(min(1,node9path32) - 1))) & (success'=min(1, node9path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path33 * min(1,node9path33) - currentNode*(min(1, node9path33) - 1))) &  (currentPath'=(33 * min(1, node9path33) - currentPath*(min(1,node9path33) - 1))) & (success'=min(1, node9path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path34 * min(1,node9path34) - currentNode*(min(1, node9path34) - 1))) &  (currentPath'=(34 * min(1, node9path34) - currentPath*(min(1,node9path34) - 1))) & (success'=min(1, node9path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path35 * min(1,node9path35) - currentNode*(min(1, node9path35) - 1))) &  (currentPath'=(35 * min(1, node9path35) - currentPath*(min(1,node9path35) - 1))) & (success'=min(1, node9path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path36 * min(1,node9path36) - currentNode*(min(1, node9path36) - 1))) &  (currentPath'=(36 * min(1, node9path36) - currentPath*(min(1,node9path36) - 1))) & (success'=min(1, node9path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path37 * min(1,node9path37) - currentNode*(min(1, node9path37) - 1))) &  (currentPath'=(37 * min(1, node9path37) - currentPath*(min(1,node9path37) - 1))) & (success'=min(1, node9path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path38 * min(1,node9path38) - currentNode*(min(1, node9path38) - 1))) &  (currentPath'=(38 * min(1, node9path38) - currentPath*(min(1,node9path38) - 1))) & (success'=min(1, node9path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path39 * min(1,node9path39) - currentNode*(min(1, node9path39) - 1))) &  (currentPath'=(39 * min(1, node9path39) - currentPath*(min(1,node9path39) - 1))) & (success'=min(1, node9path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path40 * min(1,node9path40) - currentNode*(min(1, node9path40) - 1))) &  (currentPath'=(40 * min(1, node9path40) - currentPath*(min(1,node9path40) - 1))) & (success'=min(1, node9path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path41 * min(1,node9path41) - currentNode*(min(1, node9path41) - 1))) &  (currentPath'=(41 * min(1, node9path41) - currentPath*(min(1,node9path41) - 1))) & (success'=min(1, node9path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path42 * min(1,node9path42) - currentNode*(min(1, node9path42) - 1))) &  (currentPath'=(42 * min(1, node9path42) - currentPath*(min(1,node9path42) - 1))) & (success'=min(1, node9path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path43 * min(1,node9path43) - currentNode*(min(1, node9path43) - 1))) &  (currentPath'=(43 * min(1, node9path43) - currentPath*(min(1,node9path43) - 1))) & (success'=min(1, node9path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path44 * min(1,node9path44) - currentNode*(min(1, node9path44) - 1))) &  (currentPath'=(44 * min(1, node9path44) - currentPath*(min(1,node9path44) - 1))) & (success'=min(1, node9path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path45 * min(1,node9path45) - currentNode*(min(1, node9path45) - 1))) &  (currentPath'=(45 * min(1, node9path45) - currentPath*(min(1,node9path45) - 1))) & (success'=min(1, node9path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path46 * min(1,node9path46) - currentNode*(min(1, node9path46) - 1))) &  (currentPath'=(46 * min(1, node9path46) - currentPath*(min(1,node9path46) - 1))) & (success'=min(1, node9path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path47 * min(1,node9path47) - currentNode*(min(1, node9path47) - 1))) &  (currentPath'=(47 * min(1, node9path47) - currentPath*(min(1,node9path47) - 1))) & (success'=min(1, node9path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path48 * min(1,node9path48) - currentNode*(min(1, node9path48) - 1))) &  (currentPath'=(48 * min(1, node9path48) - currentPath*(min(1,node9path48) - 1))) & (success'=min(1, node9path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path49 * min(1,node9path49) - currentNode*(min(1, node9path49) - 1))) &  (currentPath'=(49 * min(1, node9path49) - currentPath*(min(1,node9path49) - 1))) & (success'=min(1, node9path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path50 * min(1,node9path50) - currentNode*(min(1, node9path50) - 1))) &  (currentPath'=(50 * min(1, node9path50) - currentPath*(min(1,node9path50) - 1))) & (success'=min(1, node9path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path51 * min(1,node9path51) - currentNode*(min(1, node9path51) - 1))) &  (currentPath'=(51 * min(1, node9path51) - currentPath*(min(1,node9path51) - 1))) & (success'=min(1, node9path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path52 * min(1,node9path52) - currentNode*(min(1, node9path52) - 1))) &  (currentPath'=(52 * min(1, node9path52) - currentPath*(min(1,node9path52) - 1))) & (success'=min(1, node9path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path53 * min(1,node9path53) - currentNode*(min(1, node9path53) - 1))) &  (currentPath'=(53 * min(1, node9path53) - currentPath*(min(1,node9path53) - 1))) & (success'=min(1, node9path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path54 * min(1,node9path54) - currentNode*(min(1, node9path54) - 1))) &  (currentPath'=(54 * min(1, node9path54) - currentPath*(min(1,node9path54) - 1))) & (success'=min(1, node9path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path55 * min(1,node9path55) - currentNode*(min(1, node9path55) - 1))) &  (currentPath'=(55 * min(1, node9path55) - currentPath*(min(1,node9path55) - 1))) & (success'=min(1, node9path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path56 * min(1,node9path56) - currentNode*(min(1, node9path56) - 1))) &  (currentPath'=(56 * min(1, node9path56) - currentPath*(min(1,node9path56) - 1))) & (success'=min(1, node9path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path57 * min(1,node9path57) - currentNode*(min(1, node9path57) - 1))) &  (currentPath'=(57 * min(1, node9path57) - currentPath*(min(1,node9path57) - 1))) & (success'=min(1, node9path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path58 * min(1,node9path58) - currentNode*(min(1, node9path58) - 1))) &  (currentPath'=(58 * min(1, node9path58) - currentPath*(min(1,node9path58) - 1))) & (success'=min(1, node9path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path59 * min(1,node9path59) - currentNode*(min(1, node9path59) - 1))) &  (currentPath'=(59 * min(1, node9path59) - currentPath*(min(1,node9path59) - 1))) & (success'=min(1, node9path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path60 * min(1,node9path60) - currentNode*(min(1, node9path60) - 1))) &  (currentPath'=(60 * min(1, node9path60) - currentPath*(min(1,node9path60) - 1))) & (success'=min(1, node9path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path61 * min(1,node9path61) - currentNode*(min(1, node9path61) - 1))) &  (currentPath'=(61 * min(1, node9path61) - currentPath*(min(1,node9path61) - 1))) & (success'=min(1, node9path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path62 * min(1,node9path62) - currentNode*(min(1, node9path62) - 1))) &  (currentPath'=(62 * min(1, node9path62) - currentPath*(min(1,node9path62) - 1))) & (success'=min(1, node9path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path63 * min(1,node9path63) - currentNode*(min(1, node9path63) - 1))) &  (currentPath'=(63 * min(1, node9path63) - currentPath*(min(1,node9path63) - 1))) & (success'=min(1, node9path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path64 * min(1,node9path64) - currentNode*(min(1, node9path64) - 1))) &  (currentPath'=(64 * min(1, node9path64) - currentPath*(min(1,node9path64) - 1))) & (success'=min(1, node9path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path65 * min(1,node9path65) - currentNode*(min(1, node9path65) - 1))) &  (currentPath'=(65 * min(1, node9path65) - currentPath*(min(1,node9path65) - 1))) & (success'=min(1, node9path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path66 * min(1,node9path66) - currentNode*(min(1, node9path66) - 1))) &  (currentPath'=(66 * min(1, node9path66) - currentPath*(min(1,node9path66) - 1))) & (success'=min(1, node9path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path67 * min(1,node9path67) - currentNode*(min(1, node9path67) - 1))) &  (currentPath'=(67 * min(1, node9path67) - currentPath*(min(1,node9path67) - 1))) & (success'=min(1, node9path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path68 * min(1,node9path68) - currentNode*(min(1, node9path68) - 1))) &  (currentPath'=(68 * min(1, node9path68) - currentPath*(min(1,node9path68) - 1))) & (success'=min(1, node9path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path69 * min(1,node9path69) - currentNode*(min(1, node9path69) - 1))) &  (currentPath'=(69 * min(1, node9path69) - currentPath*(min(1,node9path69) - 1))) & (success'=min(1, node9path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path70 * min(1,node9path70) - currentNode*(min(1, node9path70) - 1))) &  (currentPath'=(70 * min(1, node9path70) - currentPath*(min(1,node9path70) - 1))) & (success'=min(1, node9path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path71 * min(1,node9path71) - currentNode*(min(1, node9path71) - 1))) &  (currentPath'=(71 * min(1, node9path71) - currentPath*(min(1,node9path71) - 1))) & (success'=min(1, node9path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path72 * min(1,node9path72) - currentNode*(min(1, node9path72) - 1))) &  (currentPath'=(72 * min(1, node9path72) - currentPath*(min(1,node9path72) - 1))) & (success'=min(1, node9path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path73 * min(1,node9path73) - currentNode*(min(1, node9path73) - 1))) &  (currentPath'=(73 * min(1, node9path73) - currentPath*(min(1,node9path73) - 1))) & (success'=min(1, node9path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path74 * min(1,node9path74) - currentNode*(min(1, node9path74) - 1))) &  (currentPath'=(74 * min(1, node9path74) - currentPath*(min(1,node9path74) - 1))) & (success'=min(1, node9path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path75 * min(1,node9path75) - currentNode*(min(1, node9path75) - 1))) &  (currentPath'=(75 * min(1, node9path75) - currentPath*(min(1,node9path75) - 1))) & (success'=min(1, node9path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path76 * min(1,node9path76) - currentNode*(min(1, node9path76) - 1))) &  (currentPath'=(76 * min(1, node9path76) - currentPath*(min(1,node9path76) - 1))) & (success'=min(1, node9path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path77 * min(1,node9path77) - currentNode*(min(1, node9path77) - 1))) &  (currentPath'=(77 * min(1, node9path77) - currentPath*(min(1,node9path77) - 1))) & (success'=min(1, node9path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path78 * min(1,node9path78) - currentNode*(min(1, node9path78) - 1))) &  (currentPath'=(78 * min(1, node9path78) - currentPath*(min(1,node9path78) - 1))) & (success'=min(1, node9path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path79 * min(1,node9path79) - currentNode*(min(1, node9path79) - 1))) &  (currentPath'=(79 * min(1, node9path79) - currentPath*(min(1,node9path79) - 1))) & (success'=min(1, node9path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path80 * min(1,node9path80) - currentNode*(min(1, node9path80) - 1))) &  (currentPath'=(80 * min(1, node9path80) - currentPath*(min(1,node9path80) - 1))) & (success'=min(1, node9path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path81 * min(1,node9path81) - currentNode*(min(1, node9path81) - 1))) &  (currentPath'=(81 * min(1, node9path81) - currentPath*(min(1,node9path81) - 1))) & (success'=min(1, node9path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path82 * min(1,node9path82) - currentNode*(min(1, node9path82) - 1))) &  (currentPath'=(82 * min(1, node9path82) - currentPath*(min(1,node9path82) - 1))) & (success'=min(1, node9path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path83 * min(1,node9path83) - currentNode*(min(1, node9path83) - 1))) &  (currentPath'=(83 * min(1, node9path83) - currentPath*(min(1,node9path83) - 1))) & (success'=min(1, node9path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path84 * min(1,node9path84) - currentNode*(min(1, node9path84) - 1))) &  (currentPath'=(84 * min(1, node9path84) - currentPath*(min(1,node9path84) - 1))) & (success'=min(1, node9path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path85 * min(1,node9path85) - currentNode*(min(1, node9path85) - 1))) &  (currentPath'=(85 * min(1, node9path85) - currentPath*(min(1,node9path85) - 1))) & (success'=min(1, node9path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path86 * min(1,node9path86) - currentNode*(min(1, node9path86) - 1))) &  (currentPath'=(86 * min(1, node9path86) - currentPath*(min(1,node9path86) - 1))) & (success'=min(1, node9path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path87 * min(1,node9path87) - currentNode*(min(1, node9path87) - 1))) &  (currentPath'=(87 * min(1, node9path87) - currentPath*(min(1,node9path87) - 1))) & (success'=min(1, node9path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path88 * min(1,node9path88) - currentNode*(min(1, node9path88) - 1))) &  (currentPath'=(88 * min(1, node9path88) - currentPath*(min(1,node9path88) - 1))) & (success'=min(1, node9path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path89 * min(1,node9path89) - currentNode*(min(1, node9path89) - 1))) &  (currentPath'=(89 * min(1, node9path89) - currentPath*(min(1,node9path89) - 1))) & (success'=min(1, node9path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path90 * min(1,node9path90) - currentNode*(min(1, node9path90) - 1))) &  (currentPath'=(90 * min(1, node9path90) - currentPath*(min(1,node9path90) - 1))) & (success'=min(1, node9path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path91 * min(1,node9path91) - currentNode*(min(1, node9path91) - 1))) &  (currentPath'=(91 * min(1, node9path91) - currentPath*(min(1,node9path91) - 1))) & (success'=min(1, node9path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path92 * min(1,node9path92) - currentNode*(min(1, node9path92) - 1))) &  (currentPath'=(92 * min(1, node9path92) - currentPath*(min(1,node9path92) - 1))) & (success'=min(1, node9path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path93 * min(1,node9path93) - currentNode*(min(1, node9path93) - 1))) &  (currentPath'=(93 * min(1, node9path93) - currentPath*(min(1,node9path93) - 1))) & (success'=min(1, node9path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path94 * min(1,node9path94) - currentNode*(min(1, node9path94) - 1))) &  (currentPath'=(94 * min(1, node9path94) - currentPath*(min(1,node9path94) - 1))) & (success'=min(1, node9path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path95 * min(1,node9path95) - currentNode*(min(1, node9path95) - 1))) &  (currentPath'=(95 * min(1, node9path95) - currentPath*(min(1,node9path95) - 1))) & (success'=min(1, node9path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path96 * min(1,node9path96) - currentNode*(min(1, node9path96) - 1))) &  (currentPath'=(96 * min(1, node9path96) - currentPath*(min(1,node9path96) - 1))) & (success'=min(1, node9path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path97 * min(1,node9path97) - currentNode*(min(1, node9path97) - 1))) &  (currentPath'=(97 * min(1, node9path97) - currentPath*(min(1,node9path97) - 1))) & (success'=min(1, node9path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path98 * min(1,node9path98) - currentNode*(min(1, node9path98) - 1))) &  (currentPath'=(98 * min(1, node9path98) - currentPath*(min(1,node9path98) - 1))) & (success'=min(1, node9path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path99 * min(1,node9path99) - currentNode*(min(1, node9path99) - 1))) &  (currentPath'=(99 * min(1, node9path99) - currentPath*(min(1,node9path99) - 1))) & (success'=min(1, node9path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node9path100 * min(1,node9path100) - currentNode*(min(1, node9path100) - 1))) &  (currentPath'=(100 * min(1, node9path100) - currentPath*(min(1,node9path100) - 1))) & (success'=min(1, node9path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 10) ->
 numPathsInv: (currentNode'=(node10path1 * min(1,node10path1) - currentNode*(min(1, node10path1) - 1))) &  (currentPath'=(1 * min(1, node10path1) - currentPath*(min(1,node10path1) - 1))) & (success'=min(1, node10path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path2 * min(1,node10path2) - currentNode*(min(1, node10path2) - 1))) &  (currentPath'=(2 * min(1, node10path2) - currentPath*(min(1,node10path2) - 1))) & (success'=min(1, node10path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path3 * min(1,node10path3) - currentNode*(min(1, node10path3) - 1))) &  (currentPath'=(3 * min(1, node10path3) - currentPath*(min(1,node10path3) - 1))) & (success'=min(1, node10path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path4 * min(1,node10path4) - currentNode*(min(1, node10path4) - 1))) &  (currentPath'=(4 * min(1, node10path4) - currentPath*(min(1,node10path4) - 1))) & (success'=min(1, node10path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path5 * min(1,node10path5) - currentNode*(min(1, node10path5) - 1))) &  (currentPath'=(5 * min(1, node10path5) - currentPath*(min(1,node10path5) - 1))) & (success'=min(1, node10path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path6 * min(1,node10path6) - currentNode*(min(1, node10path6) - 1))) &  (currentPath'=(6 * min(1, node10path6) - currentPath*(min(1,node10path6) - 1))) & (success'=min(1, node10path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path7 * min(1,node10path7) - currentNode*(min(1, node10path7) - 1))) &  (currentPath'=(7 * min(1, node10path7) - currentPath*(min(1,node10path7) - 1))) & (success'=min(1, node10path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path8 * min(1,node10path8) - currentNode*(min(1, node10path8) - 1))) &  (currentPath'=(8 * min(1, node10path8) - currentPath*(min(1,node10path8) - 1))) & (success'=min(1, node10path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path9 * min(1,node10path9) - currentNode*(min(1, node10path9) - 1))) &  (currentPath'=(9 * min(1, node10path9) - currentPath*(min(1,node10path9) - 1))) & (success'=min(1, node10path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path10 * min(1,node10path10) - currentNode*(min(1, node10path10) - 1))) &  (currentPath'=(10 * min(1, node10path10) - currentPath*(min(1,node10path10) - 1))) & (success'=min(1, node10path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path11 * min(1,node10path11) - currentNode*(min(1, node10path11) - 1))) &  (currentPath'=(11 * min(1, node10path11) - currentPath*(min(1,node10path11) - 1))) & (success'=min(1, node10path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path12 * min(1,node10path12) - currentNode*(min(1, node10path12) - 1))) &  (currentPath'=(12 * min(1, node10path12) - currentPath*(min(1,node10path12) - 1))) & (success'=min(1, node10path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path13 * min(1,node10path13) - currentNode*(min(1, node10path13) - 1))) &  (currentPath'=(13 * min(1, node10path13) - currentPath*(min(1,node10path13) - 1))) & (success'=min(1, node10path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path14 * min(1,node10path14) - currentNode*(min(1, node10path14) - 1))) &  (currentPath'=(14 * min(1, node10path14) - currentPath*(min(1,node10path14) - 1))) & (success'=min(1, node10path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path15 * min(1,node10path15) - currentNode*(min(1, node10path15) - 1))) &  (currentPath'=(15 * min(1, node10path15) - currentPath*(min(1,node10path15) - 1))) & (success'=min(1, node10path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path16 * min(1,node10path16) - currentNode*(min(1, node10path16) - 1))) &  (currentPath'=(16 * min(1, node10path16) - currentPath*(min(1,node10path16) - 1))) & (success'=min(1, node10path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path17 * min(1,node10path17) - currentNode*(min(1, node10path17) - 1))) &  (currentPath'=(17 * min(1, node10path17) - currentPath*(min(1,node10path17) - 1))) & (success'=min(1, node10path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path18 * min(1,node10path18) - currentNode*(min(1, node10path18) - 1))) &  (currentPath'=(18 * min(1, node10path18) - currentPath*(min(1,node10path18) - 1))) & (success'=min(1, node10path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path19 * min(1,node10path19) - currentNode*(min(1, node10path19) - 1))) &  (currentPath'=(19 * min(1, node10path19) - currentPath*(min(1,node10path19) - 1))) & (success'=min(1, node10path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path20 * min(1,node10path20) - currentNode*(min(1, node10path20) - 1))) &  (currentPath'=(20 * min(1, node10path20) - currentPath*(min(1,node10path20) - 1))) & (success'=min(1, node10path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path21 * min(1,node10path21) - currentNode*(min(1, node10path21) - 1))) &  (currentPath'=(21 * min(1, node10path21) - currentPath*(min(1,node10path21) - 1))) & (success'=min(1, node10path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path22 * min(1,node10path22) - currentNode*(min(1, node10path22) - 1))) &  (currentPath'=(22 * min(1, node10path22) - currentPath*(min(1,node10path22) - 1))) & (success'=min(1, node10path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path23 * min(1,node10path23) - currentNode*(min(1, node10path23) - 1))) &  (currentPath'=(23 * min(1, node10path23) - currentPath*(min(1,node10path23) - 1))) & (success'=min(1, node10path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path24 * min(1,node10path24) - currentNode*(min(1, node10path24) - 1))) &  (currentPath'=(24 * min(1, node10path24) - currentPath*(min(1,node10path24) - 1))) & (success'=min(1, node10path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path25 * min(1,node10path25) - currentNode*(min(1, node10path25) - 1))) &  (currentPath'=(25 * min(1, node10path25) - currentPath*(min(1,node10path25) - 1))) & (success'=min(1, node10path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path26 * min(1,node10path26) - currentNode*(min(1, node10path26) - 1))) &  (currentPath'=(26 * min(1, node10path26) - currentPath*(min(1,node10path26) - 1))) & (success'=min(1, node10path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path27 * min(1,node10path27) - currentNode*(min(1, node10path27) - 1))) &  (currentPath'=(27 * min(1, node10path27) - currentPath*(min(1,node10path27) - 1))) & (success'=min(1, node10path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path28 * min(1,node10path28) - currentNode*(min(1, node10path28) - 1))) &  (currentPath'=(28 * min(1, node10path28) - currentPath*(min(1,node10path28) - 1))) & (success'=min(1, node10path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path29 * min(1,node10path29) - currentNode*(min(1, node10path29) - 1))) &  (currentPath'=(29 * min(1, node10path29) - currentPath*(min(1,node10path29) - 1))) & (success'=min(1, node10path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path30 * min(1,node10path30) - currentNode*(min(1, node10path30) - 1))) &  (currentPath'=(30 * min(1, node10path30) - currentPath*(min(1,node10path30) - 1))) & (success'=min(1, node10path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path31 * min(1,node10path31) - currentNode*(min(1, node10path31) - 1))) &  (currentPath'=(31 * min(1, node10path31) - currentPath*(min(1,node10path31) - 1))) & (success'=min(1, node10path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path32 * min(1,node10path32) - currentNode*(min(1, node10path32) - 1))) &  (currentPath'=(32 * min(1, node10path32) - currentPath*(min(1,node10path32) - 1))) & (success'=min(1, node10path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path33 * min(1,node10path33) - currentNode*(min(1, node10path33) - 1))) &  (currentPath'=(33 * min(1, node10path33) - currentPath*(min(1,node10path33) - 1))) & (success'=min(1, node10path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path34 * min(1,node10path34) - currentNode*(min(1, node10path34) - 1))) &  (currentPath'=(34 * min(1, node10path34) - currentPath*(min(1,node10path34) - 1))) & (success'=min(1, node10path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path35 * min(1,node10path35) - currentNode*(min(1, node10path35) - 1))) &  (currentPath'=(35 * min(1, node10path35) - currentPath*(min(1,node10path35) - 1))) & (success'=min(1, node10path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path36 * min(1,node10path36) - currentNode*(min(1, node10path36) - 1))) &  (currentPath'=(36 * min(1, node10path36) - currentPath*(min(1,node10path36) - 1))) & (success'=min(1, node10path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path37 * min(1,node10path37) - currentNode*(min(1, node10path37) - 1))) &  (currentPath'=(37 * min(1, node10path37) - currentPath*(min(1,node10path37) - 1))) & (success'=min(1, node10path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path38 * min(1,node10path38) - currentNode*(min(1, node10path38) - 1))) &  (currentPath'=(38 * min(1, node10path38) - currentPath*(min(1,node10path38) - 1))) & (success'=min(1, node10path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path39 * min(1,node10path39) - currentNode*(min(1, node10path39) - 1))) &  (currentPath'=(39 * min(1, node10path39) - currentPath*(min(1,node10path39) - 1))) & (success'=min(1, node10path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path40 * min(1,node10path40) - currentNode*(min(1, node10path40) - 1))) &  (currentPath'=(40 * min(1, node10path40) - currentPath*(min(1,node10path40) - 1))) & (success'=min(1, node10path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path41 * min(1,node10path41) - currentNode*(min(1, node10path41) - 1))) &  (currentPath'=(41 * min(1, node10path41) - currentPath*(min(1,node10path41) - 1))) & (success'=min(1, node10path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path42 * min(1,node10path42) - currentNode*(min(1, node10path42) - 1))) &  (currentPath'=(42 * min(1, node10path42) - currentPath*(min(1,node10path42) - 1))) & (success'=min(1, node10path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path43 * min(1,node10path43) - currentNode*(min(1, node10path43) - 1))) &  (currentPath'=(43 * min(1, node10path43) - currentPath*(min(1,node10path43) - 1))) & (success'=min(1, node10path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path44 * min(1,node10path44) - currentNode*(min(1, node10path44) - 1))) &  (currentPath'=(44 * min(1, node10path44) - currentPath*(min(1,node10path44) - 1))) & (success'=min(1, node10path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path45 * min(1,node10path45) - currentNode*(min(1, node10path45) - 1))) &  (currentPath'=(45 * min(1, node10path45) - currentPath*(min(1,node10path45) - 1))) & (success'=min(1, node10path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path46 * min(1,node10path46) - currentNode*(min(1, node10path46) - 1))) &  (currentPath'=(46 * min(1, node10path46) - currentPath*(min(1,node10path46) - 1))) & (success'=min(1, node10path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path47 * min(1,node10path47) - currentNode*(min(1, node10path47) - 1))) &  (currentPath'=(47 * min(1, node10path47) - currentPath*(min(1,node10path47) - 1))) & (success'=min(1, node10path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path48 * min(1,node10path48) - currentNode*(min(1, node10path48) - 1))) &  (currentPath'=(48 * min(1, node10path48) - currentPath*(min(1,node10path48) - 1))) & (success'=min(1, node10path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path49 * min(1,node10path49) - currentNode*(min(1, node10path49) - 1))) &  (currentPath'=(49 * min(1, node10path49) - currentPath*(min(1,node10path49) - 1))) & (success'=min(1, node10path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path50 * min(1,node10path50) - currentNode*(min(1, node10path50) - 1))) &  (currentPath'=(50 * min(1, node10path50) - currentPath*(min(1,node10path50) - 1))) & (success'=min(1, node10path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path51 * min(1,node10path51) - currentNode*(min(1, node10path51) - 1))) &  (currentPath'=(51 * min(1, node10path51) - currentPath*(min(1,node10path51) - 1))) & (success'=min(1, node10path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path52 * min(1,node10path52) - currentNode*(min(1, node10path52) - 1))) &  (currentPath'=(52 * min(1, node10path52) - currentPath*(min(1,node10path52) - 1))) & (success'=min(1, node10path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path53 * min(1,node10path53) - currentNode*(min(1, node10path53) - 1))) &  (currentPath'=(53 * min(1, node10path53) - currentPath*(min(1,node10path53) - 1))) & (success'=min(1, node10path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path54 * min(1,node10path54) - currentNode*(min(1, node10path54) - 1))) &  (currentPath'=(54 * min(1, node10path54) - currentPath*(min(1,node10path54) - 1))) & (success'=min(1, node10path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path55 * min(1,node10path55) - currentNode*(min(1, node10path55) - 1))) &  (currentPath'=(55 * min(1, node10path55) - currentPath*(min(1,node10path55) - 1))) & (success'=min(1, node10path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path56 * min(1,node10path56) - currentNode*(min(1, node10path56) - 1))) &  (currentPath'=(56 * min(1, node10path56) - currentPath*(min(1,node10path56) - 1))) & (success'=min(1, node10path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path57 * min(1,node10path57) - currentNode*(min(1, node10path57) - 1))) &  (currentPath'=(57 * min(1, node10path57) - currentPath*(min(1,node10path57) - 1))) & (success'=min(1, node10path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path58 * min(1,node10path58) - currentNode*(min(1, node10path58) - 1))) &  (currentPath'=(58 * min(1, node10path58) - currentPath*(min(1,node10path58) - 1))) & (success'=min(1, node10path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path59 * min(1,node10path59) - currentNode*(min(1, node10path59) - 1))) &  (currentPath'=(59 * min(1, node10path59) - currentPath*(min(1,node10path59) - 1))) & (success'=min(1, node10path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path60 * min(1,node10path60) - currentNode*(min(1, node10path60) - 1))) &  (currentPath'=(60 * min(1, node10path60) - currentPath*(min(1,node10path60) - 1))) & (success'=min(1, node10path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path61 * min(1,node10path61) - currentNode*(min(1, node10path61) - 1))) &  (currentPath'=(61 * min(1, node10path61) - currentPath*(min(1,node10path61) - 1))) & (success'=min(1, node10path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path62 * min(1,node10path62) - currentNode*(min(1, node10path62) - 1))) &  (currentPath'=(62 * min(1, node10path62) - currentPath*(min(1,node10path62) - 1))) & (success'=min(1, node10path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path63 * min(1,node10path63) - currentNode*(min(1, node10path63) - 1))) &  (currentPath'=(63 * min(1, node10path63) - currentPath*(min(1,node10path63) - 1))) & (success'=min(1, node10path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path64 * min(1,node10path64) - currentNode*(min(1, node10path64) - 1))) &  (currentPath'=(64 * min(1, node10path64) - currentPath*(min(1,node10path64) - 1))) & (success'=min(1, node10path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path65 * min(1,node10path65) - currentNode*(min(1, node10path65) - 1))) &  (currentPath'=(65 * min(1, node10path65) - currentPath*(min(1,node10path65) - 1))) & (success'=min(1, node10path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path66 * min(1,node10path66) - currentNode*(min(1, node10path66) - 1))) &  (currentPath'=(66 * min(1, node10path66) - currentPath*(min(1,node10path66) - 1))) & (success'=min(1, node10path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path67 * min(1,node10path67) - currentNode*(min(1, node10path67) - 1))) &  (currentPath'=(67 * min(1, node10path67) - currentPath*(min(1,node10path67) - 1))) & (success'=min(1, node10path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path68 * min(1,node10path68) - currentNode*(min(1, node10path68) - 1))) &  (currentPath'=(68 * min(1, node10path68) - currentPath*(min(1,node10path68) - 1))) & (success'=min(1, node10path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path69 * min(1,node10path69) - currentNode*(min(1, node10path69) - 1))) &  (currentPath'=(69 * min(1, node10path69) - currentPath*(min(1,node10path69) - 1))) & (success'=min(1, node10path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path70 * min(1,node10path70) - currentNode*(min(1, node10path70) - 1))) &  (currentPath'=(70 * min(1, node10path70) - currentPath*(min(1,node10path70) - 1))) & (success'=min(1, node10path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path71 * min(1,node10path71) - currentNode*(min(1, node10path71) - 1))) &  (currentPath'=(71 * min(1, node10path71) - currentPath*(min(1,node10path71) - 1))) & (success'=min(1, node10path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path72 * min(1,node10path72) - currentNode*(min(1, node10path72) - 1))) &  (currentPath'=(72 * min(1, node10path72) - currentPath*(min(1,node10path72) - 1))) & (success'=min(1, node10path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path73 * min(1,node10path73) - currentNode*(min(1, node10path73) - 1))) &  (currentPath'=(73 * min(1, node10path73) - currentPath*(min(1,node10path73) - 1))) & (success'=min(1, node10path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path74 * min(1,node10path74) - currentNode*(min(1, node10path74) - 1))) &  (currentPath'=(74 * min(1, node10path74) - currentPath*(min(1,node10path74) - 1))) & (success'=min(1, node10path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path75 * min(1,node10path75) - currentNode*(min(1, node10path75) - 1))) &  (currentPath'=(75 * min(1, node10path75) - currentPath*(min(1,node10path75) - 1))) & (success'=min(1, node10path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path76 * min(1,node10path76) - currentNode*(min(1, node10path76) - 1))) &  (currentPath'=(76 * min(1, node10path76) - currentPath*(min(1,node10path76) - 1))) & (success'=min(1, node10path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path77 * min(1,node10path77) - currentNode*(min(1, node10path77) - 1))) &  (currentPath'=(77 * min(1, node10path77) - currentPath*(min(1,node10path77) - 1))) & (success'=min(1, node10path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path78 * min(1,node10path78) - currentNode*(min(1, node10path78) - 1))) &  (currentPath'=(78 * min(1, node10path78) - currentPath*(min(1,node10path78) - 1))) & (success'=min(1, node10path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path79 * min(1,node10path79) - currentNode*(min(1, node10path79) - 1))) &  (currentPath'=(79 * min(1, node10path79) - currentPath*(min(1,node10path79) - 1))) & (success'=min(1, node10path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path80 * min(1,node10path80) - currentNode*(min(1, node10path80) - 1))) &  (currentPath'=(80 * min(1, node10path80) - currentPath*(min(1,node10path80) - 1))) & (success'=min(1, node10path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path81 * min(1,node10path81) - currentNode*(min(1, node10path81) - 1))) &  (currentPath'=(81 * min(1, node10path81) - currentPath*(min(1,node10path81) - 1))) & (success'=min(1, node10path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path82 * min(1,node10path82) - currentNode*(min(1, node10path82) - 1))) &  (currentPath'=(82 * min(1, node10path82) - currentPath*(min(1,node10path82) - 1))) & (success'=min(1, node10path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path83 * min(1,node10path83) - currentNode*(min(1, node10path83) - 1))) &  (currentPath'=(83 * min(1, node10path83) - currentPath*(min(1,node10path83) - 1))) & (success'=min(1, node10path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path84 * min(1,node10path84) - currentNode*(min(1, node10path84) - 1))) &  (currentPath'=(84 * min(1, node10path84) - currentPath*(min(1,node10path84) - 1))) & (success'=min(1, node10path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path85 * min(1,node10path85) - currentNode*(min(1, node10path85) - 1))) &  (currentPath'=(85 * min(1, node10path85) - currentPath*(min(1,node10path85) - 1))) & (success'=min(1, node10path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path86 * min(1,node10path86) - currentNode*(min(1, node10path86) - 1))) &  (currentPath'=(86 * min(1, node10path86) - currentPath*(min(1,node10path86) - 1))) & (success'=min(1, node10path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path87 * min(1,node10path87) - currentNode*(min(1, node10path87) - 1))) &  (currentPath'=(87 * min(1, node10path87) - currentPath*(min(1,node10path87) - 1))) & (success'=min(1, node10path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path88 * min(1,node10path88) - currentNode*(min(1, node10path88) - 1))) &  (currentPath'=(88 * min(1, node10path88) - currentPath*(min(1,node10path88) - 1))) & (success'=min(1, node10path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path89 * min(1,node10path89) - currentNode*(min(1, node10path89) - 1))) &  (currentPath'=(89 * min(1, node10path89) - currentPath*(min(1,node10path89) - 1))) & (success'=min(1, node10path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path90 * min(1,node10path90) - currentNode*(min(1, node10path90) - 1))) &  (currentPath'=(90 * min(1, node10path90) - currentPath*(min(1,node10path90) - 1))) & (success'=min(1, node10path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path91 * min(1,node10path91) - currentNode*(min(1, node10path91) - 1))) &  (currentPath'=(91 * min(1, node10path91) - currentPath*(min(1,node10path91) - 1))) & (success'=min(1, node10path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path92 * min(1,node10path92) - currentNode*(min(1, node10path92) - 1))) &  (currentPath'=(92 * min(1, node10path92) - currentPath*(min(1,node10path92) - 1))) & (success'=min(1, node10path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path93 * min(1,node10path93) - currentNode*(min(1, node10path93) - 1))) &  (currentPath'=(93 * min(1, node10path93) - currentPath*(min(1,node10path93) - 1))) & (success'=min(1, node10path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path94 * min(1,node10path94) - currentNode*(min(1, node10path94) - 1))) &  (currentPath'=(94 * min(1, node10path94) - currentPath*(min(1,node10path94) - 1))) & (success'=min(1, node10path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path95 * min(1,node10path95) - currentNode*(min(1, node10path95) - 1))) &  (currentPath'=(95 * min(1, node10path95) - currentPath*(min(1,node10path95) - 1))) & (success'=min(1, node10path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path96 * min(1,node10path96) - currentNode*(min(1, node10path96) - 1))) &  (currentPath'=(96 * min(1, node10path96) - currentPath*(min(1,node10path96) - 1))) & (success'=min(1, node10path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path97 * min(1,node10path97) - currentNode*(min(1, node10path97) - 1))) &  (currentPath'=(97 * min(1, node10path97) - currentPath*(min(1,node10path97) - 1))) & (success'=min(1, node10path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path98 * min(1,node10path98) - currentNode*(min(1, node10path98) - 1))) &  (currentPath'=(98 * min(1, node10path98) - currentPath*(min(1,node10path98) - 1))) & (success'=min(1, node10path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path99 * min(1,node10path99) - currentNode*(min(1, node10path99) - 1))) &  (currentPath'=(99 * min(1, node10path99) - currentPath*(min(1,node10path99) - 1))) & (success'=min(1, node10path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node10path100 * min(1,node10path100) - currentNode*(min(1, node10path100) - 1))) &  (currentPath'=(100 * min(1, node10path100) - currentPath*(min(1,node10path100) - 1))) & (success'=min(1, node10path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 11) ->
 numPathsInv: (currentNode'=(node11path1 * min(1,node11path1) - currentNode*(min(1, node11path1) - 1))) &  (currentPath'=(1 * min(1, node11path1) - currentPath*(min(1,node11path1) - 1))) & (success'=min(1, node11path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path2 * min(1,node11path2) - currentNode*(min(1, node11path2) - 1))) &  (currentPath'=(2 * min(1, node11path2) - currentPath*(min(1,node11path2) - 1))) & (success'=min(1, node11path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path3 * min(1,node11path3) - currentNode*(min(1, node11path3) - 1))) &  (currentPath'=(3 * min(1, node11path3) - currentPath*(min(1,node11path3) - 1))) & (success'=min(1, node11path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path4 * min(1,node11path4) - currentNode*(min(1, node11path4) - 1))) &  (currentPath'=(4 * min(1, node11path4) - currentPath*(min(1,node11path4) - 1))) & (success'=min(1, node11path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path5 * min(1,node11path5) - currentNode*(min(1, node11path5) - 1))) &  (currentPath'=(5 * min(1, node11path5) - currentPath*(min(1,node11path5) - 1))) & (success'=min(1, node11path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path6 * min(1,node11path6) - currentNode*(min(1, node11path6) - 1))) &  (currentPath'=(6 * min(1, node11path6) - currentPath*(min(1,node11path6) - 1))) & (success'=min(1, node11path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path7 * min(1,node11path7) - currentNode*(min(1, node11path7) - 1))) &  (currentPath'=(7 * min(1, node11path7) - currentPath*(min(1,node11path7) - 1))) & (success'=min(1, node11path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path8 * min(1,node11path8) - currentNode*(min(1, node11path8) - 1))) &  (currentPath'=(8 * min(1, node11path8) - currentPath*(min(1,node11path8) - 1))) & (success'=min(1, node11path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path9 * min(1,node11path9) - currentNode*(min(1, node11path9) - 1))) &  (currentPath'=(9 * min(1, node11path9) - currentPath*(min(1,node11path9) - 1))) & (success'=min(1, node11path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path10 * min(1,node11path10) - currentNode*(min(1, node11path10) - 1))) &  (currentPath'=(10 * min(1, node11path10) - currentPath*(min(1,node11path10) - 1))) & (success'=min(1, node11path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path11 * min(1,node11path11) - currentNode*(min(1, node11path11) - 1))) &  (currentPath'=(11 * min(1, node11path11) - currentPath*(min(1,node11path11) - 1))) & (success'=min(1, node11path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path12 * min(1,node11path12) - currentNode*(min(1, node11path12) - 1))) &  (currentPath'=(12 * min(1, node11path12) - currentPath*(min(1,node11path12) - 1))) & (success'=min(1, node11path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path13 * min(1,node11path13) - currentNode*(min(1, node11path13) - 1))) &  (currentPath'=(13 * min(1, node11path13) - currentPath*(min(1,node11path13) - 1))) & (success'=min(1, node11path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path14 * min(1,node11path14) - currentNode*(min(1, node11path14) - 1))) &  (currentPath'=(14 * min(1, node11path14) - currentPath*(min(1,node11path14) - 1))) & (success'=min(1, node11path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path15 * min(1,node11path15) - currentNode*(min(1, node11path15) - 1))) &  (currentPath'=(15 * min(1, node11path15) - currentPath*(min(1,node11path15) - 1))) & (success'=min(1, node11path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path16 * min(1,node11path16) - currentNode*(min(1, node11path16) - 1))) &  (currentPath'=(16 * min(1, node11path16) - currentPath*(min(1,node11path16) - 1))) & (success'=min(1, node11path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path17 * min(1,node11path17) - currentNode*(min(1, node11path17) - 1))) &  (currentPath'=(17 * min(1, node11path17) - currentPath*(min(1,node11path17) - 1))) & (success'=min(1, node11path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path18 * min(1,node11path18) - currentNode*(min(1, node11path18) - 1))) &  (currentPath'=(18 * min(1, node11path18) - currentPath*(min(1,node11path18) - 1))) & (success'=min(1, node11path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path19 * min(1,node11path19) - currentNode*(min(1, node11path19) - 1))) &  (currentPath'=(19 * min(1, node11path19) - currentPath*(min(1,node11path19) - 1))) & (success'=min(1, node11path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path20 * min(1,node11path20) - currentNode*(min(1, node11path20) - 1))) &  (currentPath'=(20 * min(1, node11path20) - currentPath*(min(1,node11path20) - 1))) & (success'=min(1, node11path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path21 * min(1,node11path21) - currentNode*(min(1, node11path21) - 1))) &  (currentPath'=(21 * min(1, node11path21) - currentPath*(min(1,node11path21) - 1))) & (success'=min(1, node11path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path22 * min(1,node11path22) - currentNode*(min(1, node11path22) - 1))) &  (currentPath'=(22 * min(1, node11path22) - currentPath*(min(1,node11path22) - 1))) & (success'=min(1, node11path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path23 * min(1,node11path23) - currentNode*(min(1, node11path23) - 1))) &  (currentPath'=(23 * min(1, node11path23) - currentPath*(min(1,node11path23) - 1))) & (success'=min(1, node11path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path24 * min(1,node11path24) - currentNode*(min(1, node11path24) - 1))) &  (currentPath'=(24 * min(1, node11path24) - currentPath*(min(1,node11path24) - 1))) & (success'=min(1, node11path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path25 * min(1,node11path25) - currentNode*(min(1, node11path25) - 1))) &  (currentPath'=(25 * min(1, node11path25) - currentPath*(min(1,node11path25) - 1))) & (success'=min(1, node11path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path26 * min(1,node11path26) - currentNode*(min(1, node11path26) - 1))) &  (currentPath'=(26 * min(1, node11path26) - currentPath*(min(1,node11path26) - 1))) & (success'=min(1, node11path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path27 * min(1,node11path27) - currentNode*(min(1, node11path27) - 1))) &  (currentPath'=(27 * min(1, node11path27) - currentPath*(min(1,node11path27) - 1))) & (success'=min(1, node11path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path28 * min(1,node11path28) - currentNode*(min(1, node11path28) - 1))) &  (currentPath'=(28 * min(1, node11path28) - currentPath*(min(1,node11path28) - 1))) & (success'=min(1, node11path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path29 * min(1,node11path29) - currentNode*(min(1, node11path29) - 1))) &  (currentPath'=(29 * min(1, node11path29) - currentPath*(min(1,node11path29) - 1))) & (success'=min(1, node11path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path30 * min(1,node11path30) - currentNode*(min(1, node11path30) - 1))) &  (currentPath'=(30 * min(1, node11path30) - currentPath*(min(1,node11path30) - 1))) & (success'=min(1, node11path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path31 * min(1,node11path31) - currentNode*(min(1, node11path31) - 1))) &  (currentPath'=(31 * min(1, node11path31) - currentPath*(min(1,node11path31) - 1))) & (success'=min(1, node11path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path32 * min(1,node11path32) - currentNode*(min(1, node11path32) - 1))) &  (currentPath'=(32 * min(1, node11path32) - currentPath*(min(1,node11path32) - 1))) & (success'=min(1, node11path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path33 * min(1,node11path33) - currentNode*(min(1, node11path33) - 1))) &  (currentPath'=(33 * min(1, node11path33) - currentPath*(min(1,node11path33) - 1))) & (success'=min(1, node11path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path34 * min(1,node11path34) - currentNode*(min(1, node11path34) - 1))) &  (currentPath'=(34 * min(1, node11path34) - currentPath*(min(1,node11path34) - 1))) & (success'=min(1, node11path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path35 * min(1,node11path35) - currentNode*(min(1, node11path35) - 1))) &  (currentPath'=(35 * min(1, node11path35) - currentPath*(min(1,node11path35) - 1))) & (success'=min(1, node11path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path36 * min(1,node11path36) - currentNode*(min(1, node11path36) - 1))) &  (currentPath'=(36 * min(1, node11path36) - currentPath*(min(1,node11path36) - 1))) & (success'=min(1, node11path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path37 * min(1,node11path37) - currentNode*(min(1, node11path37) - 1))) &  (currentPath'=(37 * min(1, node11path37) - currentPath*(min(1,node11path37) - 1))) & (success'=min(1, node11path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path38 * min(1,node11path38) - currentNode*(min(1, node11path38) - 1))) &  (currentPath'=(38 * min(1, node11path38) - currentPath*(min(1,node11path38) - 1))) & (success'=min(1, node11path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path39 * min(1,node11path39) - currentNode*(min(1, node11path39) - 1))) &  (currentPath'=(39 * min(1, node11path39) - currentPath*(min(1,node11path39) - 1))) & (success'=min(1, node11path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path40 * min(1,node11path40) - currentNode*(min(1, node11path40) - 1))) &  (currentPath'=(40 * min(1, node11path40) - currentPath*(min(1,node11path40) - 1))) & (success'=min(1, node11path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path41 * min(1,node11path41) - currentNode*(min(1, node11path41) - 1))) &  (currentPath'=(41 * min(1, node11path41) - currentPath*(min(1,node11path41) - 1))) & (success'=min(1, node11path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path42 * min(1,node11path42) - currentNode*(min(1, node11path42) - 1))) &  (currentPath'=(42 * min(1, node11path42) - currentPath*(min(1,node11path42) - 1))) & (success'=min(1, node11path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path43 * min(1,node11path43) - currentNode*(min(1, node11path43) - 1))) &  (currentPath'=(43 * min(1, node11path43) - currentPath*(min(1,node11path43) - 1))) & (success'=min(1, node11path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path44 * min(1,node11path44) - currentNode*(min(1, node11path44) - 1))) &  (currentPath'=(44 * min(1, node11path44) - currentPath*(min(1,node11path44) - 1))) & (success'=min(1, node11path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path45 * min(1,node11path45) - currentNode*(min(1, node11path45) - 1))) &  (currentPath'=(45 * min(1, node11path45) - currentPath*(min(1,node11path45) - 1))) & (success'=min(1, node11path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path46 * min(1,node11path46) - currentNode*(min(1, node11path46) - 1))) &  (currentPath'=(46 * min(1, node11path46) - currentPath*(min(1,node11path46) - 1))) & (success'=min(1, node11path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path47 * min(1,node11path47) - currentNode*(min(1, node11path47) - 1))) &  (currentPath'=(47 * min(1, node11path47) - currentPath*(min(1,node11path47) - 1))) & (success'=min(1, node11path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path48 * min(1,node11path48) - currentNode*(min(1, node11path48) - 1))) &  (currentPath'=(48 * min(1, node11path48) - currentPath*(min(1,node11path48) - 1))) & (success'=min(1, node11path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path49 * min(1,node11path49) - currentNode*(min(1, node11path49) - 1))) &  (currentPath'=(49 * min(1, node11path49) - currentPath*(min(1,node11path49) - 1))) & (success'=min(1, node11path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path50 * min(1,node11path50) - currentNode*(min(1, node11path50) - 1))) &  (currentPath'=(50 * min(1, node11path50) - currentPath*(min(1,node11path50) - 1))) & (success'=min(1, node11path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path51 * min(1,node11path51) - currentNode*(min(1, node11path51) - 1))) &  (currentPath'=(51 * min(1, node11path51) - currentPath*(min(1,node11path51) - 1))) & (success'=min(1, node11path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path52 * min(1,node11path52) - currentNode*(min(1, node11path52) - 1))) &  (currentPath'=(52 * min(1, node11path52) - currentPath*(min(1,node11path52) - 1))) & (success'=min(1, node11path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path53 * min(1,node11path53) - currentNode*(min(1, node11path53) - 1))) &  (currentPath'=(53 * min(1, node11path53) - currentPath*(min(1,node11path53) - 1))) & (success'=min(1, node11path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path54 * min(1,node11path54) - currentNode*(min(1, node11path54) - 1))) &  (currentPath'=(54 * min(1, node11path54) - currentPath*(min(1,node11path54) - 1))) & (success'=min(1, node11path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path55 * min(1,node11path55) - currentNode*(min(1, node11path55) - 1))) &  (currentPath'=(55 * min(1, node11path55) - currentPath*(min(1,node11path55) - 1))) & (success'=min(1, node11path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path56 * min(1,node11path56) - currentNode*(min(1, node11path56) - 1))) &  (currentPath'=(56 * min(1, node11path56) - currentPath*(min(1,node11path56) - 1))) & (success'=min(1, node11path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path57 * min(1,node11path57) - currentNode*(min(1, node11path57) - 1))) &  (currentPath'=(57 * min(1, node11path57) - currentPath*(min(1,node11path57) - 1))) & (success'=min(1, node11path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path58 * min(1,node11path58) - currentNode*(min(1, node11path58) - 1))) &  (currentPath'=(58 * min(1, node11path58) - currentPath*(min(1,node11path58) - 1))) & (success'=min(1, node11path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path59 * min(1,node11path59) - currentNode*(min(1, node11path59) - 1))) &  (currentPath'=(59 * min(1, node11path59) - currentPath*(min(1,node11path59) - 1))) & (success'=min(1, node11path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path60 * min(1,node11path60) - currentNode*(min(1, node11path60) - 1))) &  (currentPath'=(60 * min(1, node11path60) - currentPath*(min(1,node11path60) - 1))) & (success'=min(1, node11path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path61 * min(1,node11path61) - currentNode*(min(1, node11path61) - 1))) &  (currentPath'=(61 * min(1, node11path61) - currentPath*(min(1,node11path61) - 1))) & (success'=min(1, node11path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path62 * min(1,node11path62) - currentNode*(min(1, node11path62) - 1))) &  (currentPath'=(62 * min(1, node11path62) - currentPath*(min(1,node11path62) - 1))) & (success'=min(1, node11path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path63 * min(1,node11path63) - currentNode*(min(1, node11path63) - 1))) &  (currentPath'=(63 * min(1, node11path63) - currentPath*(min(1,node11path63) - 1))) & (success'=min(1, node11path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path64 * min(1,node11path64) - currentNode*(min(1, node11path64) - 1))) &  (currentPath'=(64 * min(1, node11path64) - currentPath*(min(1,node11path64) - 1))) & (success'=min(1, node11path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path65 * min(1,node11path65) - currentNode*(min(1, node11path65) - 1))) &  (currentPath'=(65 * min(1, node11path65) - currentPath*(min(1,node11path65) - 1))) & (success'=min(1, node11path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path66 * min(1,node11path66) - currentNode*(min(1, node11path66) - 1))) &  (currentPath'=(66 * min(1, node11path66) - currentPath*(min(1,node11path66) - 1))) & (success'=min(1, node11path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path67 * min(1,node11path67) - currentNode*(min(1, node11path67) - 1))) &  (currentPath'=(67 * min(1, node11path67) - currentPath*(min(1,node11path67) - 1))) & (success'=min(1, node11path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path68 * min(1,node11path68) - currentNode*(min(1, node11path68) - 1))) &  (currentPath'=(68 * min(1, node11path68) - currentPath*(min(1,node11path68) - 1))) & (success'=min(1, node11path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path69 * min(1,node11path69) - currentNode*(min(1, node11path69) - 1))) &  (currentPath'=(69 * min(1, node11path69) - currentPath*(min(1,node11path69) - 1))) & (success'=min(1, node11path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path70 * min(1,node11path70) - currentNode*(min(1, node11path70) - 1))) &  (currentPath'=(70 * min(1, node11path70) - currentPath*(min(1,node11path70) - 1))) & (success'=min(1, node11path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path71 * min(1,node11path71) - currentNode*(min(1, node11path71) - 1))) &  (currentPath'=(71 * min(1, node11path71) - currentPath*(min(1,node11path71) - 1))) & (success'=min(1, node11path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path72 * min(1,node11path72) - currentNode*(min(1, node11path72) - 1))) &  (currentPath'=(72 * min(1, node11path72) - currentPath*(min(1,node11path72) - 1))) & (success'=min(1, node11path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path73 * min(1,node11path73) - currentNode*(min(1, node11path73) - 1))) &  (currentPath'=(73 * min(1, node11path73) - currentPath*(min(1,node11path73) - 1))) & (success'=min(1, node11path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path74 * min(1,node11path74) - currentNode*(min(1, node11path74) - 1))) &  (currentPath'=(74 * min(1, node11path74) - currentPath*(min(1,node11path74) - 1))) & (success'=min(1, node11path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path75 * min(1,node11path75) - currentNode*(min(1, node11path75) - 1))) &  (currentPath'=(75 * min(1, node11path75) - currentPath*(min(1,node11path75) - 1))) & (success'=min(1, node11path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path76 * min(1,node11path76) - currentNode*(min(1, node11path76) - 1))) &  (currentPath'=(76 * min(1, node11path76) - currentPath*(min(1,node11path76) - 1))) & (success'=min(1, node11path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path77 * min(1,node11path77) - currentNode*(min(1, node11path77) - 1))) &  (currentPath'=(77 * min(1, node11path77) - currentPath*(min(1,node11path77) - 1))) & (success'=min(1, node11path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path78 * min(1,node11path78) - currentNode*(min(1, node11path78) - 1))) &  (currentPath'=(78 * min(1, node11path78) - currentPath*(min(1,node11path78) - 1))) & (success'=min(1, node11path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path79 * min(1,node11path79) - currentNode*(min(1, node11path79) - 1))) &  (currentPath'=(79 * min(1, node11path79) - currentPath*(min(1,node11path79) - 1))) & (success'=min(1, node11path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path80 * min(1,node11path80) - currentNode*(min(1, node11path80) - 1))) &  (currentPath'=(80 * min(1, node11path80) - currentPath*(min(1,node11path80) - 1))) & (success'=min(1, node11path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path81 * min(1,node11path81) - currentNode*(min(1, node11path81) - 1))) &  (currentPath'=(81 * min(1, node11path81) - currentPath*(min(1,node11path81) - 1))) & (success'=min(1, node11path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path82 * min(1,node11path82) - currentNode*(min(1, node11path82) - 1))) &  (currentPath'=(82 * min(1, node11path82) - currentPath*(min(1,node11path82) - 1))) & (success'=min(1, node11path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path83 * min(1,node11path83) - currentNode*(min(1, node11path83) - 1))) &  (currentPath'=(83 * min(1, node11path83) - currentPath*(min(1,node11path83) - 1))) & (success'=min(1, node11path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path84 * min(1,node11path84) - currentNode*(min(1, node11path84) - 1))) &  (currentPath'=(84 * min(1, node11path84) - currentPath*(min(1,node11path84) - 1))) & (success'=min(1, node11path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path85 * min(1,node11path85) - currentNode*(min(1, node11path85) - 1))) &  (currentPath'=(85 * min(1, node11path85) - currentPath*(min(1,node11path85) - 1))) & (success'=min(1, node11path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path86 * min(1,node11path86) - currentNode*(min(1, node11path86) - 1))) &  (currentPath'=(86 * min(1, node11path86) - currentPath*(min(1,node11path86) - 1))) & (success'=min(1, node11path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path87 * min(1,node11path87) - currentNode*(min(1, node11path87) - 1))) &  (currentPath'=(87 * min(1, node11path87) - currentPath*(min(1,node11path87) - 1))) & (success'=min(1, node11path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path88 * min(1,node11path88) - currentNode*(min(1, node11path88) - 1))) &  (currentPath'=(88 * min(1, node11path88) - currentPath*(min(1,node11path88) - 1))) & (success'=min(1, node11path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path89 * min(1,node11path89) - currentNode*(min(1, node11path89) - 1))) &  (currentPath'=(89 * min(1, node11path89) - currentPath*(min(1,node11path89) - 1))) & (success'=min(1, node11path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path90 * min(1,node11path90) - currentNode*(min(1, node11path90) - 1))) &  (currentPath'=(90 * min(1, node11path90) - currentPath*(min(1,node11path90) - 1))) & (success'=min(1, node11path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path91 * min(1,node11path91) - currentNode*(min(1, node11path91) - 1))) &  (currentPath'=(91 * min(1, node11path91) - currentPath*(min(1,node11path91) - 1))) & (success'=min(1, node11path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path92 * min(1,node11path92) - currentNode*(min(1, node11path92) - 1))) &  (currentPath'=(92 * min(1, node11path92) - currentPath*(min(1,node11path92) - 1))) & (success'=min(1, node11path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path93 * min(1,node11path93) - currentNode*(min(1, node11path93) - 1))) &  (currentPath'=(93 * min(1, node11path93) - currentPath*(min(1,node11path93) - 1))) & (success'=min(1, node11path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path94 * min(1,node11path94) - currentNode*(min(1, node11path94) - 1))) &  (currentPath'=(94 * min(1, node11path94) - currentPath*(min(1,node11path94) - 1))) & (success'=min(1, node11path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path95 * min(1,node11path95) - currentNode*(min(1, node11path95) - 1))) &  (currentPath'=(95 * min(1, node11path95) - currentPath*(min(1,node11path95) - 1))) & (success'=min(1, node11path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path96 * min(1,node11path96) - currentNode*(min(1, node11path96) - 1))) &  (currentPath'=(96 * min(1, node11path96) - currentPath*(min(1,node11path96) - 1))) & (success'=min(1, node11path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path97 * min(1,node11path97) - currentNode*(min(1, node11path97) - 1))) &  (currentPath'=(97 * min(1, node11path97) - currentPath*(min(1,node11path97) - 1))) & (success'=min(1, node11path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path98 * min(1,node11path98) - currentNode*(min(1, node11path98) - 1))) &  (currentPath'=(98 * min(1, node11path98) - currentPath*(min(1,node11path98) - 1))) & (success'=min(1, node11path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path99 * min(1,node11path99) - currentNode*(min(1, node11path99) - 1))) &  (currentPath'=(99 * min(1, node11path99) - currentPath*(min(1,node11path99) - 1))) & (success'=min(1, node11path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node11path100 * min(1,node11path100) - currentNode*(min(1, node11path100) - 1))) &  (currentPath'=(100 * min(1, node11path100) - currentPath*(min(1,node11path100) - 1))) & (success'=min(1, node11path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 12) ->
 numPathsInv: (currentNode'=(node12path1 * min(1,node12path1) - currentNode*(min(1, node12path1) - 1))) &  (currentPath'=(1 * min(1, node12path1) - currentPath*(min(1,node12path1) - 1))) & (success'=min(1, node12path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path2 * min(1,node12path2) - currentNode*(min(1, node12path2) - 1))) &  (currentPath'=(2 * min(1, node12path2) - currentPath*(min(1,node12path2) - 1))) & (success'=min(1, node12path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path3 * min(1,node12path3) - currentNode*(min(1, node12path3) - 1))) &  (currentPath'=(3 * min(1, node12path3) - currentPath*(min(1,node12path3) - 1))) & (success'=min(1, node12path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path4 * min(1,node12path4) - currentNode*(min(1, node12path4) - 1))) &  (currentPath'=(4 * min(1, node12path4) - currentPath*(min(1,node12path4) - 1))) & (success'=min(1, node12path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path5 * min(1,node12path5) - currentNode*(min(1, node12path5) - 1))) &  (currentPath'=(5 * min(1, node12path5) - currentPath*(min(1,node12path5) - 1))) & (success'=min(1, node12path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path6 * min(1,node12path6) - currentNode*(min(1, node12path6) - 1))) &  (currentPath'=(6 * min(1, node12path6) - currentPath*(min(1,node12path6) - 1))) & (success'=min(1, node12path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path7 * min(1,node12path7) - currentNode*(min(1, node12path7) - 1))) &  (currentPath'=(7 * min(1, node12path7) - currentPath*(min(1,node12path7) - 1))) & (success'=min(1, node12path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path8 * min(1,node12path8) - currentNode*(min(1, node12path8) - 1))) &  (currentPath'=(8 * min(1, node12path8) - currentPath*(min(1,node12path8) - 1))) & (success'=min(1, node12path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path9 * min(1,node12path9) - currentNode*(min(1, node12path9) - 1))) &  (currentPath'=(9 * min(1, node12path9) - currentPath*(min(1,node12path9) - 1))) & (success'=min(1, node12path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path10 * min(1,node12path10) - currentNode*(min(1, node12path10) - 1))) &  (currentPath'=(10 * min(1, node12path10) - currentPath*(min(1,node12path10) - 1))) & (success'=min(1, node12path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path11 * min(1,node12path11) - currentNode*(min(1, node12path11) - 1))) &  (currentPath'=(11 * min(1, node12path11) - currentPath*(min(1,node12path11) - 1))) & (success'=min(1, node12path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path12 * min(1,node12path12) - currentNode*(min(1, node12path12) - 1))) &  (currentPath'=(12 * min(1, node12path12) - currentPath*(min(1,node12path12) - 1))) & (success'=min(1, node12path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path13 * min(1,node12path13) - currentNode*(min(1, node12path13) - 1))) &  (currentPath'=(13 * min(1, node12path13) - currentPath*(min(1,node12path13) - 1))) & (success'=min(1, node12path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path14 * min(1,node12path14) - currentNode*(min(1, node12path14) - 1))) &  (currentPath'=(14 * min(1, node12path14) - currentPath*(min(1,node12path14) - 1))) & (success'=min(1, node12path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path15 * min(1,node12path15) - currentNode*(min(1, node12path15) - 1))) &  (currentPath'=(15 * min(1, node12path15) - currentPath*(min(1,node12path15) - 1))) & (success'=min(1, node12path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path16 * min(1,node12path16) - currentNode*(min(1, node12path16) - 1))) &  (currentPath'=(16 * min(1, node12path16) - currentPath*(min(1,node12path16) - 1))) & (success'=min(1, node12path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path17 * min(1,node12path17) - currentNode*(min(1, node12path17) - 1))) &  (currentPath'=(17 * min(1, node12path17) - currentPath*(min(1,node12path17) - 1))) & (success'=min(1, node12path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path18 * min(1,node12path18) - currentNode*(min(1, node12path18) - 1))) &  (currentPath'=(18 * min(1, node12path18) - currentPath*(min(1,node12path18) - 1))) & (success'=min(1, node12path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path19 * min(1,node12path19) - currentNode*(min(1, node12path19) - 1))) &  (currentPath'=(19 * min(1, node12path19) - currentPath*(min(1,node12path19) - 1))) & (success'=min(1, node12path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path20 * min(1,node12path20) - currentNode*(min(1, node12path20) - 1))) &  (currentPath'=(20 * min(1, node12path20) - currentPath*(min(1,node12path20) - 1))) & (success'=min(1, node12path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path21 * min(1,node12path21) - currentNode*(min(1, node12path21) - 1))) &  (currentPath'=(21 * min(1, node12path21) - currentPath*(min(1,node12path21) - 1))) & (success'=min(1, node12path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path22 * min(1,node12path22) - currentNode*(min(1, node12path22) - 1))) &  (currentPath'=(22 * min(1, node12path22) - currentPath*(min(1,node12path22) - 1))) & (success'=min(1, node12path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path23 * min(1,node12path23) - currentNode*(min(1, node12path23) - 1))) &  (currentPath'=(23 * min(1, node12path23) - currentPath*(min(1,node12path23) - 1))) & (success'=min(1, node12path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path24 * min(1,node12path24) - currentNode*(min(1, node12path24) - 1))) &  (currentPath'=(24 * min(1, node12path24) - currentPath*(min(1,node12path24) - 1))) & (success'=min(1, node12path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path25 * min(1,node12path25) - currentNode*(min(1, node12path25) - 1))) &  (currentPath'=(25 * min(1, node12path25) - currentPath*(min(1,node12path25) - 1))) & (success'=min(1, node12path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path26 * min(1,node12path26) - currentNode*(min(1, node12path26) - 1))) &  (currentPath'=(26 * min(1, node12path26) - currentPath*(min(1,node12path26) - 1))) & (success'=min(1, node12path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path27 * min(1,node12path27) - currentNode*(min(1, node12path27) - 1))) &  (currentPath'=(27 * min(1, node12path27) - currentPath*(min(1,node12path27) - 1))) & (success'=min(1, node12path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path28 * min(1,node12path28) - currentNode*(min(1, node12path28) - 1))) &  (currentPath'=(28 * min(1, node12path28) - currentPath*(min(1,node12path28) - 1))) & (success'=min(1, node12path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path29 * min(1,node12path29) - currentNode*(min(1, node12path29) - 1))) &  (currentPath'=(29 * min(1, node12path29) - currentPath*(min(1,node12path29) - 1))) & (success'=min(1, node12path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path30 * min(1,node12path30) - currentNode*(min(1, node12path30) - 1))) &  (currentPath'=(30 * min(1, node12path30) - currentPath*(min(1,node12path30) - 1))) & (success'=min(1, node12path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path31 * min(1,node12path31) - currentNode*(min(1, node12path31) - 1))) &  (currentPath'=(31 * min(1, node12path31) - currentPath*(min(1,node12path31) - 1))) & (success'=min(1, node12path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path32 * min(1,node12path32) - currentNode*(min(1, node12path32) - 1))) &  (currentPath'=(32 * min(1, node12path32) - currentPath*(min(1,node12path32) - 1))) & (success'=min(1, node12path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path33 * min(1,node12path33) - currentNode*(min(1, node12path33) - 1))) &  (currentPath'=(33 * min(1, node12path33) - currentPath*(min(1,node12path33) - 1))) & (success'=min(1, node12path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path34 * min(1,node12path34) - currentNode*(min(1, node12path34) - 1))) &  (currentPath'=(34 * min(1, node12path34) - currentPath*(min(1,node12path34) - 1))) & (success'=min(1, node12path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path35 * min(1,node12path35) - currentNode*(min(1, node12path35) - 1))) &  (currentPath'=(35 * min(1, node12path35) - currentPath*(min(1,node12path35) - 1))) & (success'=min(1, node12path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path36 * min(1,node12path36) - currentNode*(min(1, node12path36) - 1))) &  (currentPath'=(36 * min(1, node12path36) - currentPath*(min(1,node12path36) - 1))) & (success'=min(1, node12path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path37 * min(1,node12path37) - currentNode*(min(1, node12path37) - 1))) &  (currentPath'=(37 * min(1, node12path37) - currentPath*(min(1,node12path37) - 1))) & (success'=min(1, node12path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path38 * min(1,node12path38) - currentNode*(min(1, node12path38) - 1))) &  (currentPath'=(38 * min(1, node12path38) - currentPath*(min(1,node12path38) - 1))) & (success'=min(1, node12path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path39 * min(1,node12path39) - currentNode*(min(1, node12path39) - 1))) &  (currentPath'=(39 * min(1, node12path39) - currentPath*(min(1,node12path39) - 1))) & (success'=min(1, node12path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path40 * min(1,node12path40) - currentNode*(min(1, node12path40) - 1))) &  (currentPath'=(40 * min(1, node12path40) - currentPath*(min(1,node12path40) - 1))) & (success'=min(1, node12path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path41 * min(1,node12path41) - currentNode*(min(1, node12path41) - 1))) &  (currentPath'=(41 * min(1, node12path41) - currentPath*(min(1,node12path41) - 1))) & (success'=min(1, node12path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path42 * min(1,node12path42) - currentNode*(min(1, node12path42) - 1))) &  (currentPath'=(42 * min(1, node12path42) - currentPath*(min(1,node12path42) - 1))) & (success'=min(1, node12path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path43 * min(1,node12path43) - currentNode*(min(1, node12path43) - 1))) &  (currentPath'=(43 * min(1, node12path43) - currentPath*(min(1,node12path43) - 1))) & (success'=min(1, node12path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path44 * min(1,node12path44) - currentNode*(min(1, node12path44) - 1))) &  (currentPath'=(44 * min(1, node12path44) - currentPath*(min(1,node12path44) - 1))) & (success'=min(1, node12path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path45 * min(1,node12path45) - currentNode*(min(1, node12path45) - 1))) &  (currentPath'=(45 * min(1, node12path45) - currentPath*(min(1,node12path45) - 1))) & (success'=min(1, node12path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path46 * min(1,node12path46) - currentNode*(min(1, node12path46) - 1))) &  (currentPath'=(46 * min(1, node12path46) - currentPath*(min(1,node12path46) - 1))) & (success'=min(1, node12path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path47 * min(1,node12path47) - currentNode*(min(1, node12path47) - 1))) &  (currentPath'=(47 * min(1, node12path47) - currentPath*(min(1,node12path47) - 1))) & (success'=min(1, node12path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path48 * min(1,node12path48) - currentNode*(min(1, node12path48) - 1))) &  (currentPath'=(48 * min(1, node12path48) - currentPath*(min(1,node12path48) - 1))) & (success'=min(1, node12path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path49 * min(1,node12path49) - currentNode*(min(1, node12path49) - 1))) &  (currentPath'=(49 * min(1, node12path49) - currentPath*(min(1,node12path49) - 1))) & (success'=min(1, node12path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path50 * min(1,node12path50) - currentNode*(min(1, node12path50) - 1))) &  (currentPath'=(50 * min(1, node12path50) - currentPath*(min(1,node12path50) - 1))) & (success'=min(1, node12path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path51 * min(1,node12path51) - currentNode*(min(1, node12path51) - 1))) &  (currentPath'=(51 * min(1, node12path51) - currentPath*(min(1,node12path51) - 1))) & (success'=min(1, node12path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path52 * min(1,node12path52) - currentNode*(min(1, node12path52) - 1))) &  (currentPath'=(52 * min(1, node12path52) - currentPath*(min(1,node12path52) - 1))) & (success'=min(1, node12path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path53 * min(1,node12path53) - currentNode*(min(1, node12path53) - 1))) &  (currentPath'=(53 * min(1, node12path53) - currentPath*(min(1,node12path53) - 1))) & (success'=min(1, node12path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path54 * min(1,node12path54) - currentNode*(min(1, node12path54) - 1))) &  (currentPath'=(54 * min(1, node12path54) - currentPath*(min(1,node12path54) - 1))) & (success'=min(1, node12path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path55 * min(1,node12path55) - currentNode*(min(1, node12path55) - 1))) &  (currentPath'=(55 * min(1, node12path55) - currentPath*(min(1,node12path55) - 1))) & (success'=min(1, node12path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path56 * min(1,node12path56) - currentNode*(min(1, node12path56) - 1))) &  (currentPath'=(56 * min(1, node12path56) - currentPath*(min(1,node12path56) - 1))) & (success'=min(1, node12path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path57 * min(1,node12path57) - currentNode*(min(1, node12path57) - 1))) &  (currentPath'=(57 * min(1, node12path57) - currentPath*(min(1,node12path57) - 1))) & (success'=min(1, node12path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path58 * min(1,node12path58) - currentNode*(min(1, node12path58) - 1))) &  (currentPath'=(58 * min(1, node12path58) - currentPath*(min(1,node12path58) - 1))) & (success'=min(1, node12path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path59 * min(1,node12path59) - currentNode*(min(1, node12path59) - 1))) &  (currentPath'=(59 * min(1, node12path59) - currentPath*(min(1,node12path59) - 1))) & (success'=min(1, node12path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path60 * min(1,node12path60) - currentNode*(min(1, node12path60) - 1))) &  (currentPath'=(60 * min(1, node12path60) - currentPath*(min(1,node12path60) - 1))) & (success'=min(1, node12path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path61 * min(1,node12path61) - currentNode*(min(1, node12path61) - 1))) &  (currentPath'=(61 * min(1, node12path61) - currentPath*(min(1,node12path61) - 1))) & (success'=min(1, node12path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path62 * min(1,node12path62) - currentNode*(min(1, node12path62) - 1))) &  (currentPath'=(62 * min(1, node12path62) - currentPath*(min(1,node12path62) - 1))) & (success'=min(1, node12path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path63 * min(1,node12path63) - currentNode*(min(1, node12path63) - 1))) &  (currentPath'=(63 * min(1, node12path63) - currentPath*(min(1,node12path63) - 1))) & (success'=min(1, node12path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path64 * min(1,node12path64) - currentNode*(min(1, node12path64) - 1))) &  (currentPath'=(64 * min(1, node12path64) - currentPath*(min(1,node12path64) - 1))) & (success'=min(1, node12path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path65 * min(1,node12path65) - currentNode*(min(1, node12path65) - 1))) &  (currentPath'=(65 * min(1, node12path65) - currentPath*(min(1,node12path65) - 1))) & (success'=min(1, node12path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path66 * min(1,node12path66) - currentNode*(min(1, node12path66) - 1))) &  (currentPath'=(66 * min(1, node12path66) - currentPath*(min(1,node12path66) - 1))) & (success'=min(1, node12path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path67 * min(1,node12path67) - currentNode*(min(1, node12path67) - 1))) &  (currentPath'=(67 * min(1, node12path67) - currentPath*(min(1,node12path67) - 1))) & (success'=min(1, node12path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path68 * min(1,node12path68) - currentNode*(min(1, node12path68) - 1))) &  (currentPath'=(68 * min(1, node12path68) - currentPath*(min(1,node12path68) - 1))) & (success'=min(1, node12path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path69 * min(1,node12path69) - currentNode*(min(1, node12path69) - 1))) &  (currentPath'=(69 * min(1, node12path69) - currentPath*(min(1,node12path69) - 1))) & (success'=min(1, node12path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path70 * min(1,node12path70) - currentNode*(min(1, node12path70) - 1))) &  (currentPath'=(70 * min(1, node12path70) - currentPath*(min(1,node12path70) - 1))) & (success'=min(1, node12path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path71 * min(1,node12path71) - currentNode*(min(1, node12path71) - 1))) &  (currentPath'=(71 * min(1, node12path71) - currentPath*(min(1,node12path71) - 1))) & (success'=min(1, node12path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path72 * min(1,node12path72) - currentNode*(min(1, node12path72) - 1))) &  (currentPath'=(72 * min(1, node12path72) - currentPath*(min(1,node12path72) - 1))) & (success'=min(1, node12path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path73 * min(1,node12path73) - currentNode*(min(1, node12path73) - 1))) &  (currentPath'=(73 * min(1, node12path73) - currentPath*(min(1,node12path73) - 1))) & (success'=min(1, node12path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path74 * min(1,node12path74) - currentNode*(min(1, node12path74) - 1))) &  (currentPath'=(74 * min(1, node12path74) - currentPath*(min(1,node12path74) - 1))) & (success'=min(1, node12path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path75 * min(1,node12path75) - currentNode*(min(1, node12path75) - 1))) &  (currentPath'=(75 * min(1, node12path75) - currentPath*(min(1,node12path75) - 1))) & (success'=min(1, node12path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path76 * min(1,node12path76) - currentNode*(min(1, node12path76) - 1))) &  (currentPath'=(76 * min(1, node12path76) - currentPath*(min(1,node12path76) - 1))) & (success'=min(1, node12path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path77 * min(1,node12path77) - currentNode*(min(1, node12path77) - 1))) &  (currentPath'=(77 * min(1, node12path77) - currentPath*(min(1,node12path77) - 1))) & (success'=min(1, node12path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path78 * min(1,node12path78) - currentNode*(min(1, node12path78) - 1))) &  (currentPath'=(78 * min(1, node12path78) - currentPath*(min(1,node12path78) - 1))) & (success'=min(1, node12path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path79 * min(1,node12path79) - currentNode*(min(1, node12path79) - 1))) &  (currentPath'=(79 * min(1, node12path79) - currentPath*(min(1,node12path79) - 1))) & (success'=min(1, node12path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path80 * min(1,node12path80) - currentNode*(min(1, node12path80) - 1))) &  (currentPath'=(80 * min(1, node12path80) - currentPath*(min(1,node12path80) - 1))) & (success'=min(1, node12path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path81 * min(1,node12path81) - currentNode*(min(1, node12path81) - 1))) &  (currentPath'=(81 * min(1, node12path81) - currentPath*(min(1,node12path81) - 1))) & (success'=min(1, node12path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path82 * min(1,node12path82) - currentNode*(min(1, node12path82) - 1))) &  (currentPath'=(82 * min(1, node12path82) - currentPath*(min(1,node12path82) - 1))) & (success'=min(1, node12path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path83 * min(1,node12path83) - currentNode*(min(1, node12path83) - 1))) &  (currentPath'=(83 * min(1, node12path83) - currentPath*(min(1,node12path83) - 1))) & (success'=min(1, node12path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path84 * min(1,node12path84) - currentNode*(min(1, node12path84) - 1))) &  (currentPath'=(84 * min(1, node12path84) - currentPath*(min(1,node12path84) - 1))) & (success'=min(1, node12path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path85 * min(1,node12path85) - currentNode*(min(1, node12path85) - 1))) &  (currentPath'=(85 * min(1, node12path85) - currentPath*(min(1,node12path85) - 1))) & (success'=min(1, node12path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path86 * min(1,node12path86) - currentNode*(min(1, node12path86) - 1))) &  (currentPath'=(86 * min(1, node12path86) - currentPath*(min(1,node12path86) - 1))) & (success'=min(1, node12path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path87 * min(1,node12path87) - currentNode*(min(1, node12path87) - 1))) &  (currentPath'=(87 * min(1, node12path87) - currentPath*(min(1,node12path87) - 1))) & (success'=min(1, node12path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path88 * min(1,node12path88) - currentNode*(min(1, node12path88) - 1))) &  (currentPath'=(88 * min(1, node12path88) - currentPath*(min(1,node12path88) - 1))) & (success'=min(1, node12path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path89 * min(1,node12path89) - currentNode*(min(1, node12path89) - 1))) &  (currentPath'=(89 * min(1, node12path89) - currentPath*(min(1,node12path89) - 1))) & (success'=min(1, node12path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path90 * min(1,node12path90) - currentNode*(min(1, node12path90) - 1))) &  (currentPath'=(90 * min(1, node12path90) - currentPath*(min(1,node12path90) - 1))) & (success'=min(1, node12path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path91 * min(1,node12path91) - currentNode*(min(1, node12path91) - 1))) &  (currentPath'=(91 * min(1, node12path91) - currentPath*(min(1,node12path91) - 1))) & (success'=min(1, node12path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path92 * min(1,node12path92) - currentNode*(min(1, node12path92) - 1))) &  (currentPath'=(92 * min(1, node12path92) - currentPath*(min(1,node12path92) - 1))) & (success'=min(1, node12path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path93 * min(1,node12path93) - currentNode*(min(1, node12path93) - 1))) &  (currentPath'=(93 * min(1, node12path93) - currentPath*(min(1,node12path93) - 1))) & (success'=min(1, node12path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path94 * min(1,node12path94) - currentNode*(min(1, node12path94) - 1))) &  (currentPath'=(94 * min(1, node12path94) - currentPath*(min(1,node12path94) - 1))) & (success'=min(1, node12path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path95 * min(1,node12path95) - currentNode*(min(1, node12path95) - 1))) &  (currentPath'=(95 * min(1, node12path95) - currentPath*(min(1,node12path95) - 1))) & (success'=min(1, node12path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path96 * min(1,node12path96) - currentNode*(min(1, node12path96) - 1))) &  (currentPath'=(96 * min(1, node12path96) - currentPath*(min(1,node12path96) - 1))) & (success'=min(1, node12path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path97 * min(1,node12path97) - currentNode*(min(1, node12path97) - 1))) &  (currentPath'=(97 * min(1, node12path97) - currentPath*(min(1,node12path97) - 1))) & (success'=min(1, node12path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path98 * min(1,node12path98) - currentNode*(min(1, node12path98) - 1))) &  (currentPath'=(98 * min(1, node12path98) - currentPath*(min(1,node12path98) - 1))) & (success'=min(1, node12path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path99 * min(1,node12path99) - currentNode*(min(1, node12path99) - 1))) &  (currentPath'=(99 * min(1, node12path99) - currentPath*(min(1,node12path99) - 1))) & (success'=min(1, node12path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node12path100 * min(1,node12path100) - currentNode*(min(1, node12path100) - 1))) &  (currentPath'=(100 * min(1, node12path100) - currentPath*(min(1,node12path100) - 1))) & (success'=min(1, node12path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 13) ->
 numPathsInv: (currentNode'=(node13path1 * min(1,node13path1) - currentNode*(min(1, node13path1) - 1))) &  (currentPath'=(1 * min(1, node13path1) - currentPath*(min(1,node13path1) - 1))) & (success'=min(1, node13path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path2 * min(1,node13path2) - currentNode*(min(1, node13path2) - 1))) &  (currentPath'=(2 * min(1, node13path2) - currentPath*(min(1,node13path2) - 1))) & (success'=min(1, node13path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path3 * min(1,node13path3) - currentNode*(min(1, node13path3) - 1))) &  (currentPath'=(3 * min(1, node13path3) - currentPath*(min(1,node13path3) - 1))) & (success'=min(1, node13path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path4 * min(1,node13path4) - currentNode*(min(1, node13path4) - 1))) &  (currentPath'=(4 * min(1, node13path4) - currentPath*(min(1,node13path4) - 1))) & (success'=min(1, node13path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path5 * min(1,node13path5) - currentNode*(min(1, node13path5) - 1))) &  (currentPath'=(5 * min(1, node13path5) - currentPath*(min(1,node13path5) - 1))) & (success'=min(1, node13path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path6 * min(1,node13path6) - currentNode*(min(1, node13path6) - 1))) &  (currentPath'=(6 * min(1, node13path6) - currentPath*(min(1,node13path6) - 1))) & (success'=min(1, node13path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path7 * min(1,node13path7) - currentNode*(min(1, node13path7) - 1))) &  (currentPath'=(7 * min(1, node13path7) - currentPath*(min(1,node13path7) - 1))) & (success'=min(1, node13path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path8 * min(1,node13path8) - currentNode*(min(1, node13path8) - 1))) &  (currentPath'=(8 * min(1, node13path8) - currentPath*(min(1,node13path8) - 1))) & (success'=min(1, node13path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path9 * min(1,node13path9) - currentNode*(min(1, node13path9) - 1))) &  (currentPath'=(9 * min(1, node13path9) - currentPath*(min(1,node13path9) - 1))) & (success'=min(1, node13path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path10 * min(1,node13path10) - currentNode*(min(1, node13path10) - 1))) &  (currentPath'=(10 * min(1, node13path10) - currentPath*(min(1,node13path10) - 1))) & (success'=min(1, node13path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path11 * min(1,node13path11) - currentNode*(min(1, node13path11) - 1))) &  (currentPath'=(11 * min(1, node13path11) - currentPath*(min(1,node13path11) - 1))) & (success'=min(1, node13path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path12 * min(1,node13path12) - currentNode*(min(1, node13path12) - 1))) &  (currentPath'=(12 * min(1, node13path12) - currentPath*(min(1,node13path12) - 1))) & (success'=min(1, node13path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path13 * min(1,node13path13) - currentNode*(min(1, node13path13) - 1))) &  (currentPath'=(13 * min(1, node13path13) - currentPath*(min(1,node13path13) - 1))) & (success'=min(1, node13path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path14 * min(1,node13path14) - currentNode*(min(1, node13path14) - 1))) &  (currentPath'=(14 * min(1, node13path14) - currentPath*(min(1,node13path14) - 1))) & (success'=min(1, node13path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path15 * min(1,node13path15) - currentNode*(min(1, node13path15) - 1))) &  (currentPath'=(15 * min(1, node13path15) - currentPath*(min(1,node13path15) - 1))) & (success'=min(1, node13path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path16 * min(1,node13path16) - currentNode*(min(1, node13path16) - 1))) &  (currentPath'=(16 * min(1, node13path16) - currentPath*(min(1,node13path16) - 1))) & (success'=min(1, node13path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path17 * min(1,node13path17) - currentNode*(min(1, node13path17) - 1))) &  (currentPath'=(17 * min(1, node13path17) - currentPath*(min(1,node13path17) - 1))) & (success'=min(1, node13path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path18 * min(1,node13path18) - currentNode*(min(1, node13path18) - 1))) &  (currentPath'=(18 * min(1, node13path18) - currentPath*(min(1,node13path18) - 1))) & (success'=min(1, node13path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path19 * min(1,node13path19) - currentNode*(min(1, node13path19) - 1))) &  (currentPath'=(19 * min(1, node13path19) - currentPath*(min(1,node13path19) - 1))) & (success'=min(1, node13path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path20 * min(1,node13path20) - currentNode*(min(1, node13path20) - 1))) &  (currentPath'=(20 * min(1, node13path20) - currentPath*(min(1,node13path20) - 1))) & (success'=min(1, node13path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path21 * min(1,node13path21) - currentNode*(min(1, node13path21) - 1))) &  (currentPath'=(21 * min(1, node13path21) - currentPath*(min(1,node13path21) - 1))) & (success'=min(1, node13path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path22 * min(1,node13path22) - currentNode*(min(1, node13path22) - 1))) &  (currentPath'=(22 * min(1, node13path22) - currentPath*(min(1,node13path22) - 1))) & (success'=min(1, node13path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path23 * min(1,node13path23) - currentNode*(min(1, node13path23) - 1))) &  (currentPath'=(23 * min(1, node13path23) - currentPath*(min(1,node13path23) - 1))) & (success'=min(1, node13path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path24 * min(1,node13path24) - currentNode*(min(1, node13path24) - 1))) &  (currentPath'=(24 * min(1, node13path24) - currentPath*(min(1,node13path24) - 1))) & (success'=min(1, node13path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path25 * min(1,node13path25) - currentNode*(min(1, node13path25) - 1))) &  (currentPath'=(25 * min(1, node13path25) - currentPath*(min(1,node13path25) - 1))) & (success'=min(1, node13path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path26 * min(1,node13path26) - currentNode*(min(1, node13path26) - 1))) &  (currentPath'=(26 * min(1, node13path26) - currentPath*(min(1,node13path26) - 1))) & (success'=min(1, node13path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path27 * min(1,node13path27) - currentNode*(min(1, node13path27) - 1))) &  (currentPath'=(27 * min(1, node13path27) - currentPath*(min(1,node13path27) - 1))) & (success'=min(1, node13path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path28 * min(1,node13path28) - currentNode*(min(1, node13path28) - 1))) &  (currentPath'=(28 * min(1, node13path28) - currentPath*(min(1,node13path28) - 1))) & (success'=min(1, node13path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path29 * min(1,node13path29) - currentNode*(min(1, node13path29) - 1))) &  (currentPath'=(29 * min(1, node13path29) - currentPath*(min(1,node13path29) - 1))) & (success'=min(1, node13path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path30 * min(1,node13path30) - currentNode*(min(1, node13path30) - 1))) &  (currentPath'=(30 * min(1, node13path30) - currentPath*(min(1,node13path30) - 1))) & (success'=min(1, node13path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path31 * min(1,node13path31) - currentNode*(min(1, node13path31) - 1))) &  (currentPath'=(31 * min(1, node13path31) - currentPath*(min(1,node13path31) - 1))) & (success'=min(1, node13path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path32 * min(1,node13path32) - currentNode*(min(1, node13path32) - 1))) &  (currentPath'=(32 * min(1, node13path32) - currentPath*(min(1,node13path32) - 1))) & (success'=min(1, node13path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path33 * min(1,node13path33) - currentNode*(min(1, node13path33) - 1))) &  (currentPath'=(33 * min(1, node13path33) - currentPath*(min(1,node13path33) - 1))) & (success'=min(1, node13path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path34 * min(1,node13path34) - currentNode*(min(1, node13path34) - 1))) &  (currentPath'=(34 * min(1, node13path34) - currentPath*(min(1,node13path34) - 1))) & (success'=min(1, node13path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path35 * min(1,node13path35) - currentNode*(min(1, node13path35) - 1))) &  (currentPath'=(35 * min(1, node13path35) - currentPath*(min(1,node13path35) - 1))) & (success'=min(1, node13path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path36 * min(1,node13path36) - currentNode*(min(1, node13path36) - 1))) &  (currentPath'=(36 * min(1, node13path36) - currentPath*(min(1,node13path36) - 1))) & (success'=min(1, node13path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path37 * min(1,node13path37) - currentNode*(min(1, node13path37) - 1))) &  (currentPath'=(37 * min(1, node13path37) - currentPath*(min(1,node13path37) - 1))) & (success'=min(1, node13path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path38 * min(1,node13path38) - currentNode*(min(1, node13path38) - 1))) &  (currentPath'=(38 * min(1, node13path38) - currentPath*(min(1,node13path38) - 1))) & (success'=min(1, node13path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path39 * min(1,node13path39) - currentNode*(min(1, node13path39) - 1))) &  (currentPath'=(39 * min(1, node13path39) - currentPath*(min(1,node13path39) - 1))) & (success'=min(1, node13path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path40 * min(1,node13path40) - currentNode*(min(1, node13path40) - 1))) &  (currentPath'=(40 * min(1, node13path40) - currentPath*(min(1,node13path40) - 1))) & (success'=min(1, node13path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path41 * min(1,node13path41) - currentNode*(min(1, node13path41) - 1))) &  (currentPath'=(41 * min(1, node13path41) - currentPath*(min(1,node13path41) - 1))) & (success'=min(1, node13path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path42 * min(1,node13path42) - currentNode*(min(1, node13path42) - 1))) &  (currentPath'=(42 * min(1, node13path42) - currentPath*(min(1,node13path42) - 1))) & (success'=min(1, node13path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path43 * min(1,node13path43) - currentNode*(min(1, node13path43) - 1))) &  (currentPath'=(43 * min(1, node13path43) - currentPath*(min(1,node13path43) - 1))) & (success'=min(1, node13path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path44 * min(1,node13path44) - currentNode*(min(1, node13path44) - 1))) &  (currentPath'=(44 * min(1, node13path44) - currentPath*(min(1,node13path44) - 1))) & (success'=min(1, node13path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path45 * min(1,node13path45) - currentNode*(min(1, node13path45) - 1))) &  (currentPath'=(45 * min(1, node13path45) - currentPath*(min(1,node13path45) - 1))) & (success'=min(1, node13path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path46 * min(1,node13path46) - currentNode*(min(1, node13path46) - 1))) &  (currentPath'=(46 * min(1, node13path46) - currentPath*(min(1,node13path46) - 1))) & (success'=min(1, node13path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path47 * min(1,node13path47) - currentNode*(min(1, node13path47) - 1))) &  (currentPath'=(47 * min(1, node13path47) - currentPath*(min(1,node13path47) - 1))) & (success'=min(1, node13path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path48 * min(1,node13path48) - currentNode*(min(1, node13path48) - 1))) &  (currentPath'=(48 * min(1, node13path48) - currentPath*(min(1,node13path48) - 1))) & (success'=min(1, node13path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path49 * min(1,node13path49) - currentNode*(min(1, node13path49) - 1))) &  (currentPath'=(49 * min(1, node13path49) - currentPath*(min(1,node13path49) - 1))) & (success'=min(1, node13path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path50 * min(1,node13path50) - currentNode*(min(1, node13path50) - 1))) &  (currentPath'=(50 * min(1, node13path50) - currentPath*(min(1,node13path50) - 1))) & (success'=min(1, node13path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path51 * min(1,node13path51) - currentNode*(min(1, node13path51) - 1))) &  (currentPath'=(51 * min(1, node13path51) - currentPath*(min(1,node13path51) - 1))) & (success'=min(1, node13path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path52 * min(1,node13path52) - currentNode*(min(1, node13path52) - 1))) &  (currentPath'=(52 * min(1, node13path52) - currentPath*(min(1,node13path52) - 1))) & (success'=min(1, node13path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path53 * min(1,node13path53) - currentNode*(min(1, node13path53) - 1))) &  (currentPath'=(53 * min(1, node13path53) - currentPath*(min(1,node13path53) - 1))) & (success'=min(1, node13path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path54 * min(1,node13path54) - currentNode*(min(1, node13path54) - 1))) &  (currentPath'=(54 * min(1, node13path54) - currentPath*(min(1,node13path54) - 1))) & (success'=min(1, node13path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path55 * min(1,node13path55) - currentNode*(min(1, node13path55) - 1))) &  (currentPath'=(55 * min(1, node13path55) - currentPath*(min(1,node13path55) - 1))) & (success'=min(1, node13path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path56 * min(1,node13path56) - currentNode*(min(1, node13path56) - 1))) &  (currentPath'=(56 * min(1, node13path56) - currentPath*(min(1,node13path56) - 1))) & (success'=min(1, node13path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path57 * min(1,node13path57) - currentNode*(min(1, node13path57) - 1))) &  (currentPath'=(57 * min(1, node13path57) - currentPath*(min(1,node13path57) - 1))) & (success'=min(1, node13path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path58 * min(1,node13path58) - currentNode*(min(1, node13path58) - 1))) &  (currentPath'=(58 * min(1, node13path58) - currentPath*(min(1,node13path58) - 1))) & (success'=min(1, node13path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path59 * min(1,node13path59) - currentNode*(min(1, node13path59) - 1))) &  (currentPath'=(59 * min(1, node13path59) - currentPath*(min(1,node13path59) - 1))) & (success'=min(1, node13path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path60 * min(1,node13path60) - currentNode*(min(1, node13path60) - 1))) &  (currentPath'=(60 * min(1, node13path60) - currentPath*(min(1,node13path60) - 1))) & (success'=min(1, node13path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path61 * min(1,node13path61) - currentNode*(min(1, node13path61) - 1))) &  (currentPath'=(61 * min(1, node13path61) - currentPath*(min(1,node13path61) - 1))) & (success'=min(1, node13path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path62 * min(1,node13path62) - currentNode*(min(1, node13path62) - 1))) &  (currentPath'=(62 * min(1, node13path62) - currentPath*(min(1,node13path62) - 1))) & (success'=min(1, node13path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path63 * min(1,node13path63) - currentNode*(min(1, node13path63) - 1))) &  (currentPath'=(63 * min(1, node13path63) - currentPath*(min(1,node13path63) - 1))) & (success'=min(1, node13path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path64 * min(1,node13path64) - currentNode*(min(1, node13path64) - 1))) &  (currentPath'=(64 * min(1, node13path64) - currentPath*(min(1,node13path64) - 1))) & (success'=min(1, node13path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path65 * min(1,node13path65) - currentNode*(min(1, node13path65) - 1))) &  (currentPath'=(65 * min(1, node13path65) - currentPath*(min(1,node13path65) - 1))) & (success'=min(1, node13path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path66 * min(1,node13path66) - currentNode*(min(1, node13path66) - 1))) &  (currentPath'=(66 * min(1, node13path66) - currentPath*(min(1,node13path66) - 1))) & (success'=min(1, node13path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path67 * min(1,node13path67) - currentNode*(min(1, node13path67) - 1))) &  (currentPath'=(67 * min(1, node13path67) - currentPath*(min(1,node13path67) - 1))) & (success'=min(1, node13path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path68 * min(1,node13path68) - currentNode*(min(1, node13path68) - 1))) &  (currentPath'=(68 * min(1, node13path68) - currentPath*(min(1,node13path68) - 1))) & (success'=min(1, node13path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path69 * min(1,node13path69) - currentNode*(min(1, node13path69) - 1))) &  (currentPath'=(69 * min(1, node13path69) - currentPath*(min(1,node13path69) - 1))) & (success'=min(1, node13path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path70 * min(1,node13path70) - currentNode*(min(1, node13path70) - 1))) &  (currentPath'=(70 * min(1, node13path70) - currentPath*(min(1,node13path70) - 1))) & (success'=min(1, node13path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path71 * min(1,node13path71) - currentNode*(min(1, node13path71) - 1))) &  (currentPath'=(71 * min(1, node13path71) - currentPath*(min(1,node13path71) - 1))) & (success'=min(1, node13path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path72 * min(1,node13path72) - currentNode*(min(1, node13path72) - 1))) &  (currentPath'=(72 * min(1, node13path72) - currentPath*(min(1,node13path72) - 1))) & (success'=min(1, node13path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path73 * min(1,node13path73) - currentNode*(min(1, node13path73) - 1))) &  (currentPath'=(73 * min(1, node13path73) - currentPath*(min(1,node13path73) - 1))) & (success'=min(1, node13path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path74 * min(1,node13path74) - currentNode*(min(1, node13path74) - 1))) &  (currentPath'=(74 * min(1, node13path74) - currentPath*(min(1,node13path74) - 1))) & (success'=min(1, node13path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path75 * min(1,node13path75) - currentNode*(min(1, node13path75) - 1))) &  (currentPath'=(75 * min(1, node13path75) - currentPath*(min(1,node13path75) - 1))) & (success'=min(1, node13path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path76 * min(1,node13path76) - currentNode*(min(1, node13path76) - 1))) &  (currentPath'=(76 * min(1, node13path76) - currentPath*(min(1,node13path76) - 1))) & (success'=min(1, node13path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path77 * min(1,node13path77) - currentNode*(min(1, node13path77) - 1))) &  (currentPath'=(77 * min(1, node13path77) - currentPath*(min(1,node13path77) - 1))) & (success'=min(1, node13path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path78 * min(1,node13path78) - currentNode*(min(1, node13path78) - 1))) &  (currentPath'=(78 * min(1, node13path78) - currentPath*(min(1,node13path78) - 1))) & (success'=min(1, node13path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path79 * min(1,node13path79) - currentNode*(min(1, node13path79) - 1))) &  (currentPath'=(79 * min(1, node13path79) - currentPath*(min(1,node13path79) - 1))) & (success'=min(1, node13path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path80 * min(1,node13path80) - currentNode*(min(1, node13path80) - 1))) &  (currentPath'=(80 * min(1, node13path80) - currentPath*(min(1,node13path80) - 1))) & (success'=min(1, node13path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path81 * min(1,node13path81) - currentNode*(min(1, node13path81) - 1))) &  (currentPath'=(81 * min(1, node13path81) - currentPath*(min(1,node13path81) - 1))) & (success'=min(1, node13path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path82 * min(1,node13path82) - currentNode*(min(1, node13path82) - 1))) &  (currentPath'=(82 * min(1, node13path82) - currentPath*(min(1,node13path82) - 1))) & (success'=min(1, node13path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path83 * min(1,node13path83) - currentNode*(min(1, node13path83) - 1))) &  (currentPath'=(83 * min(1, node13path83) - currentPath*(min(1,node13path83) - 1))) & (success'=min(1, node13path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path84 * min(1,node13path84) - currentNode*(min(1, node13path84) - 1))) &  (currentPath'=(84 * min(1, node13path84) - currentPath*(min(1,node13path84) - 1))) & (success'=min(1, node13path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path85 * min(1,node13path85) - currentNode*(min(1, node13path85) - 1))) &  (currentPath'=(85 * min(1, node13path85) - currentPath*(min(1,node13path85) - 1))) & (success'=min(1, node13path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path86 * min(1,node13path86) - currentNode*(min(1, node13path86) - 1))) &  (currentPath'=(86 * min(1, node13path86) - currentPath*(min(1,node13path86) - 1))) & (success'=min(1, node13path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path87 * min(1,node13path87) - currentNode*(min(1, node13path87) - 1))) &  (currentPath'=(87 * min(1, node13path87) - currentPath*(min(1,node13path87) - 1))) & (success'=min(1, node13path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path88 * min(1,node13path88) - currentNode*(min(1, node13path88) - 1))) &  (currentPath'=(88 * min(1, node13path88) - currentPath*(min(1,node13path88) - 1))) & (success'=min(1, node13path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path89 * min(1,node13path89) - currentNode*(min(1, node13path89) - 1))) &  (currentPath'=(89 * min(1, node13path89) - currentPath*(min(1,node13path89) - 1))) & (success'=min(1, node13path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path90 * min(1,node13path90) - currentNode*(min(1, node13path90) - 1))) &  (currentPath'=(90 * min(1, node13path90) - currentPath*(min(1,node13path90) - 1))) & (success'=min(1, node13path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path91 * min(1,node13path91) - currentNode*(min(1, node13path91) - 1))) &  (currentPath'=(91 * min(1, node13path91) - currentPath*(min(1,node13path91) - 1))) & (success'=min(1, node13path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path92 * min(1,node13path92) - currentNode*(min(1, node13path92) - 1))) &  (currentPath'=(92 * min(1, node13path92) - currentPath*(min(1,node13path92) - 1))) & (success'=min(1, node13path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path93 * min(1,node13path93) - currentNode*(min(1, node13path93) - 1))) &  (currentPath'=(93 * min(1, node13path93) - currentPath*(min(1,node13path93) - 1))) & (success'=min(1, node13path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path94 * min(1,node13path94) - currentNode*(min(1, node13path94) - 1))) &  (currentPath'=(94 * min(1, node13path94) - currentPath*(min(1,node13path94) - 1))) & (success'=min(1, node13path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path95 * min(1,node13path95) - currentNode*(min(1, node13path95) - 1))) &  (currentPath'=(95 * min(1, node13path95) - currentPath*(min(1,node13path95) - 1))) & (success'=min(1, node13path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path96 * min(1,node13path96) - currentNode*(min(1, node13path96) - 1))) &  (currentPath'=(96 * min(1, node13path96) - currentPath*(min(1,node13path96) - 1))) & (success'=min(1, node13path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path97 * min(1,node13path97) - currentNode*(min(1, node13path97) - 1))) &  (currentPath'=(97 * min(1, node13path97) - currentPath*(min(1,node13path97) - 1))) & (success'=min(1, node13path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path98 * min(1,node13path98) - currentNode*(min(1, node13path98) - 1))) &  (currentPath'=(98 * min(1, node13path98) - currentPath*(min(1,node13path98) - 1))) & (success'=min(1, node13path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path99 * min(1,node13path99) - currentNode*(min(1, node13path99) - 1))) &  (currentPath'=(99 * min(1, node13path99) - currentPath*(min(1,node13path99) - 1))) & (success'=min(1, node13path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node13path100 * min(1,node13path100) - currentNode*(min(1, node13path100) - 1))) &  (currentPath'=(100 * min(1, node13path100) - currentPath*(min(1,node13path100) - 1))) & (success'=min(1, node13path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 14) ->
 numPathsInv: (currentNode'=(node14path1 * min(1,node14path1) - currentNode*(min(1, node14path1) - 1))) &  (currentPath'=(1 * min(1, node14path1) - currentPath*(min(1,node14path1) - 1))) & (success'=min(1, node14path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path2 * min(1,node14path2) - currentNode*(min(1, node14path2) - 1))) &  (currentPath'=(2 * min(1, node14path2) - currentPath*(min(1,node14path2) - 1))) & (success'=min(1, node14path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path3 * min(1,node14path3) - currentNode*(min(1, node14path3) - 1))) &  (currentPath'=(3 * min(1, node14path3) - currentPath*(min(1,node14path3) - 1))) & (success'=min(1, node14path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path4 * min(1,node14path4) - currentNode*(min(1, node14path4) - 1))) &  (currentPath'=(4 * min(1, node14path4) - currentPath*(min(1,node14path4) - 1))) & (success'=min(1, node14path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path5 * min(1,node14path5) - currentNode*(min(1, node14path5) - 1))) &  (currentPath'=(5 * min(1, node14path5) - currentPath*(min(1,node14path5) - 1))) & (success'=min(1, node14path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path6 * min(1,node14path6) - currentNode*(min(1, node14path6) - 1))) &  (currentPath'=(6 * min(1, node14path6) - currentPath*(min(1,node14path6) - 1))) & (success'=min(1, node14path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path7 * min(1,node14path7) - currentNode*(min(1, node14path7) - 1))) &  (currentPath'=(7 * min(1, node14path7) - currentPath*(min(1,node14path7) - 1))) & (success'=min(1, node14path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path8 * min(1,node14path8) - currentNode*(min(1, node14path8) - 1))) &  (currentPath'=(8 * min(1, node14path8) - currentPath*(min(1,node14path8) - 1))) & (success'=min(1, node14path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path9 * min(1,node14path9) - currentNode*(min(1, node14path9) - 1))) &  (currentPath'=(9 * min(1, node14path9) - currentPath*(min(1,node14path9) - 1))) & (success'=min(1, node14path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path10 * min(1,node14path10) - currentNode*(min(1, node14path10) - 1))) &  (currentPath'=(10 * min(1, node14path10) - currentPath*(min(1,node14path10) - 1))) & (success'=min(1, node14path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path11 * min(1,node14path11) - currentNode*(min(1, node14path11) - 1))) &  (currentPath'=(11 * min(1, node14path11) - currentPath*(min(1,node14path11) - 1))) & (success'=min(1, node14path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path12 * min(1,node14path12) - currentNode*(min(1, node14path12) - 1))) &  (currentPath'=(12 * min(1, node14path12) - currentPath*(min(1,node14path12) - 1))) & (success'=min(1, node14path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path13 * min(1,node14path13) - currentNode*(min(1, node14path13) - 1))) &  (currentPath'=(13 * min(1, node14path13) - currentPath*(min(1,node14path13) - 1))) & (success'=min(1, node14path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path14 * min(1,node14path14) - currentNode*(min(1, node14path14) - 1))) &  (currentPath'=(14 * min(1, node14path14) - currentPath*(min(1,node14path14) - 1))) & (success'=min(1, node14path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path15 * min(1,node14path15) - currentNode*(min(1, node14path15) - 1))) &  (currentPath'=(15 * min(1, node14path15) - currentPath*(min(1,node14path15) - 1))) & (success'=min(1, node14path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path16 * min(1,node14path16) - currentNode*(min(1, node14path16) - 1))) &  (currentPath'=(16 * min(1, node14path16) - currentPath*(min(1,node14path16) - 1))) & (success'=min(1, node14path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path17 * min(1,node14path17) - currentNode*(min(1, node14path17) - 1))) &  (currentPath'=(17 * min(1, node14path17) - currentPath*(min(1,node14path17) - 1))) & (success'=min(1, node14path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path18 * min(1,node14path18) - currentNode*(min(1, node14path18) - 1))) &  (currentPath'=(18 * min(1, node14path18) - currentPath*(min(1,node14path18) - 1))) & (success'=min(1, node14path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path19 * min(1,node14path19) - currentNode*(min(1, node14path19) - 1))) &  (currentPath'=(19 * min(1, node14path19) - currentPath*(min(1,node14path19) - 1))) & (success'=min(1, node14path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path20 * min(1,node14path20) - currentNode*(min(1, node14path20) - 1))) &  (currentPath'=(20 * min(1, node14path20) - currentPath*(min(1,node14path20) - 1))) & (success'=min(1, node14path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path21 * min(1,node14path21) - currentNode*(min(1, node14path21) - 1))) &  (currentPath'=(21 * min(1, node14path21) - currentPath*(min(1,node14path21) - 1))) & (success'=min(1, node14path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path22 * min(1,node14path22) - currentNode*(min(1, node14path22) - 1))) &  (currentPath'=(22 * min(1, node14path22) - currentPath*(min(1,node14path22) - 1))) & (success'=min(1, node14path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path23 * min(1,node14path23) - currentNode*(min(1, node14path23) - 1))) &  (currentPath'=(23 * min(1, node14path23) - currentPath*(min(1,node14path23) - 1))) & (success'=min(1, node14path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path24 * min(1,node14path24) - currentNode*(min(1, node14path24) - 1))) &  (currentPath'=(24 * min(1, node14path24) - currentPath*(min(1,node14path24) - 1))) & (success'=min(1, node14path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path25 * min(1,node14path25) - currentNode*(min(1, node14path25) - 1))) &  (currentPath'=(25 * min(1, node14path25) - currentPath*(min(1,node14path25) - 1))) & (success'=min(1, node14path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path26 * min(1,node14path26) - currentNode*(min(1, node14path26) - 1))) &  (currentPath'=(26 * min(1, node14path26) - currentPath*(min(1,node14path26) - 1))) & (success'=min(1, node14path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path27 * min(1,node14path27) - currentNode*(min(1, node14path27) - 1))) &  (currentPath'=(27 * min(1, node14path27) - currentPath*(min(1,node14path27) - 1))) & (success'=min(1, node14path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path28 * min(1,node14path28) - currentNode*(min(1, node14path28) - 1))) &  (currentPath'=(28 * min(1, node14path28) - currentPath*(min(1,node14path28) - 1))) & (success'=min(1, node14path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path29 * min(1,node14path29) - currentNode*(min(1, node14path29) - 1))) &  (currentPath'=(29 * min(1, node14path29) - currentPath*(min(1,node14path29) - 1))) & (success'=min(1, node14path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path30 * min(1,node14path30) - currentNode*(min(1, node14path30) - 1))) &  (currentPath'=(30 * min(1, node14path30) - currentPath*(min(1,node14path30) - 1))) & (success'=min(1, node14path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path31 * min(1,node14path31) - currentNode*(min(1, node14path31) - 1))) &  (currentPath'=(31 * min(1, node14path31) - currentPath*(min(1,node14path31) - 1))) & (success'=min(1, node14path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path32 * min(1,node14path32) - currentNode*(min(1, node14path32) - 1))) &  (currentPath'=(32 * min(1, node14path32) - currentPath*(min(1,node14path32) - 1))) & (success'=min(1, node14path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path33 * min(1,node14path33) - currentNode*(min(1, node14path33) - 1))) &  (currentPath'=(33 * min(1, node14path33) - currentPath*(min(1,node14path33) - 1))) & (success'=min(1, node14path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path34 * min(1,node14path34) - currentNode*(min(1, node14path34) - 1))) &  (currentPath'=(34 * min(1, node14path34) - currentPath*(min(1,node14path34) - 1))) & (success'=min(1, node14path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path35 * min(1,node14path35) - currentNode*(min(1, node14path35) - 1))) &  (currentPath'=(35 * min(1, node14path35) - currentPath*(min(1,node14path35) - 1))) & (success'=min(1, node14path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path36 * min(1,node14path36) - currentNode*(min(1, node14path36) - 1))) &  (currentPath'=(36 * min(1, node14path36) - currentPath*(min(1,node14path36) - 1))) & (success'=min(1, node14path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path37 * min(1,node14path37) - currentNode*(min(1, node14path37) - 1))) &  (currentPath'=(37 * min(1, node14path37) - currentPath*(min(1,node14path37) - 1))) & (success'=min(1, node14path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path38 * min(1,node14path38) - currentNode*(min(1, node14path38) - 1))) &  (currentPath'=(38 * min(1, node14path38) - currentPath*(min(1,node14path38) - 1))) & (success'=min(1, node14path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path39 * min(1,node14path39) - currentNode*(min(1, node14path39) - 1))) &  (currentPath'=(39 * min(1, node14path39) - currentPath*(min(1,node14path39) - 1))) & (success'=min(1, node14path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path40 * min(1,node14path40) - currentNode*(min(1, node14path40) - 1))) &  (currentPath'=(40 * min(1, node14path40) - currentPath*(min(1,node14path40) - 1))) & (success'=min(1, node14path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path41 * min(1,node14path41) - currentNode*(min(1, node14path41) - 1))) &  (currentPath'=(41 * min(1, node14path41) - currentPath*(min(1,node14path41) - 1))) & (success'=min(1, node14path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path42 * min(1,node14path42) - currentNode*(min(1, node14path42) - 1))) &  (currentPath'=(42 * min(1, node14path42) - currentPath*(min(1,node14path42) - 1))) & (success'=min(1, node14path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path43 * min(1,node14path43) - currentNode*(min(1, node14path43) - 1))) &  (currentPath'=(43 * min(1, node14path43) - currentPath*(min(1,node14path43) - 1))) & (success'=min(1, node14path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path44 * min(1,node14path44) - currentNode*(min(1, node14path44) - 1))) &  (currentPath'=(44 * min(1, node14path44) - currentPath*(min(1,node14path44) - 1))) & (success'=min(1, node14path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path45 * min(1,node14path45) - currentNode*(min(1, node14path45) - 1))) &  (currentPath'=(45 * min(1, node14path45) - currentPath*(min(1,node14path45) - 1))) & (success'=min(1, node14path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path46 * min(1,node14path46) - currentNode*(min(1, node14path46) - 1))) &  (currentPath'=(46 * min(1, node14path46) - currentPath*(min(1,node14path46) - 1))) & (success'=min(1, node14path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path47 * min(1,node14path47) - currentNode*(min(1, node14path47) - 1))) &  (currentPath'=(47 * min(1, node14path47) - currentPath*(min(1,node14path47) - 1))) & (success'=min(1, node14path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path48 * min(1,node14path48) - currentNode*(min(1, node14path48) - 1))) &  (currentPath'=(48 * min(1, node14path48) - currentPath*(min(1,node14path48) - 1))) & (success'=min(1, node14path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path49 * min(1,node14path49) - currentNode*(min(1, node14path49) - 1))) &  (currentPath'=(49 * min(1, node14path49) - currentPath*(min(1,node14path49) - 1))) & (success'=min(1, node14path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path50 * min(1,node14path50) - currentNode*(min(1, node14path50) - 1))) &  (currentPath'=(50 * min(1, node14path50) - currentPath*(min(1,node14path50) - 1))) & (success'=min(1, node14path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path51 * min(1,node14path51) - currentNode*(min(1, node14path51) - 1))) &  (currentPath'=(51 * min(1, node14path51) - currentPath*(min(1,node14path51) - 1))) & (success'=min(1, node14path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path52 * min(1,node14path52) - currentNode*(min(1, node14path52) - 1))) &  (currentPath'=(52 * min(1, node14path52) - currentPath*(min(1,node14path52) - 1))) & (success'=min(1, node14path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path53 * min(1,node14path53) - currentNode*(min(1, node14path53) - 1))) &  (currentPath'=(53 * min(1, node14path53) - currentPath*(min(1,node14path53) - 1))) & (success'=min(1, node14path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path54 * min(1,node14path54) - currentNode*(min(1, node14path54) - 1))) &  (currentPath'=(54 * min(1, node14path54) - currentPath*(min(1,node14path54) - 1))) & (success'=min(1, node14path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path55 * min(1,node14path55) - currentNode*(min(1, node14path55) - 1))) &  (currentPath'=(55 * min(1, node14path55) - currentPath*(min(1,node14path55) - 1))) & (success'=min(1, node14path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path56 * min(1,node14path56) - currentNode*(min(1, node14path56) - 1))) &  (currentPath'=(56 * min(1, node14path56) - currentPath*(min(1,node14path56) - 1))) & (success'=min(1, node14path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path57 * min(1,node14path57) - currentNode*(min(1, node14path57) - 1))) &  (currentPath'=(57 * min(1, node14path57) - currentPath*(min(1,node14path57) - 1))) & (success'=min(1, node14path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path58 * min(1,node14path58) - currentNode*(min(1, node14path58) - 1))) &  (currentPath'=(58 * min(1, node14path58) - currentPath*(min(1,node14path58) - 1))) & (success'=min(1, node14path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path59 * min(1,node14path59) - currentNode*(min(1, node14path59) - 1))) &  (currentPath'=(59 * min(1, node14path59) - currentPath*(min(1,node14path59) - 1))) & (success'=min(1, node14path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path60 * min(1,node14path60) - currentNode*(min(1, node14path60) - 1))) &  (currentPath'=(60 * min(1, node14path60) - currentPath*(min(1,node14path60) - 1))) & (success'=min(1, node14path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path61 * min(1,node14path61) - currentNode*(min(1, node14path61) - 1))) &  (currentPath'=(61 * min(1, node14path61) - currentPath*(min(1,node14path61) - 1))) & (success'=min(1, node14path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path62 * min(1,node14path62) - currentNode*(min(1, node14path62) - 1))) &  (currentPath'=(62 * min(1, node14path62) - currentPath*(min(1,node14path62) - 1))) & (success'=min(1, node14path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path63 * min(1,node14path63) - currentNode*(min(1, node14path63) - 1))) &  (currentPath'=(63 * min(1, node14path63) - currentPath*(min(1,node14path63) - 1))) & (success'=min(1, node14path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path64 * min(1,node14path64) - currentNode*(min(1, node14path64) - 1))) &  (currentPath'=(64 * min(1, node14path64) - currentPath*(min(1,node14path64) - 1))) & (success'=min(1, node14path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path65 * min(1,node14path65) - currentNode*(min(1, node14path65) - 1))) &  (currentPath'=(65 * min(1, node14path65) - currentPath*(min(1,node14path65) - 1))) & (success'=min(1, node14path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path66 * min(1,node14path66) - currentNode*(min(1, node14path66) - 1))) &  (currentPath'=(66 * min(1, node14path66) - currentPath*(min(1,node14path66) - 1))) & (success'=min(1, node14path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path67 * min(1,node14path67) - currentNode*(min(1, node14path67) - 1))) &  (currentPath'=(67 * min(1, node14path67) - currentPath*(min(1,node14path67) - 1))) & (success'=min(1, node14path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path68 * min(1,node14path68) - currentNode*(min(1, node14path68) - 1))) &  (currentPath'=(68 * min(1, node14path68) - currentPath*(min(1,node14path68) - 1))) & (success'=min(1, node14path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path69 * min(1,node14path69) - currentNode*(min(1, node14path69) - 1))) &  (currentPath'=(69 * min(1, node14path69) - currentPath*(min(1,node14path69) - 1))) & (success'=min(1, node14path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path70 * min(1,node14path70) - currentNode*(min(1, node14path70) - 1))) &  (currentPath'=(70 * min(1, node14path70) - currentPath*(min(1,node14path70) - 1))) & (success'=min(1, node14path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path71 * min(1,node14path71) - currentNode*(min(1, node14path71) - 1))) &  (currentPath'=(71 * min(1, node14path71) - currentPath*(min(1,node14path71) - 1))) & (success'=min(1, node14path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path72 * min(1,node14path72) - currentNode*(min(1, node14path72) - 1))) &  (currentPath'=(72 * min(1, node14path72) - currentPath*(min(1,node14path72) - 1))) & (success'=min(1, node14path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path73 * min(1,node14path73) - currentNode*(min(1, node14path73) - 1))) &  (currentPath'=(73 * min(1, node14path73) - currentPath*(min(1,node14path73) - 1))) & (success'=min(1, node14path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path74 * min(1,node14path74) - currentNode*(min(1, node14path74) - 1))) &  (currentPath'=(74 * min(1, node14path74) - currentPath*(min(1,node14path74) - 1))) & (success'=min(1, node14path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path75 * min(1,node14path75) - currentNode*(min(1, node14path75) - 1))) &  (currentPath'=(75 * min(1, node14path75) - currentPath*(min(1,node14path75) - 1))) & (success'=min(1, node14path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path76 * min(1,node14path76) - currentNode*(min(1, node14path76) - 1))) &  (currentPath'=(76 * min(1, node14path76) - currentPath*(min(1,node14path76) - 1))) & (success'=min(1, node14path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path77 * min(1,node14path77) - currentNode*(min(1, node14path77) - 1))) &  (currentPath'=(77 * min(1, node14path77) - currentPath*(min(1,node14path77) - 1))) & (success'=min(1, node14path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path78 * min(1,node14path78) - currentNode*(min(1, node14path78) - 1))) &  (currentPath'=(78 * min(1, node14path78) - currentPath*(min(1,node14path78) - 1))) & (success'=min(1, node14path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path79 * min(1,node14path79) - currentNode*(min(1, node14path79) - 1))) &  (currentPath'=(79 * min(1, node14path79) - currentPath*(min(1,node14path79) - 1))) & (success'=min(1, node14path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path80 * min(1,node14path80) - currentNode*(min(1, node14path80) - 1))) &  (currentPath'=(80 * min(1, node14path80) - currentPath*(min(1,node14path80) - 1))) & (success'=min(1, node14path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path81 * min(1,node14path81) - currentNode*(min(1, node14path81) - 1))) &  (currentPath'=(81 * min(1, node14path81) - currentPath*(min(1,node14path81) - 1))) & (success'=min(1, node14path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path82 * min(1,node14path82) - currentNode*(min(1, node14path82) - 1))) &  (currentPath'=(82 * min(1, node14path82) - currentPath*(min(1,node14path82) - 1))) & (success'=min(1, node14path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path83 * min(1,node14path83) - currentNode*(min(1, node14path83) - 1))) &  (currentPath'=(83 * min(1, node14path83) - currentPath*(min(1,node14path83) - 1))) & (success'=min(1, node14path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path84 * min(1,node14path84) - currentNode*(min(1, node14path84) - 1))) &  (currentPath'=(84 * min(1, node14path84) - currentPath*(min(1,node14path84) - 1))) & (success'=min(1, node14path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path85 * min(1,node14path85) - currentNode*(min(1, node14path85) - 1))) &  (currentPath'=(85 * min(1, node14path85) - currentPath*(min(1,node14path85) - 1))) & (success'=min(1, node14path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path86 * min(1,node14path86) - currentNode*(min(1, node14path86) - 1))) &  (currentPath'=(86 * min(1, node14path86) - currentPath*(min(1,node14path86) - 1))) & (success'=min(1, node14path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path87 * min(1,node14path87) - currentNode*(min(1, node14path87) - 1))) &  (currentPath'=(87 * min(1, node14path87) - currentPath*(min(1,node14path87) - 1))) & (success'=min(1, node14path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path88 * min(1,node14path88) - currentNode*(min(1, node14path88) - 1))) &  (currentPath'=(88 * min(1, node14path88) - currentPath*(min(1,node14path88) - 1))) & (success'=min(1, node14path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path89 * min(1,node14path89) - currentNode*(min(1, node14path89) - 1))) &  (currentPath'=(89 * min(1, node14path89) - currentPath*(min(1,node14path89) - 1))) & (success'=min(1, node14path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path90 * min(1,node14path90) - currentNode*(min(1, node14path90) - 1))) &  (currentPath'=(90 * min(1, node14path90) - currentPath*(min(1,node14path90) - 1))) & (success'=min(1, node14path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path91 * min(1,node14path91) - currentNode*(min(1, node14path91) - 1))) &  (currentPath'=(91 * min(1, node14path91) - currentPath*(min(1,node14path91) - 1))) & (success'=min(1, node14path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path92 * min(1,node14path92) - currentNode*(min(1, node14path92) - 1))) &  (currentPath'=(92 * min(1, node14path92) - currentPath*(min(1,node14path92) - 1))) & (success'=min(1, node14path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path93 * min(1,node14path93) - currentNode*(min(1, node14path93) - 1))) &  (currentPath'=(93 * min(1, node14path93) - currentPath*(min(1,node14path93) - 1))) & (success'=min(1, node14path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path94 * min(1,node14path94) - currentNode*(min(1, node14path94) - 1))) &  (currentPath'=(94 * min(1, node14path94) - currentPath*(min(1,node14path94) - 1))) & (success'=min(1, node14path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path95 * min(1,node14path95) - currentNode*(min(1, node14path95) - 1))) &  (currentPath'=(95 * min(1, node14path95) - currentPath*(min(1,node14path95) - 1))) & (success'=min(1, node14path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path96 * min(1,node14path96) - currentNode*(min(1, node14path96) - 1))) &  (currentPath'=(96 * min(1, node14path96) - currentPath*(min(1,node14path96) - 1))) & (success'=min(1, node14path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path97 * min(1,node14path97) - currentNode*(min(1, node14path97) - 1))) &  (currentPath'=(97 * min(1, node14path97) - currentPath*(min(1,node14path97) - 1))) & (success'=min(1, node14path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path98 * min(1,node14path98) - currentNode*(min(1, node14path98) - 1))) &  (currentPath'=(98 * min(1, node14path98) - currentPath*(min(1,node14path98) - 1))) & (success'=min(1, node14path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path99 * min(1,node14path99) - currentNode*(min(1, node14path99) - 1))) &  (currentPath'=(99 * min(1, node14path99) - currentPath*(min(1,node14path99) - 1))) & (success'=min(1, node14path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node14path100 * min(1,node14path100) - currentNode*(min(1, node14path100) - 1))) &  (currentPath'=(100 * min(1, node14path100) - currentPath*(min(1,node14path100) - 1))) & (success'=min(1, node14path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 15) ->
 numPathsInv: (currentNode'=(node15path1 * min(1,node15path1) - currentNode*(min(1, node15path1) - 1))) &  (currentPath'=(1 * min(1, node15path1) - currentPath*(min(1,node15path1) - 1))) & (success'=min(1, node15path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path2 * min(1,node15path2) - currentNode*(min(1, node15path2) - 1))) &  (currentPath'=(2 * min(1, node15path2) - currentPath*(min(1,node15path2) - 1))) & (success'=min(1, node15path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path3 * min(1,node15path3) - currentNode*(min(1, node15path3) - 1))) &  (currentPath'=(3 * min(1, node15path3) - currentPath*(min(1,node15path3) - 1))) & (success'=min(1, node15path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path4 * min(1,node15path4) - currentNode*(min(1, node15path4) - 1))) &  (currentPath'=(4 * min(1, node15path4) - currentPath*(min(1,node15path4) - 1))) & (success'=min(1, node15path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path5 * min(1,node15path5) - currentNode*(min(1, node15path5) - 1))) &  (currentPath'=(5 * min(1, node15path5) - currentPath*(min(1,node15path5) - 1))) & (success'=min(1, node15path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path6 * min(1,node15path6) - currentNode*(min(1, node15path6) - 1))) &  (currentPath'=(6 * min(1, node15path6) - currentPath*(min(1,node15path6) - 1))) & (success'=min(1, node15path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path7 * min(1,node15path7) - currentNode*(min(1, node15path7) - 1))) &  (currentPath'=(7 * min(1, node15path7) - currentPath*(min(1,node15path7) - 1))) & (success'=min(1, node15path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path8 * min(1,node15path8) - currentNode*(min(1, node15path8) - 1))) &  (currentPath'=(8 * min(1, node15path8) - currentPath*(min(1,node15path8) - 1))) & (success'=min(1, node15path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path9 * min(1,node15path9) - currentNode*(min(1, node15path9) - 1))) &  (currentPath'=(9 * min(1, node15path9) - currentPath*(min(1,node15path9) - 1))) & (success'=min(1, node15path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path10 * min(1,node15path10) - currentNode*(min(1, node15path10) - 1))) &  (currentPath'=(10 * min(1, node15path10) - currentPath*(min(1,node15path10) - 1))) & (success'=min(1, node15path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path11 * min(1,node15path11) - currentNode*(min(1, node15path11) - 1))) &  (currentPath'=(11 * min(1, node15path11) - currentPath*(min(1,node15path11) - 1))) & (success'=min(1, node15path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path12 * min(1,node15path12) - currentNode*(min(1, node15path12) - 1))) &  (currentPath'=(12 * min(1, node15path12) - currentPath*(min(1,node15path12) - 1))) & (success'=min(1, node15path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path13 * min(1,node15path13) - currentNode*(min(1, node15path13) - 1))) &  (currentPath'=(13 * min(1, node15path13) - currentPath*(min(1,node15path13) - 1))) & (success'=min(1, node15path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path14 * min(1,node15path14) - currentNode*(min(1, node15path14) - 1))) &  (currentPath'=(14 * min(1, node15path14) - currentPath*(min(1,node15path14) - 1))) & (success'=min(1, node15path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path15 * min(1,node15path15) - currentNode*(min(1, node15path15) - 1))) &  (currentPath'=(15 * min(1, node15path15) - currentPath*(min(1,node15path15) - 1))) & (success'=min(1, node15path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path16 * min(1,node15path16) - currentNode*(min(1, node15path16) - 1))) &  (currentPath'=(16 * min(1, node15path16) - currentPath*(min(1,node15path16) - 1))) & (success'=min(1, node15path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path17 * min(1,node15path17) - currentNode*(min(1, node15path17) - 1))) &  (currentPath'=(17 * min(1, node15path17) - currentPath*(min(1,node15path17) - 1))) & (success'=min(1, node15path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path18 * min(1,node15path18) - currentNode*(min(1, node15path18) - 1))) &  (currentPath'=(18 * min(1, node15path18) - currentPath*(min(1,node15path18) - 1))) & (success'=min(1, node15path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path19 * min(1,node15path19) - currentNode*(min(1, node15path19) - 1))) &  (currentPath'=(19 * min(1, node15path19) - currentPath*(min(1,node15path19) - 1))) & (success'=min(1, node15path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path20 * min(1,node15path20) - currentNode*(min(1, node15path20) - 1))) &  (currentPath'=(20 * min(1, node15path20) - currentPath*(min(1,node15path20) - 1))) & (success'=min(1, node15path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path21 * min(1,node15path21) - currentNode*(min(1, node15path21) - 1))) &  (currentPath'=(21 * min(1, node15path21) - currentPath*(min(1,node15path21) - 1))) & (success'=min(1, node15path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path22 * min(1,node15path22) - currentNode*(min(1, node15path22) - 1))) &  (currentPath'=(22 * min(1, node15path22) - currentPath*(min(1,node15path22) - 1))) & (success'=min(1, node15path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path23 * min(1,node15path23) - currentNode*(min(1, node15path23) - 1))) &  (currentPath'=(23 * min(1, node15path23) - currentPath*(min(1,node15path23) - 1))) & (success'=min(1, node15path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path24 * min(1,node15path24) - currentNode*(min(1, node15path24) - 1))) &  (currentPath'=(24 * min(1, node15path24) - currentPath*(min(1,node15path24) - 1))) & (success'=min(1, node15path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path25 * min(1,node15path25) - currentNode*(min(1, node15path25) - 1))) &  (currentPath'=(25 * min(1, node15path25) - currentPath*(min(1,node15path25) - 1))) & (success'=min(1, node15path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path26 * min(1,node15path26) - currentNode*(min(1, node15path26) - 1))) &  (currentPath'=(26 * min(1, node15path26) - currentPath*(min(1,node15path26) - 1))) & (success'=min(1, node15path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path27 * min(1,node15path27) - currentNode*(min(1, node15path27) - 1))) &  (currentPath'=(27 * min(1, node15path27) - currentPath*(min(1,node15path27) - 1))) & (success'=min(1, node15path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path28 * min(1,node15path28) - currentNode*(min(1, node15path28) - 1))) &  (currentPath'=(28 * min(1, node15path28) - currentPath*(min(1,node15path28) - 1))) & (success'=min(1, node15path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path29 * min(1,node15path29) - currentNode*(min(1, node15path29) - 1))) &  (currentPath'=(29 * min(1, node15path29) - currentPath*(min(1,node15path29) - 1))) & (success'=min(1, node15path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path30 * min(1,node15path30) - currentNode*(min(1, node15path30) - 1))) &  (currentPath'=(30 * min(1, node15path30) - currentPath*(min(1,node15path30) - 1))) & (success'=min(1, node15path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path31 * min(1,node15path31) - currentNode*(min(1, node15path31) - 1))) &  (currentPath'=(31 * min(1, node15path31) - currentPath*(min(1,node15path31) - 1))) & (success'=min(1, node15path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path32 * min(1,node15path32) - currentNode*(min(1, node15path32) - 1))) &  (currentPath'=(32 * min(1, node15path32) - currentPath*(min(1,node15path32) - 1))) & (success'=min(1, node15path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path33 * min(1,node15path33) - currentNode*(min(1, node15path33) - 1))) &  (currentPath'=(33 * min(1, node15path33) - currentPath*(min(1,node15path33) - 1))) & (success'=min(1, node15path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path34 * min(1,node15path34) - currentNode*(min(1, node15path34) - 1))) &  (currentPath'=(34 * min(1, node15path34) - currentPath*(min(1,node15path34) - 1))) & (success'=min(1, node15path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path35 * min(1,node15path35) - currentNode*(min(1, node15path35) - 1))) &  (currentPath'=(35 * min(1, node15path35) - currentPath*(min(1,node15path35) - 1))) & (success'=min(1, node15path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path36 * min(1,node15path36) - currentNode*(min(1, node15path36) - 1))) &  (currentPath'=(36 * min(1, node15path36) - currentPath*(min(1,node15path36) - 1))) & (success'=min(1, node15path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path37 * min(1,node15path37) - currentNode*(min(1, node15path37) - 1))) &  (currentPath'=(37 * min(1, node15path37) - currentPath*(min(1,node15path37) - 1))) & (success'=min(1, node15path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path38 * min(1,node15path38) - currentNode*(min(1, node15path38) - 1))) &  (currentPath'=(38 * min(1, node15path38) - currentPath*(min(1,node15path38) - 1))) & (success'=min(1, node15path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path39 * min(1,node15path39) - currentNode*(min(1, node15path39) - 1))) &  (currentPath'=(39 * min(1, node15path39) - currentPath*(min(1,node15path39) - 1))) & (success'=min(1, node15path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path40 * min(1,node15path40) - currentNode*(min(1, node15path40) - 1))) &  (currentPath'=(40 * min(1, node15path40) - currentPath*(min(1,node15path40) - 1))) & (success'=min(1, node15path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path41 * min(1,node15path41) - currentNode*(min(1, node15path41) - 1))) &  (currentPath'=(41 * min(1, node15path41) - currentPath*(min(1,node15path41) - 1))) & (success'=min(1, node15path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path42 * min(1,node15path42) - currentNode*(min(1, node15path42) - 1))) &  (currentPath'=(42 * min(1, node15path42) - currentPath*(min(1,node15path42) - 1))) & (success'=min(1, node15path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path43 * min(1,node15path43) - currentNode*(min(1, node15path43) - 1))) &  (currentPath'=(43 * min(1, node15path43) - currentPath*(min(1,node15path43) - 1))) & (success'=min(1, node15path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path44 * min(1,node15path44) - currentNode*(min(1, node15path44) - 1))) &  (currentPath'=(44 * min(1, node15path44) - currentPath*(min(1,node15path44) - 1))) & (success'=min(1, node15path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path45 * min(1,node15path45) - currentNode*(min(1, node15path45) - 1))) &  (currentPath'=(45 * min(1, node15path45) - currentPath*(min(1,node15path45) - 1))) & (success'=min(1, node15path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path46 * min(1,node15path46) - currentNode*(min(1, node15path46) - 1))) &  (currentPath'=(46 * min(1, node15path46) - currentPath*(min(1,node15path46) - 1))) & (success'=min(1, node15path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path47 * min(1,node15path47) - currentNode*(min(1, node15path47) - 1))) &  (currentPath'=(47 * min(1, node15path47) - currentPath*(min(1,node15path47) - 1))) & (success'=min(1, node15path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path48 * min(1,node15path48) - currentNode*(min(1, node15path48) - 1))) &  (currentPath'=(48 * min(1, node15path48) - currentPath*(min(1,node15path48) - 1))) & (success'=min(1, node15path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path49 * min(1,node15path49) - currentNode*(min(1, node15path49) - 1))) &  (currentPath'=(49 * min(1, node15path49) - currentPath*(min(1,node15path49) - 1))) & (success'=min(1, node15path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path50 * min(1,node15path50) - currentNode*(min(1, node15path50) - 1))) &  (currentPath'=(50 * min(1, node15path50) - currentPath*(min(1,node15path50) - 1))) & (success'=min(1, node15path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path51 * min(1,node15path51) - currentNode*(min(1, node15path51) - 1))) &  (currentPath'=(51 * min(1, node15path51) - currentPath*(min(1,node15path51) - 1))) & (success'=min(1, node15path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path52 * min(1,node15path52) - currentNode*(min(1, node15path52) - 1))) &  (currentPath'=(52 * min(1, node15path52) - currentPath*(min(1,node15path52) - 1))) & (success'=min(1, node15path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path53 * min(1,node15path53) - currentNode*(min(1, node15path53) - 1))) &  (currentPath'=(53 * min(1, node15path53) - currentPath*(min(1,node15path53) - 1))) & (success'=min(1, node15path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path54 * min(1,node15path54) - currentNode*(min(1, node15path54) - 1))) &  (currentPath'=(54 * min(1, node15path54) - currentPath*(min(1,node15path54) - 1))) & (success'=min(1, node15path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path55 * min(1,node15path55) - currentNode*(min(1, node15path55) - 1))) &  (currentPath'=(55 * min(1, node15path55) - currentPath*(min(1,node15path55) - 1))) & (success'=min(1, node15path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path56 * min(1,node15path56) - currentNode*(min(1, node15path56) - 1))) &  (currentPath'=(56 * min(1, node15path56) - currentPath*(min(1,node15path56) - 1))) & (success'=min(1, node15path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path57 * min(1,node15path57) - currentNode*(min(1, node15path57) - 1))) &  (currentPath'=(57 * min(1, node15path57) - currentPath*(min(1,node15path57) - 1))) & (success'=min(1, node15path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path58 * min(1,node15path58) - currentNode*(min(1, node15path58) - 1))) &  (currentPath'=(58 * min(1, node15path58) - currentPath*(min(1,node15path58) - 1))) & (success'=min(1, node15path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path59 * min(1,node15path59) - currentNode*(min(1, node15path59) - 1))) &  (currentPath'=(59 * min(1, node15path59) - currentPath*(min(1,node15path59) - 1))) & (success'=min(1, node15path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path60 * min(1,node15path60) - currentNode*(min(1, node15path60) - 1))) &  (currentPath'=(60 * min(1, node15path60) - currentPath*(min(1,node15path60) - 1))) & (success'=min(1, node15path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path61 * min(1,node15path61) - currentNode*(min(1, node15path61) - 1))) &  (currentPath'=(61 * min(1, node15path61) - currentPath*(min(1,node15path61) - 1))) & (success'=min(1, node15path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path62 * min(1,node15path62) - currentNode*(min(1, node15path62) - 1))) &  (currentPath'=(62 * min(1, node15path62) - currentPath*(min(1,node15path62) - 1))) & (success'=min(1, node15path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path63 * min(1,node15path63) - currentNode*(min(1, node15path63) - 1))) &  (currentPath'=(63 * min(1, node15path63) - currentPath*(min(1,node15path63) - 1))) & (success'=min(1, node15path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path64 * min(1,node15path64) - currentNode*(min(1, node15path64) - 1))) &  (currentPath'=(64 * min(1, node15path64) - currentPath*(min(1,node15path64) - 1))) & (success'=min(1, node15path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path65 * min(1,node15path65) - currentNode*(min(1, node15path65) - 1))) &  (currentPath'=(65 * min(1, node15path65) - currentPath*(min(1,node15path65) - 1))) & (success'=min(1, node15path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path66 * min(1,node15path66) - currentNode*(min(1, node15path66) - 1))) &  (currentPath'=(66 * min(1, node15path66) - currentPath*(min(1,node15path66) - 1))) & (success'=min(1, node15path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path67 * min(1,node15path67) - currentNode*(min(1, node15path67) - 1))) &  (currentPath'=(67 * min(1, node15path67) - currentPath*(min(1,node15path67) - 1))) & (success'=min(1, node15path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path68 * min(1,node15path68) - currentNode*(min(1, node15path68) - 1))) &  (currentPath'=(68 * min(1, node15path68) - currentPath*(min(1,node15path68) - 1))) & (success'=min(1, node15path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path69 * min(1,node15path69) - currentNode*(min(1, node15path69) - 1))) &  (currentPath'=(69 * min(1, node15path69) - currentPath*(min(1,node15path69) - 1))) & (success'=min(1, node15path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path70 * min(1,node15path70) - currentNode*(min(1, node15path70) - 1))) &  (currentPath'=(70 * min(1, node15path70) - currentPath*(min(1,node15path70) - 1))) & (success'=min(1, node15path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path71 * min(1,node15path71) - currentNode*(min(1, node15path71) - 1))) &  (currentPath'=(71 * min(1, node15path71) - currentPath*(min(1,node15path71) - 1))) & (success'=min(1, node15path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path72 * min(1,node15path72) - currentNode*(min(1, node15path72) - 1))) &  (currentPath'=(72 * min(1, node15path72) - currentPath*(min(1,node15path72) - 1))) & (success'=min(1, node15path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path73 * min(1,node15path73) - currentNode*(min(1, node15path73) - 1))) &  (currentPath'=(73 * min(1, node15path73) - currentPath*(min(1,node15path73) - 1))) & (success'=min(1, node15path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path74 * min(1,node15path74) - currentNode*(min(1, node15path74) - 1))) &  (currentPath'=(74 * min(1, node15path74) - currentPath*(min(1,node15path74) - 1))) & (success'=min(1, node15path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path75 * min(1,node15path75) - currentNode*(min(1, node15path75) - 1))) &  (currentPath'=(75 * min(1, node15path75) - currentPath*(min(1,node15path75) - 1))) & (success'=min(1, node15path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path76 * min(1,node15path76) - currentNode*(min(1, node15path76) - 1))) &  (currentPath'=(76 * min(1, node15path76) - currentPath*(min(1,node15path76) - 1))) & (success'=min(1, node15path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path77 * min(1,node15path77) - currentNode*(min(1, node15path77) - 1))) &  (currentPath'=(77 * min(1, node15path77) - currentPath*(min(1,node15path77) - 1))) & (success'=min(1, node15path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path78 * min(1,node15path78) - currentNode*(min(1, node15path78) - 1))) &  (currentPath'=(78 * min(1, node15path78) - currentPath*(min(1,node15path78) - 1))) & (success'=min(1, node15path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path79 * min(1,node15path79) - currentNode*(min(1, node15path79) - 1))) &  (currentPath'=(79 * min(1, node15path79) - currentPath*(min(1,node15path79) - 1))) & (success'=min(1, node15path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path80 * min(1,node15path80) - currentNode*(min(1, node15path80) - 1))) &  (currentPath'=(80 * min(1, node15path80) - currentPath*(min(1,node15path80) - 1))) & (success'=min(1, node15path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path81 * min(1,node15path81) - currentNode*(min(1, node15path81) - 1))) &  (currentPath'=(81 * min(1, node15path81) - currentPath*(min(1,node15path81) - 1))) & (success'=min(1, node15path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path82 * min(1,node15path82) - currentNode*(min(1, node15path82) - 1))) &  (currentPath'=(82 * min(1, node15path82) - currentPath*(min(1,node15path82) - 1))) & (success'=min(1, node15path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path83 * min(1,node15path83) - currentNode*(min(1, node15path83) - 1))) &  (currentPath'=(83 * min(1, node15path83) - currentPath*(min(1,node15path83) - 1))) & (success'=min(1, node15path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path84 * min(1,node15path84) - currentNode*(min(1, node15path84) - 1))) &  (currentPath'=(84 * min(1, node15path84) - currentPath*(min(1,node15path84) - 1))) & (success'=min(1, node15path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path85 * min(1,node15path85) - currentNode*(min(1, node15path85) - 1))) &  (currentPath'=(85 * min(1, node15path85) - currentPath*(min(1,node15path85) - 1))) & (success'=min(1, node15path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path86 * min(1,node15path86) - currentNode*(min(1, node15path86) - 1))) &  (currentPath'=(86 * min(1, node15path86) - currentPath*(min(1,node15path86) - 1))) & (success'=min(1, node15path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path87 * min(1,node15path87) - currentNode*(min(1, node15path87) - 1))) &  (currentPath'=(87 * min(1, node15path87) - currentPath*(min(1,node15path87) - 1))) & (success'=min(1, node15path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path88 * min(1,node15path88) - currentNode*(min(1, node15path88) - 1))) &  (currentPath'=(88 * min(1, node15path88) - currentPath*(min(1,node15path88) - 1))) & (success'=min(1, node15path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path89 * min(1,node15path89) - currentNode*(min(1, node15path89) - 1))) &  (currentPath'=(89 * min(1, node15path89) - currentPath*(min(1,node15path89) - 1))) & (success'=min(1, node15path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path90 * min(1,node15path90) - currentNode*(min(1, node15path90) - 1))) &  (currentPath'=(90 * min(1, node15path90) - currentPath*(min(1,node15path90) - 1))) & (success'=min(1, node15path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path91 * min(1,node15path91) - currentNode*(min(1, node15path91) - 1))) &  (currentPath'=(91 * min(1, node15path91) - currentPath*(min(1,node15path91) - 1))) & (success'=min(1, node15path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path92 * min(1,node15path92) - currentNode*(min(1, node15path92) - 1))) &  (currentPath'=(92 * min(1, node15path92) - currentPath*(min(1,node15path92) - 1))) & (success'=min(1, node15path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path93 * min(1,node15path93) - currentNode*(min(1, node15path93) - 1))) &  (currentPath'=(93 * min(1, node15path93) - currentPath*(min(1,node15path93) - 1))) & (success'=min(1, node15path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path94 * min(1,node15path94) - currentNode*(min(1, node15path94) - 1))) &  (currentPath'=(94 * min(1, node15path94) - currentPath*(min(1,node15path94) - 1))) & (success'=min(1, node15path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path95 * min(1,node15path95) - currentNode*(min(1, node15path95) - 1))) &  (currentPath'=(95 * min(1, node15path95) - currentPath*(min(1,node15path95) - 1))) & (success'=min(1, node15path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path96 * min(1,node15path96) - currentNode*(min(1, node15path96) - 1))) &  (currentPath'=(96 * min(1, node15path96) - currentPath*(min(1,node15path96) - 1))) & (success'=min(1, node15path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path97 * min(1,node15path97) - currentNode*(min(1, node15path97) - 1))) &  (currentPath'=(97 * min(1, node15path97) - currentPath*(min(1,node15path97) - 1))) & (success'=min(1, node15path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path98 * min(1,node15path98) - currentNode*(min(1, node15path98) - 1))) &  (currentPath'=(98 * min(1, node15path98) - currentPath*(min(1,node15path98) - 1))) & (success'=min(1, node15path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path99 * min(1,node15path99) - currentNode*(min(1, node15path99) - 1))) &  (currentPath'=(99 * min(1, node15path99) - currentPath*(min(1,node15path99) - 1))) & (success'=min(1, node15path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node15path100 * min(1,node15path100) - currentNode*(min(1, node15path100) - 1))) &  (currentPath'=(100 * min(1, node15path100) - currentPath*(min(1,node15path100) - 1))) & (success'=min(1, node15path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 16) ->
 numPathsInv: (currentNode'=(node16path1 * min(1,node16path1) - currentNode*(min(1, node16path1) - 1))) &  (currentPath'=(1 * min(1, node16path1) - currentPath*(min(1,node16path1) - 1))) & (success'=min(1, node16path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path2 * min(1,node16path2) - currentNode*(min(1, node16path2) - 1))) &  (currentPath'=(2 * min(1, node16path2) - currentPath*(min(1,node16path2) - 1))) & (success'=min(1, node16path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path3 * min(1,node16path3) - currentNode*(min(1, node16path3) - 1))) &  (currentPath'=(3 * min(1, node16path3) - currentPath*(min(1,node16path3) - 1))) & (success'=min(1, node16path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path4 * min(1,node16path4) - currentNode*(min(1, node16path4) - 1))) &  (currentPath'=(4 * min(1, node16path4) - currentPath*(min(1,node16path4) - 1))) & (success'=min(1, node16path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path5 * min(1,node16path5) - currentNode*(min(1, node16path5) - 1))) &  (currentPath'=(5 * min(1, node16path5) - currentPath*(min(1,node16path5) - 1))) & (success'=min(1, node16path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path6 * min(1,node16path6) - currentNode*(min(1, node16path6) - 1))) &  (currentPath'=(6 * min(1, node16path6) - currentPath*(min(1,node16path6) - 1))) & (success'=min(1, node16path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path7 * min(1,node16path7) - currentNode*(min(1, node16path7) - 1))) &  (currentPath'=(7 * min(1, node16path7) - currentPath*(min(1,node16path7) - 1))) & (success'=min(1, node16path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path8 * min(1,node16path8) - currentNode*(min(1, node16path8) - 1))) &  (currentPath'=(8 * min(1, node16path8) - currentPath*(min(1,node16path8) - 1))) & (success'=min(1, node16path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path9 * min(1,node16path9) - currentNode*(min(1, node16path9) - 1))) &  (currentPath'=(9 * min(1, node16path9) - currentPath*(min(1,node16path9) - 1))) & (success'=min(1, node16path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path10 * min(1,node16path10) - currentNode*(min(1, node16path10) - 1))) &  (currentPath'=(10 * min(1, node16path10) - currentPath*(min(1,node16path10) - 1))) & (success'=min(1, node16path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path11 * min(1,node16path11) - currentNode*(min(1, node16path11) - 1))) &  (currentPath'=(11 * min(1, node16path11) - currentPath*(min(1,node16path11) - 1))) & (success'=min(1, node16path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path12 * min(1,node16path12) - currentNode*(min(1, node16path12) - 1))) &  (currentPath'=(12 * min(1, node16path12) - currentPath*(min(1,node16path12) - 1))) & (success'=min(1, node16path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path13 * min(1,node16path13) - currentNode*(min(1, node16path13) - 1))) &  (currentPath'=(13 * min(1, node16path13) - currentPath*(min(1,node16path13) - 1))) & (success'=min(1, node16path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path14 * min(1,node16path14) - currentNode*(min(1, node16path14) - 1))) &  (currentPath'=(14 * min(1, node16path14) - currentPath*(min(1,node16path14) - 1))) & (success'=min(1, node16path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path15 * min(1,node16path15) - currentNode*(min(1, node16path15) - 1))) &  (currentPath'=(15 * min(1, node16path15) - currentPath*(min(1,node16path15) - 1))) & (success'=min(1, node16path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path16 * min(1,node16path16) - currentNode*(min(1, node16path16) - 1))) &  (currentPath'=(16 * min(1, node16path16) - currentPath*(min(1,node16path16) - 1))) & (success'=min(1, node16path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path17 * min(1,node16path17) - currentNode*(min(1, node16path17) - 1))) &  (currentPath'=(17 * min(1, node16path17) - currentPath*(min(1,node16path17) - 1))) & (success'=min(1, node16path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path18 * min(1,node16path18) - currentNode*(min(1, node16path18) - 1))) &  (currentPath'=(18 * min(1, node16path18) - currentPath*(min(1,node16path18) - 1))) & (success'=min(1, node16path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path19 * min(1,node16path19) - currentNode*(min(1, node16path19) - 1))) &  (currentPath'=(19 * min(1, node16path19) - currentPath*(min(1,node16path19) - 1))) & (success'=min(1, node16path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path20 * min(1,node16path20) - currentNode*(min(1, node16path20) - 1))) &  (currentPath'=(20 * min(1, node16path20) - currentPath*(min(1,node16path20) - 1))) & (success'=min(1, node16path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path21 * min(1,node16path21) - currentNode*(min(1, node16path21) - 1))) &  (currentPath'=(21 * min(1, node16path21) - currentPath*(min(1,node16path21) - 1))) & (success'=min(1, node16path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path22 * min(1,node16path22) - currentNode*(min(1, node16path22) - 1))) &  (currentPath'=(22 * min(1, node16path22) - currentPath*(min(1,node16path22) - 1))) & (success'=min(1, node16path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path23 * min(1,node16path23) - currentNode*(min(1, node16path23) - 1))) &  (currentPath'=(23 * min(1, node16path23) - currentPath*(min(1,node16path23) - 1))) & (success'=min(1, node16path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path24 * min(1,node16path24) - currentNode*(min(1, node16path24) - 1))) &  (currentPath'=(24 * min(1, node16path24) - currentPath*(min(1,node16path24) - 1))) & (success'=min(1, node16path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path25 * min(1,node16path25) - currentNode*(min(1, node16path25) - 1))) &  (currentPath'=(25 * min(1, node16path25) - currentPath*(min(1,node16path25) - 1))) & (success'=min(1, node16path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path26 * min(1,node16path26) - currentNode*(min(1, node16path26) - 1))) &  (currentPath'=(26 * min(1, node16path26) - currentPath*(min(1,node16path26) - 1))) & (success'=min(1, node16path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path27 * min(1,node16path27) - currentNode*(min(1, node16path27) - 1))) &  (currentPath'=(27 * min(1, node16path27) - currentPath*(min(1,node16path27) - 1))) & (success'=min(1, node16path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path28 * min(1,node16path28) - currentNode*(min(1, node16path28) - 1))) &  (currentPath'=(28 * min(1, node16path28) - currentPath*(min(1,node16path28) - 1))) & (success'=min(1, node16path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path29 * min(1,node16path29) - currentNode*(min(1, node16path29) - 1))) &  (currentPath'=(29 * min(1, node16path29) - currentPath*(min(1,node16path29) - 1))) & (success'=min(1, node16path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path30 * min(1,node16path30) - currentNode*(min(1, node16path30) - 1))) &  (currentPath'=(30 * min(1, node16path30) - currentPath*(min(1,node16path30) - 1))) & (success'=min(1, node16path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path31 * min(1,node16path31) - currentNode*(min(1, node16path31) - 1))) &  (currentPath'=(31 * min(1, node16path31) - currentPath*(min(1,node16path31) - 1))) & (success'=min(1, node16path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path32 * min(1,node16path32) - currentNode*(min(1, node16path32) - 1))) &  (currentPath'=(32 * min(1, node16path32) - currentPath*(min(1,node16path32) - 1))) & (success'=min(1, node16path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path33 * min(1,node16path33) - currentNode*(min(1, node16path33) - 1))) &  (currentPath'=(33 * min(1, node16path33) - currentPath*(min(1,node16path33) - 1))) & (success'=min(1, node16path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path34 * min(1,node16path34) - currentNode*(min(1, node16path34) - 1))) &  (currentPath'=(34 * min(1, node16path34) - currentPath*(min(1,node16path34) - 1))) & (success'=min(1, node16path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path35 * min(1,node16path35) - currentNode*(min(1, node16path35) - 1))) &  (currentPath'=(35 * min(1, node16path35) - currentPath*(min(1,node16path35) - 1))) & (success'=min(1, node16path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path36 * min(1,node16path36) - currentNode*(min(1, node16path36) - 1))) &  (currentPath'=(36 * min(1, node16path36) - currentPath*(min(1,node16path36) - 1))) & (success'=min(1, node16path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path37 * min(1,node16path37) - currentNode*(min(1, node16path37) - 1))) &  (currentPath'=(37 * min(1, node16path37) - currentPath*(min(1,node16path37) - 1))) & (success'=min(1, node16path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path38 * min(1,node16path38) - currentNode*(min(1, node16path38) - 1))) &  (currentPath'=(38 * min(1, node16path38) - currentPath*(min(1,node16path38) - 1))) & (success'=min(1, node16path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path39 * min(1,node16path39) - currentNode*(min(1, node16path39) - 1))) &  (currentPath'=(39 * min(1, node16path39) - currentPath*(min(1,node16path39) - 1))) & (success'=min(1, node16path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path40 * min(1,node16path40) - currentNode*(min(1, node16path40) - 1))) &  (currentPath'=(40 * min(1, node16path40) - currentPath*(min(1,node16path40) - 1))) & (success'=min(1, node16path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path41 * min(1,node16path41) - currentNode*(min(1, node16path41) - 1))) &  (currentPath'=(41 * min(1, node16path41) - currentPath*(min(1,node16path41) - 1))) & (success'=min(1, node16path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path42 * min(1,node16path42) - currentNode*(min(1, node16path42) - 1))) &  (currentPath'=(42 * min(1, node16path42) - currentPath*(min(1,node16path42) - 1))) & (success'=min(1, node16path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path43 * min(1,node16path43) - currentNode*(min(1, node16path43) - 1))) &  (currentPath'=(43 * min(1, node16path43) - currentPath*(min(1,node16path43) - 1))) & (success'=min(1, node16path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path44 * min(1,node16path44) - currentNode*(min(1, node16path44) - 1))) &  (currentPath'=(44 * min(1, node16path44) - currentPath*(min(1,node16path44) - 1))) & (success'=min(1, node16path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path45 * min(1,node16path45) - currentNode*(min(1, node16path45) - 1))) &  (currentPath'=(45 * min(1, node16path45) - currentPath*(min(1,node16path45) - 1))) & (success'=min(1, node16path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path46 * min(1,node16path46) - currentNode*(min(1, node16path46) - 1))) &  (currentPath'=(46 * min(1, node16path46) - currentPath*(min(1,node16path46) - 1))) & (success'=min(1, node16path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path47 * min(1,node16path47) - currentNode*(min(1, node16path47) - 1))) &  (currentPath'=(47 * min(1, node16path47) - currentPath*(min(1,node16path47) - 1))) & (success'=min(1, node16path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path48 * min(1,node16path48) - currentNode*(min(1, node16path48) - 1))) &  (currentPath'=(48 * min(1, node16path48) - currentPath*(min(1,node16path48) - 1))) & (success'=min(1, node16path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path49 * min(1,node16path49) - currentNode*(min(1, node16path49) - 1))) &  (currentPath'=(49 * min(1, node16path49) - currentPath*(min(1,node16path49) - 1))) & (success'=min(1, node16path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path50 * min(1,node16path50) - currentNode*(min(1, node16path50) - 1))) &  (currentPath'=(50 * min(1, node16path50) - currentPath*(min(1,node16path50) - 1))) & (success'=min(1, node16path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path51 * min(1,node16path51) - currentNode*(min(1, node16path51) - 1))) &  (currentPath'=(51 * min(1, node16path51) - currentPath*(min(1,node16path51) - 1))) & (success'=min(1, node16path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path52 * min(1,node16path52) - currentNode*(min(1, node16path52) - 1))) &  (currentPath'=(52 * min(1, node16path52) - currentPath*(min(1,node16path52) - 1))) & (success'=min(1, node16path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path53 * min(1,node16path53) - currentNode*(min(1, node16path53) - 1))) &  (currentPath'=(53 * min(1, node16path53) - currentPath*(min(1,node16path53) - 1))) & (success'=min(1, node16path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path54 * min(1,node16path54) - currentNode*(min(1, node16path54) - 1))) &  (currentPath'=(54 * min(1, node16path54) - currentPath*(min(1,node16path54) - 1))) & (success'=min(1, node16path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path55 * min(1,node16path55) - currentNode*(min(1, node16path55) - 1))) &  (currentPath'=(55 * min(1, node16path55) - currentPath*(min(1,node16path55) - 1))) & (success'=min(1, node16path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path56 * min(1,node16path56) - currentNode*(min(1, node16path56) - 1))) &  (currentPath'=(56 * min(1, node16path56) - currentPath*(min(1,node16path56) - 1))) & (success'=min(1, node16path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path57 * min(1,node16path57) - currentNode*(min(1, node16path57) - 1))) &  (currentPath'=(57 * min(1, node16path57) - currentPath*(min(1,node16path57) - 1))) & (success'=min(1, node16path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path58 * min(1,node16path58) - currentNode*(min(1, node16path58) - 1))) &  (currentPath'=(58 * min(1, node16path58) - currentPath*(min(1,node16path58) - 1))) & (success'=min(1, node16path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path59 * min(1,node16path59) - currentNode*(min(1, node16path59) - 1))) &  (currentPath'=(59 * min(1, node16path59) - currentPath*(min(1,node16path59) - 1))) & (success'=min(1, node16path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path60 * min(1,node16path60) - currentNode*(min(1, node16path60) - 1))) &  (currentPath'=(60 * min(1, node16path60) - currentPath*(min(1,node16path60) - 1))) & (success'=min(1, node16path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path61 * min(1,node16path61) - currentNode*(min(1, node16path61) - 1))) &  (currentPath'=(61 * min(1, node16path61) - currentPath*(min(1,node16path61) - 1))) & (success'=min(1, node16path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path62 * min(1,node16path62) - currentNode*(min(1, node16path62) - 1))) &  (currentPath'=(62 * min(1, node16path62) - currentPath*(min(1,node16path62) - 1))) & (success'=min(1, node16path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path63 * min(1,node16path63) - currentNode*(min(1, node16path63) - 1))) &  (currentPath'=(63 * min(1, node16path63) - currentPath*(min(1,node16path63) - 1))) & (success'=min(1, node16path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path64 * min(1,node16path64) - currentNode*(min(1, node16path64) - 1))) &  (currentPath'=(64 * min(1, node16path64) - currentPath*(min(1,node16path64) - 1))) & (success'=min(1, node16path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path65 * min(1,node16path65) - currentNode*(min(1, node16path65) - 1))) &  (currentPath'=(65 * min(1, node16path65) - currentPath*(min(1,node16path65) - 1))) & (success'=min(1, node16path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path66 * min(1,node16path66) - currentNode*(min(1, node16path66) - 1))) &  (currentPath'=(66 * min(1, node16path66) - currentPath*(min(1,node16path66) - 1))) & (success'=min(1, node16path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path67 * min(1,node16path67) - currentNode*(min(1, node16path67) - 1))) &  (currentPath'=(67 * min(1, node16path67) - currentPath*(min(1,node16path67) - 1))) & (success'=min(1, node16path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path68 * min(1,node16path68) - currentNode*(min(1, node16path68) - 1))) &  (currentPath'=(68 * min(1, node16path68) - currentPath*(min(1,node16path68) - 1))) & (success'=min(1, node16path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path69 * min(1,node16path69) - currentNode*(min(1, node16path69) - 1))) &  (currentPath'=(69 * min(1, node16path69) - currentPath*(min(1,node16path69) - 1))) & (success'=min(1, node16path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path70 * min(1,node16path70) - currentNode*(min(1, node16path70) - 1))) &  (currentPath'=(70 * min(1, node16path70) - currentPath*(min(1,node16path70) - 1))) & (success'=min(1, node16path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path71 * min(1,node16path71) - currentNode*(min(1, node16path71) - 1))) &  (currentPath'=(71 * min(1, node16path71) - currentPath*(min(1,node16path71) - 1))) & (success'=min(1, node16path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path72 * min(1,node16path72) - currentNode*(min(1, node16path72) - 1))) &  (currentPath'=(72 * min(1, node16path72) - currentPath*(min(1,node16path72) - 1))) & (success'=min(1, node16path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path73 * min(1,node16path73) - currentNode*(min(1, node16path73) - 1))) &  (currentPath'=(73 * min(1, node16path73) - currentPath*(min(1,node16path73) - 1))) & (success'=min(1, node16path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path74 * min(1,node16path74) - currentNode*(min(1, node16path74) - 1))) &  (currentPath'=(74 * min(1, node16path74) - currentPath*(min(1,node16path74) - 1))) & (success'=min(1, node16path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path75 * min(1,node16path75) - currentNode*(min(1, node16path75) - 1))) &  (currentPath'=(75 * min(1, node16path75) - currentPath*(min(1,node16path75) - 1))) & (success'=min(1, node16path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path76 * min(1,node16path76) - currentNode*(min(1, node16path76) - 1))) &  (currentPath'=(76 * min(1, node16path76) - currentPath*(min(1,node16path76) - 1))) & (success'=min(1, node16path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path77 * min(1,node16path77) - currentNode*(min(1, node16path77) - 1))) &  (currentPath'=(77 * min(1, node16path77) - currentPath*(min(1,node16path77) - 1))) & (success'=min(1, node16path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path78 * min(1,node16path78) - currentNode*(min(1, node16path78) - 1))) &  (currentPath'=(78 * min(1, node16path78) - currentPath*(min(1,node16path78) - 1))) & (success'=min(1, node16path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path79 * min(1,node16path79) - currentNode*(min(1, node16path79) - 1))) &  (currentPath'=(79 * min(1, node16path79) - currentPath*(min(1,node16path79) - 1))) & (success'=min(1, node16path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path80 * min(1,node16path80) - currentNode*(min(1, node16path80) - 1))) &  (currentPath'=(80 * min(1, node16path80) - currentPath*(min(1,node16path80) - 1))) & (success'=min(1, node16path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path81 * min(1,node16path81) - currentNode*(min(1, node16path81) - 1))) &  (currentPath'=(81 * min(1, node16path81) - currentPath*(min(1,node16path81) - 1))) & (success'=min(1, node16path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path82 * min(1,node16path82) - currentNode*(min(1, node16path82) - 1))) &  (currentPath'=(82 * min(1, node16path82) - currentPath*(min(1,node16path82) - 1))) & (success'=min(1, node16path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path83 * min(1,node16path83) - currentNode*(min(1, node16path83) - 1))) &  (currentPath'=(83 * min(1, node16path83) - currentPath*(min(1,node16path83) - 1))) & (success'=min(1, node16path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path84 * min(1,node16path84) - currentNode*(min(1, node16path84) - 1))) &  (currentPath'=(84 * min(1, node16path84) - currentPath*(min(1,node16path84) - 1))) & (success'=min(1, node16path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path85 * min(1,node16path85) - currentNode*(min(1, node16path85) - 1))) &  (currentPath'=(85 * min(1, node16path85) - currentPath*(min(1,node16path85) - 1))) & (success'=min(1, node16path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path86 * min(1,node16path86) - currentNode*(min(1, node16path86) - 1))) &  (currentPath'=(86 * min(1, node16path86) - currentPath*(min(1,node16path86) - 1))) & (success'=min(1, node16path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path87 * min(1,node16path87) - currentNode*(min(1, node16path87) - 1))) &  (currentPath'=(87 * min(1, node16path87) - currentPath*(min(1,node16path87) - 1))) & (success'=min(1, node16path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path88 * min(1,node16path88) - currentNode*(min(1, node16path88) - 1))) &  (currentPath'=(88 * min(1, node16path88) - currentPath*(min(1,node16path88) - 1))) & (success'=min(1, node16path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path89 * min(1,node16path89) - currentNode*(min(1, node16path89) - 1))) &  (currentPath'=(89 * min(1, node16path89) - currentPath*(min(1,node16path89) - 1))) & (success'=min(1, node16path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path90 * min(1,node16path90) - currentNode*(min(1, node16path90) - 1))) &  (currentPath'=(90 * min(1, node16path90) - currentPath*(min(1,node16path90) - 1))) & (success'=min(1, node16path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path91 * min(1,node16path91) - currentNode*(min(1, node16path91) - 1))) &  (currentPath'=(91 * min(1, node16path91) - currentPath*(min(1,node16path91) - 1))) & (success'=min(1, node16path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path92 * min(1,node16path92) - currentNode*(min(1, node16path92) - 1))) &  (currentPath'=(92 * min(1, node16path92) - currentPath*(min(1,node16path92) - 1))) & (success'=min(1, node16path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path93 * min(1,node16path93) - currentNode*(min(1, node16path93) - 1))) &  (currentPath'=(93 * min(1, node16path93) - currentPath*(min(1,node16path93) - 1))) & (success'=min(1, node16path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path94 * min(1,node16path94) - currentNode*(min(1, node16path94) - 1))) &  (currentPath'=(94 * min(1, node16path94) - currentPath*(min(1,node16path94) - 1))) & (success'=min(1, node16path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path95 * min(1,node16path95) - currentNode*(min(1, node16path95) - 1))) &  (currentPath'=(95 * min(1, node16path95) - currentPath*(min(1,node16path95) - 1))) & (success'=min(1, node16path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path96 * min(1,node16path96) - currentNode*(min(1, node16path96) - 1))) &  (currentPath'=(96 * min(1, node16path96) - currentPath*(min(1,node16path96) - 1))) & (success'=min(1, node16path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path97 * min(1,node16path97) - currentNode*(min(1, node16path97) - 1))) &  (currentPath'=(97 * min(1, node16path97) - currentPath*(min(1,node16path97) - 1))) & (success'=min(1, node16path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path98 * min(1,node16path98) - currentNode*(min(1, node16path98) - 1))) &  (currentPath'=(98 * min(1, node16path98) - currentPath*(min(1,node16path98) - 1))) & (success'=min(1, node16path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path99 * min(1,node16path99) - currentNode*(min(1, node16path99) - 1))) &  (currentPath'=(99 * min(1, node16path99) - currentPath*(min(1,node16path99) - 1))) & (success'=min(1, node16path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node16path100 * min(1,node16path100) - currentNode*(min(1, node16path100) - 1))) &  (currentPath'=(100 * min(1, node16path100) - currentPath*(min(1,node16path100) - 1))) & (success'=min(1, node16path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 17) ->
 numPathsInv: (currentNode'=(node17path1 * min(1,node17path1) - currentNode*(min(1, node17path1) - 1))) &  (currentPath'=(1 * min(1, node17path1) - currentPath*(min(1,node17path1) - 1))) & (success'=min(1, node17path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path2 * min(1,node17path2) - currentNode*(min(1, node17path2) - 1))) &  (currentPath'=(2 * min(1, node17path2) - currentPath*(min(1,node17path2) - 1))) & (success'=min(1, node17path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path3 * min(1,node17path3) - currentNode*(min(1, node17path3) - 1))) &  (currentPath'=(3 * min(1, node17path3) - currentPath*(min(1,node17path3) - 1))) & (success'=min(1, node17path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path4 * min(1,node17path4) - currentNode*(min(1, node17path4) - 1))) &  (currentPath'=(4 * min(1, node17path4) - currentPath*(min(1,node17path4) - 1))) & (success'=min(1, node17path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path5 * min(1,node17path5) - currentNode*(min(1, node17path5) - 1))) &  (currentPath'=(5 * min(1, node17path5) - currentPath*(min(1,node17path5) - 1))) & (success'=min(1, node17path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path6 * min(1,node17path6) - currentNode*(min(1, node17path6) - 1))) &  (currentPath'=(6 * min(1, node17path6) - currentPath*(min(1,node17path6) - 1))) & (success'=min(1, node17path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path7 * min(1,node17path7) - currentNode*(min(1, node17path7) - 1))) &  (currentPath'=(7 * min(1, node17path7) - currentPath*(min(1,node17path7) - 1))) & (success'=min(1, node17path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path8 * min(1,node17path8) - currentNode*(min(1, node17path8) - 1))) &  (currentPath'=(8 * min(1, node17path8) - currentPath*(min(1,node17path8) - 1))) & (success'=min(1, node17path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path9 * min(1,node17path9) - currentNode*(min(1, node17path9) - 1))) &  (currentPath'=(9 * min(1, node17path9) - currentPath*(min(1,node17path9) - 1))) & (success'=min(1, node17path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path10 * min(1,node17path10) - currentNode*(min(1, node17path10) - 1))) &  (currentPath'=(10 * min(1, node17path10) - currentPath*(min(1,node17path10) - 1))) & (success'=min(1, node17path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path11 * min(1,node17path11) - currentNode*(min(1, node17path11) - 1))) &  (currentPath'=(11 * min(1, node17path11) - currentPath*(min(1,node17path11) - 1))) & (success'=min(1, node17path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path12 * min(1,node17path12) - currentNode*(min(1, node17path12) - 1))) &  (currentPath'=(12 * min(1, node17path12) - currentPath*(min(1,node17path12) - 1))) & (success'=min(1, node17path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path13 * min(1,node17path13) - currentNode*(min(1, node17path13) - 1))) &  (currentPath'=(13 * min(1, node17path13) - currentPath*(min(1,node17path13) - 1))) & (success'=min(1, node17path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path14 * min(1,node17path14) - currentNode*(min(1, node17path14) - 1))) &  (currentPath'=(14 * min(1, node17path14) - currentPath*(min(1,node17path14) - 1))) & (success'=min(1, node17path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path15 * min(1,node17path15) - currentNode*(min(1, node17path15) - 1))) &  (currentPath'=(15 * min(1, node17path15) - currentPath*(min(1,node17path15) - 1))) & (success'=min(1, node17path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path16 * min(1,node17path16) - currentNode*(min(1, node17path16) - 1))) &  (currentPath'=(16 * min(1, node17path16) - currentPath*(min(1,node17path16) - 1))) & (success'=min(1, node17path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path17 * min(1,node17path17) - currentNode*(min(1, node17path17) - 1))) &  (currentPath'=(17 * min(1, node17path17) - currentPath*(min(1,node17path17) - 1))) & (success'=min(1, node17path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path18 * min(1,node17path18) - currentNode*(min(1, node17path18) - 1))) &  (currentPath'=(18 * min(1, node17path18) - currentPath*(min(1,node17path18) - 1))) & (success'=min(1, node17path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path19 * min(1,node17path19) - currentNode*(min(1, node17path19) - 1))) &  (currentPath'=(19 * min(1, node17path19) - currentPath*(min(1,node17path19) - 1))) & (success'=min(1, node17path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path20 * min(1,node17path20) - currentNode*(min(1, node17path20) - 1))) &  (currentPath'=(20 * min(1, node17path20) - currentPath*(min(1,node17path20) - 1))) & (success'=min(1, node17path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path21 * min(1,node17path21) - currentNode*(min(1, node17path21) - 1))) &  (currentPath'=(21 * min(1, node17path21) - currentPath*(min(1,node17path21) - 1))) & (success'=min(1, node17path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path22 * min(1,node17path22) - currentNode*(min(1, node17path22) - 1))) &  (currentPath'=(22 * min(1, node17path22) - currentPath*(min(1,node17path22) - 1))) & (success'=min(1, node17path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path23 * min(1,node17path23) - currentNode*(min(1, node17path23) - 1))) &  (currentPath'=(23 * min(1, node17path23) - currentPath*(min(1,node17path23) - 1))) & (success'=min(1, node17path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path24 * min(1,node17path24) - currentNode*(min(1, node17path24) - 1))) &  (currentPath'=(24 * min(1, node17path24) - currentPath*(min(1,node17path24) - 1))) & (success'=min(1, node17path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path25 * min(1,node17path25) - currentNode*(min(1, node17path25) - 1))) &  (currentPath'=(25 * min(1, node17path25) - currentPath*(min(1,node17path25) - 1))) & (success'=min(1, node17path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path26 * min(1,node17path26) - currentNode*(min(1, node17path26) - 1))) &  (currentPath'=(26 * min(1, node17path26) - currentPath*(min(1,node17path26) - 1))) & (success'=min(1, node17path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path27 * min(1,node17path27) - currentNode*(min(1, node17path27) - 1))) &  (currentPath'=(27 * min(1, node17path27) - currentPath*(min(1,node17path27) - 1))) & (success'=min(1, node17path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path28 * min(1,node17path28) - currentNode*(min(1, node17path28) - 1))) &  (currentPath'=(28 * min(1, node17path28) - currentPath*(min(1,node17path28) - 1))) & (success'=min(1, node17path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path29 * min(1,node17path29) - currentNode*(min(1, node17path29) - 1))) &  (currentPath'=(29 * min(1, node17path29) - currentPath*(min(1,node17path29) - 1))) & (success'=min(1, node17path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path30 * min(1,node17path30) - currentNode*(min(1, node17path30) - 1))) &  (currentPath'=(30 * min(1, node17path30) - currentPath*(min(1,node17path30) - 1))) & (success'=min(1, node17path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path31 * min(1,node17path31) - currentNode*(min(1, node17path31) - 1))) &  (currentPath'=(31 * min(1, node17path31) - currentPath*(min(1,node17path31) - 1))) & (success'=min(1, node17path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path32 * min(1,node17path32) - currentNode*(min(1, node17path32) - 1))) &  (currentPath'=(32 * min(1, node17path32) - currentPath*(min(1,node17path32) - 1))) & (success'=min(1, node17path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path33 * min(1,node17path33) - currentNode*(min(1, node17path33) - 1))) &  (currentPath'=(33 * min(1, node17path33) - currentPath*(min(1,node17path33) - 1))) & (success'=min(1, node17path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path34 * min(1,node17path34) - currentNode*(min(1, node17path34) - 1))) &  (currentPath'=(34 * min(1, node17path34) - currentPath*(min(1,node17path34) - 1))) & (success'=min(1, node17path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path35 * min(1,node17path35) - currentNode*(min(1, node17path35) - 1))) &  (currentPath'=(35 * min(1, node17path35) - currentPath*(min(1,node17path35) - 1))) & (success'=min(1, node17path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path36 * min(1,node17path36) - currentNode*(min(1, node17path36) - 1))) &  (currentPath'=(36 * min(1, node17path36) - currentPath*(min(1,node17path36) - 1))) & (success'=min(1, node17path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path37 * min(1,node17path37) - currentNode*(min(1, node17path37) - 1))) &  (currentPath'=(37 * min(1, node17path37) - currentPath*(min(1,node17path37) - 1))) & (success'=min(1, node17path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path38 * min(1,node17path38) - currentNode*(min(1, node17path38) - 1))) &  (currentPath'=(38 * min(1, node17path38) - currentPath*(min(1,node17path38) - 1))) & (success'=min(1, node17path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path39 * min(1,node17path39) - currentNode*(min(1, node17path39) - 1))) &  (currentPath'=(39 * min(1, node17path39) - currentPath*(min(1,node17path39) - 1))) & (success'=min(1, node17path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path40 * min(1,node17path40) - currentNode*(min(1, node17path40) - 1))) &  (currentPath'=(40 * min(1, node17path40) - currentPath*(min(1,node17path40) - 1))) & (success'=min(1, node17path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path41 * min(1,node17path41) - currentNode*(min(1, node17path41) - 1))) &  (currentPath'=(41 * min(1, node17path41) - currentPath*(min(1,node17path41) - 1))) & (success'=min(1, node17path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path42 * min(1,node17path42) - currentNode*(min(1, node17path42) - 1))) &  (currentPath'=(42 * min(1, node17path42) - currentPath*(min(1,node17path42) - 1))) & (success'=min(1, node17path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path43 * min(1,node17path43) - currentNode*(min(1, node17path43) - 1))) &  (currentPath'=(43 * min(1, node17path43) - currentPath*(min(1,node17path43) - 1))) & (success'=min(1, node17path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path44 * min(1,node17path44) - currentNode*(min(1, node17path44) - 1))) &  (currentPath'=(44 * min(1, node17path44) - currentPath*(min(1,node17path44) - 1))) & (success'=min(1, node17path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path45 * min(1,node17path45) - currentNode*(min(1, node17path45) - 1))) &  (currentPath'=(45 * min(1, node17path45) - currentPath*(min(1,node17path45) - 1))) & (success'=min(1, node17path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path46 * min(1,node17path46) - currentNode*(min(1, node17path46) - 1))) &  (currentPath'=(46 * min(1, node17path46) - currentPath*(min(1,node17path46) - 1))) & (success'=min(1, node17path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path47 * min(1,node17path47) - currentNode*(min(1, node17path47) - 1))) &  (currentPath'=(47 * min(1, node17path47) - currentPath*(min(1,node17path47) - 1))) & (success'=min(1, node17path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path48 * min(1,node17path48) - currentNode*(min(1, node17path48) - 1))) &  (currentPath'=(48 * min(1, node17path48) - currentPath*(min(1,node17path48) - 1))) & (success'=min(1, node17path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path49 * min(1,node17path49) - currentNode*(min(1, node17path49) - 1))) &  (currentPath'=(49 * min(1, node17path49) - currentPath*(min(1,node17path49) - 1))) & (success'=min(1, node17path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path50 * min(1,node17path50) - currentNode*(min(1, node17path50) - 1))) &  (currentPath'=(50 * min(1, node17path50) - currentPath*(min(1,node17path50) - 1))) & (success'=min(1, node17path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path51 * min(1,node17path51) - currentNode*(min(1, node17path51) - 1))) &  (currentPath'=(51 * min(1, node17path51) - currentPath*(min(1,node17path51) - 1))) & (success'=min(1, node17path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path52 * min(1,node17path52) - currentNode*(min(1, node17path52) - 1))) &  (currentPath'=(52 * min(1, node17path52) - currentPath*(min(1,node17path52) - 1))) & (success'=min(1, node17path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path53 * min(1,node17path53) - currentNode*(min(1, node17path53) - 1))) &  (currentPath'=(53 * min(1, node17path53) - currentPath*(min(1,node17path53) - 1))) & (success'=min(1, node17path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path54 * min(1,node17path54) - currentNode*(min(1, node17path54) - 1))) &  (currentPath'=(54 * min(1, node17path54) - currentPath*(min(1,node17path54) - 1))) & (success'=min(1, node17path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path55 * min(1,node17path55) - currentNode*(min(1, node17path55) - 1))) &  (currentPath'=(55 * min(1, node17path55) - currentPath*(min(1,node17path55) - 1))) & (success'=min(1, node17path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path56 * min(1,node17path56) - currentNode*(min(1, node17path56) - 1))) &  (currentPath'=(56 * min(1, node17path56) - currentPath*(min(1,node17path56) - 1))) & (success'=min(1, node17path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path57 * min(1,node17path57) - currentNode*(min(1, node17path57) - 1))) &  (currentPath'=(57 * min(1, node17path57) - currentPath*(min(1,node17path57) - 1))) & (success'=min(1, node17path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path58 * min(1,node17path58) - currentNode*(min(1, node17path58) - 1))) &  (currentPath'=(58 * min(1, node17path58) - currentPath*(min(1,node17path58) - 1))) & (success'=min(1, node17path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path59 * min(1,node17path59) - currentNode*(min(1, node17path59) - 1))) &  (currentPath'=(59 * min(1, node17path59) - currentPath*(min(1,node17path59) - 1))) & (success'=min(1, node17path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path60 * min(1,node17path60) - currentNode*(min(1, node17path60) - 1))) &  (currentPath'=(60 * min(1, node17path60) - currentPath*(min(1,node17path60) - 1))) & (success'=min(1, node17path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path61 * min(1,node17path61) - currentNode*(min(1, node17path61) - 1))) &  (currentPath'=(61 * min(1, node17path61) - currentPath*(min(1,node17path61) - 1))) & (success'=min(1, node17path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path62 * min(1,node17path62) - currentNode*(min(1, node17path62) - 1))) &  (currentPath'=(62 * min(1, node17path62) - currentPath*(min(1,node17path62) - 1))) & (success'=min(1, node17path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path63 * min(1,node17path63) - currentNode*(min(1, node17path63) - 1))) &  (currentPath'=(63 * min(1, node17path63) - currentPath*(min(1,node17path63) - 1))) & (success'=min(1, node17path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path64 * min(1,node17path64) - currentNode*(min(1, node17path64) - 1))) &  (currentPath'=(64 * min(1, node17path64) - currentPath*(min(1,node17path64) - 1))) & (success'=min(1, node17path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path65 * min(1,node17path65) - currentNode*(min(1, node17path65) - 1))) &  (currentPath'=(65 * min(1, node17path65) - currentPath*(min(1,node17path65) - 1))) & (success'=min(1, node17path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path66 * min(1,node17path66) - currentNode*(min(1, node17path66) - 1))) &  (currentPath'=(66 * min(1, node17path66) - currentPath*(min(1,node17path66) - 1))) & (success'=min(1, node17path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path67 * min(1,node17path67) - currentNode*(min(1, node17path67) - 1))) &  (currentPath'=(67 * min(1, node17path67) - currentPath*(min(1,node17path67) - 1))) & (success'=min(1, node17path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path68 * min(1,node17path68) - currentNode*(min(1, node17path68) - 1))) &  (currentPath'=(68 * min(1, node17path68) - currentPath*(min(1,node17path68) - 1))) & (success'=min(1, node17path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path69 * min(1,node17path69) - currentNode*(min(1, node17path69) - 1))) &  (currentPath'=(69 * min(1, node17path69) - currentPath*(min(1,node17path69) - 1))) & (success'=min(1, node17path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path70 * min(1,node17path70) - currentNode*(min(1, node17path70) - 1))) &  (currentPath'=(70 * min(1, node17path70) - currentPath*(min(1,node17path70) - 1))) & (success'=min(1, node17path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path71 * min(1,node17path71) - currentNode*(min(1, node17path71) - 1))) &  (currentPath'=(71 * min(1, node17path71) - currentPath*(min(1,node17path71) - 1))) & (success'=min(1, node17path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path72 * min(1,node17path72) - currentNode*(min(1, node17path72) - 1))) &  (currentPath'=(72 * min(1, node17path72) - currentPath*(min(1,node17path72) - 1))) & (success'=min(1, node17path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path73 * min(1,node17path73) - currentNode*(min(1, node17path73) - 1))) &  (currentPath'=(73 * min(1, node17path73) - currentPath*(min(1,node17path73) - 1))) & (success'=min(1, node17path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path74 * min(1,node17path74) - currentNode*(min(1, node17path74) - 1))) &  (currentPath'=(74 * min(1, node17path74) - currentPath*(min(1,node17path74) - 1))) & (success'=min(1, node17path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path75 * min(1,node17path75) - currentNode*(min(1, node17path75) - 1))) &  (currentPath'=(75 * min(1, node17path75) - currentPath*(min(1,node17path75) - 1))) & (success'=min(1, node17path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path76 * min(1,node17path76) - currentNode*(min(1, node17path76) - 1))) &  (currentPath'=(76 * min(1, node17path76) - currentPath*(min(1,node17path76) - 1))) & (success'=min(1, node17path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path77 * min(1,node17path77) - currentNode*(min(1, node17path77) - 1))) &  (currentPath'=(77 * min(1, node17path77) - currentPath*(min(1,node17path77) - 1))) & (success'=min(1, node17path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path78 * min(1,node17path78) - currentNode*(min(1, node17path78) - 1))) &  (currentPath'=(78 * min(1, node17path78) - currentPath*(min(1,node17path78) - 1))) & (success'=min(1, node17path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path79 * min(1,node17path79) - currentNode*(min(1, node17path79) - 1))) &  (currentPath'=(79 * min(1, node17path79) - currentPath*(min(1,node17path79) - 1))) & (success'=min(1, node17path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path80 * min(1,node17path80) - currentNode*(min(1, node17path80) - 1))) &  (currentPath'=(80 * min(1, node17path80) - currentPath*(min(1,node17path80) - 1))) & (success'=min(1, node17path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path81 * min(1,node17path81) - currentNode*(min(1, node17path81) - 1))) &  (currentPath'=(81 * min(1, node17path81) - currentPath*(min(1,node17path81) - 1))) & (success'=min(1, node17path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path82 * min(1,node17path82) - currentNode*(min(1, node17path82) - 1))) &  (currentPath'=(82 * min(1, node17path82) - currentPath*(min(1,node17path82) - 1))) & (success'=min(1, node17path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path83 * min(1,node17path83) - currentNode*(min(1, node17path83) - 1))) &  (currentPath'=(83 * min(1, node17path83) - currentPath*(min(1,node17path83) - 1))) & (success'=min(1, node17path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path84 * min(1,node17path84) - currentNode*(min(1, node17path84) - 1))) &  (currentPath'=(84 * min(1, node17path84) - currentPath*(min(1,node17path84) - 1))) & (success'=min(1, node17path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path85 * min(1,node17path85) - currentNode*(min(1, node17path85) - 1))) &  (currentPath'=(85 * min(1, node17path85) - currentPath*(min(1,node17path85) - 1))) & (success'=min(1, node17path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path86 * min(1,node17path86) - currentNode*(min(1, node17path86) - 1))) &  (currentPath'=(86 * min(1, node17path86) - currentPath*(min(1,node17path86) - 1))) & (success'=min(1, node17path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path87 * min(1,node17path87) - currentNode*(min(1, node17path87) - 1))) &  (currentPath'=(87 * min(1, node17path87) - currentPath*(min(1,node17path87) - 1))) & (success'=min(1, node17path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path88 * min(1,node17path88) - currentNode*(min(1, node17path88) - 1))) &  (currentPath'=(88 * min(1, node17path88) - currentPath*(min(1,node17path88) - 1))) & (success'=min(1, node17path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path89 * min(1,node17path89) - currentNode*(min(1, node17path89) - 1))) &  (currentPath'=(89 * min(1, node17path89) - currentPath*(min(1,node17path89) - 1))) & (success'=min(1, node17path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path90 * min(1,node17path90) - currentNode*(min(1, node17path90) - 1))) &  (currentPath'=(90 * min(1, node17path90) - currentPath*(min(1,node17path90) - 1))) & (success'=min(1, node17path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path91 * min(1,node17path91) - currentNode*(min(1, node17path91) - 1))) &  (currentPath'=(91 * min(1, node17path91) - currentPath*(min(1,node17path91) - 1))) & (success'=min(1, node17path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path92 * min(1,node17path92) - currentNode*(min(1, node17path92) - 1))) &  (currentPath'=(92 * min(1, node17path92) - currentPath*(min(1,node17path92) - 1))) & (success'=min(1, node17path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path93 * min(1,node17path93) - currentNode*(min(1, node17path93) - 1))) &  (currentPath'=(93 * min(1, node17path93) - currentPath*(min(1,node17path93) - 1))) & (success'=min(1, node17path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path94 * min(1,node17path94) - currentNode*(min(1, node17path94) - 1))) &  (currentPath'=(94 * min(1, node17path94) - currentPath*(min(1,node17path94) - 1))) & (success'=min(1, node17path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path95 * min(1,node17path95) - currentNode*(min(1, node17path95) - 1))) &  (currentPath'=(95 * min(1, node17path95) - currentPath*(min(1,node17path95) - 1))) & (success'=min(1, node17path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path96 * min(1,node17path96) - currentNode*(min(1, node17path96) - 1))) &  (currentPath'=(96 * min(1, node17path96) - currentPath*(min(1,node17path96) - 1))) & (success'=min(1, node17path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path97 * min(1,node17path97) - currentNode*(min(1, node17path97) - 1))) &  (currentPath'=(97 * min(1, node17path97) - currentPath*(min(1,node17path97) - 1))) & (success'=min(1, node17path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path98 * min(1,node17path98) - currentNode*(min(1, node17path98) - 1))) &  (currentPath'=(98 * min(1, node17path98) - currentPath*(min(1,node17path98) - 1))) & (success'=min(1, node17path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path99 * min(1,node17path99) - currentNode*(min(1, node17path99) - 1))) &  (currentPath'=(99 * min(1, node17path99) - currentPath*(min(1,node17path99) - 1))) & (success'=min(1, node17path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node17path100 * min(1,node17path100) - currentNode*(min(1, node17path100) - 1))) &  (currentPath'=(100 * min(1, node17path100) - currentPath*(min(1,node17path100) - 1))) & (success'=min(1, node17path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 18) ->
 numPathsInv: (currentNode'=(node18path1 * min(1,node18path1) - currentNode*(min(1, node18path1) - 1))) &  (currentPath'=(1 * min(1, node18path1) - currentPath*(min(1,node18path1) - 1))) & (success'=min(1, node18path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path2 * min(1,node18path2) - currentNode*(min(1, node18path2) - 1))) &  (currentPath'=(2 * min(1, node18path2) - currentPath*(min(1,node18path2) - 1))) & (success'=min(1, node18path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path3 * min(1,node18path3) - currentNode*(min(1, node18path3) - 1))) &  (currentPath'=(3 * min(1, node18path3) - currentPath*(min(1,node18path3) - 1))) & (success'=min(1, node18path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path4 * min(1,node18path4) - currentNode*(min(1, node18path4) - 1))) &  (currentPath'=(4 * min(1, node18path4) - currentPath*(min(1,node18path4) - 1))) & (success'=min(1, node18path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path5 * min(1,node18path5) - currentNode*(min(1, node18path5) - 1))) &  (currentPath'=(5 * min(1, node18path5) - currentPath*(min(1,node18path5) - 1))) & (success'=min(1, node18path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path6 * min(1,node18path6) - currentNode*(min(1, node18path6) - 1))) &  (currentPath'=(6 * min(1, node18path6) - currentPath*(min(1,node18path6) - 1))) & (success'=min(1, node18path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path7 * min(1,node18path7) - currentNode*(min(1, node18path7) - 1))) &  (currentPath'=(7 * min(1, node18path7) - currentPath*(min(1,node18path7) - 1))) & (success'=min(1, node18path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path8 * min(1,node18path8) - currentNode*(min(1, node18path8) - 1))) &  (currentPath'=(8 * min(1, node18path8) - currentPath*(min(1,node18path8) - 1))) & (success'=min(1, node18path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path9 * min(1,node18path9) - currentNode*(min(1, node18path9) - 1))) &  (currentPath'=(9 * min(1, node18path9) - currentPath*(min(1,node18path9) - 1))) & (success'=min(1, node18path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path10 * min(1,node18path10) - currentNode*(min(1, node18path10) - 1))) &  (currentPath'=(10 * min(1, node18path10) - currentPath*(min(1,node18path10) - 1))) & (success'=min(1, node18path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path11 * min(1,node18path11) - currentNode*(min(1, node18path11) - 1))) &  (currentPath'=(11 * min(1, node18path11) - currentPath*(min(1,node18path11) - 1))) & (success'=min(1, node18path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path12 * min(1,node18path12) - currentNode*(min(1, node18path12) - 1))) &  (currentPath'=(12 * min(1, node18path12) - currentPath*(min(1,node18path12) - 1))) & (success'=min(1, node18path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path13 * min(1,node18path13) - currentNode*(min(1, node18path13) - 1))) &  (currentPath'=(13 * min(1, node18path13) - currentPath*(min(1,node18path13) - 1))) & (success'=min(1, node18path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path14 * min(1,node18path14) - currentNode*(min(1, node18path14) - 1))) &  (currentPath'=(14 * min(1, node18path14) - currentPath*(min(1,node18path14) - 1))) & (success'=min(1, node18path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path15 * min(1,node18path15) - currentNode*(min(1, node18path15) - 1))) &  (currentPath'=(15 * min(1, node18path15) - currentPath*(min(1,node18path15) - 1))) & (success'=min(1, node18path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path16 * min(1,node18path16) - currentNode*(min(1, node18path16) - 1))) &  (currentPath'=(16 * min(1, node18path16) - currentPath*(min(1,node18path16) - 1))) & (success'=min(1, node18path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path17 * min(1,node18path17) - currentNode*(min(1, node18path17) - 1))) &  (currentPath'=(17 * min(1, node18path17) - currentPath*(min(1,node18path17) - 1))) & (success'=min(1, node18path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path18 * min(1,node18path18) - currentNode*(min(1, node18path18) - 1))) &  (currentPath'=(18 * min(1, node18path18) - currentPath*(min(1,node18path18) - 1))) & (success'=min(1, node18path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path19 * min(1,node18path19) - currentNode*(min(1, node18path19) - 1))) &  (currentPath'=(19 * min(1, node18path19) - currentPath*(min(1,node18path19) - 1))) & (success'=min(1, node18path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path20 * min(1,node18path20) - currentNode*(min(1, node18path20) - 1))) &  (currentPath'=(20 * min(1, node18path20) - currentPath*(min(1,node18path20) - 1))) & (success'=min(1, node18path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path21 * min(1,node18path21) - currentNode*(min(1, node18path21) - 1))) &  (currentPath'=(21 * min(1, node18path21) - currentPath*(min(1,node18path21) - 1))) & (success'=min(1, node18path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path22 * min(1,node18path22) - currentNode*(min(1, node18path22) - 1))) &  (currentPath'=(22 * min(1, node18path22) - currentPath*(min(1,node18path22) - 1))) & (success'=min(1, node18path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path23 * min(1,node18path23) - currentNode*(min(1, node18path23) - 1))) &  (currentPath'=(23 * min(1, node18path23) - currentPath*(min(1,node18path23) - 1))) & (success'=min(1, node18path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path24 * min(1,node18path24) - currentNode*(min(1, node18path24) - 1))) &  (currentPath'=(24 * min(1, node18path24) - currentPath*(min(1,node18path24) - 1))) & (success'=min(1, node18path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path25 * min(1,node18path25) - currentNode*(min(1, node18path25) - 1))) &  (currentPath'=(25 * min(1, node18path25) - currentPath*(min(1,node18path25) - 1))) & (success'=min(1, node18path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path26 * min(1,node18path26) - currentNode*(min(1, node18path26) - 1))) &  (currentPath'=(26 * min(1, node18path26) - currentPath*(min(1,node18path26) - 1))) & (success'=min(1, node18path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path27 * min(1,node18path27) - currentNode*(min(1, node18path27) - 1))) &  (currentPath'=(27 * min(1, node18path27) - currentPath*(min(1,node18path27) - 1))) & (success'=min(1, node18path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path28 * min(1,node18path28) - currentNode*(min(1, node18path28) - 1))) &  (currentPath'=(28 * min(1, node18path28) - currentPath*(min(1,node18path28) - 1))) & (success'=min(1, node18path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path29 * min(1,node18path29) - currentNode*(min(1, node18path29) - 1))) &  (currentPath'=(29 * min(1, node18path29) - currentPath*(min(1,node18path29) - 1))) & (success'=min(1, node18path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path30 * min(1,node18path30) - currentNode*(min(1, node18path30) - 1))) &  (currentPath'=(30 * min(1, node18path30) - currentPath*(min(1,node18path30) - 1))) & (success'=min(1, node18path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path31 * min(1,node18path31) - currentNode*(min(1, node18path31) - 1))) &  (currentPath'=(31 * min(1, node18path31) - currentPath*(min(1,node18path31) - 1))) & (success'=min(1, node18path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path32 * min(1,node18path32) - currentNode*(min(1, node18path32) - 1))) &  (currentPath'=(32 * min(1, node18path32) - currentPath*(min(1,node18path32) - 1))) & (success'=min(1, node18path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path33 * min(1,node18path33) - currentNode*(min(1, node18path33) - 1))) &  (currentPath'=(33 * min(1, node18path33) - currentPath*(min(1,node18path33) - 1))) & (success'=min(1, node18path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path34 * min(1,node18path34) - currentNode*(min(1, node18path34) - 1))) &  (currentPath'=(34 * min(1, node18path34) - currentPath*(min(1,node18path34) - 1))) & (success'=min(1, node18path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path35 * min(1,node18path35) - currentNode*(min(1, node18path35) - 1))) &  (currentPath'=(35 * min(1, node18path35) - currentPath*(min(1,node18path35) - 1))) & (success'=min(1, node18path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path36 * min(1,node18path36) - currentNode*(min(1, node18path36) - 1))) &  (currentPath'=(36 * min(1, node18path36) - currentPath*(min(1,node18path36) - 1))) & (success'=min(1, node18path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path37 * min(1,node18path37) - currentNode*(min(1, node18path37) - 1))) &  (currentPath'=(37 * min(1, node18path37) - currentPath*(min(1,node18path37) - 1))) & (success'=min(1, node18path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path38 * min(1,node18path38) - currentNode*(min(1, node18path38) - 1))) &  (currentPath'=(38 * min(1, node18path38) - currentPath*(min(1,node18path38) - 1))) & (success'=min(1, node18path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path39 * min(1,node18path39) - currentNode*(min(1, node18path39) - 1))) &  (currentPath'=(39 * min(1, node18path39) - currentPath*(min(1,node18path39) - 1))) & (success'=min(1, node18path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path40 * min(1,node18path40) - currentNode*(min(1, node18path40) - 1))) &  (currentPath'=(40 * min(1, node18path40) - currentPath*(min(1,node18path40) - 1))) & (success'=min(1, node18path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path41 * min(1,node18path41) - currentNode*(min(1, node18path41) - 1))) &  (currentPath'=(41 * min(1, node18path41) - currentPath*(min(1,node18path41) - 1))) & (success'=min(1, node18path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path42 * min(1,node18path42) - currentNode*(min(1, node18path42) - 1))) &  (currentPath'=(42 * min(1, node18path42) - currentPath*(min(1,node18path42) - 1))) & (success'=min(1, node18path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path43 * min(1,node18path43) - currentNode*(min(1, node18path43) - 1))) &  (currentPath'=(43 * min(1, node18path43) - currentPath*(min(1,node18path43) - 1))) & (success'=min(1, node18path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path44 * min(1,node18path44) - currentNode*(min(1, node18path44) - 1))) &  (currentPath'=(44 * min(1, node18path44) - currentPath*(min(1,node18path44) - 1))) & (success'=min(1, node18path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path45 * min(1,node18path45) - currentNode*(min(1, node18path45) - 1))) &  (currentPath'=(45 * min(1, node18path45) - currentPath*(min(1,node18path45) - 1))) & (success'=min(1, node18path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path46 * min(1,node18path46) - currentNode*(min(1, node18path46) - 1))) &  (currentPath'=(46 * min(1, node18path46) - currentPath*(min(1,node18path46) - 1))) & (success'=min(1, node18path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path47 * min(1,node18path47) - currentNode*(min(1, node18path47) - 1))) &  (currentPath'=(47 * min(1, node18path47) - currentPath*(min(1,node18path47) - 1))) & (success'=min(1, node18path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path48 * min(1,node18path48) - currentNode*(min(1, node18path48) - 1))) &  (currentPath'=(48 * min(1, node18path48) - currentPath*(min(1,node18path48) - 1))) & (success'=min(1, node18path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path49 * min(1,node18path49) - currentNode*(min(1, node18path49) - 1))) &  (currentPath'=(49 * min(1, node18path49) - currentPath*(min(1,node18path49) - 1))) & (success'=min(1, node18path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path50 * min(1,node18path50) - currentNode*(min(1, node18path50) - 1))) &  (currentPath'=(50 * min(1, node18path50) - currentPath*(min(1,node18path50) - 1))) & (success'=min(1, node18path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path51 * min(1,node18path51) - currentNode*(min(1, node18path51) - 1))) &  (currentPath'=(51 * min(1, node18path51) - currentPath*(min(1,node18path51) - 1))) & (success'=min(1, node18path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path52 * min(1,node18path52) - currentNode*(min(1, node18path52) - 1))) &  (currentPath'=(52 * min(1, node18path52) - currentPath*(min(1,node18path52) - 1))) & (success'=min(1, node18path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path53 * min(1,node18path53) - currentNode*(min(1, node18path53) - 1))) &  (currentPath'=(53 * min(1, node18path53) - currentPath*(min(1,node18path53) - 1))) & (success'=min(1, node18path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path54 * min(1,node18path54) - currentNode*(min(1, node18path54) - 1))) &  (currentPath'=(54 * min(1, node18path54) - currentPath*(min(1,node18path54) - 1))) & (success'=min(1, node18path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path55 * min(1,node18path55) - currentNode*(min(1, node18path55) - 1))) &  (currentPath'=(55 * min(1, node18path55) - currentPath*(min(1,node18path55) - 1))) & (success'=min(1, node18path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path56 * min(1,node18path56) - currentNode*(min(1, node18path56) - 1))) &  (currentPath'=(56 * min(1, node18path56) - currentPath*(min(1,node18path56) - 1))) & (success'=min(1, node18path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path57 * min(1,node18path57) - currentNode*(min(1, node18path57) - 1))) &  (currentPath'=(57 * min(1, node18path57) - currentPath*(min(1,node18path57) - 1))) & (success'=min(1, node18path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path58 * min(1,node18path58) - currentNode*(min(1, node18path58) - 1))) &  (currentPath'=(58 * min(1, node18path58) - currentPath*(min(1,node18path58) - 1))) & (success'=min(1, node18path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path59 * min(1,node18path59) - currentNode*(min(1, node18path59) - 1))) &  (currentPath'=(59 * min(1, node18path59) - currentPath*(min(1,node18path59) - 1))) & (success'=min(1, node18path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path60 * min(1,node18path60) - currentNode*(min(1, node18path60) - 1))) &  (currentPath'=(60 * min(1, node18path60) - currentPath*(min(1,node18path60) - 1))) & (success'=min(1, node18path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path61 * min(1,node18path61) - currentNode*(min(1, node18path61) - 1))) &  (currentPath'=(61 * min(1, node18path61) - currentPath*(min(1,node18path61) - 1))) & (success'=min(1, node18path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path62 * min(1,node18path62) - currentNode*(min(1, node18path62) - 1))) &  (currentPath'=(62 * min(1, node18path62) - currentPath*(min(1,node18path62) - 1))) & (success'=min(1, node18path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path63 * min(1,node18path63) - currentNode*(min(1, node18path63) - 1))) &  (currentPath'=(63 * min(1, node18path63) - currentPath*(min(1,node18path63) - 1))) & (success'=min(1, node18path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path64 * min(1,node18path64) - currentNode*(min(1, node18path64) - 1))) &  (currentPath'=(64 * min(1, node18path64) - currentPath*(min(1,node18path64) - 1))) & (success'=min(1, node18path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path65 * min(1,node18path65) - currentNode*(min(1, node18path65) - 1))) &  (currentPath'=(65 * min(1, node18path65) - currentPath*(min(1,node18path65) - 1))) & (success'=min(1, node18path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path66 * min(1,node18path66) - currentNode*(min(1, node18path66) - 1))) &  (currentPath'=(66 * min(1, node18path66) - currentPath*(min(1,node18path66) - 1))) & (success'=min(1, node18path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path67 * min(1,node18path67) - currentNode*(min(1, node18path67) - 1))) &  (currentPath'=(67 * min(1, node18path67) - currentPath*(min(1,node18path67) - 1))) & (success'=min(1, node18path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path68 * min(1,node18path68) - currentNode*(min(1, node18path68) - 1))) &  (currentPath'=(68 * min(1, node18path68) - currentPath*(min(1,node18path68) - 1))) & (success'=min(1, node18path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path69 * min(1,node18path69) - currentNode*(min(1, node18path69) - 1))) &  (currentPath'=(69 * min(1, node18path69) - currentPath*(min(1,node18path69) - 1))) & (success'=min(1, node18path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path70 * min(1,node18path70) - currentNode*(min(1, node18path70) - 1))) &  (currentPath'=(70 * min(1, node18path70) - currentPath*(min(1,node18path70) - 1))) & (success'=min(1, node18path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path71 * min(1,node18path71) - currentNode*(min(1, node18path71) - 1))) &  (currentPath'=(71 * min(1, node18path71) - currentPath*(min(1,node18path71) - 1))) & (success'=min(1, node18path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path72 * min(1,node18path72) - currentNode*(min(1, node18path72) - 1))) &  (currentPath'=(72 * min(1, node18path72) - currentPath*(min(1,node18path72) - 1))) & (success'=min(1, node18path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path73 * min(1,node18path73) - currentNode*(min(1, node18path73) - 1))) &  (currentPath'=(73 * min(1, node18path73) - currentPath*(min(1,node18path73) - 1))) & (success'=min(1, node18path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path74 * min(1,node18path74) - currentNode*(min(1, node18path74) - 1))) &  (currentPath'=(74 * min(1, node18path74) - currentPath*(min(1,node18path74) - 1))) & (success'=min(1, node18path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path75 * min(1,node18path75) - currentNode*(min(1, node18path75) - 1))) &  (currentPath'=(75 * min(1, node18path75) - currentPath*(min(1,node18path75) - 1))) & (success'=min(1, node18path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path76 * min(1,node18path76) - currentNode*(min(1, node18path76) - 1))) &  (currentPath'=(76 * min(1, node18path76) - currentPath*(min(1,node18path76) - 1))) & (success'=min(1, node18path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path77 * min(1,node18path77) - currentNode*(min(1, node18path77) - 1))) &  (currentPath'=(77 * min(1, node18path77) - currentPath*(min(1,node18path77) - 1))) & (success'=min(1, node18path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path78 * min(1,node18path78) - currentNode*(min(1, node18path78) - 1))) &  (currentPath'=(78 * min(1, node18path78) - currentPath*(min(1,node18path78) - 1))) & (success'=min(1, node18path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path79 * min(1,node18path79) - currentNode*(min(1, node18path79) - 1))) &  (currentPath'=(79 * min(1, node18path79) - currentPath*(min(1,node18path79) - 1))) & (success'=min(1, node18path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path80 * min(1,node18path80) - currentNode*(min(1, node18path80) - 1))) &  (currentPath'=(80 * min(1, node18path80) - currentPath*(min(1,node18path80) - 1))) & (success'=min(1, node18path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path81 * min(1,node18path81) - currentNode*(min(1, node18path81) - 1))) &  (currentPath'=(81 * min(1, node18path81) - currentPath*(min(1,node18path81) - 1))) & (success'=min(1, node18path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path82 * min(1,node18path82) - currentNode*(min(1, node18path82) - 1))) &  (currentPath'=(82 * min(1, node18path82) - currentPath*(min(1,node18path82) - 1))) & (success'=min(1, node18path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path83 * min(1,node18path83) - currentNode*(min(1, node18path83) - 1))) &  (currentPath'=(83 * min(1, node18path83) - currentPath*(min(1,node18path83) - 1))) & (success'=min(1, node18path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path84 * min(1,node18path84) - currentNode*(min(1, node18path84) - 1))) &  (currentPath'=(84 * min(1, node18path84) - currentPath*(min(1,node18path84) - 1))) & (success'=min(1, node18path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path85 * min(1,node18path85) - currentNode*(min(1, node18path85) - 1))) &  (currentPath'=(85 * min(1, node18path85) - currentPath*(min(1,node18path85) - 1))) & (success'=min(1, node18path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path86 * min(1,node18path86) - currentNode*(min(1, node18path86) - 1))) &  (currentPath'=(86 * min(1, node18path86) - currentPath*(min(1,node18path86) - 1))) & (success'=min(1, node18path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path87 * min(1,node18path87) - currentNode*(min(1, node18path87) - 1))) &  (currentPath'=(87 * min(1, node18path87) - currentPath*(min(1,node18path87) - 1))) & (success'=min(1, node18path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path88 * min(1,node18path88) - currentNode*(min(1, node18path88) - 1))) &  (currentPath'=(88 * min(1, node18path88) - currentPath*(min(1,node18path88) - 1))) & (success'=min(1, node18path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path89 * min(1,node18path89) - currentNode*(min(1, node18path89) - 1))) &  (currentPath'=(89 * min(1, node18path89) - currentPath*(min(1,node18path89) - 1))) & (success'=min(1, node18path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path90 * min(1,node18path90) - currentNode*(min(1, node18path90) - 1))) &  (currentPath'=(90 * min(1, node18path90) - currentPath*(min(1,node18path90) - 1))) & (success'=min(1, node18path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path91 * min(1,node18path91) - currentNode*(min(1, node18path91) - 1))) &  (currentPath'=(91 * min(1, node18path91) - currentPath*(min(1,node18path91) - 1))) & (success'=min(1, node18path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path92 * min(1,node18path92) - currentNode*(min(1, node18path92) - 1))) &  (currentPath'=(92 * min(1, node18path92) - currentPath*(min(1,node18path92) - 1))) & (success'=min(1, node18path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path93 * min(1,node18path93) - currentNode*(min(1, node18path93) - 1))) &  (currentPath'=(93 * min(1, node18path93) - currentPath*(min(1,node18path93) - 1))) & (success'=min(1, node18path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path94 * min(1,node18path94) - currentNode*(min(1, node18path94) - 1))) &  (currentPath'=(94 * min(1, node18path94) - currentPath*(min(1,node18path94) - 1))) & (success'=min(1, node18path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path95 * min(1,node18path95) - currentNode*(min(1, node18path95) - 1))) &  (currentPath'=(95 * min(1, node18path95) - currentPath*(min(1,node18path95) - 1))) & (success'=min(1, node18path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path96 * min(1,node18path96) - currentNode*(min(1, node18path96) - 1))) &  (currentPath'=(96 * min(1, node18path96) - currentPath*(min(1,node18path96) - 1))) & (success'=min(1, node18path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path97 * min(1,node18path97) - currentNode*(min(1, node18path97) - 1))) &  (currentPath'=(97 * min(1, node18path97) - currentPath*(min(1,node18path97) - 1))) & (success'=min(1, node18path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path98 * min(1,node18path98) - currentNode*(min(1, node18path98) - 1))) &  (currentPath'=(98 * min(1, node18path98) - currentPath*(min(1,node18path98) - 1))) & (success'=min(1, node18path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path99 * min(1,node18path99) - currentNode*(min(1, node18path99) - 1))) &  (currentPath'=(99 * min(1, node18path99) - currentPath*(min(1,node18path99) - 1))) & (success'=min(1, node18path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node18path100 * min(1,node18path100) - currentNode*(min(1, node18path100) - 1))) &  (currentPath'=(100 * min(1, node18path100) - currentPath*(min(1,node18path100) - 1))) & (success'=min(1, node18path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 19) ->
 numPathsInv: (currentNode'=(node19path1 * min(1,node19path1) - currentNode*(min(1, node19path1) - 1))) &  (currentPath'=(1 * min(1, node19path1) - currentPath*(min(1,node19path1) - 1))) & (success'=min(1, node19path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path2 * min(1,node19path2) - currentNode*(min(1, node19path2) - 1))) &  (currentPath'=(2 * min(1, node19path2) - currentPath*(min(1,node19path2) - 1))) & (success'=min(1, node19path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path3 * min(1,node19path3) - currentNode*(min(1, node19path3) - 1))) &  (currentPath'=(3 * min(1, node19path3) - currentPath*(min(1,node19path3) - 1))) & (success'=min(1, node19path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path4 * min(1,node19path4) - currentNode*(min(1, node19path4) - 1))) &  (currentPath'=(4 * min(1, node19path4) - currentPath*(min(1,node19path4) - 1))) & (success'=min(1, node19path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path5 * min(1,node19path5) - currentNode*(min(1, node19path5) - 1))) &  (currentPath'=(5 * min(1, node19path5) - currentPath*(min(1,node19path5) - 1))) & (success'=min(1, node19path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path6 * min(1,node19path6) - currentNode*(min(1, node19path6) - 1))) &  (currentPath'=(6 * min(1, node19path6) - currentPath*(min(1,node19path6) - 1))) & (success'=min(1, node19path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path7 * min(1,node19path7) - currentNode*(min(1, node19path7) - 1))) &  (currentPath'=(7 * min(1, node19path7) - currentPath*(min(1,node19path7) - 1))) & (success'=min(1, node19path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path8 * min(1,node19path8) - currentNode*(min(1, node19path8) - 1))) &  (currentPath'=(8 * min(1, node19path8) - currentPath*(min(1,node19path8) - 1))) & (success'=min(1, node19path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path9 * min(1,node19path9) - currentNode*(min(1, node19path9) - 1))) &  (currentPath'=(9 * min(1, node19path9) - currentPath*(min(1,node19path9) - 1))) & (success'=min(1, node19path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path10 * min(1,node19path10) - currentNode*(min(1, node19path10) - 1))) &  (currentPath'=(10 * min(1, node19path10) - currentPath*(min(1,node19path10) - 1))) & (success'=min(1, node19path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path11 * min(1,node19path11) - currentNode*(min(1, node19path11) - 1))) &  (currentPath'=(11 * min(1, node19path11) - currentPath*(min(1,node19path11) - 1))) & (success'=min(1, node19path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path12 * min(1,node19path12) - currentNode*(min(1, node19path12) - 1))) &  (currentPath'=(12 * min(1, node19path12) - currentPath*(min(1,node19path12) - 1))) & (success'=min(1, node19path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path13 * min(1,node19path13) - currentNode*(min(1, node19path13) - 1))) &  (currentPath'=(13 * min(1, node19path13) - currentPath*(min(1,node19path13) - 1))) & (success'=min(1, node19path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path14 * min(1,node19path14) - currentNode*(min(1, node19path14) - 1))) &  (currentPath'=(14 * min(1, node19path14) - currentPath*(min(1,node19path14) - 1))) & (success'=min(1, node19path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path15 * min(1,node19path15) - currentNode*(min(1, node19path15) - 1))) &  (currentPath'=(15 * min(1, node19path15) - currentPath*(min(1,node19path15) - 1))) & (success'=min(1, node19path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path16 * min(1,node19path16) - currentNode*(min(1, node19path16) - 1))) &  (currentPath'=(16 * min(1, node19path16) - currentPath*(min(1,node19path16) - 1))) & (success'=min(1, node19path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path17 * min(1,node19path17) - currentNode*(min(1, node19path17) - 1))) &  (currentPath'=(17 * min(1, node19path17) - currentPath*(min(1,node19path17) - 1))) & (success'=min(1, node19path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path18 * min(1,node19path18) - currentNode*(min(1, node19path18) - 1))) &  (currentPath'=(18 * min(1, node19path18) - currentPath*(min(1,node19path18) - 1))) & (success'=min(1, node19path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path19 * min(1,node19path19) - currentNode*(min(1, node19path19) - 1))) &  (currentPath'=(19 * min(1, node19path19) - currentPath*(min(1,node19path19) - 1))) & (success'=min(1, node19path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path20 * min(1,node19path20) - currentNode*(min(1, node19path20) - 1))) &  (currentPath'=(20 * min(1, node19path20) - currentPath*(min(1,node19path20) - 1))) & (success'=min(1, node19path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path21 * min(1,node19path21) - currentNode*(min(1, node19path21) - 1))) &  (currentPath'=(21 * min(1, node19path21) - currentPath*(min(1,node19path21) - 1))) & (success'=min(1, node19path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path22 * min(1,node19path22) - currentNode*(min(1, node19path22) - 1))) &  (currentPath'=(22 * min(1, node19path22) - currentPath*(min(1,node19path22) - 1))) & (success'=min(1, node19path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path23 * min(1,node19path23) - currentNode*(min(1, node19path23) - 1))) &  (currentPath'=(23 * min(1, node19path23) - currentPath*(min(1,node19path23) - 1))) & (success'=min(1, node19path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path24 * min(1,node19path24) - currentNode*(min(1, node19path24) - 1))) &  (currentPath'=(24 * min(1, node19path24) - currentPath*(min(1,node19path24) - 1))) & (success'=min(1, node19path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path25 * min(1,node19path25) - currentNode*(min(1, node19path25) - 1))) &  (currentPath'=(25 * min(1, node19path25) - currentPath*(min(1,node19path25) - 1))) & (success'=min(1, node19path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path26 * min(1,node19path26) - currentNode*(min(1, node19path26) - 1))) &  (currentPath'=(26 * min(1, node19path26) - currentPath*(min(1,node19path26) - 1))) & (success'=min(1, node19path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path27 * min(1,node19path27) - currentNode*(min(1, node19path27) - 1))) &  (currentPath'=(27 * min(1, node19path27) - currentPath*(min(1,node19path27) - 1))) & (success'=min(1, node19path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path28 * min(1,node19path28) - currentNode*(min(1, node19path28) - 1))) &  (currentPath'=(28 * min(1, node19path28) - currentPath*(min(1,node19path28) - 1))) & (success'=min(1, node19path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path29 * min(1,node19path29) - currentNode*(min(1, node19path29) - 1))) &  (currentPath'=(29 * min(1, node19path29) - currentPath*(min(1,node19path29) - 1))) & (success'=min(1, node19path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path30 * min(1,node19path30) - currentNode*(min(1, node19path30) - 1))) &  (currentPath'=(30 * min(1, node19path30) - currentPath*(min(1,node19path30) - 1))) & (success'=min(1, node19path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path31 * min(1,node19path31) - currentNode*(min(1, node19path31) - 1))) &  (currentPath'=(31 * min(1, node19path31) - currentPath*(min(1,node19path31) - 1))) & (success'=min(1, node19path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path32 * min(1,node19path32) - currentNode*(min(1, node19path32) - 1))) &  (currentPath'=(32 * min(1, node19path32) - currentPath*(min(1,node19path32) - 1))) & (success'=min(1, node19path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path33 * min(1,node19path33) - currentNode*(min(1, node19path33) - 1))) &  (currentPath'=(33 * min(1, node19path33) - currentPath*(min(1,node19path33) - 1))) & (success'=min(1, node19path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path34 * min(1,node19path34) - currentNode*(min(1, node19path34) - 1))) &  (currentPath'=(34 * min(1, node19path34) - currentPath*(min(1,node19path34) - 1))) & (success'=min(1, node19path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path35 * min(1,node19path35) - currentNode*(min(1, node19path35) - 1))) &  (currentPath'=(35 * min(1, node19path35) - currentPath*(min(1,node19path35) - 1))) & (success'=min(1, node19path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path36 * min(1,node19path36) - currentNode*(min(1, node19path36) - 1))) &  (currentPath'=(36 * min(1, node19path36) - currentPath*(min(1,node19path36) - 1))) & (success'=min(1, node19path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path37 * min(1,node19path37) - currentNode*(min(1, node19path37) - 1))) &  (currentPath'=(37 * min(1, node19path37) - currentPath*(min(1,node19path37) - 1))) & (success'=min(1, node19path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path38 * min(1,node19path38) - currentNode*(min(1, node19path38) - 1))) &  (currentPath'=(38 * min(1, node19path38) - currentPath*(min(1,node19path38) - 1))) & (success'=min(1, node19path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path39 * min(1,node19path39) - currentNode*(min(1, node19path39) - 1))) &  (currentPath'=(39 * min(1, node19path39) - currentPath*(min(1,node19path39) - 1))) & (success'=min(1, node19path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path40 * min(1,node19path40) - currentNode*(min(1, node19path40) - 1))) &  (currentPath'=(40 * min(1, node19path40) - currentPath*(min(1,node19path40) - 1))) & (success'=min(1, node19path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path41 * min(1,node19path41) - currentNode*(min(1, node19path41) - 1))) &  (currentPath'=(41 * min(1, node19path41) - currentPath*(min(1,node19path41) - 1))) & (success'=min(1, node19path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path42 * min(1,node19path42) - currentNode*(min(1, node19path42) - 1))) &  (currentPath'=(42 * min(1, node19path42) - currentPath*(min(1,node19path42) - 1))) & (success'=min(1, node19path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path43 * min(1,node19path43) - currentNode*(min(1, node19path43) - 1))) &  (currentPath'=(43 * min(1, node19path43) - currentPath*(min(1,node19path43) - 1))) & (success'=min(1, node19path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path44 * min(1,node19path44) - currentNode*(min(1, node19path44) - 1))) &  (currentPath'=(44 * min(1, node19path44) - currentPath*(min(1,node19path44) - 1))) & (success'=min(1, node19path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path45 * min(1,node19path45) - currentNode*(min(1, node19path45) - 1))) &  (currentPath'=(45 * min(1, node19path45) - currentPath*(min(1,node19path45) - 1))) & (success'=min(1, node19path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path46 * min(1,node19path46) - currentNode*(min(1, node19path46) - 1))) &  (currentPath'=(46 * min(1, node19path46) - currentPath*(min(1,node19path46) - 1))) & (success'=min(1, node19path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path47 * min(1,node19path47) - currentNode*(min(1, node19path47) - 1))) &  (currentPath'=(47 * min(1, node19path47) - currentPath*(min(1,node19path47) - 1))) & (success'=min(1, node19path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path48 * min(1,node19path48) - currentNode*(min(1, node19path48) - 1))) &  (currentPath'=(48 * min(1, node19path48) - currentPath*(min(1,node19path48) - 1))) & (success'=min(1, node19path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path49 * min(1,node19path49) - currentNode*(min(1, node19path49) - 1))) &  (currentPath'=(49 * min(1, node19path49) - currentPath*(min(1,node19path49) - 1))) & (success'=min(1, node19path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path50 * min(1,node19path50) - currentNode*(min(1, node19path50) - 1))) &  (currentPath'=(50 * min(1, node19path50) - currentPath*(min(1,node19path50) - 1))) & (success'=min(1, node19path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path51 * min(1,node19path51) - currentNode*(min(1, node19path51) - 1))) &  (currentPath'=(51 * min(1, node19path51) - currentPath*(min(1,node19path51) - 1))) & (success'=min(1, node19path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path52 * min(1,node19path52) - currentNode*(min(1, node19path52) - 1))) &  (currentPath'=(52 * min(1, node19path52) - currentPath*(min(1,node19path52) - 1))) & (success'=min(1, node19path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path53 * min(1,node19path53) - currentNode*(min(1, node19path53) - 1))) &  (currentPath'=(53 * min(1, node19path53) - currentPath*(min(1,node19path53) - 1))) & (success'=min(1, node19path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path54 * min(1,node19path54) - currentNode*(min(1, node19path54) - 1))) &  (currentPath'=(54 * min(1, node19path54) - currentPath*(min(1,node19path54) - 1))) & (success'=min(1, node19path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path55 * min(1,node19path55) - currentNode*(min(1, node19path55) - 1))) &  (currentPath'=(55 * min(1, node19path55) - currentPath*(min(1,node19path55) - 1))) & (success'=min(1, node19path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path56 * min(1,node19path56) - currentNode*(min(1, node19path56) - 1))) &  (currentPath'=(56 * min(1, node19path56) - currentPath*(min(1,node19path56) - 1))) & (success'=min(1, node19path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path57 * min(1,node19path57) - currentNode*(min(1, node19path57) - 1))) &  (currentPath'=(57 * min(1, node19path57) - currentPath*(min(1,node19path57) - 1))) & (success'=min(1, node19path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path58 * min(1,node19path58) - currentNode*(min(1, node19path58) - 1))) &  (currentPath'=(58 * min(1, node19path58) - currentPath*(min(1,node19path58) - 1))) & (success'=min(1, node19path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path59 * min(1,node19path59) - currentNode*(min(1, node19path59) - 1))) &  (currentPath'=(59 * min(1, node19path59) - currentPath*(min(1,node19path59) - 1))) & (success'=min(1, node19path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path60 * min(1,node19path60) - currentNode*(min(1, node19path60) - 1))) &  (currentPath'=(60 * min(1, node19path60) - currentPath*(min(1,node19path60) - 1))) & (success'=min(1, node19path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path61 * min(1,node19path61) - currentNode*(min(1, node19path61) - 1))) &  (currentPath'=(61 * min(1, node19path61) - currentPath*(min(1,node19path61) - 1))) & (success'=min(1, node19path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path62 * min(1,node19path62) - currentNode*(min(1, node19path62) - 1))) &  (currentPath'=(62 * min(1, node19path62) - currentPath*(min(1,node19path62) - 1))) & (success'=min(1, node19path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path63 * min(1,node19path63) - currentNode*(min(1, node19path63) - 1))) &  (currentPath'=(63 * min(1, node19path63) - currentPath*(min(1,node19path63) - 1))) & (success'=min(1, node19path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path64 * min(1,node19path64) - currentNode*(min(1, node19path64) - 1))) &  (currentPath'=(64 * min(1, node19path64) - currentPath*(min(1,node19path64) - 1))) & (success'=min(1, node19path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path65 * min(1,node19path65) - currentNode*(min(1, node19path65) - 1))) &  (currentPath'=(65 * min(1, node19path65) - currentPath*(min(1,node19path65) - 1))) & (success'=min(1, node19path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path66 * min(1,node19path66) - currentNode*(min(1, node19path66) - 1))) &  (currentPath'=(66 * min(1, node19path66) - currentPath*(min(1,node19path66) - 1))) & (success'=min(1, node19path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path67 * min(1,node19path67) - currentNode*(min(1, node19path67) - 1))) &  (currentPath'=(67 * min(1, node19path67) - currentPath*(min(1,node19path67) - 1))) & (success'=min(1, node19path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path68 * min(1,node19path68) - currentNode*(min(1, node19path68) - 1))) &  (currentPath'=(68 * min(1, node19path68) - currentPath*(min(1,node19path68) - 1))) & (success'=min(1, node19path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path69 * min(1,node19path69) - currentNode*(min(1, node19path69) - 1))) &  (currentPath'=(69 * min(1, node19path69) - currentPath*(min(1,node19path69) - 1))) & (success'=min(1, node19path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path70 * min(1,node19path70) - currentNode*(min(1, node19path70) - 1))) &  (currentPath'=(70 * min(1, node19path70) - currentPath*(min(1,node19path70) - 1))) & (success'=min(1, node19path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path71 * min(1,node19path71) - currentNode*(min(1, node19path71) - 1))) &  (currentPath'=(71 * min(1, node19path71) - currentPath*(min(1,node19path71) - 1))) & (success'=min(1, node19path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path72 * min(1,node19path72) - currentNode*(min(1, node19path72) - 1))) &  (currentPath'=(72 * min(1, node19path72) - currentPath*(min(1,node19path72) - 1))) & (success'=min(1, node19path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path73 * min(1,node19path73) - currentNode*(min(1, node19path73) - 1))) &  (currentPath'=(73 * min(1, node19path73) - currentPath*(min(1,node19path73) - 1))) & (success'=min(1, node19path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path74 * min(1,node19path74) - currentNode*(min(1, node19path74) - 1))) &  (currentPath'=(74 * min(1, node19path74) - currentPath*(min(1,node19path74) - 1))) & (success'=min(1, node19path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path75 * min(1,node19path75) - currentNode*(min(1, node19path75) - 1))) &  (currentPath'=(75 * min(1, node19path75) - currentPath*(min(1,node19path75) - 1))) & (success'=min(1, node19path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path76 * min(1,node19path76) - currentNode*(min(1, node19path76) - 1))) &  (currentPath'=(76 * min(1, node19path76) - currentPath*(min(1,node19path76) - 1))) & (success'=min(1, node19path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path77 * min(1,node19path77) - currentNode*(min(1, node19path77) - 1))) &  (currentPath'=(77 * min(1, node19path77) - currentPath*(min(1,node19path77) - 1))) & (success'=min(1, node19path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path78 * min(1,node19path78) - currentNode*(min(1, node19path78) - 1))) &  (currentPath'=(78 * min(1, node19path78) - currentPath*(min(1,node19path78) - 1))) & (success'=min(1, node19path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path79 * min(1,node19path79) - currentNode*(min(1, node19path79) - 1))) &  (currentPath'=(79 * min(1, node19path79) - currentPath*(min(1,node19path79) - 1))) & (success'=min(1, node19path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path80 * min(1,node19path80) - currentNode*(min(1, node19path80) - 1))) &  (currentPath'=(80 * min(1, node19path80) - currentPath*(min(1,node19path80) - 1))) & (success'=min(1, node19path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path81 * min(1,node19path81) - currentNode*(min(1, node19path81) - 1))) &  (currentPath'=(81 * min(1, node19path81) - currentPath*(min(1,node19path81) - 1))) & (success'=min(1, node19path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path82 * min(1,node19path82) - currentNode*(min(1, node19path82) - 1))) &  (currentPath'=(82 * min(1, node19path82) - currentPath*(min(1,node19path82) - 1))) & (success'=min(1, node19path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path83 * min(1,node19path83) - currentNode*(min(1, node19path83) - 1))) &  (currentPath'=(83 * min(1, node19path83) - currentPath*(min(1,node19path83) - 1))) & (success'=min(1, node19path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path84 * min(1,node19path84) - currentNode*(min(1, node19path84) - 1))) &  (currentPath'=(84 * min(1, node19path84) - currentPath*(min(1,node19path84) - 1))) & (success'=min(1, node19path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path85 * min(1,node19path85) - currentNode*(min(1, node19path85) - 1))) &  (currentPath'=(85 * min(1, node19path85) - currentPath*(min(1,node19path85) - 1))) & (success'=min(1, node19path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path86 * min(1,node19path86) - currentNode*(min(1, node19path86) - 1))) &  (currentPath'=(86 * min(1, node19path86) - currentPath*(min(1,node19path86) - 1))) & (success'=min(1, node19path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path87 * min(1,node19path87) - currentNode*(min(1, node19path87) - 1))) &  (currentPath'=(87 * min(1, node19path87) - currentPath*(min(1,node19path87) - 1))) & (success'=min(1, node19path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path88 * min(1,node19path88) - currentNode*(min(1, node19path88) - 1))) &  (currentPath'=(88 * min(1, node19path88) - currentPath*(min(1,node19path88) - 1))) & (success'=min(1, node19path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path89 * min(1,node19path89) - currentNode*(min(1, node19path89) - 1))) &  (currentPath'=(89 * min(1, node19path89) - currentPath*(min(1,node19path89) - 1))) & (success'=min(1, node19path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path90 * min(1,node19path90) - currentNode*(min(1, node19path90) - 1))) &  (currentPath'=(90 * min(1, node19path90) - currentPath*(min(1,node19path90) - 1))) & (success'=min(1, node19path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path91 * min(1,node19path91) - currentNode*(min(1, node19path91) - 1))) &  (currentPath'=(91 * min(1, node19path91) - currentPath*(min(1,node19path91) - 1))) & (success'=min(1, node19path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path92 * min(1,node19path92) - currentNode*(min(1, node19path92) - 1))) &  (currentPath'=(92 * min(1, node19path92) - currentPath*(min(1,node19path92) - 1))) & (success'=min(1, node19path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path93 * min(1,node19path93) - currentNode*(min(1, node19path93) - 1))) &  (currentPath'=(93 * min(1, node19path93) - currentPath*(min(1,node19path93) - 1))) & (success'=min(1, node19path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path94 * min(1,node19path94) - currentNode*(min(1, node19path94) - 1))) &  (currentPath'=(94 * min(1, node19path94) - currentPath*(min(1,node19path94) - 1))) & (success'=min(1, node19path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path95 * min(1,node19path95) - currentNode*(min(1, node19path95) - 1))) &  (currentPath'=(95 * min(1, node19path95) - currentPath*(min(1,node19path95) - 1))) & (success'=min(1, node19path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path96 * min(1,node19path96) - currentNode*(min(1, node19path96) - 1))) &  (currentPath'=(96 * min(1, node19path96) - currentPath*(min(1,node19path96) - 1))) & (success'=min(1, node19path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path97 * min(1,node19path97) - currentNode*(min(1, node19path97) - 1))) &  (currentPath'=(97 * min(1, node19path97) - currentPath*(min(1,node19path97) - 1))) & (success'=min(1, node19path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path98 * min(1,node19path98) - currentNode*(min(1, node19path98) - 1))) &  (currentPath'=(98 * min(1, node19path98) - currentPath*(min(1,node19path98) - 1))) & (success'=min(1, node19path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path99 * min(1,node19path99) - currentNode*(min(1, node19path99) - 1))) &  (currentPath'=(99 * min(1, node19path99) - currentPath*(min(1,node19path99) - 1))) & (success'=min(1, node19path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node19path100 * min(1,node19path100) - currentNode*(min(1, node19path100) - 1))) &  (currentPath'=(100 * min(1, node19path100) - currentPath*(min(1,node19path100) - 1))) & (success'=min(1, node19path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 20) ->
 numPathsInv: (currentNode'=(node20path1 * min(1,node20path1) - currentNode*(min(1, node20path1) - 1))) &  (currentPath'=(1 * min(1, node20path1) - currentPath*(min(1,node20path1) - 1))) & (success'=min(1, node20path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path2 * min(1,node20path2) - currentNode*(min(1, node20path2) - 1))) &  (currentPath'=(2 * min(1, node20path2) - currentPath*(min(1,node20path2) - 1))) & (success'=min(1, node20path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path3 * min(1,node20path3) - currentNode*(min(1, node20path3) - 1))) &  (currentPath'=(3 * min(1, node20path3) - currentPath*(min(1,node20path3) - 1))) & (success'=min(1, node20path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path4 * min(1,node20path4) - currentNode*(min(1, node20path4) - 1))) &  (currentPath'=(4 * min(1, node20path4) - currentPath*(min(1,node20path4) - 1))) & (success'=min(1, node20path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path5 * min(1,node20path5) - currentNode*(min(1, node20path5) - 1))) &  (currentPath'=(5 * min(1, node20path5) - currentPath*(min(1,node20path5) - 1))) & (success'=min(1, node20path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path6 * min(1,node20path6) - currentNode*(min(1, node20path6) - 1))) &  (currentPath'=(6 * min(1, node20path6) - currentPath*(min(1,node20path6) - 1))) & (success'=min(1, node20path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path7 * min(1,node20path7) - currentNode*(min(1, node20path7) - 1))) &  (currentPath'=(7 * min(1, node20path7) - currentPath*(min(1,node20path7) - 1))) & (success'=min(1, node20path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path8 * min(1,node20path8) - currentNode*(min(1, node20path8) - 1))) &  (currentPath'=(8 * min(1, node20path8) - currentPath*(min(1,node20path8) - 1))) & (success'=min(1, node20path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path9 * min(1,node20path9) - currentNode*(min(1, node20path9) - 1))) &  (currentPath'=(9 * min(1, node20path9) - currentPath*(min(1,node20path9) - 1))) & (success'=min(1, node20path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path10 * min(1,node20path10) - currentNode*(min(1, node20path10) - 1))) &  (currentPath'=(10 * min(1, node20path10) - currentPath*(min(1,node20path10) - 1))) & (success'=min(1, node20path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path11 * min(1,node20path11) - currentNode*(min(1, node20path11) - 1))) &  (currentPath'=(11 * min(1, node20path11) - currentPath*(min(1,node20path11) - 1))) & (success'=min(1, node20path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path12 * min(1,node20path12) - currentNode*(min(1, node20path12) - 1))) &  (currentPath'=(12 * min(1, node20path12) - currentPath*(min(1,node20path12) - 1))) & (success'=min(1, node20path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path13 * min(1,node20path13) - currentNode*(min(1, node20path13) - 1))) &  (currentPath'=(13 * min(1, node20path13) - currentPath*(min(1,node20path13) - 1))) & (success'=min(1, node20path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path14 * min(1,node20path14) - currentNode*(min(1, node20path14) - 1))) &  (currentPath'=(14 * min(1, node20path14) - currentPath*(min(1,node20path14) - 1))) & (success'=min(1, node20path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path15 * min(1,node20path15) - currentNode*(min(1, node20path15) - 1))) &  (currentPath'=(15 * min(1, node20path15) - currentPath*(min(1,node20path15) - 1))) & (success'=min(1, node20path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path16 * min(1,node20path16) - currentNode*(min(1, node20path16) - 1))) &  (currentPath'=(16 * min(1, node20path16) - currentPath*(min(1,node20path16) - 1))) & (success'=min(1, node20path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path17 * min(1,node20path17) - currentNode*(min(1, node20path17) - 1))) &  (currentPath'=(17 * min(1, node20path17) - currentPath*(min(1,node20path17) - 1))) & (success'=min(1, node20path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path18 * min(1,node20path18) - currentNode*(min(1, node20path18) - 1))) &  (currentPath'=(18 * min(1, node20path18) - currentPath*(min(1,node20path18) - 1))) & (success'=min(1, node20path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path19 * min(1,node20path19) - currentNode*(min(1, node20path19) - 1))) &  (currentPath'=(19 * min(1, node20path19) - currentPath*(min(1,node20path19) - 1))) & (success'=min(1, node20path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path20 * min(1,node20path20) - currentNode*(min(1, node20path20) - 1))) &  (currentPath'=(20 * min(1, node20path20) - currentPath*(min(1,node20path20) - 1))) & (success'=min(1, node20path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path21 * min(1,node20path21) - currentNode*(min(1, node20path21) - 1))) &  (currentPath'=(21 * min(1, node20path21) - currentPath*(min(1,node20path21) - 1))) & (success'=min(1, node20path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path22 * min(1,node20path22) - currentNode*(min(1, node20path22) - 1))) &  (currentPath'=(22 * min(1, node20path22) - currentPath*(min(1,node20path22) - 1))) & (success'=min(1, node20path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path23 * min(1,node20path23) - currentNode*(min(1, node20path23) - 1))) &  (currentPath'=(23 * min(1, node20path23) - currentPath*(min(1,node20path23) - 1))) & (success'=min(1, node20path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path24 * min(1,node20path24) - currentNode*(min(1, node20path24) - 1))) &  (currentPath'=(24 * min(1, node20path24) - currentPath*(min(1,node20path24) - 1))) & (success'=min(1, node20path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path25 * min(1,node20path25) - currentNode*(min(1, node20path25) - 1))) &  (currentPath'=(25 * min(1, node20path25) - currentPath*(min(1,node20path25) - 1))) & (success'=min(1, node20path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path26 * min(1,node20path26) - currentNode*(min(1, node20path26) - 1))) &  (currentPath'=(26 * min(1, node20path26) - currentPath*(min(1,node20path26) - 1))) & (success'=min(1, node20path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path27 * min(1,node20path27) - currentNode*(min(1, node20path27) - 1))) &  (currentPath'=(27 * min(1, node20path27) - currentPath*(min(1,node20path27) - 1))) & (success'=min(1, node20path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path28 * min(1,node20path28) - currentNode*(min(1, node20path28) - 1))) &  (currentPath'=(28 * min(1, node20path28) - currentPath*(min(1,node20path28) - 1))) & (success'=min(1, node20path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path29 * min(1,node20path29) - currentNode*(min(1, node20path29) - 1))) &  (currentPath'=(29 * min(1, node20path29) - currentPath*(min(1,node20path29) - 1))) & (success'=min(1, node20path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path30 * min(1,node20path30) - currentNode*(min(1, node20path30) - 1))) &  (currentPath'=(30 * min(1, node20path30) - currentPath*(min(1,node20path30) - 1))) & (success'=min(1, node20path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path31 * min(1,node20path31) - currentNode*(min(1, node20path31) - 1))) &  (currentPath'=(31 * min(1, node20path31) - currentPath*(min(1,node20path31) - 1))) & (success'=min(1, node20path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path32 * min(1,node20path32) - currentNode*(min(1, node20path32) - 1))) &  (currentPath'=(32 * min(1, node20path32) - currentPath*(min(1,node20path32) - 1))) & (success'=min(1, node20path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path33 * min(1,node20path33) - currentNode*(min(1, node20path33) - 1))) &  (currentPath'=(33 * min(1, node20path33) - currentPath*(min(1,node20path33) - 1))) & (success'=min(1, node20path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path34 * min(1,node20path34) - currentNode*(min(1, node20path34) - 1))) &  (currentPath'=(34 * min(1, node20path34) - currentPath*(min(1,node20path34) - 1))) & (success'=min(1, node20path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path35 * min(1,node20path35) - currentNode*(min(1, node20path35) - 1))) &  (currentPath'=(35 * min(1, node20path35) - currentPath*(min(1,node20path35) - 1))) & (success'=min(1, node20path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path36 * min(1,node20path36) - currentNode*(min(1, node20path36) - 1))) &  (currentPath'=(36 * min(1, node20path36) - currentPath*(min(1,node20path36) - 1))) & (success'=min(1, node20path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path37 * min(1,node20path37) - currentNode*(min(1, node20path37) - 1))) &  (currentPath'=(37 * min(1, node20path37) - currentPath*(min(1,node20path37) - 1))) & (success'=min(1, node20path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path38 * min(1,node20path38) - currentNode*(min(1, node20path38) - 1))) &  (currentPath'=(38 * min(1, node20path38) - currentPath*(min(1,node20path38) - 1))) & (success'=min(1, node20path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path39 * min(1,node20path39) - currentNode*(min(1, node20path39) - 1))) &  (currentPath'=(39 * min(1, node20path39) - currentPath*(min(1,node20path39) - 1))) & (success'=min(1, node20path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path40 * min(1,node20path40) - currentNode*(min(1, node20path40) - 1))) &  (currentPath'=(40 * min(1, node20path40) - currentPath*(min(1,node20path40) - 1))) & (success'=min(1, node20path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path41 * min(1,node20path41) - currentNode*(min(1, node20path41) - 1))) &  (currentPath'=(41 * min(1, node20path41) - currentPath*(min(1,node20path41) - 1))) & (success'=min(1, node20path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path42 * min(1,node20path42) - currentNode*(min(1, node20path42) - 1))) &  (currentPath'=(42 * min(1, node20path42) - currentPath*(min(1,node20path42) - 1))) & (success'=min(1, node20path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path43 * min(1,node20path43) - currentNode*(min(1, node20path43) - 1))) &  (currentPath'=(43 * min(1, node20path43) - currentPath*(min(1,node20path43) - 1))) & (success'=min(1, node20path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path44 * min(1,node20path44) - currentNode*(min(1, node20path44) - 1))) &  (currentPath'=(44 * min(1, node20path44) - currentPath*(min(1,node20path44) - 1))) & (success'=min(1, node20path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path45 * min(1,node20path45) - currentNode*(min(1, node20path45) - 1))) &  (currentPath'=(45 * min(1, node20path45) - currentPath*(min(1,node20path45) - 1))) & (success'=min(1, node20path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path46 * min(1,node20path46) - currentNode*(min(1, node20path46) - 1))) &  (currentPath'=(46 * min(1, node20path46) - currentPath*(min(1,node20path46) - 1))) & (success'=min(1, node20path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path47 * min(1,node20path47) - currentNode*(min(1, node20path47) - 1))) &  (currentPath'=(47 * min(1, node20path47) - currentPath*(min(1,node20path47) - 1))) & (success'=min(1, node20path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path48 * min(1,node20path48) - currentNode*(min(1, node20path48) - 1))) &  (currentPath'=(48 * min(1, node20path48) - currentPath*(min(1,node20path48) - 1))) & (success'=min(1, node20path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path49 * min(1,node20path49) - currentNode*(min(1, node20path49) - 1))) &  (currentPath'=(49 * min(1, node20path49) - currentPath*(min(1,node20path49) - 1))) & (success'=min(1, node20path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path50 * min(1,node20path50) - currentNode*(min(1, node20path50) - 1))) &  (currentPath'=(50 * min(1, node20path50) - currentPath*(min(1,node20path50) - 1))) & (success'=min(1, node20path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path51 * min(1,node20path51) - currentNode*(min(1, node20path51) - 1))) &  (currentPath'=(51 * min(1, node20path51) - currentPath*(min(1,node20path51) - 1))) & (success'=min(1, node20path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path52 * min(1,node20path52) - currentNode*(min(1, node20path52) - 1))) &  (currentPath'=(52 * min(1, node20path52) - currentPath*(min(1,node20path52) - 1))) & (success'=min(1, node20path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path53 * min(1,node20path53) - currentNode*(min(1, node20path53) - 1))) &  (currentPath'=(53 * min(1, node20path53) - currentPath*(min(1,node20path53) - 1))) & (success'=min(1, node20path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path54 * min(1,node20path54) - currentNode*(min(1, node20path54) - 1))) &  (currentPath'=(54 * min(1, node20path54) - currentPath*(min(1,node20path54) - 1))) & (success'=min(1, node20path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path55 * min(1,node20path55) - currentNode*(min(1, node20path55) - 1))) &  (currentPath'=(55 * min(1, node20path55) - currentPath*(min(1,node20path55) - 1))) & (success'=min(1, node20path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path56 * min(1,node20path56) - currentNode*(min(1, node20path56) - 1))) &  (currentPath'=(56 * min(1, node20path56) - currentPath*(min(1,node20path56) - 1))) & (success'=min(1, node20path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path57 * min(1,node20path57) - currentNode*(min(1, node20path57) - 1))) &  (currentPath'=(57 * min(1, node20path57) - currentPath*(min(1,node20path57) - 1))) & (success'=min(1, node20path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path58 * min(1,node20path58) - currentNode*(min(1, node20path58) - 1))) &  (currentPath'=(58 * min(1, node20path58) - currentPath*(min(1,node20path58) - 1))) & (success'=min(1, node20path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path59 * min(1,node20path59) - currentNode*(min(1, node20path59) - 1))) &  (currentPath'=(59 * min(1, node20path59) - currentPath*(min(1,node20path59) - 1))) & (success'=min(1, node20path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path60 * min(1,node20path60) - currentNode*(min(1, node20path60) - 1))) &  (currentPath'=(60 * min(1, node20path60) - currentPath*(min(1,node20path60) - 1))) & (success'=min(1, node20path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path61 * min(1,node20path61) - currentNode*(min(1, node20path61) - 1))) &  (currentPath'=(61 * min(1, node20path61) - currentPath*(min(1,node20path61) - 1))) & (success'=min(1, node20path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path62 * min(1,node20path62) - currentNode*(min(1, node20path62) - 1))) &  (currentPath'=(62 * min(1, node20path62) - currentPath*(min(1,node20path62) - 1))) & (success'=min(1, node20path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path63 * min(1,node20path63) - currentNode*(min(1, node20path63) - 1))) &  (currentPath'=(63 * min(1, node20path63) - currentPath*(min(1,node20path63) - 1))) & (success'=min(1, node20path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path64 * min(1,node20path64) - currentNode*(min(1, node20path64) - 1))) &  (currentPath'=(64 * min(1, node20path64) - currentPath*(min(1,node20path64) - 1))) & (success'=min(1, node20path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path65 * min(1,node20path65) - currentNode*(min(1, node20path65) - 1))) &  (currentPath'=(65 * min(1, node20path65) - currentPath*(min(1,node20path65) - 1))) & (success'=min(1, node20path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path66 * min(1,node20path66) - currentNode*(min(1, node20path66) - 1))) &  (currentPath'=(66 * min(1, node20path66) - currentPath*(min(1,node20path66) - 1))) & (success'=min(1, node20path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path67 * min(1,node20path67) - currentNode*(min(1, node20path67) - 1))) &  (currentPath'=(67 * min(1, node20path67) - currentPath*(min(1,node20path67) - 1))) & (success'=min(1, node20path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path68 * min(1,node20path68) - currentNode*(min(1, node20path68) - 1))) &  (currentPath'=(68 * min(1, node20path68) - currentPath*(min(1,node20path68) - 1))) & (success'=min(1, node20path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path69 * min(1,node20path69) - currentNode*(min(1, node20path69) - 1))) &  (currentPath'=(69 * min(1, node20path69) - currentPath*(min(1,node20path69) - 1))) & (success'=min(1, node20path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path70 * min(1,node20path70) - currentNode*(min(1, node20path70) - 1))) &  (currentPath'=(70 * min(1, node20path70) - currentPath*(min(1,node20path70) - 1))) & (success'=min(1, node20path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path71 * min(1,node20path71) - currentNode*(min(1, node20path71) - 1))) &  (currentPath'=(71 * min(1, node20path71) - currentPath*(min(1,node20path71) - 1))) & (success'=min(1, node20path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path72 * min(1,node20path72) - currentNode*(min(1, node20path72) - 1))) &  (currentPath'=(72 * min(1, node20path72) - currentPath*(min(1,node20path72) - 1))) & (success'=min(1, node20path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path73 * min(1,node20path73) - currentNode*(min(1, node20path73) - 1))) &  (currentPath'=(73 * min(1, node20path73) - currentPath*(min(1,node20path73) - 1))) & (success'=min(1, node20path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path74 * min(1,node20path74) - currentNode*(min(1, node20path74) - 1))) &  (currentPath'=(74 * min(1, node20path74) - currentPath*(min(1,node20path74) - 1))) & (success'=min(1, node20path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path75 * min(1,node20path75) - currentNode*(min(1, node20path75) - 1))) &  (currentPath'=(75 * min(1, node20path75) - currentPath*(min(1,node20path75) - 1))) & (success'=min(1, node20path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path76 * min(1,node20path76) - currentNode*(min(1, node20path76) - 1))) &  (currentPath'=(76 * min(1, node20path76) - currentPath*(min(1,node20path76) - 1))) & (success'=min(1, node20path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path77 * min(1,node20path77) - currentNode*(min(1, node20path77) - 1))) &  (currentPath'=(77 * min(1, node20path77) - currentPath*(min(1,node20path77) - 1))) & (success'=min(1, node20path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path78 * min(1,node20path78) - currentNode*(min(1, node20path78) - 1))) &  (currentPath'=(78 * min(1, node20path78) - currentPath*(min(1,node20path78) - 1))) & (success'=min(1, node20path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path79 * min(1,node20path79) - currentNode*(min(1, node20path79) - 1))) &  (currentPath'=(79 * min(1, node20path79) - currentPath*(min(1,node20path79) - 1))) & (success'=min(1, node20path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path80 * min(1,node20path80) - currentNode*(min(1, node20path80) - 1))) &  (currentPath'=(80 * min(1, node20path80) - currentPath*(min(1,node20path80) - 1))) & (success'=min(1, node20path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path81 * min(1,node20path81) - currentNode*(min(1, node20path81) - 1))) &  (currentPath'=(81 * min(1, node20path81) - currentPath*(min(1,node20path81) - 1))) & (success'=min(1, node20path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path82 * min(1,node20path82) - currentNode*(min(1, node20path82) - 1))) &  (currentPath'=(82 * min(1, node20path82) - currentPath*(min(1,node20path82) - 1))) & (success'=min(1, node20path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path83 * min(1,node20path83) - currentNode*(min(1, node20path83) - 1))) &  (currentPath'=(83 * min(1, node20path83) - currentPath*(min(1,node20path83) - 1))) & (success'=min(1, node20path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path84 * min(1,node20path84) - currentNode*(min(1, node20path84) - 1))) &  (currentPath'=(84 * min(1, node20path84) - currentPath*(min(1,node20path84) - 1))) & (success'=min(1, node20path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path85 * min(1,node20path85) - currentNode*(min(1, node20path85) - 1))) &  (currentPath'=(85 * min(1, node20path85) - currentPath*(min(1,node20path85) - 1))) & (success'=min(1, node20path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path86 * min(1,node20path86) - currentNode*(min(1, node20path86) - 1))) &  (currentPath'=(86 * min(1, node20path86) - currentPath*(min(1,node20path86) - 1))) & (success'=min(1, node20path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path87 * min(1,node20path87) - currentNode*(min(1, node20path87) - 1))) &  (currentPath'=(87 * min(1, node20path87) - currentPath*(min(1,node20path87) - 1))) & (success'=min(1, node20path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path88 * min(1,node20path88) - currentNode*(min(1, node20path88) - 1))) &  (currentPath'=(88 * min(1, node20path88) - currentPath*(min(1,node20path88) - 1))) & (success'=min(1, node20path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path89 * min(1,node20path89) - currentNode*(min(1, node20path89) - 1))) &  (currentPath'=(89 * min(1, node20path89) - currentPath*(min(1,node20path89) - 1))) & (success'=min(1, node20path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path90 * min(1,node20path90) - currentNode*(min(1, node20path90) - 1))) &  (currentPath'=(90 * min(1, node20path90) - currentPath*(min(1,node20path90) - 1))) & (success'=min(1, node20path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path91 * min(1,node20path91) - currentNode*(min(1, node20path91) - 1))) &  (currentPath'=(91 * min(1, node20path91) - currentPath*(min(1,node20path91) - 1))) & (success'=min(1, node20path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path92 * min(1,node20path92) - currentNode*(min(1, node20path92) - 1))) &  (currentPath'=(92 * min(1, node20path92) - currentPath*(min(1,node20path92) - 1))) & (success'=min(1, node20path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path93 * min(1,node20path93) - currentNode*(min(1, node20path93) - 1))) &  (currentPath'=(93 * min(1, node20path93) - currentPath*(min(1,node20path93) - 1))) & (success'=min(1, node20path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path94 * min(1,node20path94) - currentNode*(min(1, node20path94) - 1))) &  (currentPath'=(94 * min(1, node20path94) - currentPath*(min(1,node20path94) - 1))) & (success'=min(1, node20path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path95 * min(1,node20path95) - currentNode*(min(1, node20path95) - 1))) &  (currentPath'=(95 * min(1, node20path95) - currentPath*(min(1,node20path95) - 1))) & (success'=min(1, node20path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path96 * min(1,node20path96) - currentNode*(min(1, node20path96) - 1))) &  (currentPath'=(96 * min(1, node20path96) - currentPath*(min(1,node20path96) - 1))) & (success'=min(1, node20path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path97 * min(1,node20path97) - currentNode*(min(1, node20path97) - 1))) &  (currentPath'=(97 * min(1, node20path97) - currentPath*(min(1,node20path97) - 1))) & (success'=min(1, node20path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path98 * min(1,node20path98) - currentNode*(min(1, node20path98) - 1))) &  (currentPath'=(98 * min(1, node20path98) - currentPath*(min(1,node20path98) - 1))) & (success'=min(1, node20path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path99 * min(1,node20path99) - currentNode*(min(1, node20path99) - 1))) &  (currentPath'=(99 * min(1, node20path99) - currentPath*(min(1,node20path99) - 1))) & (success'=min(1, node20path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node20path100 * min(1,node20path100) - currentNode*(min(1, node20path100) - 1))) &  (currentPath'=(100 * min(1, node20path100) - currentPath*(min(1,node20path100) - 1))) & (success'=min(1, node20path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 21) ->
 numPathsInv: (currentNode'=(node21path1 * min(1,node21path1) - currentNode*(min(1, node21path1) - 1))) &  (currentPath'=(1 * min(1, node21path1) - currentPath*(min(1,node21path1) - 1))) & (success'=min(1, node21path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path2 * min(1,node21path2) - currentNode*(min(1, node21path2) - 1))) &  (currentPath'=(2 * min(1, node21path2) - currentPath*(min(1,node21path2) - 1))) & (success'=min(1, node21path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path3 * min(1,node21path3) - currentNode*(min(1, node21path3) - 1))) &  (currentPath'=(3 * min(1, node21path3) - currentPath*(min(1,node21path3) - 1))) & (success'=min(1, node21path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path4 * min(1,node21path4) - currentNode*(min(1, node21path4) - 1))) &  (currentPath'=(4 * min(1, node21path4) - currentPath*(min(1,node21path4) - 1))) & (success'=min(1, node21path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path5 * min(1,node21path5) - currentNode*(min(1, node21path5) - 1))) &  (currentPath'=(5 * min(1, node21path5) - currentPath*(min(1,node21path5) - 1))) & (success'=min(1, node21path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path6 * min(1,node21path6) - currentNode*(min(1, node21path6) - 1))) &  (currentPath'=(6 * min(1, node21path6) - currentPath*(min(1,node21path6) - 1))) & (success'=min(1, node21path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path7 * min(1,node21path7) - currentNode*(min(1, node21path7) - 1))) &  (currentPath'=(7 * min(1, node21path7) - currentPath*(min(1,node21path7) - 1))) & (success'=min(1, node21path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path8 * min(1,node21path8) - currentNode*(min(1, node21path8) - 1))) &  (currentPath'=(8 * min(1, node21path8) - currentPath*(min(1,node21path8) - 1))) & (success'=min(1, node21path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path9 * min(1,node21path9) - currentNode*(min(1, node21path9) - 1))) &  (currentPath'=(9 * min(1, node21path9) - currentPath*(min(1,node21path9) - 1))) & (success'=min(1, node21path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path10 * min(1,node21path10) - currentNode*(min(1, node21path10) - 1))) &  (currentPath'=(10 * min(1, node21path10) - currentPath*(min(1,node21path10) - 1))) & (success'=min(1, node21path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path11 * min(1,node21path11) - currentNode*(min(1, node21path11) - 1))) &  (currentPath'=(11 * min(1, node21path11) - currentPath*(min(1,node21path11) - 1))) & (success'=min(1, node21path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path12 * min(1,node21path12) - currentNode*(min(1, node21path12) - 1))) &  (currentPath'=(12 * min(1, node21path12) - currentPath*(min(1,node21path12) - 1))) & (success'=min(1, node21path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path13 * min(1,node21path13) - currentNode*(min(1, node21path13) - 1))) &  (currentPath'=(13 * min(1, node21path13) - currentPath*(min(1,node21path13) - 1))) & (success'=min(1, node21path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path14 * min(1,node21path14) - currentNode*(min(1, node21path14) - 1))) &  (currentPath'=(14 * min(1, node21path14) - currentPath*(min(1,node21path14) - 1))) & (success'=min(1, node21path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path15 * min(1,node21path15) - currentNode*(min(1, node21path15) - 1))) &  (currentPath'=(15 * min(1, node21path15) - currentPath*(min(1,node21path15) - 1))) & (success'=min(1, node21path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path16 * min(1,node21path16) - currentNode*(min(1, node21path16) - 1))) &  (currentPath'=(16 * min(1, node21path16) - currentPath*(min(1,node21path16) - 1))) & (success'=min(1, node21path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path17 * min(1,node21path17) - currentNode*(min(1, node21path17) - 1))) &  (currentPath'=(17 * min(1, node21path17) - currentPath*(min(1,node21path17) - 1))) & (success'=min(1, node21path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path18 * min(1,node21path18) - currentNode*(min(1, node21path18) - 1))) &  (currentPath'=(18 * min(1, node21path18) - currentPath*(min(1,node21path18) - 1))) & (success'=min(1, node21path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path19 * min(1,node21path19) - currentNode*(min(1, node21path19) - 1))) &  (currentPath'=(19 * min(1, node21path19) - currentPath*(min(1,node21path19) - 1))) & (success'=min(1, node21path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path20 * min(1,node21path20) - currentNode*(min(1, node21path20) - 1))) &  (currentPath'=(20 * min(1, node21path20) - currentPath*(min(1,node21path20) - 1))) & (success'=min(1, node21path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path21 * min(1,node21path21) - currentNode*(min(1, node21path21) - 1))) &  (currentPath'=(21 * min(1, node21path21) - currentPath*(min(1,node21path21) - 1))) & (success'=min(1, node21path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path22 * min(1,node21path22) - currentNode*(min(1, node21path22) - 1))) &  (currentPath'=(22 * min(1, node21path22) - currentPath*(min(1,node21path22) - 1))) & (success'=min(1, node21path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path23 * min(1,node21path23) - currentNode*(min(1, node21path23) - 1))) &  (currentPath'=(23 * min(1, node21path23) - currentPath*(min(1,node21path23) - 1))) & (success'=min(1, node21path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path24 * min(1,node21path24) - currentNode*(min(1, node21path24) - 1))) &  (currentPath'=(24 * min(1, node21path24) - currentPath*(min(1,node21path24) - 1))) & (success'=min(1, node21path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path25 * min(1,node21path25) - currentNode*(min(1, node21path25) - 1))) &  (currentPath'=(25 * min(1, node21path25) - currentPath*(min(1,node21path25) - 1))) & (success'=min(1, node21path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path26 * min(1,node21path26) - currentNode*(min(1, node21path26) - 1))) &  (currentPath'=(26 * min(1, node21path26) - currentPath*(min(1,node21path26) - 1))) & (success'=min(1, node21path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path27 * min(1,node21path27) - currentNode*(min(1, node21path27) - 1))) &  (currentPath'=(27 * min(1, node21path27) - currentPath*(min(1,node21path27) - 1))) & (success'=min(1, node21path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path28 * min(1,node21path28) - currentNode*(min(1, node21path28) - 1))) &  (currentPath'=(28 * min(1, node21path28) - currentPath*(min(1,node21path28) - 1))) & (success'=min(1, node21path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path29 * min(1,node21path29) - currentNode*(min(1, node21path29) - 1))) &  (currentPath'=(29 * min(1, node21path29) - currentPath*(min(1,node21path29) - 1))) & (success'=min(1, node21path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path30 * min(1,node21path30) - currentNode*(min(1, node21path30) - 1))) &  (currentPath'=(30 * min(1, node21path30) - currentPath*(min(1,node21path30) - 1))) & (success'=min(1, node21path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path31 * min(1,node21path31) - currentNode*(min(1, node21path31) - 1))) &  (currentPath'=(31 * min(1, node21path31) - currentPath*(min(1,node21path31) - 1))) & (success'=min(1, node21path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path32 * min(1,node21path32) - currentNode*(min(1, node21path32) - 1))) &  (currentPath'=(32 * min(1, node21path32) - currentPath*(min(1,node21path32) - 1))) & (success'=min(1, node21path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path33 * min(1,node21path33) - currentNode*(min(1, node21path33) - 1))) &  (currentPath'=(33 * min(1, node21path33) - currentPath*(min(1,node21path33) - 1))) & (success'=min(1, node21path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path34 * min(1,node21path34) - currentNode*(min(1, node21path34) - 1))) &  (currentPath'=(34 * min(1, node21path34) - currentPath*(min(1,node21path34) - 1))) & (success'=min(1, node21path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path35 * min(1,node21path35) - currentNode*(min(1, node21path35) - 1))) &  (currentPath'=(35 * min(1, node21path35) - currentPath*(min(1,node21path35) - 1))) & (success'=min(1, node21path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path36 * min(1,node21path36) - currentNode*(min(1, node21path36) - 1))) &  (currentPath'=(36 * min(1, node21path36) - currentPath*(min(1,node21path36) - 1))) & (success'=min(1, node21path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path37 * min(1,node21path37) - currentNode*(min(1, node21path37) - 1))) &  (currentPath'=(37 * min(1, node21path37) - currentPath*(min(1,node21path37) - 1))) & (success'=min(1, node21path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path38 * min(1,node21path38) - currentNode*(min(1, node21path38) - 1))) &  (currentPath'=(38 * min(1, node21path38) - currentPath*(min(1,node21path38) - 1))) & (success'=min(1, node21path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path39 * min(1,node21path39) - currentNode*(min(1, node21path39) - 1))) &  (currentPath'=(39 * min(1, node21path39) - currentPath*(min(1,node21path39) - 1))) & (success'=min(1, node21path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path40 * min(1,node21path40) - currentNode*(min(1, node21path40) - 1))) &  (currentPath'=(40 * min(1, node21path40) - currentPath*(min(1,node21path40) - 1))) & (success'=min(1, node21path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path41 * min(1,node21path41) - currentNode*(min(1, node21path41) - 1))) &  (currentPath'=(41 * min(1, node21path41) - currentPath*(min(1,node21path41) - 1))) & (success'=min(1, node21path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path42 * min(1,node21path42) - currentNode*(min(1, node21path42) - 1))) &  (currentPath'=(42 * min(1, node21path42) - currentPath*(min(1,node21path42) - 1))) & (success'=min(1, node21path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path43 * min(1,node21path43) - currentNode*(min(1, node21path43) - 1))) &  (currentPath'=(43 * min(1, node21path43) - currentPath*(min(1,node21path43) - 1))) & (success'=min(1, node21path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path44 * min(1,node21path44) - currentNode*(min(1, node21path44) - 1))) &  (currentPath'=(44 * min(1, node21path44) - currentPath*(min(1,node21path44) - 1))) & (success'=min(1, node21path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path45 * min(1,node21path45) - currentNode*(min(1, node21path45) - 1))) &  (currentPath'=(45 * min(1, node21path45) - currentPath*(min(1,node21path45) - 1))) & (success'=min(1, node21path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path46 * min(1,node21path46) - currentNode*(min(1, node21path46) - 1))) &  (currentPath'=(46 * min(1, node21path46) - currentPath*(min(1,node21path46) - 1))) & (success'=min(1, node21path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path47 * min(1,node21path47) - currentNode*(min(1, node21path47) - 1))) &  (currentPath'=(47 * min(1, node21path47) - currentPath*(min(1,node21path47) - 1))) & (success'=min(1, node21path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path48 * min(1,node21path48) - currentNode*(min(1, node21path48) - 1))) &  (currentPath'=(48 * min(1, node21path48) - currentPath*(min(1,node21path48) - 1))) & (success'=min(1, node21path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path49 * min(1,node21path49) - currentNode*(min(1, node21path49) - 1))) &  (currentPath'=(49 * min(1, node21path49) - currentPath*(min(1,node21path49) - 1))) & (success'=min(1, node21path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path50 * min(1,node21path50) - currentNode*(min(1, node21path50) - 1))) &  (currentPath'=(50 * min(1, node21path50) - currentPath*(min(1,node21path50) - 1))) & (success'=min(1, node21path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path51 * min(1,node21path51) - currentNode*(min(1, node21path51) - 1))) &  (currentPath'=(51 * min(1, node21path51) - currentPath*(min(1,node21path51) - 1))) & (success'=min(1, node21path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path52 * min(1,node21path52) - currentNode*(min(1, node21path52) - 1))) &  (currentPath'=(52 * min(1, node21path52) - currentPath*(min(1,node21path52) - 1))) & (success'=min(1, node21path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path53 * min(1,node21path53) - currentNode*(min(1, node21path53) - 1))) &  (currentPath'=(53 * min(1, node21path53) - currentPath*(min(1,node21path53) - 1))) & (success'=min(1, node21path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path54 * min(1,node21path54) - currentNode*(min(1, node21path54) - 1))) &  (currentPath'=(54 * min(1, node21path54) - currentPath*(min(1,node21path54) - 1))) & (success'=min(1, node21path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path55 * min(1,node21path55) - currentNode*(min(1, node21path55) - 1))) &  (currentPath'=(55 * min(1, node21path55) - currentPath*(min(1,node21path55) - 1))) & (success'=min(1, node21path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path56 * min(1,node21path56) - currentNode*(min(1, node21path56) - 1))) &  (currentPath'=(56 * min(1, node21path56) - currentPath*(min(1,node21path56) - 1))) & (success'=min(1, node21path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path57 * min(1,node21path57) - currentNode*(min(1, node21path57) - 1))) &  (currentPath'=(57 * min(1, node21path57) - currentPath*(min(1,node21path57) - 1))) & (success'=min(1, node21path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path58 * min(1,node21path58) - currentNode*(min(1, node21path58) - 1))) &  (currentPath'=(58 * min(1, node21path58) - currentPath*(min(1,node21path58) - 1))) & (success'=min(1, node21path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path59 * min(1,node21path59) - currentNode*(min(1, node21path59) - 1))) &  (currentPath'=(59 * min(1, node21path59) - currentPath*(min(1,node21path59) - 1))) & (success'=min(1, node21path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path60 * min(1,node21path60) - currentNode*(min(1, node21path60) - 1))) &  (currentPath'=(60 * min(1, node21path60) - currentPath*(min(1,node21path60) - 1))) & (success'=min(1, node21path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path61 * min(1,node21path61) - currentNode*(min(1, node21path61) - 1))) &  (currentPath'=(61 * min(1, node21path61) - currentPath*(min(1,node21path61) - 1))) & (success'=min(1, node21path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path62 * min(1,node21path62) - currentNode*(min(1, node21path62) - 1))) &  (currentPath'=(62 * min(1, node21path62) - currentPath*(min(1,node21path62) - 1))) & (success'=min(1, node21path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path63 * min(1,node21path63) - currentNode*(min(1, node21path63) - 1))) &  (currentPath'=(63 * min(1, node21path63) - currentPath*(min(1,node21path63) - 1))) & (success'=min(1, node21path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path64 * min(1,node21path64) - currentNode*(min(1, node21path64) - 1))) &  (currentPath'=(64 * min(1, node21path64) - currentPath*(min(1,node21path64) - 1))) & (success'=min(1, node21path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path65 * min(1,node21path65) - currentNode*(min(1, node21path65) - 1))) &  (currentPath'=(65 * min(1, node21path65) - currentPath*(min(1,node21path65) - 1))) & (success'=min(1, node21path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path66 * min(1,node21path66) - currentNode*(min(1, node21path66) - 1))) &  (currentPath'=(66 * min(1, node21path66) - currentPath*(min(1,node21path66) - 1))) & (success'=min(1, node21path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path67 * min(1,node21path67) - currentNode*(min(1, node21path67) - 1))) &  (currentPath'=(67 * min(1, node21path67) - currentPath*(min(1,node21path67) - 1))) & (success'=min(1, node21path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path68 * min(1,node21path68) - currentNode*(min(1, node21path68) - 1))) &  (currentPath'=(68 * min(1, node21path68) - currentPath*(min(1,node21path68) - 1))) & (success'=min(1, node21path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path69 * min(1,node21path69) - currentNode*(min(1, node21path69) - 1))) &  (currentPath'=(69 * min(1, node21path69) - currentPath*(min(1,node21path69) - 1))) & (success'=min(1, node21path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path70 * min(1,node21path70) - currentNode*(min(1, node21path70) - 1))) &  (currentPath'=(70 * min(1, node21path70) - currentPath*(min(1,node21path70) - 1))) & (success'=min(1, node21path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path71 * min(1,node21path71) - currentNode*(min(1, node21path71) - 1))) &  (currentPath'=(71 * min(1, node21path71) - currentPath*(min(1,node21path71) - 1))) & (success'=min(1, node21path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path72 * min(1,node21path72) - currentNode*(min(1, node21path72) - 1))) &  (currentPath'=(72 * min(1, node21path72) - currentPath*(min(1,node21path72) - 1))) & (success'=min(1, node21path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path73 * min(1,node21path73) - currentNode*(min(1, node21path73) - 1))) &  (currentPath'=(73 * min(1, node21path73) - currentPath*(min(1,node21path73) - 1))) & (success'=min(1, node21path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path74 * min(1,node21path74) - currentNode*(min(1, node21path74) - 1))) &  (currentPath'=(74 * min(1, node21path74) - currentPath*(min(1,node21path74) - 1))) & (success'=min(1, node21path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path75 * min(1,node21path75) - currentNode*(min(1, node21path75) - 1))) &  (currentPath'=(75 * min(1, node21path75) - currentPath*(min(1,node21path75) - 1))) & (success'=min(1, node21path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path76 * min(1,node21path76) - currentNode*(min(1, node21path76) - 1))) &  (currentPath'=(76 * min(1, node21path76) - currentPath*(min(1,node21path76) - 1))) & (success'=min(1, node21path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path77 * min(1,node21path77) - currentNode*(min(1, node21path77) - 1))) &  (currentPath'=(77 * min(1, node21path77) - currentPath*(min(1,node21path77) - 1))) & (success'=min(1, node21path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path78 * min(1,node21path78) - currentNode*(min(1, node21path78) - 1))) &  (currentPath'=(78 * min(1, node21path78) - currentPath*(min(1,node21path78) - 1))) & (success'=min(1, node21path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path79 * min(1,node21path79) - currentNode*(min(1, node21path79) - 1))) &  (currentPath'=(79 * min(1, node21path79) - currentPath*(min(1,node21path79) - 1))) & (success'=min(1, node21path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path80 * min(1,node21path80) - currentNode*(min(1, node21path80) - 1))) &  (currentPath'=(80 * min(1, node21path80) - currentPath*(min(1,node21path80) - 1))) & (success'=min(1, node21path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path81 * min(1,node21path81) - currentNode*(min(1, node21path81) - 1))) &  (currentPath'=(81 * min(1, node21path81) - currentPath*(min(1,node21path81) - 1))) & (success'=min(1, node21path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path82 * min(1,node21path82) - currentNode*(min(1, node21path82) - 1))) &  (currentPath'=(82 * min(1, node21path82) - currentPath*(min(1,node21path82) - 1))) & (success'=min(1, node21path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path83 * min(1,node21path83) - currentNode*(min(1, node21path83) - 1))) &  (currentPath'=(83 * min(1, node21path83) - currentPath*(min(1,node21path83) - 1))) & (success'=min(1, node21path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path84 * min(1,node21path84) - currentNode*(min(1, node21path84) - 1))) &  (currentPath'=(84 * min(1, node21path84) - currentPath*(min(1,node21path84) - 1))) & (success'=min(1, node21path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path85 * min(1,node21path85) - currentNode*(min(1, node21path85) - 1))) &  (currentPath'=(85 * min(1, node21path85) - currentPath*(min(1,node21path85) - 1))) & (success'=min(1, node21path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path86 * min(1,node21path86) - currentNode*(min(1, node21path86) - 1))) &  (currentPath'=(86 * min(1, node21path86) - currentPath*(min(1,node21path86) - 1))) & (success'=min(1, node21path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path87 * min(1,node21path87) - currentNode*(min(1, node21path87) - 1))) &  (currentPath'=(87 * min(1, node21path87) - currentPath*(min(1,node21path87) - 1))) & (success'=min(1, node21path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path88 * min(1,node21path88) - currentNode*(min(1, node21path88) - 1))) &  (currentPath'=(88 * min(1, node21path88) - currentPath*(min(1,node21path88) - 1))) & (success'=min(1, node21path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path89 * min(1,node21path89) - currentNode*(min(1, node21path89) - 1))) &  (currentPath'=(89 * min(1, node21path89) - currentPath*(min(1,node21path89) - 1))) & (success'=min(1, node21path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path90 * min(1,node21path90) - currentNode*(min(1, node21path90) - 1))) &  (currentPath'=(90 * min(1, node21path90) - currentPath*(min(1,node21path90) - 1))) & (success'=min(1, node21path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path91 * min(1,node21path91) - currentNode*(min(1, node21path91) - 1))) &  (currentPath'=(91 * min(1, node21path91) - currentPath*(min(1,node21path91) - 1))) & (success'=min(1, node21path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path92 * min(1,node21path92) - currentNode*(min(1, node21path92) - 1))) &  (currentPath'=(92 * min(1, node21path92) - currentPath*(min(1,node21path92) - 1))) & (success'=min(1, node21path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path93 * min(1,node21path93) - currentNode*(min(1, node21path93) - 1))) &  (currentPath'=(93 * min(1, node21path93) - currentPath*(min(1,node21path93) - 1))) & (success'=min(1, node21path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path94 * min(1,node21path94) - currentNode*(min(1, node21path94) - 1))) &  (currentPath'=(94 * min(1, node21path94) - currentPath*(min(1,node21path94) - 1))) & (success'=min(1, node21path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path95 * min(1,node21path95) - currentNode*(min(1, node21path95) - 1))) &  (currentPath'=(95 * min(1, node21path95) - currentPath*(min(1,node21path95) - 1))) & (success'=min(1, node21path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path96 * min(1,node21path96) - currentNode*(min(1, node21path96) - 1))) &  (currentPath'=(96 * min(1, node21path96) - currentPath*(min(1,node21path96) - 1))) & (success'=min(1, node21path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path97 * min(1,node21path97) - currentNode*(min(1, node21path97) - 1))) &  (currentPath'=(97 * min(1, node21path97) - currentPath*(min(1,node21path97) - 1))) & (success'=min(1, node21path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path98 * min(1,node21path98) - currentNode*(min(1, node21path98) - 1))) &  (currentPath'=(98 * min(1, node21path98) - currentPath*(min(1,node21path98) - 1))) & (success'=min(1, node21path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path99 * min(1,node21path99) - currentNode*(min(1, node21path99) - 1))) &  (currentPath'=(99 * min(1, node21path99) - currentPath*(min(1,node21path99) - 1))) & (success'=min(1, node21path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node21path100 * min(1,node21path100) - currentNode*(min(1, node21path100) - 1))) &  (currentPath'=(100 * min(1, node21path100) - currentPath*(min(1,node21path100) - 1))) & (success'=min(1, node21path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 22) ->
 numPathsInv: (currentNode'=(node22path1 * min(1,node22path1) - currentNode*(min(1, node22path1) - 1))) &  (currentPath'=(1 * min(1, node22path1) - currentPath*(min(1,node22path1) - 1))) & (success'=min(1, node22path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path2 * min(1,node22path2) - currentNode*(min(1, node22path2) - 1))) &  (currentPath'=(2 * min(1, node22path2) - currentPath*(min(1,node22path2) - 1))) & (success'=min(1, node22path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path3 * min(1,node22path3) - currentNode*(min(1, node22path3) - 1))) &  (currentPath'=(3 * min(1, node22path3) - currentPath*(min(1,node22path3) - 1))) & (success'=min(1, node22path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path4 * min(1,node22path4) - currentNode*(min(1, node22path4) - 1))) &  (currentPath'=(4 * min(1, node22path4) - currentPath*(min(1,node22path4) - 1))) & (success'=min(1, node22path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path5 * min(1,node22path5) - currentNode*(min(1, node22path5) - 1))) &  (currentPath'=(5 * min(1, node22path5) - currentPath*(min(1,node22path5) - 1))) & (success'=min(1, node22path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path6 * min(1,node22path6) - currentNode*(min(1, node22path6) - 1))) &  (currentPath'=(6 * min(1, node22path6) - currentPath*(min(1,node22path6) - 1))) & (success'=min(1, node22path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path7 * min(1,node22path7) - currentNode*(min(1, node22path7) - 1))) &  (currentPath'=(7 * min(1, node22path7) - currentPath*(min(1,node22path7) - 1))) & (success'=min(1, node22path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path8 * min(1,node22path8) - currentNode*(min(1, node22path8) - 1))) &  (currentPath'=(8 * min(1, node22path8) - currentPath*(min(1,node22path8) - 1))) & (success'=min(1, node22path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path9 * min(1,node22path9) - currentNode*(min(1, node22path9) - 1))) &  (currentPath'=(9 * min(1, node22path9) - currentPath*(min(1,node22path9) - 1))) & (success'=min(1, node22path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path10 * min(1,node22path10) - currentNode*(min(1, node22path10) - 1))) &  (currentPath'=(10 * min(1, node22path10) - currentPath*(min(1,node22path10) - 1))) & (success'=min(1, node22path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path11 * min(1,node22path11) - currentNode*(min(1, node22path11) - 1))) &  (currentPath'=(11 * min(1, node22path11) - currentPath*(min(1,node22path11) - 1))) & (success'=min(1, node22path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path12 * min(1,node22path12) - currentNode*(min(1, node22path12) - 1))) &  (currentPath'=(12 * min(1, node22path12) - currentPath*(min(1,node22path12) - 1))) & (success'=min(1, node22path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path13 * min(1,node22path13) - currentNode*(min(1, node22path13) - 1))) &  (currentPath'=(13 * min(1, node22path13) - currentPath*(min(1,node22path13) - 1))) & (success'=min(1, node22path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path14 * min(1,node22path14) - currentNode*(min(1, node22path14) - 1))) &  (currentPath'=(14 * min(1, node22path14) - currentPath*(min(1,node22path14) - 1))) & (success'=min(1, node22path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path15 * min(1,node22path15) - currentNode*(min(1, node22path15) - 1))) &  (currentPath'=(15 * min(1, node22path15) - currentPath*(min(1,node22path15) - 1))) & (success'=min(1, node22path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path16 * min(1,node22path16) - currentNode*(min(1, node22path16) - 1))) &  (currentPath'=(16 * min(1, node22path16) - currentPath*(min(1,node22path16) - 1))) & (success'=min(1, node22path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path17 * min(1,node22path17) - currentNode*(min(1, node22path17) - 1))) &  (currentPath'=(17 * min(1, node22path17) - currentPath*(min(1,node22path17) - 1))) & (success'=min(1, node22path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path18 * min(1,node22path18) - currentNode*(min(1, node22path18) - 1))) &  (currentPath'=(18 * min(1, node22path18) - currentPath*(min(1,node22path18) - 1))) & (success'=min(1, node22path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path19 * min(1,node22path19) - currentNode*(min(1, node22path19) - 1))) &  (currentPath'=(19 * min(1, node22path19) - currentPath*(min(1,node22path19) - 1))) & (success'=min(1, node22path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path20 * min(1,node22path20) - currentNode*(min(1, node22path20) - 1))) &  (currentPath'=(20 * min(1, node22path20) - currentPath*(min(1,node22path20) - 1))) & (success'=min(1, node22path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path21 * min(1,node22path21) - currentNode*(min(1, node22path21) - 1))) &  (currentPath'=(21 * min(1, node22path21) - currentPath*(min(1,node22path21) - 1))) & (success'=min(1, node22path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path22 * min(1,node22path22) - currentNode*(min(1, node22path22) - 1))) &  (currentPath'=(22 * min(1, node22path22) - currentPath*(min(1,node22path22) - 1))) & (success'=min(1, node22path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path23 * min(1,node22path23) - currentNode*(min(1, node22path23) - 1))) &  (currentPath'=(23 * min(1, node22path23) - currentPath*(min(1,node22path23) - 1))) & (success'=min(1, node22path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path24 * min(1,node22path24) - currentNode*(min(1, node22path24) - 1))) &  (currentPath'=(24 * min(1, node22path24) - currentPath*(min(1,node22path24) - 1))) & (success'=min(1, node22path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path25 * min(1,node22path25) - currentNode*(min(1, node22path25) - 1))) &  (currentPath'=(25 * min(1, node22path25) - currentPath*(min(1,node22path25) - 1))) & (success'=min(1, node22path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path26 * min(1,node22path26) - currentNode*(min(1, node22path26) - 1))) &  (currentPath'=(26 * min(1, node22path26) - currentPath*(min(1,node22path26) - 1))) & (success'=min(1, node22path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path27 * min(1,node22path27) - currentNode*(min(1, node22path27) - 1))) &  (currentPath'=(27 * min(1, node22path27) - currentPath*(min(1,node22path27) - 1))) & (success'=min(1, node22path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path28 * min(1,node22path28) - currentNode*(min(1, node22path28) - 1))) &  (currentPath'=(28 * min(1, node22path28) - currentPath*(min(1,node22path28) - 1))) & (success'=min(1, node22path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path29 * min(1,node22path29) - currentNode*(min(1, node22path29) - 1))) &  (currentPath'=(29 * min(1, node22path29) - currentPath*(min(1,node22path29) - 1))) & (success'=min(1, node22path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path30 * min(1,node22path30) - currentNode*(min(1, node22path30) - 1))) &  (currentPath'=(30 * min(1, node22path30) - currentPath*(min(1,node22path30) - 1))) & (success'=min(1, node22path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path31 * min(1,node22path31) - currentNode*(min(1, node22path31) - 1))) &  (currentPath'=(31 * min(1, node22path31) - currentPath*(min(1,node22path31) - 1))) & (success'=min(1, node22path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path32 * min(1,node22path32) - currentNode*(min(1, node22path32) - 1))) &  (currentPath'=(32 * min(1, node22path32) - currentPath*(min(1,node22path32) - 1))) & (success'=min(1, node22path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path33 * min(1,node22path33) - currentNode*(min(1, node22path33) - 1))) &  (currentPath'=(33 * min(1, node22path33) - currentPath*(min(1,node22path33) - 1))) & (success'=min(1, node22path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path34 * min(1,node22path34) - currentNode*(min(1, node22path34) - 1))) &  (currentPath'=(34 * min(1, node22path34) - currentPath*(min(1,node22path34) - 1))) & (success'=min(1, node22path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path35 * min(1,node22path35) - currentNode*(min(1, node22path35) - 1))) &  (currentPath'=(35 * min(1, node22path35) - currentPath*(min(1,node22path35) - 1))) & (success'=min(1, node22path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path36 * min(1,node22path36) - currentNode*(min(1, node22path36) - 1))) &  (currentPath'=(36 * min(1, node22path36) - currentPath*(min(1,node22path36) - 1))) & (success'=min(1, node22path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path37 * min(1,node22path37) - currentNode*(min(1, node22path37) - 1))) &  (currentPath'=(37 * min(1, node22path37) - currentPath*(min(1,node22path37) - 1))) & (success'=min(1, node22path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path38 * min(1,node22path38) - currentNode*(min(1, node22path38) - 1))) &  (currentPath'=(38 * min(1, node22path38) - currentPath*(min(1,node22path38) - 1))) & (success'=min(1, node22path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path39 * min(1,node22path39) - currentNode*(min(1, node22path39) - 1))) &  (currentPath'=(39 * min(1, node22path39) - currentPath*(min(1,node22path39) - 1))) & (success'=min(1, node22path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path40 * min(1,node22path40) - currentNode*(min(1, node22path40) - 1))) &  (currentPath'=(40 * min(1, node22path40) - currentPath*(min(1,node22path40) - 1))) & (success'=min(1, node22path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path41 * min(1,node22path41) - currentNode*(min(1, node22path41) - 1))) &  (currentPath'=(41 * min(1, node22path41) - currentPath*(min(1,node22path41) - 1))) & (success'=min(1, node22path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path42 * min(1,node22path42) - currentNode*(min(1, node22path42) - 1))) &  (currentPath'=(42 * min(1, node22path42) - currentPath*(min(1,node22path42) - 1))) & (success'=min(1, node22path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path43 * min(1,node22path43) - currentNode*(min(1, node22path43) - 1))) &  (currentPath'=(43 * min(1, node22path43) - currentPath*(min(1,node22path43) - 1))) & (success'=min(1, node22path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path44 * min(1,node22path44) - currentNode*(min(1, node22path44) - 1))) &  (currentPath'=(44 * min(1, node22path44) - currentPath*(min(1,node22path44) - 1))) & (success'=min(1, node22path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path45 * min(1,node22path45) - currentNode*(min(1, node22path45) - 1))) &  (currentPath'=(45 * min(1, node22path45) - currentPath*(min(1,node22path45) - 1))) & (success'=min(1, node22path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path46 * min(1,node22path46) - currentNode*(min(1, node22path46) - 1))) &  (currentPath'=(46 * min(1, node22path46) - currentPath*(min(1,node22path46) - 1))) & (success'=min(1, node22path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path47 * min(1,node22path47) - currentNode*(min(1, node22path47) - 1))) &  (currentPath'=(47 * min(1, node22path47) - currentPath*(min(1,node22path47) - 1))) & (success'=min(1, node22path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path48 * min(1,node22path48) - currentNode*(min(1, node22path48) - 1))) &  (currentPath'=(48 * min(1, node22path48) - currentPath*(min(1,node22path48) - 1))) & (success'=min(1, node22path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path49 * min(1,node22path49) - currentNode*(min(1, node22path49) - 1))) &  (currentPath'=(49 * min(1, node22path49) - currentPath*(min(1,node22path49) - 1))) & (success'=min(1, node22path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path50 * min(1,node22path50) - currentNode*(min(1, node22path50) - 1))) &  (currentPath'=(50 * min(1, node22path50) - currentPath*(min(1,node22path50) - 1))) & (success'=min(1, node22path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path51 * min(1,node22path51) - currentNode*(min(1, node22path51) - 1))) &  (currentPath'=(51 * min(1, node22path51) - currentPath*(min(1,node22path51) - 1))) & (success'=min(1, node22path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path52 * min(1,node22path52) - currentNode*(min(1, node22path52) - 1))) &  (currentPath'=(52 * min(1, node22path52) - currentPath*(min(1,node22path52) - 1))) & (success'=min(1, node22path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path53 * min(1,node22path53) - currentNode*(min(1, node22path53) - 1))) &  (currentPath'=(53 * min(1, node22path53) - currentPath*(min(1,node22path53) - 1))) & (success'=min(1, node22path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path54 * min(1,node22path54) - currentNode*(min(1, node22path54) - 1))) &  (currentPath'=(54 * min(1, node22path54) - currentPath*(min(1,node22path54) - 1))) & (success'=min(1, node22path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path55 * min(1,node22path55) - currentNode*(min(1, node22path55) - 1))) &  (currentPath'=(55 * min(1, node22path55) - currentPath*(min(1,node22path55) - 1))) & (success'=min(1, node22path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path56 * min(1,node22path56) - currentNode*(min(1, node22path56) - 1))) &  (currentPath'=(56 * min(1, node22path56) - currentPath*(min(1,node22path56) - 1))) & (success'=min(1, node22path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path57 * min(1,node22path57) - currentNode*(min(1, node22path57) - 1))) &  (currentPath'=(57 * min(1, node22path57) - currentPath*(min(1,node22path57) - 1))) & (success'=min(1, node22path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path58 * min(1,node22path58) - currentNode*(min(1, node22path58) - 1))) &  (currentPath'=(58 * min(1, node22path58) - currentPath*(min(1,node22path58) - 1))) & (success'=min(1, node22path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path59 * min(1,node22path59) - currentNode*(min(1, node22path59) - 1))) &  (currentPath'=(59 * min(1, node22path59) - currentPath*(min(1,node22path59) - 1))) & (success'=min(1, node22path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path60 * min(1,node22path60) - currentNode*(min(1, node22path60) - 1))) &  (currentPath'=(60 * min(1, node22path60) - currentPath*(min(1,node22path60) - 1))) & (success'=min(1, node22path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path61 * min(1,node22path61) - currentNode*(min(1, node22path61) - 1))) &  (currentPath'=(61 * min(1, node22path61) - currentPath*(min(1,node22path61) - 1))) & (success'=min(1, node22path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path62 * min(1,node22path62) - currentNode*(min(1, node22path62) - 1))) &  (currentPath'=(62 * min(1, node22path62) - currentPath*(min(1,node22path62) - 1))) & (success'=min(1, node22path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path63 * min(1,node22path63) - currentNode*(min(1, node22path63) - 1))) &  (currentPath'=(63 * min(1, node22path63) - currentPath*(min(1,node22path63) - 1))) & (success'=min(1, node22path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path64 * min(1,node22path64) - currentNode*(min(1, node22path64) - 1))) &  (currentPath'=(64 * min(1, node22path64) - currentPath*(min(1,node22path64) - 1))) & (success'=min(1, node22path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path65 * min(1,node22path65) - currentNode*(min(1, node22path65) - 1))) &  (currentPath'=(65 * min(1, node22path65) - currentPath*(min(1,node22path65) - 1))) & (success'=min(1, node22path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path66 * min(1,node22path66) - currentNode*(min(1, node22path66) - 1))) &  (currentPath'=(66 * min(1, node22path66) - currentPath*(min(1,node22path66) - 1))) & (success'=min(1, node22path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path67 * min(1,node22path67) - currentNode*(min(1, node22path67) - 1))) &  (currentPath'=(67 * min(1, node22path67) - currentPath*(min(1,node22path67) - 1))) & (success'=min(1, node22path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path68 * min(1,node22path68) - currentNode*(min(1, node22path68) - 1))) &  (currentPath'=(68 * min(1, node22path68) - currentPath*(min(1,node22path68) - 1))) & (success'=min(1, node22path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path69 * min(1,node22path69) - currentNode*(min(1, node22path69) - 1))) &  (currentPath'=(69 * min(1, node22path69) - currentPath*(min(1,node22path69) - 1))) & (success'=min(1, node22path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path70 * min(1,node22path70) - currentNode*(min(1, node22path70) - 1))) &  (currentPath'=(70 * min(1, node22path70) - currentPath*(min(1,node22path70) - 1))) & (success'=min(1, node22path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path71 * min(1,node22path71) - currentNode*(min(1, node22path71) - 1))) &  (currentPath'=(71 * min(1, node22path71) - currentPath*(min(1,node22path71) - 1))) & (success'=min(1, node22path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path72 * min(1,node22path72) - currentNode*(min(1, node22path72) - 1))) &  (currentPath'=(72 * min(1, node22path72) - currentPath*(min(1,node22path72) - 1))) & (success'=min(1, node22path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path73 * min(1,node22path73) - currentNode*(min(1, node22path73) - 1))) &  (currentPath'=(73 * min(1, node22path73) - currentPath*(min(1,node22path73) - 1))) & (success'=min(1, node22path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path74 * min(1,node22path74) - currentNode*(min(1, node22path74) - 1))) &  (currentPath'=(74 * min(1, node22path74) - currentPath*(min(1,node22path74) - 1))) & (success'=min(1, node22path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path75 * min(1,node22path75) - currentNode*(min(1, node22path75) - 1))) &  (currentPath'=(75 * min(1, node22path75) - currentPath*(min(1,node22path75) - 1))) & (success'=min(1, node22path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path76 * min(1,node22path76) - currentNode*(min(1, node22path76) - 1))) &  (currentPath'=(76 * min(1, node22path76) - currentPath*(min(1,node22path76) - 1))) & (success'=min(1, node22path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path77 * min(1,node22path77) - currentNode*(min(1, node22path77) - 1))) &  (currentPath'=(77 * min(1, node22path77) - currentPath*(min(1,node22path77) - 1))) & (success'=min(1, node22path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path78 * min(1,node22path78) - currentNode*(min(1, node22path78) - 1))) &  (currentPath'=(78 * min(1, node22path78) - currentPath*(min(1,node22path78) - 1))) & (success'=min(1, node22path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path79 * min(1,node22path79) - currentNode*(min(1, node22path79) - 1))) &  (currentPath'=(79 * min(1, node22path79) - currentPath*(min(1,node22path79) - 1))) & (success'=min(1, node22path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path80 * min(1,node22path80) - currentNode*(min(1, node22path80) - 1))) &  (currentPath'=(80 * min(1, node22path80) - currentPath*(min(1,node22path80) - 1))) & (success'=min(1, node22path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path81 * min(1,node22path81) - currentNode*(min(1, node22path81) - 1))) &  (currentPath'=(81 * min(1, node22path81) - currentPath*(min(1,node22path81) - 1))) & (success'=min(1, node22path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path82 * min(1,node22path82) - currentNode*(min(1, node22path82) - 1))) &  (currentPath'=(82 * min(1, node22path82) - currentPath*(min(1,node22path82) - 1))) & (success'=min(1, node22path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path83 * min(1,node22path83) - currentNode*(min(1, node22path83) - 1))) &  (currentPath'=(83 * min(1, node22path83) - currentPath*(min(1,node22path83) - 1))) & (success'=min(1, node22path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path84 * min(1,node22path84) - currentNode*(min(1, node22path84) - 1))) &  (currentPath'=(84 * min(1, node22path84) - currentPath*(min(1,node22path84) - 1))) & (success'=min(1, node22path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path85 * min(1,node22path85) - currentNode*(min(1, node22path85) - 1))) &  (currentPath'=(85 * min(1, node22path85) - currentPath*(min(1,node22path85) - 1))) & (success'=min(1, node22path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path86 * min(1,node22path86) - currentNode*(min(1, node22path86) - 1))) &  (currentPath'=(86 * min(1, node22path86) - currentPath*(min(1,node22path86) - 1))) & (success'=min(1, node22path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path87 * min(1,node22path87) - currentNode*(min(1, node22path87) - 1))) &  (currentPath'=(87 * min(1, node22path87) - currentPath*(min(1,node22path87) - 1))) & (success'=min(1, node22path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path88 * min(1,node22path88) - currentNode*(min(1, node22path88) - 1))) &  (currentPath'=(88 * min(1, node22path88) - currentPath*(min(1,node22path88) - 1))) & (success'=min(1, node22path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path89 * min(1,node22path89) - currentNode*(min(1, node22path89) - 1))) &  (currentPath'=(89 * min(1, node22path89) - currentPath*(min(1,node22path89) - 1))) & (success'=min(1, node22path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path90 * min(1,node22path90) - currentNode*(min(1, node22path90) - 1))) &  (currentPath'=(90 * min(1, node22path90) - currentPath*(min(1,node22path90) - 1))) & (success'=min(1, node22path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path91 * min(1,node22path91) - currentNode*(min(1, node22path91) - 1))) &  (currentPath'=(91 * min(1, node22path91) - currentPath*(min(1,node22path91) - 1))) & (success'=min(1, node22path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path92 * min(1,node22path92) - currentNode*(min(1, node22path92) - 1))) &  (currentPath'=(92 * min(1, node22path92) - currentPath*(min(1,node22path92) - 1))) & (success'=min(1, node22path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path93 * min(1,node22path93) - currentNode*(min(1, node22path93) - 1))) &  (currentPath'=(93 * min(1, node22path93) - currentPath*(min(1,node22path93) - 1))) & (success'=min(1, node22path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path94 * min(1,node22path94) - currentNode*(min(1, node22path94) - 1))) &  (currentPath'=(94 * min(1, node22path94) - currentPath*(min(1,node22path94) - 1))) & (success'=min(1, node22path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path95 * min(1,node22path95) - currentNode*(min(1, node22path95) - 1))) &  (currentPath'=(95 * min(1, node22path95) - currentPath*(min(1,node22path95) - 1))) & (success'=min(1, node22path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path96 * min(1,node22path96) - currentNode*(min(1, node22path96) - 1))) &  (currentPath'=(96 * min(1, node22path96) - currentPath*(min(1,node22path96) - 1))) & (success'=min(1, node22path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path97 * min(1,node22path97) - currentNode*(min(1, node22path97) - 1))) &  (currentPath'=(97 * min(1, node22path97) - currentPath*(min(1,node22path97) - 1))) & (success'=min(1, node22path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path98 * min(1,node22path98) - currentNode*(min(1, node22path98) - 1))) &  (currentPath'=(98 * min(1, node22path98) - currentPath*(min(1,node22path98) - 1))) & (success'=min(1, node22path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path99 * min(1,node22path99) - currentNode*(min(1, node22path99) - 1))) &  (currentPath'=(99 * min(1, node22path99) - currentPath*(min(1,node22path99) - 1))) & (success'=min(1, node22path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node22path100 * min(1,node22path100) - currentNode*(min(1, node22path100) - 1))) &  (currentPath'=(100 * min(1, node22path100) - currentPath*(min(1,node22path100) - 1))) & (success'=min(1, node22path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 23) ->
 numPathsInv: (currentNode'=(node23path1 * min(1,node23path1) - currentNode*(min(1, node23path1) - 1))) &  (currentPath'=(1 * min(1, node23path1) - currentPath*(min(1,node23path1) - 1))) & (success'=min(1, node23path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path2 * min(1,node23path2) - currentNode*(min(1, node23path2) - 1))) &  (currentPath'=(2 * min(1, node23path2) - currentPath*(min(1,node23path2) - 1))) & (success'=min(1, node23path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path3 * min(1,node23path3) - currentNode*(min(1, node23path3) - 1))) &  (currentPath'=(3 * min(1, node23path3) - currentPath*(min(1,node23path3) - 1))) & (success'=min(1, node23path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path4 * min(1,node23path4) - currentNode*(min(1, node23path4) - 1))) &  (currentPath'=(4 * min(1, node23path4) - currentPath*(min(1,node23path4) - 1))) & (success'=min(1, node23path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path5 * min(1,node23path5) - currentNode*(min(1, node23path5) - 1))) &  (currentPath'=(5 * min(1, node23path5) - currentPath*(min(1,node23path5) - 1))) & (success'=min(1, node23path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path6 * min(1,node23path6) - currentNode*(min(1, node23path6) - 1))) &  (currentPath'=(6 * min(1, node23path6) - currentPath*(min(1,node23path6) - 1))) & (success'=min(1, node23path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path7 * min(1,node23path7) - currentNode*(min(1, node23path7) - 1))) &  (currentPath'=(7 * min(1, node23path7) - currentPath*(min(1,node23path7) - 1))) & (success'=min(1, node23path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path8 * min(1,node23path8) - currentNode*(min(1, node23path8) - 1))) &  (currentPath'=(8 * min(1, node23path8) - currentPath*(min(1,node23path8) - 1))) & (success'=min(1, node23path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path9 * min(1,node23path9) - currentNode*(min(1, node23path9) - 1))) &  (currentPath'=(9 * min(1, node23path9) - currentPath*(min(1,node23path9) - 1))) & (success'=min(1, node23path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path10 * min(1,node23path10) - currentNode*(min(1, node23path10) - 1))) &  (currentPath'=(10 * min(1, node23path10) - currentPath*(min(1,node23path10) - 1))) & (success'=min(1, node23path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path11 * min(1,node23path11) - currentNode*(min(1, node23path11) - 1))) &  (currentPath'=(11 * min(1, node23path11) - currentPath*(min(1,node23path11) - 1))) & (success'=min(1, node23path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path12 * min(1,node23path12) - currentNode*(min(1, node23path12) - 1))) &  (currentPath'=(12 * min(1, node23path12) - currentPath*(min(1,node23path12) - 1))) & (success'=min(1, node23path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path13 * min(1,node23path13) - currentNode*(min(1, node23path13) - 1))) &  (currentPath'=(13 * min(1, node23path13) - currentPath*(min(1,node23path13) - 1))) & (success'=min(1, node23path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path14 * min(1,node23path14) - currentNode*(min(1, node23path14) - 1))) &  (currentPath'=(14 * min(1, node23path14) - currentPath*(min(1,node23path14) - 1))) & (success'=min(1, node23path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path15 * min(1,node23path15) - currentNode*(min(1, node23path15) - 1))) &  (currentPath'=(15 * min(1, node23path15) - currentPath*(min(1,node23path15) - 1))) & (success'=min(1, node23path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path16 * min(1,node23path16) - currentNode*(min(1, node23path16) - 1))) &  (currentPath'=(16 * min(1, node23path16) - currentPath*(min(1,node23path16) - 1))) & (success'=min(1, node23path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path17 * min(1,node23path17) - currentNode*(min(1, node23path17) - 1))) &  (currentPath'=(17 * min(1, node23path17) - currentPath*(min(1,node23path17) - 1))) & (success'=min(1, node23path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path18 * min(1,node23path18) - currentNode*(min(1, node23path18) - 1))) &  (currentPath'=(18 * min(1, node23path18) - currentPath*(min(1,node23path18) - 1))) & (success'=min(1, node23path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path19 * min(1,node23path19) - currentNode*(min(1, node23path19) - 1))) &  (currentPath'=(19 * min(1, node23path19) - currentPath*(min(1,node23path19) - 1))) & (success'=min(1, node23path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path20 * min(1,node23path20) - currentNode*(min(1, node23path20) - 1))) &  (currentPath'=(20 * min(1, node23path20) - currentPath*(min(1,node23path20) - 1))) & (success'=min(1, node23path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path21 * min(1,node23path21) - currentNode*(min(1, node23path21) - 1))) &  (currentPath'=(21 * min(1, node23path21) - currentPath*(min(1,node23path21) - 1))) & (success'=min(1, node23path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path22 * min(1,node23path22) - currentNode*(min(1, node23path22) - 1))) &  (currentPath'=(22 * min(1, node23path22) - currentPath*(min(1,node23path22) - 1))) & (success'=min(1, node23path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path23 * min(1,node23path23) - currentNode*(min(1, node23path23) - 1))) &  (currentPath'=(23 * min(1, node23path23) - currentPath*(min(1,node23path23) - 1))) & (success'=min(1, node23path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path24 * min(1,node23path24) - currentNode*(min(1, node23path24) - 1))) &  (currentPath'=(24 * min(1, node23path24) - currentPath*(min(1,node23path24) - 1))) & (success'=min(1, node23path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path25 * min(1,node23path25) - currentNode*(min(1, node23path25) - 1))) &  (currentPath'=(25 * min(1, node23path25) - currentPath*(min(1,node23path25) - 1))) & (success'=min(1, node23path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path26 * min(1,node23path26) - currentNode*(min(1, node23path26) - 1))) &  (currentPath'=(26 * min(1, node23path26) - currentPath*(min(1,node23path26) - 1))) & (success'=min(1, node23path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path27 * min(1,node23path27) - currentNode*(min(1, node23path27) - 1))) &  (currentPath'=(27 * min(1, node23path27) - currentPath*(min(1,node23path27) - 1))) & (success'=min(1, node23path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path28 * min(1,node23path28) - currentNode*(min(1, node23path28) - 1))) &  (currentPath'=(28 * min(1, node23path28) - currentPath*(min(1,node23path28) - 1))) & (success'=min(1, node23path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path29 * min(1,node23path29) - currentNode*(min(1, node23path29) - 1))) &  (currentPath'=(29 * min(1, node23path29) - currentPath*(min(1,node23path29) - 1))) & (success'=min(1, node23path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path30 * min(1,node23path30) - currentNode*(min(1, node23path30) - 1))) &  (currentPath'=(30 * min(1, node23path30) - currentPath*(min(1,node23path30) - 1))) & (success'=min(1, node23path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path31 * min(1,node23path31) - currentNode*(min(1, node23path31) - 1))) &  (currentPath'=(31 * min(1, node23path31) - currentPath*(min(1,node23path31) - 1))) & (success'=min(1, node23path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path32 * min(1,node23path32) - currentNode*(min(1, node23path32) - 1))) &  (currentPath'=(32 * min(1, node23path32) - currentPath*(min(1,node23path32) - 1))) & (success'=min(1, node23path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path33 * min(1,node23path33) - currentNode*(min(1, node23path33) - 1))) &  (currentPath'=(33 * min(1, node23path33) - currentPath*(min(1,node23path33) - 1))) & (success'=min(1, node23path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path34 * min(1,node23path34) - currentNode*(min(1, node23path34) - 1))) &  (currentPath'=(34 * min(1, node23path34) - currentPath*(min(1,node23path34) - 1))) & (success'=min(1, node23path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path35 * min(1,node23path35) - currentNode*(min(1, node23path35) - 1))) &  (currentPath'=(35 * min(1, node23path35) - currentPath*(min(1,node23path35) - 1))) & (success'=min(1, node23path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path36 * min(1,node23path36) - currentNode*(min(1, node23path36) - 1))) &  (currentPath'=(36 * min(1, node23path36) - currentPath*(min(1,node23path36) - 1))) & (success'=min(1, node23path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path37 * min(1,node23path37) - currentNode*(min(1, node23path37) - 1))) &  (currentPath'=(37 * min(1, node23path37) - currentPath*(min(1,node23path37) - 1))) & (success'=min(1, node23path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path38 * min(1,node23path38) - currentNode*(min(1, node23path38) - 1))) &  (currentPath'=(38 * min(1, node23path38) - currentPath*(min(1,node23path38) - 1))) & (success'=min(1, node23path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path39 * min(1,node23path39) - currentNode*(min(1, node23path39) - 1))) &  (currentPath'=(39 * min(1, node23path39) - currentPath*(min(1,node23path39) - 1))) & (success'=min(1, node23path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path40 * min(1,node23path40) - currentNode*(min(1, node23path40) - 1))) &  (currentPath'=(40 * min(1, node23path40) - currentPath*(min(1,node23path40) - 1))) & (success'=min(1, node23path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path41 * min(1,node23path41) - currentNode*(min(1, node23path41) - 1))) &  (currentPath'=(41 * min(1, node23path41) - currentPath*(min(1,node23path41) - 1))) & (success'=min(1, node23path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path42 * min(1,node23path42) - currentNode*(min(1, node23path42) - 1))) &  (currentPath'=(42 * min(1, node23path42) - currentPath*(min(1,node23path42) - 1))) & (success'=min(1, node23path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path43 * min(1,node23path43) - currentNode*(min(1, node23path43) - 1))) &  (currentPath'=(43 * min(1, node23path43) - currentPath*(min(1,node23path43) - 1))) & (success'=min(1, node23path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path44 * min(1,node23path44) - currentNode*(min(1, node23path44) - 1))) &  (currentPath'=(44 * min(1, node23path44) - currentPath*(min(1,node23path44) - 1))) & (success'=min(1, node23path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path45 * min(1,node23path45) - currentNode*(min(1, node23path45) - 1))) &  (currentPath'=(45 * min(1, node23path45) - currentPath*(min(1,node23path45) - 1))) & (success'=min(1, node23path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path46 * min(1,node23path46) - currentNode*(min(1, node23path46) - 1))) &  (currentPath'=(46 * min(1, node23path46) - currentPath*(min(1,node23path46) - 1))) & (success'=min(1, node23path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path47 * min(1,node23path47) - currentNode*(min(1, node23path47) - 1))) &  (currentPath'=(47 * min(1, node23path47) - currentPath*(min(1,node23path47) - 1))) & (success'=min(1, node23path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path48 * min(1,node23path48) - currentNode*(min(1, node23path48) - 1))) &  (currentPath'=(48 * min(1, node23path48) - currentPath*(min(1,node23path48) - 1))) & (success'=min(1, node23path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path49 * min(1,node23path49) - currentNode*(min(1, node23path49) - 1))) &  (currentPath'=(49 * min(1, node23path49) - currentPath*(min(1,node23path49) - 1))) & (success'=min(1, node23path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path50 * min(1,node23path50) - currentNode*(min(1, node23path50) - 1))) &  (currentPath'=(50 * min(1, node23path50) - currentPath*(min(1,node23path50) - 1))) & (success'=min(1, node23path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path51 * min(1,node23path51) - currentNode*(min(1, node23path51) - 1))) &  (currentPath'=(51 * min(1, node23path51) - currentPath*(min(1,node23path51) - 1))) & (success'=min(1, node23path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path52 * min(1,node23path52) - currentNode*(min(1, node23path52) - 1))) &  (currentPath'=(52 * min(1, node23path52) - currentPath*(min(1,node23path52) - 1))) & (success'=min(1, node23path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path53 * min(1,node23path53) - currentNode*(min(1, node23path53) - 1))) &  (currentPath'=(53 * min(1, node23path53) - currentPath*(min(1,node23path53) - 1))) & (success'=min(1, node23path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path54 * min(1,node23path54) - currentNode*(min(1, node23path54) - 1))) &  (currentPath'=(54 * min(1, node23path54) - currentPath*(min(1,node23path54) - 1))) & (success'=min(1, node23path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path55 * min(1,node23path55) - currentNode*(min(1, node23path55) - 1))) &  (currentPath'=(55 * min(1, node23path55) - currentPath*(min(1,node23path55) - 1))) & (success'=min(1, node23path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path56 * min(1,node23path56) - currentNode*(min(1, node23path56) - 1))) &  (currentPath'=(56 * min(1, node23path56) - currentPath*(min(1,node23path56) - 1))) & (success'=min(1, node23path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path57 * min(1,node23path57) - currentNode*(min(1, node23path57) - 1))) &  (currentPath'=(57 * min(1, node23path57) - currentPath*(min(1,node23path57) - 1))) & (success'=min(1, node23path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path58 * min(1,node23path58) - currentNode*(min(1, node23path58) - 1))) &  (currentPath'=(58 * min(1, node23path58) - currentPath*(min(1,node23path58) - 1))) & (success'=min(1, node23path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path59 * min(1,node23path59) - currentNode*(min(1, node23path59) - 1))) &  (currentPath'=(59 * min(1, node23path59) - currentPath*(min(1,node23path59) - 1))) & (success'=min(1, node23path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path60 * min(1,node23path60) - currentNode*(min(1, node23path60) - 1))) &  (currentPath'=(60 * min(1, node23path60) - currentPath*(min(1,node23path60) - 1))) & (success'=min(1, node23path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path61 * min(1,node23path61) - currentNode*(min(1, node23path61) - 1))) &  (currentPath'=(61 * min(1, node23path61) - currentPath*(min(1,node23path61) - 1))) & (success'=min(1, node23path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path62 * min(1,node23path62) - currentNode*(min(1, node23path62) - 1))) &  (currentPath'=(62 * min(1, node23path62) - currentPath*(min(1,node23path62) - 1))) & (success'=min(1, node23path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path63 * min(1,node23path63) - currentNode*(min(1, node23path63) - 1))) &  (currentPath'=(63 * min(1, node23path63) - currentPath*(min(1,node23path63) - 1))) & (success'=min(1, node23path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path64 * min(1,node23path64) - currentNode*(min(1, node23path64) - 1))) &  (currentPath'=(64 * min(1, node23path64) - currentPath*(min(1,node23path64) - 1))) & (success'=min(1, node23path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path65 * min(1,node23path65) - currentNode*(min(1, node23path65) - 1))) &  (currentPath'=(65 * min(1, node23path65) - currentPath*(min(1,node23path65) - 1))) & (success'=min(1, node23path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path66 * min(1,node23path66) - currentNode*(min(1, node23path66) - 1))) &  (currentPath'=(66 * min(1, node23path66) - currentPath*(min(1,node23path66) - 1))) & (success'=min(1, node23path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path67 * min(1,node23path67) - currentNode*(min(1, node23path67) - 1))) &  (currentPath'=(67 * min(1, node23path67) - currentPath*(min(1,node23path67) - 1))) & (success'=min(1, node23path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path68 * min(1,node23path68) - currentNode*(min(1, node23path68) - 1))) &  (currentPath'=(68 * min(1, node23path68) - currentPath*(min(1,node23path68) - 1))) & (success'=min(1, node23path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path69 * min(1,node23path69) - currentNode*(min(1, node23path69) - 1))) &  (currentPath'=(69 * min(1, node23path69) - currentPath*(min(1,node23path69) - 1))) & (success'=min(1, node23path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path70 * min(1,node23path70) - currentNode*(min(1, node23path70) - 1))) &  (currentPath'=(70 * min(1, node23path70) - currentPath*(min(1,node23path70) - 1))) & (success'=min(1, node23path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path71 * min(1,node23path71) - currentNode*(min(1, node23path71) - 1))) &  (currentPath'=(71 * min(1, node23path71) - currentPath*(min(1,node23path71) - 1))) & (success'=min(1, node23path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path72 * min(1,node23path72) - currentNode*(min(1, node23path72) - 1))) &  (currentPath'=(72 * min(1, node23path72) - currentPath*(min(1,node23path72) - 1))) & (success'=min(1, node23path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path73 * min(1,node23path73) - currentNode*(min(1, node23path73) - 1))) &  (currentPath'=(73 * min(1, node23path73) - currentPath*(min(1,node23path73) - 1))) & (success'=min(1, node23path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path74 * min(1,node23path74) - currentNode*(min(1, node23path74) - 1))) &  (currentPath'=(74 * min(1, node23path74) - currentPath*(min(1,node23path74) - 1))) & (success'=min(1, node23path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path75 * min(1,node23path75) - currentNode*(min(1, node23path75) - 1))) &  (currentPath'=(75 * min(1, node23path75) - currentPath*(min(1,node23path75) - 1))) & (success'=min(1, node23path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path76 * min(1,node23path76) - currentNode*(min(1, node23path76) - 1))) &  (currentPath'=(76 * min(1, node23path76) - currentPath*(min(1,node23path76) - 1))) & (success'=min(1, node23path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path77 * min(1,node23path77) - currentNode*(min(1, node23path77) - 1))) &  (currentPath'=(77 * min(1, node23path77) - currentPath*(min(1,node23path77) - 1))) & (success'=min(1, node23path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path78 * min(1,node23path78) - currentNode*(min(1, node23path78) - 1))) &  (currentPath'=(78 * min(1, node23path78) - currentPath*(min(1,node23path78) - 1))) & (success'=min(1, node23path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path79 * min(1,node23path79) - currentNode*(min(1, node23path79) - 1))) &  (currentPath'=(79 * min(1, node23path79) - currentPath*(min(1,node23path79) - 1))) & (success'=min(1, node23path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path80 * min(1,node23path80) - currentNode*(min(1, node23path80) - 1))) &  (currentPath'=(80 * min(1, node23path80) - currentPath*(min(1,node23path80) - 1))) & (success'=min(1, node23path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path81 * min(1,node23path81) - currentNode*(min(1, node23path81) - 1))) &  (currentPath'=(81 * min(1, node23path81) - currentPath*(min(1,node23path81) - 1))) & (success'=min(1, node23path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path82 * min(1,node23path82) - currentNode*(min(1, node23path82) - 1))) &  (currentPath'=(82 * min(1, node23path82) - currentPath*(min(1,node23path82) - 1))) & (success'=min(1, node23path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path83 * min(1,node23path83) - currentNode*(min(1, node23path83) - 1))) &  (currentPath'=(83 * min(1, node23path83) - currentPath*(min(1,node23path83) - 1))) & (success'=min(1, node23path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path84 * min(1,node23path84) - currentNode*(min(1, node23path84) - 1))) &  (currentPath'=(84 * min(1, node23path84) - currentPath*(min(1,node23path84) - 1))) & (success'=min(1, node23path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path85 * min(1,node23path85) - currentNode*(min(1, node23path85) - 1))) &  (currentPath'=(85 * min(1, node23path85) - currentPath*(min(1,node23path85) - 1))) & (success'=min(1, node23path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path86 * min(1,node23path86) - currentNode*(min(1, node23path86) - 1))) &  (currentPath'=(86 * min(1, node23path86) - currentPath*(min(1,node23path86) - 1))) & (success'=min(1, node23path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path87 * min(1,node23path87) - currentNode*(min(1, node23path87) - 1))) &  (currentPath'=(87 * min(1, node23path87) - currentPath*(min(1,node23path87) - 1))) & (success'=min(1, node23path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path88 * min(1,node23path88) - currentNode*(min(1, node23path88) - 1))) &  (currentPath'=(88 * min(1, node23path88) - currentPath*(min(1,node23path88) - 1))) & (success'=min(1, node23path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path89 * min(1,node23path89) - currentNode*(min(1, node23path89) - 1))) &  (currentPath'=(89 * min(1, node23path89) - currentPath*(min(1,node23path89) - 1))) & (success'=min(1, node23path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path90 * min(1,node23path90) - currentNode*(min(1, node23path90) - 1))) &  (currentPath'=(90 * min(1, node23path90) - currentPath*(min(1,node23path90) - 1))) & (success'=min(1, node23path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path91 * min(1,node23path91) - currentNode*(min(1, node23path91) - 1))) &  (currentPath'=(91 * min(1, node23path91) - currentPath*(min(1,node23path91) - 1))) & (success'=min(1, node23path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path92 * min(1,node23path92) - currentNode*(min(1, node23path92) - 1))) &  (currentPath'=(92 * min(1, node23path92) - currentPath*(min(1,node23path92) - 1))) & (success'=min(1, node23path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path93 * min(1,node23path93) - currentNode*(min(1, node23path93) - 1))) &  (currentPath'=(93 * min(1, node23path93) - currentPath*(min(1,node23path93) - 1))) & (success'=min(1, node23path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path94 * min(1,node23path94) - currentNode*(min(1, node23path94) - 1))) &  (currentPath'=(94 * min(1, node23path94) - currentPath*(min(1,node23path94) - 1))) & (success'=min(1, node23path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path95 * min(1,node23path95) - currentNode*(min(1, node23path95) - 1))) &  (currentPath'=(95 * min(1, node23path95) - currentPath*(min(1,node23path95) - 1))) & (success'=min(1, node23path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path96 * min(1,node23path96) - currentNode*(min(1, node23path96) - 1))) &  (currentPath'=(96 * min(1, node23path96) - currentPath*(min(1,node23path96) - 1))) & (success'=min(1, node23path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path97 * min(1,node23path97) - currentNode*(min(1, node23path97) - 1))) &  (currentPath'=(97 * min(1, node23path97) - currentPath*(min(1,node23path97) - 1))) & (success'=min(1, node23path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path98 * min(1,node23path98) - currentNode*(min(1, node23path98) - 1))) &  (currentPath'=(98 * min(1, node23path98) - currentPath*(min(1,node23path98) - 1))) & (success'=min(1, node23path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path99 * min(1,node23path99) - currentNode*(min(1, node23path99) - 1))) &  (currentPath'=(99 * min(1, node23path99) - currentPath*(min(1,node23path99) - 1))) & (success'=min(1, node23path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node23path100 * min(1,node23path100) - currentNode*(min(1, node23path100) - 1))) &  (currentPath'=(100 * min(1, node23path100) - currentPath*(min(1,node23path100) - 1))) & (success'=min(1, node23path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 24) ->
 numPathsInv: (currentNode'=(node24path1 * min(1,node24path1) - currentNode*(min(1, node24path1) - 1))) &  (currentPath'=(1 * min(1, node24path1) - currentPath*(min(1,node24path1) - 1))) & (success'=min(1, node24path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path2 * min(1,node24path2) - currentNode*(min(1, node24path2) - 1))) &  (currentPath'=(2 * min(1, node24path2) - currentPath*(min(1,node24path2) - 1))) & (success'=min(1, node24path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path3 * min(1,node24path3) - currentNode*(min(1, node24path3) - 1))) &  (currentPath'=(3 * min(1, node24path3) - currentPath*(min(1,node24path3) - 1))) & (success'=min(1, node24path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path4 * min(1,node24path4) - currentNode*(min(1, node24path4) - 1))) &  (currentPath'=(4 * min(1, node24path4) - currentPath*(min(1,node24path4) - 1))) & (success'=min(1, node24path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path5 * min(1,node24path5) - currentNode*(min(1, node24path5) - 1))) &  (currentPath'=(5 * min(1, node24path5) - currentPath*(min(1,node24path5) - 1))) & (success'=min(1, node24path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path6 * min(1,node24path6) - currentNode*(min(1, node24path6) - 1))) &  (currentPath'=(6 * min(1, node24path6) - currentPath*(min(1,node24path6) - 1))) & (success'=min(1, node24path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path7 * min(1,node24path7) - currentNode*(min(1, node24path7) - 1))) &  (currentPath'=(7 * min(1, node24path7) - currentPath*(min(1,node24path7) - 1))) & (success'=min(1, node24path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path8 * min(1,node24path8) - currentNode*(min(1, node24path8) - 1))) &  (currentPath'=(8 * min(1, node24path8) - currentPath*(min(1,node24path8) - 1))) & (success'=min(1, node24path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path9 * min(1,node24path9) - currentNode*(min(1, node24path9) - 1))) &  (currentPath'=(9 * min(1, node24path9) - currentPath*(min(1,node24path9) - 1))) & (success'=min(1, node24path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path10 * min(1,node24path10) - currentNode*(min(1, node24path10) - 1))) &  (currentPath'=(10 * min(1, node24path10) - currentPath*(min(1,node24path10) - 1))) & (success'=min(1, node24path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path11 * min(1,node24path11) - currentNode*(min(1, node24path11) - 1))) &  (currentPath'=(11 * min(1, node24path11) - currentPath*(min(1,node24path11) - 1))) & (success'=min(1, node24path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path12 * min(1,node24path12) - currentNode*(min(1, node24path12) - 1))) &  (currentPath'=(12 * min(1, node24path12) - currentPath*(min(1,node24path12) - 1))) & (success'=min(1, node24path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path13 * min(1,node24path13) - currentNode*(min(1, node24path13) - 1))) &  (currentPath'=(13 * min(1, node24path13) - currentPath*(min(1,node24path13) - 1))) & (success'=min(1, node24path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path14 * min(1,node24path14) - currentNode*(min(1, node24path14) - 1))) &  (currentPath'=(14 * min(1, node24path14) - currentPath*(min(1,node24path14) - 1))) & (success'=min(1, node24path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path15 * min(1,node24path15) - currentNode*(min(1, node24path15) - 1))) &  (currentPath'=(15 * min(1, node24path15) - currentPath*(min(1,node24path15) - 1))) & (success'=min(1, node24path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path16 * min(1,node24path16) - currentNode*(min(1, node24path16) - 1))) &  (currentPath'=(16 * min(1, node24path16) - currentPath*(min(1,node24path16) - 1))) & (success'=min(1, node24path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path17 * min(1,node24path17) - currentNode*(min(1, node24path17) - 1))) &  (currentPath'=(17 * min(1, node24path17) - currentPath*(min(1,node24path17) - 1))) & (success'=min(1, node24path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path18 * min(1,node24path18) - currentNode*(min(1, node24path18) - 1))) &  (currentPath'=(18 * min(1, node24path18) - currentPath*(min(1,node24path18) - 1))) & (success'=min(1, node24path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path19 * min(1,node24path19) - currentNode*(min(1, node24path19) - 1))) &  (currentPath'=(19 * min(1, node24path19) - currentPath*(min(1,node24path19) - 1))) & (success'=min(1, node24path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path20 * min(1,node24path20) - currentNode*(min(1, node24path20) - 1))) &  (currentPath'=(20 * min(1, node24path20) - currentPath*(min(1,node24path20) - 1))) & (success'=min(1, node24path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path21 * min(1,node24path21) - currentNode*(min(1, node24path21) - 1))) &  (currentPath'=(21 * min(1, node24path21) - currentPath*(min(1,node24path21) - 1))) & (success'=min(1, node24path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path22 * min(1,node24path22) - currentNode*(min(1, node24path22) - 1))) &  (currentPath'=(22 * min(1, node24path22) - currentPath*(min(1,node24path22) - 1))) & (success'=min(1, node24path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path23 * min(1,node24path23) - currentNode*(min(1, node24path23) - 1))) &  (currentPath'=(23 * min(1, node24path23) - currentPath*(min(1,node24path23) - 1))) & (success'=min(1, node24path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path24 * min(1,node24path24) - currentNode*(min(1, node24path24) - 1))) &  (currentPath'=(24 * min(1, node24path24) - currentPath*(min(1,node24path24) - 1))) & (success'=min(1, node24path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path25 * min(1,node24path25) - currentNode*(min(1, node24path25) - 1))) &  (currentPath'=(25 * min(1, node24path25) - currentPath*(min(1,node24path25) - 1))) & (success'=min(1, node24path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path26 * min(1,node24path26) - currentNode*(min(1, node24path26) - 1))) &  (currentPath'=(26 * min(1, node24path26) - currentPath*(min(1,node24path26) - 1))) & (success'=min(1, node24path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path27 * min(1,node24path27) - currentNode*(min(1, node24path27) - 1))) &  (currentPath'=(27 * min(1, node24path27) - currentPath*(min(1,node24path27) - 1))) & (success'=min(1, node24path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path28 * min(1,node24path28) - currentNode*(min(1, node24path28) - 1))) &  (currentPath'=(28 * min(1, node24path28) - currentPath*(min(1,node24path28) - 1))) & (success'=min(1, node24path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path29 * min(1,node24path29) - currentNode*(min(1, node24path29) - 1))) &  (currentPath'=(29 * min(1, node24path29) - currentPath*(min(1,node24path29) - 1))) & (success'=min(1, node24path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path30 * min(1,node24path30) - currentNode*(min(1, node24path30) - 1))) &  (currentPath'=(30 * min(1, node24path30) - currentPath*(min(1,node24path30) - 1))) & (success'=min(1, node24path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path31 * min(1,node24path31) - currentNode*(min(1, node24path31) - 1))) &  (currentPath'=(31 * min(1, node24path31) - currentPath*(min(1,node24path31) - 1))) & (success'=min(1, node24path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path32 * min(1,node24path32) - currentNode*(min(1, node24path32) - 1))) &  (currentPath'=(32 * min(1, node24path32) - currentPath*(min(1,node24path32) - 1))) & (success'=min(1, node24path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path33 * min(1,node24path33) - currentNode*(min(1, node24path33) - 1))) &  (currentPath'=(33 * min(1, node24path33) - currentPath*(min(1,node24path33) - 1))) & (success'=min(1, node24path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path34 * min(1,node24path34) - currentNode*(min(1, node24path34) - 1))) &  (currentPath'=(34 * min(1, node24path34) - currentPath*(min(1,node24path34) - 1))) & (success'=min(1, node24path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path35 * min(1,node24path35) - currentNode*(min(1, node24path35) - 1))) &  (currentPath'=(35 * min(1, node24path35) - currentPath*(min(1,node24path35) - 1))) & (success'=min(1, node24path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path36 * min(1,node24path36) - currentNode*(min(1, node24path36) - 1))) &  (currentPath'=(36 * min(1, node24path36) - currentPath*(min(1,node24path36) - 1))) & (success'=min(1, node24path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path37 * min(1,node24path37) - currentNode*(min(1, node24path37) - 1))) &  (currentPath'=(37 * min(1, node24path37) - currentPath*(min(1,node24path37) - 1))) & (success'=min(1, node24path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path38 * min(1,node24path38) - currentNode*(min(1, node24path38) - 1))) &  (currentPath'=(38 * min(1, node24path38) - currentPath*(min(1,node24path38) - 1))) & (success'=min(1, node24path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path39 * min(1,node24path39) - currentNode*(min(1, node24path39) - 1))) &  (currentPath'=(39 * min(1, node24path39) - currentPath*(min(1,node24path39) - 1))) & (success'=min(1, node24path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path40 * min(1,node24path40) - currentNode*(min(1, node24path40) - 1))) &  (currentPath'=(40 * min(1, node24path40) - currentPath*(min(1,node24path40) - 1))) & (success'=min(1, node24path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path41 * min(1,node24path41) - currentNode*(min(1, node24path41) - 1))) &  (currentPath'=(41 * min(1, node24path41) - currentPath*(min(1,node24path41) - 1))) & (success'=min(1, node24path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path42 * min(1,node24path42) - currentNode*(min(1, node24path42) - 1))) &  (currentPath'=(42 * min(1, node24path42) - currentPath*(min(1,node24path42) - 1))) & (success'=min(1, node24path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path43 * min(1,node24path43) - currentNode*(min(1, node24path43) - 1))) &  (currentPath'=(43 * min(1, node24path43) - currentPath*(min(1,node24path43) - 1))) & (success'=min(1, node24path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path44 * min(1,node24path44) - currentNode*(min(1, node24path44) - 1))) &  (currentPath'=(44 * min(1, node24path44) - currentPath*(min(1,node24path44) - 1))) & (success'=min(1, node24path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path45 * min(1,node24path45) - currentNode*(min(1, node24path45) - 1))) &  (currentPath'=(45 * min(1, node24path45) - currentPath*(min(1,node24path45) - 1))) & (success'=min(1, node24path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path46 * min(1,node24path46) - currentNode*(min(1, node24path46) - 1))) &  (currentPath'=(46 * min(1, node24path46) - currentPath*(min(1,node24path46) - 1))) & (success'=min(1, node24path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path47 * min(1,node24path47) - currentNode*(min(1, node24path47) - 1))) &  (currentPath'=(47 * min(1, node24path47) - currentPath*(min(1,node24path47) - 1))) & (success'=min(1, node24path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path48 * min(1,node24path48) - currentNode*(min(1, node24path48) - 1))) &  (currentPath'=(48 * min(1, node24path48) - currentPath*(min(1,node24path48) - 1))) & (success'=min(1, node24path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path49 * min(1,node24path49) - currentNode*(min(1, node24path49) - 1))) &  (currentPath'=(49 * min(1, node24path49) - currentPath*(min(1,node24path49) - 1))) & (success'=min(1, node24path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path50 * min(1,node24path50) - currentNode*(min(1, node24path50) - 1))) &  (currentPath'=(50 * min(1, node24path50) - currentPath*(min(1,node24path50) - 1))) & (success'=min(1, node24path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path51 * min(1,node24path51) - currentNode*(min(1, node24path51) - 1))) &  (currentPath'=(51 * min(1, node24path51) - currentPath*(min(1,node24path51) - 1))) & (success'=min(1, node24path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path52 * min(1,node24path52) - currentNode*(min(1, node24path52) - 1))) &  (currentPath'=(52 * min(1, node24path52) - currentPath*(min(1,node24path52) - 1))) & (success'=min(1, node24path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path53 * min(1,node24path53) - currentNode*(min(1, node24path53) - 1))) &  (currentPath'=(53 * min(1, node24path53) - currentPath*(min(1,node24path53) - 1))) & (success'=min(1, node24path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path54 * min(1,node24path54) - currentNode*(min(1, node24path54) - 1))) &  (currentPath'=(54 * min(1, node24path54) - currentPath*(min(1,node24path54) - 1))) & (success'=min(1, node24path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path55 * min(1,node24path55) - currentNode*(min(1, node24path55) - 1))) &  (currentPath'=(55 * min(1, node24path55) - currentPath*(min(1,node24path55) - 1))) & (success'=min(1, node24path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path56 * min(1,node24path56) - currentNode*(min(1, node24path56) - 1))) &  (currentPath'=(56 * min(1, node24path56) - currentPath*(min(1,node24path56) - 1))) & (success'=min(1, node24path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path57 * min(1,node24path57) - currentNode*(min(1, node24path57) - 1))) &  (currentPath'=(57 * min(1, node24path57) - currentPath*(min(1,node24path57) - 1))) & (success'=min(1, node24path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path58 * min(1,node24path58) - currentNode*(min(1, node24path58) - 1))) &  (currentPath'=(58 * min(1, node24path58) - currentPath*(min(1,node24path58) - 1))) & (success'=min(1, node24path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path59 * min(1,node24path59) - currentNode*(min(1, node24path59) - 1))) &  (currentPath'=(59 * min(1, node24path59) - currentPath*(min(1,node24path59) - 1))) & (success'=min(1, node24path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path60 * min(1,node24path60) - currentNode*(min(1, node24path60) - 1))) &  (currentPath'=(60 * min(1, node24path60) - currentPath*(min(1,node24path60) - 1))) & (success'=min(1, node24path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path61 * min(1,node24path61) - currentNode*(min(1, node24path61) - 1))) &  (currentPath'=(61 * min(1, node24path61) - currentPath*(min(1,node24path61) - 1))) & (success'=min(1, node24path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path62 * min(1,node24path62) - currentNode*(min(1, node24path62) - 1))) &  (currentPath'=(62 * min(1, node24path62) - currentPath*(min(1,node24path62) - 1))) & (success'=min(1, node24path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path63 * min(1,node24path63) - currentNode*(min(1, node24path63) - 1))) &  (currentPath'=(63 * min(1, node24path63) - currentPath*(min(1,node24path63) - 1))) & (success'=min(1, node24path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path64 * min(1,node24path64) - currentNode*(min(1, node24path64) - 1))) &  (currentPath'=(64 * min(1, node24path64) - currentPath*(min(1,node24path64) - 1))) & (success'=min(1, node24path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path65 * min(1,node24path65) - currentNode*(min(1, node24path65) - 1))) &  (currentPath'=(65 * min(1, node24path65) - currentPath*(min(1,node24path65) - 1))) & (success'=min(1, node24path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path66 * min(1,node24path66) - currentNode*(min(1, node24path66) - 1))) &  (currentPath'=(66 * min(1, node24path66) - currentPath*(min(1,node24path66) - 1))) & (success'=min(1, node24path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path67 * min(1,node24path67) - currentNode*(min(1, node24path67) - 1))) &  (currentPath'=(67 * min(1, node24path67) - currentPath*(min(1,node24path67) - 1))) & (success'=min(1, node24path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path68 * min(1,node24path68) - currentNode*(min(1, node24path68) - 1))) &  (currentPath'=(68 * min(1, node24path68) - currentPath*(min(1,node24path68) - 1))) & (success'=min(1, node24path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path69 * min(1,node24path69) - currentNode*(min(1, node24path69) - 1))) &  (currentPath'=(69 * min(1, node24path69) - currentPath*(min(1,node24path69) - 1))) & (success'=min(1, node24path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path70 * min(1,node24path70) - currentNode*(min(1, node24path70) - 1))) &  (currentPath'=(70 * min(1, node24path70) - currentPath*(min(1,node24path70) - 1))) & (success'=min(1, node24path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path71 * min(1,node24path71) - currentNode*(min(1, node24path71) - 1))) &  (currentPath'=(71 * min(1, node24path71) - currentPath*(min(1,node24path71) - 1))) & (success'=min(1, node24path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path72 * min(1,node24path72) - currentNode*(min(1, node24path72) - 1))) &  (currentPath'=(72 * min(1, node24path72) - currentPath*(min(1,node24path72) - 1))) & (success'=min(1, node24path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path73 * min(1,node24path73) - currentNode*(min(1, node24path73) - 1))) &  (currentPath'=(73 * min(1, node24path73) - currentPath*(min(1,node24path73) - 1))) & (success'=min(1, node24path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path74 * min(1,node24path74) - currentNode*(min(1, node24path74) - 1))) &  (currentPath'=(74 * min(1, node24path74) - currentPath*(min(1,node24path74) - 1))) & (success'=min(1, node24path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path75 * min(1,node24path75) - currentNode*(min(1, node24path75) - 1))) &  (currentPath'=(75 * min(1, node24path75) - currentPath*(min(1,node24path75) - 1))) & (success'=min(1, node24path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path76 * min(1,node24path76) - currentNode*(min(1, node24path76) - 1))) &  (currentPath'=(76 * min(1, node24path76) - currentPath*(min(1,node24path76) - 1))) & (success'=min(1, node24path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path77 * min(1,node24path77) - currentNode*(min(1, node24path77) - 1))) &  (currentPath'=(77 * min(1, node24path77) - currentPath*(min(1,node24path77) - 1))) & (success'=min(1, node24path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path78 * min(1,node24path78) - currentNode*(min(1, node24path78) - 1))) &  (currentPath'=(78 * min(1, node24path78) - currentPath*(min(1,node24path78) - 1))) & (success'=min(1, node24path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path79 * min(1,node24path79) - currentNode*(min(1, node24path79) - 1))) &  (currentPath'=(79 * min(1, node24path79) - currentPath*(min(1,node24path79) - 1))) & (success'=min(1, node24path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path80 * min(1,node24path80) - currentNode*(min(1, node24path80) - 1))) &  (currentPath'=(80 * min(1, node24path80) - currentPath*(min(1,node24path80) - 1))) & (success'=min(1, node24path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path81 * min(1,node24path81) - currentNode*(min(1, node24path81) - 1))) &  (currentPath'=(81 * min(1, node24path81) - currentPath*(min(1,node24path81) - 1))) & (success'=min(1, node24path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path82 * min(1,node24path82) - currentNode*(min(1, node24path82) - 1))) &  (currentPath'=(82 * min(1, node24path82) - currentPath*(min(1,node24path82) - 1))) & (success'=min(1, node24path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path83 * min(1,node24path83) - currentNode*(min(1, node24path83) - 1))) &  (currentPath'=(83 * min(1, node24path83) - currentPath*(min(1,node24path83) - 1))) & (success'=min(1, node24path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path84 * min(1,node24path84) - currentNode*(min(1, node24path84) - 1))) &  (currentPath'=(84 * min(1, node24path84) - currentPath*(min(1,node24path84) - 1))) & (success'=min(1, node24path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path85 * min(1,node24path85) - currentNode*(min(1, node24path85) - 1))) &  (currentPath'=(85 * min(1, node24path85) - currentPath*(min(1,node24path85) - 1))) & (success'=min(1, node24path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path86 * min(1,node24path86) - currentNode*(min(1, node24path86) - 1))) &  (currentPath'=(86 * min(1, node24path86) - currentPath*(min(1,node24path86) - 1))) & (success'=min(1, node24path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path87 * min(1,node24path87) - currentNode*(min(1, node24path87) - 1))) &  (currentPath'=(87 * min(1, node24path87) - currentPath*(min(1,node24path87) - 1))) & (success'=min(1, node24path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path88 * min(1,node24path88) - currentNode*(min(1, node24path88) - 1))) &  (currentPath'=(88 * min(1, node24path88) - currentPath*(min(1,node24path88) - 1))) & (success'=min(1, node24path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path89 * min(1,node24path89) - currentNode*(min(1, node24path89) - 1))) &  (currentPath'=(89 * min(1, node24path89) - currentPath*(min(1,node24path89) - 1))) & (success'=min(1, node24path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path90 * min(1,node24path90) - currentNode*(min(1, node24path90) - 1))) &  (currentPath'=(90 * min(1, node24path90) - currentPath*(min(1,node24path90) - 1))) & (success'=min(1, node24path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path91 * min(1,node24path91) - currentNode*(min(1, node24path91) - 1))) &  (currentPath'=(91 * min(1, node24path91) - currentPath*(min(1,node24path91) - 1))) & (success'=min(1, node24path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path92 * min(1,node24path92) - currentNode*(min(1, node24path92) - 1))) &  (currentPath'=(92 * min(1, node24path92) - currentPath*(min(1,node24path92) - 1))) & (success'=min(1, node24path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path93 * min(1,node24path93) - currentNode*(min(1, node24path93) - 1))) &  (currentPath'=(93 * min(1, node24path93) - currentPath*(min(1,node24path93) - 1))) & (success'=min(1, node24path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path94 * min(1,node24path94) - currentNode*(min(1, node24path94) - 1))) &  (currentPath'=(94 * min(1, node24path94) - currentPath*(min(1,node24path94) - 1))) & (success'=min(1, node24path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path95 * min(1,node24path95) - currentNode*(min(1, node24path95) - 1))) &  (currentPath'=(95 * min(1, node24path95) - currentPath*(min(1,node24path95) - 1))) & (success'=min(1, node24path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path96 * min(1,node24path96) - currentNode*(min(1, node24path96) - 1))) &  (currentPath'=(96 * min(1, node24path96) - currentPath*(min(1,node24path96) - 1))) & (success'=min(1, node24path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path97 * min(1,node24path97) - currentNode*(min(1, node24path97) - 1))) &  (currentPath'=(97 * min(1, node24path97) - currentPath*(min(1,node24path97) - 1))) & (success'=min(1, node24path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path98 * min(1,node24path98) - currentNode*(min(1, node24path98) - 1))) &  (currentPath'=(98 * min(1, node24path98) - currentPath*(min(1,node24path98) - 1))) & (success'=min(1, node24path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path99 * min(1,node24path99) - currentNode*(min(1, node24path99) - 1))) &  (currentPath'=(99 * min(1, node24path99) - currentPath*(min(1,node24path99) - 1))) & (success'=min(1, node24path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node24path100 * min(1,node24path100) - currentNode*(min(1, node24path100) - 1))) &  (currentPath'=(100 * min(1, node24path100) - currentPath*(min(1,node24path100) - 1))) & (success'=min(1, node24path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 25) ->
 numPathsInv: (currentNode'=(node25path1 * min(1,node25path1) - currentNode*(min(1, node25path1) - 1))) &  (currentPath'=(1 * min(1, node25path1) - currentPath*(min(1,node25path1) - 1))) & (success'=min(1, node25path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path2 * min(1,node25path2) - currentNode*(min(1, node25path2) - 1))) &  (currentPath'=(2 * min(1, node25path2) - currentPath*(min(1,node25path2) - 1))) & (success'=min(1, node25path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path3 * min(1,node25path3) - currentNode*(min(1, node25path3) - 1))) &  (currentPath'=(3 * min(1, node25path3) - currentPath*(min(1,node25path3) - 1))) & (success'=min(1, node25path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path4 * min(1,node25path4) - currentNode*(min(1, node25path4) - 1))) &  (currentPath'=(4 * min(1, node25path4) - currentPath*(min(1,node25path4) - 1))) & (success'=min(1, node25path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path5 * min(1,node25path5) - currentNode*(min(1, node25path5) - 1))) &  (currentPath'=(5 * min(1, node25path5) - currentPath*(min(1,node25path5) - 1))) & (success'=min(1, node25path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path6 * min(1,node25path6) - currentNode*(min(1, node25path6) - 1))) &  (currentPath'=(6 * min(1, node25path6) - currentPath*(min(1,node25path6) - 1))) & (success'=min(1, node25path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path7 * min(1,node25path7) - currentNode*(min(1, node25path7) - 1))) &  (currentPath'=(7 * min(1, node25path7) - currentPath*(min(1,node25path7) - 1))) & (success'=min(1, node25path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path8 * min(1,node25path8) - currentNode*(min(1, node25path8) - 1))) &  (currentPath'=(8 * min(1, node25path8) - currentPath*(min(1,node25path8) - 1))) & (success'=min(1, node25path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path9 * min(1,node25path9) - currentNode*(min(1, node25path9) - 1))) &  (currentPath'=(9 * min(1, node25path9) - currentPath*(min(1,node25path9) - 1))) & (success'=min(1, node25path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path10 * min(1,node25path10) - currentNode*(min(1, node25path10) - 1))) &  (currentPath'=(10 * min(1, node25path10) - currentPath*(min(1,node25path10) - 1))) & (success'=min(1, node25path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path11 * min(1,node25path11) - currentNode*(min(1, node25path11) - 1))) &  (currentPath'=(11 * min(1, node25path11) - currentPath*(min(1,node25path11) - 1))) & (success'=min(1, node25path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path12 * min(1,node25path12) - currentNode*(min(1, node25path12) - 1))) &  (currentPath'=(12 * min(1, node25path12) - currentPath*(min(1,node25path12) - 1))) & (success'=min(1, node25path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path13 * min(1,node25path13) - currentNode*(min(1, node25path13) - 1))) &  (currentPath'=(13 * min(1, node25path13) - currentPath*(min(1,node25path13) - 1))) & (success'=min(1, node25path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path14 * min(1,node25path14) - currentNode*(min(1, node25path14) - 1))) &  (currentPath'=(14 * min(1, node25path14) - currentPath*(min(1,node25path14) - 1))) & (success'=min(1, node25path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path15 * min(1,node25path15) - currentNode*(min(1, node25path15) - 1))) &  (currentPath'=(15 * min(1, node25path15) - currentPath*(min(1,node25path15) - 1))) & (success'=min(1, node25path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path16 * min(1,node25path16) - currentNode*(min(1, node25path16) - 1))) &  (currentPath'=(16 * min(1, node25path16) - currentPath*(min(1,node25path16) - 1))) & (success'=min(1, node25path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path17 * min(1,node25path17) - currentNode*(min(1, node25path17) - 1))) &  (currentPath'=(17 * min(1, node25path17) - currentPath*(min(1,node25path17) - 1))) & (success'=min(1, node25path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path18 * min(1,node25path18) - currentNode*(min(1, node25path18) - 1))) &  (currentPath'=(18 * min(1, node25path18) - currentPath*(min(1,node25path18) - 1))) & (success'=min(1, node25path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path19 * min(1,node25path19) - currentNode*(min(1, node25path19) - 1))) &  (currentPath'=(19 * min(1, node25path19) - currentPath*(min(1,node25path19) - 1))) & (success'=min(1, node25path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path20 * min(1,node25path20) - currentNode*(min(1, node25path20) - 1))) &  (currentPath'=(20 * min(1, node25path20) - currentPath*(min(1,node25path20) - 1))) & (success'=min(1, node25path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path21 * min(1,node25path21) - currentNode*(min(1, node25path21) - 1))) &  (currentPath'=(21 * min(1, node25path21) - currentPath*(min(1,node25path21) - 1))) & (success'=min(1, node25path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path22 * min(1,node25path22) - currentNode*(min(1, node25path22) - 1))) &  (currentPath'=(22 * min(1, node25path22) - currentPath*(min(1,node25path22) - 1))) & (success'=min(1, node25path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path23 * min(1,node25path23) - currentNode*(min(1, node25path23) - 1))) &  (currentPath'=(23 * min(1, node25path23) - currentPath*(min(1,node25path23) - 1))) & (success'=min(1, node25path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path24 * min(1,node25path24) - currentNode*(min(1, node25path24) - 1))) &  (currentPath'=(24 * min(1, node25path24) - currentPath*(min(1,node25path24) - 1))) & (success'=min(1, node25path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path25 * min(1,node25path25) - currentNode*(min(1, node25path25) - 1))) &  (currentPath'=(25 * min(1, node25path25) - currentPath*(min(1,node25path25) - 1))) & (success'=min(1, node25path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path26 * min(1,node25path26) - currentNode*(min(1, node25path26) - 1))) &  (currentPath'=(26 * min(1, node25path26) - currentPath*(min(1,node25path26) - 1))) & (success'=min(1, node25path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path27 * min(1,node25path27) - currentNode*(min(1, node25path27) - 1))) &  (currentPath'=(27 * min(1, node25path27) - currentPath*(min(1,node25path27) - 1))) & (success'=min(1, node25path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path28 * min(1,node25path28) - currentNode*(min(1, node25path28) - 1))) &  (currentPath'=(28 * min(1, node25path28) - currentPath*(min(1,node25path28) - 1))) & (success'=min(1, node25path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path29 * min(1,node25path29) - currentNode*(min(1, node25path29) - 1))) &  (currentPath'=(29 * min(1, node25path29) - currentPath*(min(1,node25path29) - 1))) & (success'=min(1, node25path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path30 * min(1,node25path30) - currentNode*(min(1, node25path30) - 1))) &  (currentPath'=(30 * min(1, node25path30) - currentPath*(min(1,node25path30) - 1))) & (success'=min(1, node25path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path31 * min(1,node25path31) - currentNode*(min(1, node25path31) - 1))) &  (currentPath'=(31 * min(1, node25path31) - currentPath*(min(1,node25path31) - 1))) & (success'=min(1, node25path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path32 * min(1,node25path32) - currentNode*(min(1, node25path32) - 1))) &  (currentPath'=(32 * min(1, node25path32) - currentPath*(min(1,node25path32) - 1))) & (success'=min(1, node25path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path33 * min(1,node25path33) - currentNode*(min(1, node25path33) - 1))) &  (currentPath'=(33 * min(1, node25path33) - currentPath*(min(1,node25path33) - 1))) & (success'=min(1, node25path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path34 * min(1,node25path34) - currentNode*(min(1, node25path34) - 1))) &  (currentPath'=(34 * min(1, node25path34) - currentPath*(min(1,node25path34) - 1))) & (success'=min(1, node25path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path35 * min(1,node25path35) - currentNode*(min(1, node25path35) - 1))) &  (currentPath'=(35 * min(1, node25path35) - currentPath*(min(1,node25path35) - 1))) & (success'=min(1, node25path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path36 * min(1,node25path36) - currentNode*(min(1, node25path36) - 1))) &  (currentPath'=(36 * min(1, node25path36) - currentPath*(min(1,node25path36) - 1))) & (success'=min(1, node25path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path37 * min(1,node25path37) - currentNode*(min(1, node25path37) - 1))) &  (currentPath'=(37 * min(1, node25path37) - currentPath*(min(1,node25path37) - 1))) & (success'=min(1, node25path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path38 * min(1,node25path38) - currentNode*(min(1, node25path38) - 1))) &  (currentPath'=(38 * min(1, node25path38) - currentPath*(min(1,node25path38) - 1))) & (success'=min(1, node25path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path39 * min(1,node25path39) - currentNode*(min(1, node25path39) - 1))) &  (currentPath'=(39 * min(1, node25path39) - currentPath*(min(1,node25path39) - 1))) & (success'=min(1, node25path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path40 * min(1,node25path40) - currentNode*(min(1, node25path40) - 1))) &  (currentPath'=(40 * min(1, node25path40) - currentPath*(min(1,node25path40) - 1))) & (success'=min(1, node25path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path41 * min(1,node25path41) - currentNode*(min(1, node25path41) - 1))) &  (currentPath'=(41 * min(1, node25path41) - currentPath*(min(1,node25path41) - 1))) & (success'=min(1, node25path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path42 * min(1,node25path42) - currentNode*(min(1, node25path42) - 1))) &  (currentPath'=(42 * min(1, node25path42) - currentPath*(min(1,node25path42) - 1))) & (success'=min(1, node25path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path43 * min(1,node25path43) - currentNode*(min(1, node25path43) - 1))) &  (currentPath'=(43 * min(1, node25path43) - currentPath*(min(1,node25path43) - 1))) & (success'=min(1, node25path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path44 * min(1,node25path44) - currentNode*(min(1, node25path44) - 1))) &  (currentPath'=(44 * min(1, node25path44) - currentPath*(min(1,node25path44) - 1))) & (success'=min(1, node25path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path45 * min(1,node25path45) - currentNode*(min(1, node25path45) - 1))) &  (currentPath'=(45 * min(1, node25path45) - currentPath*(min(1,node25path45) - 1))) & (success'=min(1, node25path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path46 * min(1,node25path46) - currentNode*(min(1, node25path46) - 1))) &  (currentPath'=(46 * min(1, node25path46) - currentPath*(min(1,node25path46) - 1))) & (success'=min(1, node25path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path47 * min(1,node25path47) - currentNode*(min(1, node25path47) - 1))) &  (currentPath'=(47 * min(1, node25path47) - currentPath*(min(1,node25path47) - 1))) & (success'=min(1, node25path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path48 * min(1,node25path48) - currentNode*(min(1, node25path48) - 1))) &  (currentPath'=(48 * min(1, node25path48) - currentPath*(min(1,node25path48) - 1))) & (success'=min(1, node25path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path49 * min(1,node25path49) - currentNode*(min(1, node25path49) - 1))) &  (currentPath'=(49 * min(1, node25path49) - currentPath*(min(1,node25path49) - 1))) & (success'=min(1, node25path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path50 * min(1,node25path50) - currentNode*(min(1, node25path50) - 1))) &  (currentPath'=(50 * min(1, node25path50) - currentPath*(min(1,node25path50) - 1))) & (success'=min(1, node25path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path51 * min(1,node25path51) - currentNode*(min(1, node25path51) - 1))) &  (currentPath'=(51 * min(1, node25path51) - currentPath*(min(1,node25path51) - 1))) & (success'=min(1, node25path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path52 * min(1,node25path52) - currentNode*(min(1, node25path52) - 1))) &  (currentPath'=(52 * min(1, node25path52) - currentPath*(min(1,node25path52) - 1))) & (success'=min(1, node25path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path53 * min(1,node25path53) - currentNode*(min(1, node25path53) - 1))) &  (currentPath'=(53 * min(1, node25path53) - currentPath*(min(1,node25path53) - 1))) & (success'=min(1, node25path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path54 * min(1,node25path54) - currentNode*(min(1, node25path54) - 1))) &  (currentPath'=(54 * min(1, node25path54) - currentPath*(min(1,node25path54) - 1))) & (success'=min(1, node25path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path55 * min(1,node25path55) - currentNode*(min(1, node25path55) - 1))) &  (currentPath'=(55 * min(1, node25path55) - currentPath*(min(1,node25path55) - 1))) & (success'=min(1, node25path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path56 * min(1,node25path56) - currentNode*(min(1, node25path56) - 1))) &  (currentPath'=(56 * min(1, node25path56) - currentPath*(min(1,node25path56) - 1))) & (success'=min(1, node25path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path57 * min(1,node25path57) - currentNode*(min(1, node25path57) - 1))) &  (currentPath'=(57 * min(1, node25path57) - currentPath*(min(1,node25path57) - 1))) & (success'=min(1, node25path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path58 * min(1,node25path58) - currentNode*(min(1, node25path58) - 1))) &  (currentPath'=(58 * min(1, node25path58) - currentPath*(min(1,node25path58) - 1))) & (success'=min(1, node25path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path59 * min(1,node25path59) - currentNode*(min(1, node25path59) - 1))) &  (currentPath'=(59 * min(1, node25path59) - currentPath*(min(1,node25path59) - 1))) & (success'=min(1, node25path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path60 * min(1,node25path60) - currentNode*(min(1, node25path60) - 1))) &  (currentPath'=(60 * min(1, node25path60) - currentPath*(min(1,node25path60) - 1))) & (success'=min(1, node25path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path61 * min(1,node25path61) - currentNode*(min(1, node25path61) - 1))) &  (currentPath'=(61 * min(1, node25path61) - currentPath*(min(1,node25path61) - 1))) & (success'=min(1, node25path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path62 * min(1,node25path62) - currentNode*(min(1, node25path62) - 1))) &  (currentPath'=(62 * min(1, node25path62) - currentPath*(min(1,node25path62) - 1))) & (success'=min(1, node25path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path63 * min(1,node25path63) - currentNode*(min(1, node25path63) - 1))) &  (currentPath'=(63 * min(1, node25path63) - currentPath*(min(1,node25path63) - 1))) & (success'=min(1, node25path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path64 * min(1,node25path64) - currentNode*(min(1, node25path64) - 1))) &  (currentPath'=(64 * min(1, node25path64) - currentPath*(min(1,node25path64) - 1))) & (success'=min(1, node25path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path65 * min(1,node25path65) - currentNode*(min(1, node25path65) - 1))) &  (currentPath'=(65 * min(1, node25path65) - currentPath*(min(1,node25path65) - 1))) & (success'=min(1, node25path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path66 * min(1,node25path66) - currentNode*(min(1, node25path66) - 1))) &  (currentPath'=(66 * min(1, node25path66) - currentPath*(min(1,node25path66) - 1))) & (success'=min(1, node25path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path67 * min(1,node25path67) - currentNode*(min(1, node25path67) - 1))) &  (currentPath'=(67 * min(1, node25path67) - currentPath*(min(1,node25path67) - 1))) & (success'=min(1, node25path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path68 * min(1,node25path68) - currentNode*(min(1, node25path68) - 1))) &  (currentPath'=(68 * min(1, node25path68) - currentPath*(min(1,node25path68) - 1))) & (success'=min(1, node25path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path69 * min(1,node25path69) - currentNode*(min(1, node25path69) - 1))) &  (currentPath'=(69 * min(1, node25path69) - currentPath*(min(1,node25path69) - 1))) & (success'=min(1, node25path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path70 * min(1,node25path70) - currentNode*(min(1, node25path70) - 1))) &  (currentPath'=(70 * min(1, node25path70) - currentPath*(min(1,node25path70) - 1))) & (success'=min(1, node25path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path71 * min(1,node25path71) - currentNode*(min(1, node25path71) - 1))) &  (currentPath'=(71 * min(1, node25path71) - currentPath*(min(1,node25path71) - 1))) & (success'=min(1, node25path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path72 * min(1,node25path72) - currentNode*(min(1, node25path72) - 1))) &  (currentPath'=(72 * min(1, node25path72) - currentPath*(min(1,node25path72) - 1))) & (success'=min(1, node25path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path73 * min(1,node25path73) - currentNode*(min(1, node25path73) - 1))) &  (currentPath'=(73 * min(1, node25path73) - currentPath*(min(1,node25path73) - 1))) & (success'=min(1, node25path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path74 * min(1,node25path74) - currentNode*(min(1, node25path74) - 1))) &  (currentPath'=(74 * min(1, node25path74) - currentPath*(min(1,node25path74) - 1))) & (success'=min(1, node25path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path75 * min(1,node25path75) - currentNode*(min(1, node25path75) - 1))) &  (currentPath'=(75 * min(1, node25path75) - currentPath*(min(1,node25path75) - 1))) & (success'=min(1, node25path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path76 * min(1,node25path76) - currentNode*(min(1, node25path76) - 1))) &  (currentPath'=(76 * min(1, node25path76) - currentPath*(min(1,node25path76) - 1))) & (success'=min(1, node25path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path77 * min(1,node25path77) - currentNode*(min(1, node25path77) - 1))) &  (currentPath'=(77 * min(1, node25path77) - currentPath*(min(1,node25path77) - 1))) & (success'=min(1, node25path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path78 * min(1,node25path78) - currentNode*(min(1, node25path78) - 1))) &  (currentPath'=(78 * min(1, node25path78) - currentPath*(min(1,node25path78) - 1))) & (success'=min(1, node25path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path79 * min(1,node25path79) - currentNode*(min(1, node25path79) - 1))) &  (currentPath'=(79 * min(1, node25path79) - currentPath*(min(1,node25path79) - 1))) & (success'=min(1, node25path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path80 * min(1,node25path80) - currentNode*(min(1, node25path80) - 1))) &  (currentPath'=(80 * min(1, node25path80) - currentPath*(min(1,node25path80) - 1))) & (success'=min(1, node25path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path81 * min(1,node25path81) - currentNode*(min(1, node25path81) - 1))) &  (currentPath'=(81 * min(1, node25path81) - currentPath*(min(1,node25path81) - 1))) & (success'=min(1, node25path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path82 * min(1,node25path82) - currentNode*(min(1, node25path82) - 1))) &  (currentPath'=(82 * min(1, node25path82) - currentPath*(min(1,node25path82) - 1))) & (success'=min(1, node25path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path83 * min(1,node25path83) - currentNode*(min(1, node25path83) - 1))) &  (currentPath'=(83 * min(1, node25path83) - currentPath*(min(1,node25path83) - 1))) & (success'=min(1, node25path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path84 * min(1,node25path84) - currentNode*(min(1, node25path84) - 1))) &  (currentPath'=(84 * min(1, node25path84) - currentPath*(min(1,node25path84) - 1))) & (success'=min(1, node25path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path85 * min(1,node25path85) - currentNode*(min(1, node25path85) - 1))) &  (currentPath'=(85 * min(1, node25path85) - currentPath*(min(1,node25path85) - 1))) & (success'=min(1, node25path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path86 * min(1,node25path86) - currentNode*(min(1, node25path86) - 1))) &  (currentPath'=(86 * min(1, node25path86) - currentPath*(min(1,node25path86) - 1))) & (success'=min(1, node25path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path87 * min(1,node25path87) - currentNode*(min(1, node25path87) - 1))) &  (currentPath'=(87 * min(1, node25path87) - currentPath*(min(1,node25path87) - 1))) & (success'=min(1, node25path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path88 * min(1,node25path88) - currentNode*(min(1, node25path88) - 1))) &  (currentPath'=(88 * min(1, node25path88) - currentPath*(min(1,node25path88) - 1))) & (success'=min(1, node25path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path89 * min(1,node25path89) - currentNode*(min(1, node25path89) - 1))) &  (currentPath'=(89 * min(1, node25path89) - currentPath*(min(1,node25path89) - 1))) & (success'=min(1, node25path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path90 * min(1,node25path90) - currentNode*(min(1, node25path90) - 1))) &  (currentPath'=(90 * min(1, node25path90) - currentPath*(min(1,node25path90) - 1))) & (success'=min(1, node25path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path91 * min(1,node25path91) - currentNode*(min(1, node25path91) - 1))) &  (currentPath'=(91 * min(1, node25path91) - currentPath*(min(1,node25path91) - 1))) & (success'=min(1, node25path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path92 * min(1,node25path92) - currentNode*(min(1, node25path92) - 1))) &  (currentPath'=(92 * min(1, node25path92) - currentPath*(min(1,node25path92) - 1))) & (success'=min(1, node25path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path93 * min(1,node25path93) - currentNode*(min(1, node25path93) - 1))) &  (currentPath'=(93 * min(1, node25path93) - currentPath*(min(1,node25path93) - 1))) & (success'=min(1, node25path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path94 * min(1,node25path94) - currentNode*(min(1, node25path94) - 1))) &  (currentPath'=(94 * min(1, node25path94) - currentPath*(min(1,node25path94) - 1))) & (success'=min(1, node25path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path95 * min(1,node25path95) - currentNode*(min(1, node25path95) - 1))) &  (currentPath'=(95 * min(1, node25path95) - currentPath*(min(1,node25path95) - 1))) & (success'=min(1, node25path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path96 * min(1,node25path96) - currentNode*(min(1, node25path96) - 1))) &  (currentPath'=(96 * min(1, node25path96) - currentPath*(min(1,node25path96) - 1))) & (success'=min(1, node25path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path97 * min(1,node25path97) - currentNode*(min(1, node25path97) - 1))) &  (currentPath'=(97 * min(1, node25path97) - currentPath*(min(1,node25path97) - 1))) & (success'=min(1, node25path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path98 * min(1,node25path98) - currentNode*(min(1, node25path98) - 1))) &  (currentPath'=(98 * min(1, node25path98) - currentPath*(min(1,node25path98) - 1))) & (success'=min(1, node25path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path99 * min(1,node25path99) - currentNode*(min(1, node25path99) - 1))) &  (currentPath'=(99 * min(1, node25path99) - currentPath*(min(1,node25path99) - 1))) & (success'=min(1, node25path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node25path100 * min(1,node25path100) - currentNode*(min(1, node25path100) - 1))) &  (currentPath'=(100 * min(1, node25path100) - currentPath*(min(1,node25path100) - 1))) & (success'=min(1, node25path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 26) ->
 numPathsInv: (currentNode'=(node26path1 * min(1,node26path1) - currentNode*(min(1, node26path1) - 1))) &  (currentPath'=(1 * min(1, node26path1) - currentPath*(min(1,node26path1) - 1))) & (success'=min(1, node26path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path2 * min(1,node26path2) - currentNode*(min(1, node26path2) - 1))) &  (currentPath'=(2 * min(1, node26path2) - currentPath*(min(1,node26path2) - 1))) & (success'=min(1, node26path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path3 * min(1,node26path3) - currentNode*(min(1, node26path3) - 1))) &  (currentPath'=(3 * min(1, node26path3) - currentPath*(min(1,node26path3) - 1))) & (success'=min(1, node26path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path4 * min(1,node26path4) - currentNode*(min(1, node26path4) - 1))) &  (currentPath'=(4 * min(1, node26path4) - currentPath*(min(1,node26path4) - 1))) & (success'=min(1, node26path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path5 * min(1,node26path5) - currentNode*(min(1, node26path5) - 1))) &  (currentPath'=(5 * min(1, node26path5) - currentPath*(min(1,node26path5) - 1))) & (success'=min(1, node26path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path6 * min(1,node26path6) - currentNode*(min(1, node26path6) - 1))) &  (currentPath'=(6 * min(1, node26path6) - currentPath*(min(1,node26path6) - 1))) & (success'=min(1, node26path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path7 * min(1,node26path7) - currentNode*(min(1, node26path7) - 1))) &  (currentPath'=(7 * min(1, node26path7) - currentPath*(min(1,node26path7) - 1))) & (success'=min(1, node26path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path8 * min(1,node26path8) - currentNode*(min(1, node26path8) - 1))) &  (currentPath'=(8 * min(1, node26path8) - currentPath*(min(1,node26path8) - 1))) & (success'=min(1, node26path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path9 * min(1,node26path9) - currentNode*(min(1, node26path9) - 1))) &  (currentPath'=(9 * min(1, node26path9) - currentPath*(min(1,node26path9) - 1))) & (success'=min(1, node26path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path10 * min(1,node26path10) - currentNode*(min(1, node26path10) - 1))) &  (currentPath'=(10 * min(1, node26path10) - currentPath*(min(1,node26path10) - 1))) & (success'=min(1, node26path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path11 * min(1,node26path11) - currentNode*(min(1, node26path11) - 1))) &  (currentPath'=(11 * min(1, node26path11) - currentPath*(min(1,node26path11) - 1))) & (success'=min(1, node26path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path12 * min(1,node26path12) - currentNode*(min(1, node26path12) - 1))) &  (currentPath'=(12 * min(1, node26path12) - currentPath*(min(1,node26path12) - 1))) & (success'=min(1, node26path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path13 * min(1,node26path13) - currentNode*(min(1, node26path13) - 1))) &  (currentPath'=(13 * min(1, node26path13) - currentPath*(min(1,node26path13) - 1))) & (success'=min(1, node26path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path14 * min(1,node26path14) - currentNode*(min(1, node26path14) - 1))) &  (currentPath'=(14 * min(1, node26path14) - currentPath*(min(1,node26path14) - 1))) & (success'=min(1, node26path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path15 * min(1,node26path15) - currentNode*(min(1, node26path15) - 1))) &  (currentPath'=(15 * min(1, node26path15) - currentPath*(min(1,node26path15) - 1))) & (success'=min(1, node26path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path16 * min(1,node26path16) - currentNode*(min(1, node26path16) - 1))) &  (currentPath'=(16 * min(1, node26path16) - currentPath*(min(1,node26path16) - 1))) & (success'=min(1, node26path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path17 * min(1,node26path17) - currentNode*(min(1, node26path17) - 1))) &  (currentPath'=(17 * min(1, node26path17) - currentPath*(min(1,node26path17) - 1))) & (success'=min(1, node26path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path18 * min(1,node26path18) - currentNode*(min(1, node26path18) - 1))) &  (currentPath'=(18 * min(1, node26path18) - currentPath*(min(1,node26path18) - 1))) & (success'=min(1, node26path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path19 * min(1,node26path19) - currentNode*(min(1, node26path19) - 1))) &  (currentPath'=(19 * min(1, node26path19) - currentPath*(min(1,node26path19) - 1))) & (success'=min(1, node26path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path20 * min(1,node26path20) - currentNode*(min(1, node26path20) - 1))) &  (currentPath'=(20 * min(1, node26path20) - currentPath*(min(1,node26path20) - 1))) & (success'=min(1, node26path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path21 * min(1,node26path21) - currentNode*(min(1, node26path21) - 1))) &  (currentPath'=(21 * min(1, node26path21) - currentPath*(min(1,node26path21) - 1))) & (success'=min(1, node26path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path22 * min(1,node26path22) - currentNode*(min(1, node26path22) - 1))) &  (currentPath'=(22 * min(1, node26path22) - currentPath*(min(1,node26path22) - 1))) & (success'=min(1, node26path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path23 * min(1,node26path23) - currentNode*(min(1, node26path23) - 1))) &  (currentPath'=(23 * min(1, node26path23) - currentPath*(min(1,node26path23) - 1))) & (success'=min(1, node26path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path24 * min(1,node26path24) - currentNode*(min(1, node26path24) - 1))) &  (currentPath'=(24 * min(1, node26path24) - currentPath*(min(1,node26path24) - 1))) & (success'=min(1, node26path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path25 * min(1,node26path25) - currentNode*(min(1, node26path25) - 1))) &  (currentPath'=(25 * min(1, node26path25) - currentPath*(min(1,node26path25) - 1))) & (success'=min(1, node26path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path26 * min(1,node26path26) - currentNode*(min(1, node26path26) - 1))) &  (currentPath'=(26 * min(1, node26path26) - currentPath*(min(1,node26path26) - 1))) & (success'=min(1, node26path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path27 * min(1,node26path27) - currentNode*(min(1, node26path27) - 1))) &  (currentPath'=(27 * min(1, node26path27) - currentPath*(min(1,node26path27) - 1))) & (success'=min(1, node26path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path28 * min(1,node26path28) - currentNode*(min(1, node26path28) - 1))) &  (currentPath'=(28 * min(1, node26path28) - currentPath*(min(1,node26path28) - 1))) & (success'=min(1, node26path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path29 * min(1,node26path29) - currentNode*(min(1, node26path29) - 1))) &  (currentPath'=(29 * min(1, node26path29) - currentPath*(min(1,node26path29) - 1))) & (success'=min(1, node26path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path30 * min(1,node26path30) - currentNode*(min(1, node26path30) - 1))) &  (currentPath'=(30 * min(1, node26path30) - currentPath*(min(1,node26path30) - 1))) & (success'=min(1, node26path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path31 * min(1,node26path31) - currentNode*(min(1, node26path31) - 1))) &  (currentPath'=(31 * min(1, node26path31) - currentPath*(min(1,node26path31) - 1))) & (success'=min(1, node26path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path32 * min(1,node26path32) - currentNode*(min(1, node26path32) - 1))) &  (currentPath'=(32 * min(1, node26path32) - currentPath*(min(1,node26path32) - 1))) & (success'=min(1, node26path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path33 * min(1,node26path33) - currentNode*(min(1, node26path33) - 1))) &  (currentPath'=(33 * min(1, node26path33) - currentPath*(min(1,node26path33) - 1))) & (success'=min(1, node26path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path34 * min(1,node26path34) - currentNode*(min(1, node26path34) - 1))) &  (currentPath'=(34 * min(1, node26path34) - currentPath*(min(1,node26path34) - 1))) & (success'=min(1, node26path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path35 * min(1,node26path35) - currentNode*(min(1, node26path35) - 1))) &  (currentPath'=(35 * min(1, node26path35) - currentPath*(min(1,node26path35) - 1))) & (success'=min(1, node26path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path36 * min(1,node26path36) - currentNode*(min(1, node26path36) - 1))) &  (currentPath'=(36 * min(1, node26path36) - currentPath*(min(1,node26path36) - 1))) & (success'=min(1, node26path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path37 * min(1,node26path37) - currentNode*(min(1, node26path37) - 1))) &  (currentPath'=(37 * min(1, node26path37) - currentPath*(min(1,node26path37) - 1))) & (success'=min(1, node26path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path38 * min(1,node26path38) - currentNode*(min(1, node26path38) - 1))) &  (currentPath'=(38 * min(1, node26path38) - currentPath*(min(1,node26path38) - 1))) & (success'=min(1, node26path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path39 * min(1,node26path39) - currentNode*(min(1, node26path39) - 1))) &  (currentPath'=(39 * min(1, node26path39) - currentPath*(min(1,node26path39) - 1))) & (success'=min(1, node26path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path40 * min(1,node26path40) - currentNode*(min(1, node26path40) - 1))) &  (currentPath'=(40 * min(1, node26path40) - currentPath*(min(1,node26path40) - 1))) & (success'=min(1, node26path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path41 * min(1,node26path41) - currentNode*(min(1, node26path41) - 1))) &  (currentPath'=(41 * min(1, node26path41) - currentPath*(min(1,node26path41) - 1))) & (success'=min(1, node26path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path42 * min(1,node26path42) - currentNode*(min(1, node26path42) - 1))) &  (currentPath'=(42 * min(1, node26path42) - currentPath*(min(1,node26path42) - 1))) & (success'=min(1, node26path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path43 * min(1,node26path43) - currentNode*(min(1, node26path43) - 1))) &  (currentPath'=(43 * min(1, node26path43) - currentPath*(min(1,node26path43) - 1))) & (success'=min(1, node26path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path44 * min(1,node26path44) - currentNode*(min(1, node26path44) - 1))) &  (currentPath'=(44 * min(1, node26path44) - currentPath*(min(1,node26path44) - 1))) & (success'=min(1, node26path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path45 * min(1,node26path45) - currentNode*(min(1, node26path45) - 1))) &  (currentPath'=(45 * min(1, node26path45) - currentPath*(min(1,node26path45) - 1))) & (success'=min(1, node26path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path46 * min(1,node26path46) - currentNode*(min(1, node26path46) - 1))) &  (currentPath'=(46 * min(1, node26path46) - currentPath*(min(1,node26path46) - 1))) & (success'=min(1, node26path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path47 * min(1,node26path47) - currentNode*(min(1, node26path47) - 1))) &  (currentPath'=(47 * min(1, node26path47) - currentPath*(min(1,node26path47) - 1))) & (success'=min(1, node26path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path48 * min(1,node26path48) - currentNode*(min(1, node26path48) - 1))) &  (currentPath'=(48 * min(1, node26path48) - currentPath*(min(1,node26path48) - 1))) & (success'=min(1, node26path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path49 * min(1,node26path49) - currentNode*(min(1, node26path49) - 1))) &  (currentPath'=(49 * min(1, node26path49) - currentPath*(min(1,node26path49) - 1))) & (success'=min(1, node26path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path50 * min(1,node26path50) - currentNode*(min(1, node26path50) - 1))) &  (currentPath'=(50 * min(1, node26path50) - currentPath*(min(1,node26path50) - 1))) & (success'=min(1, node26path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path51 * min(1,node26path51) - currentNode*(min(1, node26path51) - 1))) &  (currentPath'=(51 * min(1, node26path51) - currentPath*(min(1,node26path51) - 1))) & (success'=min(1, node26path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path52 * min(1,node26path52) - currentNode*(min(1, node26path52) - 1))) &  (currentPath'=(52 * min(1, node26path52) - currentPath*(min(1,node26path52) - 1))) & (success'=min(1, node26path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path53 * min(1,node26path53) - currentNode*(min(1, node26path53) - 1))) &  (currentPath'=(53 * min(1, node26path53) - currentPath*(min(1,node26path53) - 1))) & (success'=min(1, node26path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path54 * min(1,node26path54) - currentNode*(min(1, node26path54) - 1))) &  (currentPath'=(54 * min(1, node26path54) - currentPath*(min(1,node26path54) - 1))) & (success'=min(1, node26path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path55 * min(1,node26path55) - currentNode*(min(1, node26path55) - 1))) &  (currentPath'=(55 * min(1, node26path55) - currentPath*(min(1,node26path55) - 1))) & (success'=min(1, node26path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path56 * min(1,node26path56) - currentNode*(min(1, node26path56) - 1))) &  (currentPath'=(56 * min(1, node26path56) - currentPath*(min(1,node26path56) - 1))) & (success'=min(1, node26path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path57 * min(1,node26path57) - currentNode*(min(1, node26path57) - 1))) &  (currentPath'=(57 * min(1, node26path57) - currentPath*(min(1,node26path57) - 1))) & (success'=min(1, node26path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path58 * min(1,node26path58) - currentNode*(min(1, node26path58) - 1))) &  (currentPath'=(58 * min(1, node26path58) - currentPath*(min(1,node26path58) - 1))) & (success'=min(1, node26path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path59 * min(1,node26path59) - currentNode*(min(1, node26path59) - 1))) &  (currentPath'=(59 * min(1, node26path59) - currentPath*(min(1,node26path59) - 1))) & (success'=min(1, node26path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path60 * min(1,node26path60) - currentNode*(min(1, node26path60) - 1))) &  (currentPath'=(60 * min(1, node26path60) - currentPath*(min(1,node26path60) - 1))) & (success'=min(1, node26path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path61 * min(1,node26path61) - currentNode*(min(1, node26path61) - 1))) &  (currentPath'=(61 * min(1, node26path61) - currentPath*(min(1,node26path61) - 1))) & (success'=min(1, node26path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path62 * min(1,node26path62) - currentNode*(min(1, node26path62) - 1))) &  (currentPath'=(62 * min(1, node26path62) - currentPath*(min(1,node26path62) - 1))) & (success'=min(1, node26path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path63 * min(1,node26path63) - currentNode*(min(1, node26path63) - 1))) &  (currentPath'=(63 * min(1, node26path63) - currentPath*(min(1,node26path63) - 1))) & (success'=min(1, node26path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path64 * min(1,node26path64) - currentNode*(min(1, node26path64) - 1))) &  (currentPath'=(64 * min(1, node26path64) - currentPath*(min(1,node26path64) - 1))) & (success'=min(1, node26path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path65 * min(1,node26path65) - currentNode*(min(1, node26path65) - 1))) &  (currentPath'=(65 * min(1, node26path65) - currentPath*(min(1,node26path65) - 1))) & (success'=min(1, node26path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path66 * min(1,node26path66) - currentNode*(min(1, node26path66) - 1))) &  (currentPath'=(66 * min(1, node26path66) - currentPath*(min(1,node26path66) - 1))) & (success'=min(1, node26path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path67 * min(1,node26path67) - currentNode*(min(1, node26path67) - 1))) &  (currentPath'=(67 * min(1, node26path67) - currentPath*(min(1,node26path67) - 1))) & (success'=min(1, node26path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path68 * min(1,node26path68) - currentNode*(min(1, node26path68) - 1))) &  (currentPath'=(68 * min(1, node26path68) - currentPath*(min(1,node26path68) - 1))) & (success'=min(1, node26path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path69 * min(1,node26path69) - currentNode*(min(1, node26path69) - 1))) &  (currentPath'=(69 * min(1, node26path69) - currentPath*(min(1,node26path69) - 1))) & (success'=min(1, node26path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path70 * min(1,node26path70) - currentNode*(min(1, node26path70) - 1))) &  (currentPath'=(70 * min(1, node26path70) - currentPath*(min(1,node26path70) - 1))) & (success'=min(1, node26path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path71 * min(1,node26path71) - currentNode*(min(1, node26path71) - 1))) &  (currentPath'=(71 * min(1, node26path71) - currentPath*(min(1,node26path71) - 1))) & (success'=min(1, node26path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path72 * min(1,node26path72) - currentNode*(min(1, node26path72) - 1))) &  (currentPath'=(72 * min(1, node26path72) - currentPath*(min(1,node26path72) - 1))) & (success'=min(1, node26path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path73 * min(1,node26path73) - currentNode*(min(1, node26path73) - 1))) &  (currentPath'=(73 * min(1, node26path73) - currentPath*(min(1,node26path73) - 1))) & (success'=min(1, node26path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path74 * min(1,node26path74) - currentNode*(min(1, node26path74) - 1))) &  (currentPath'=(74 * min(1, node26path74) - currentPath*(min(1,node26path74) - 1))) & (success'=min(1, node26path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path75 * min(1,node26path75) - currentNode*(min(1, node26path75) - 1))) &  (currentPath'=(75 * min(1, node26path75) - currentPath*(min(1,node26path75) - 1))) & (success'=min(1, node26path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path76 * min(1,node26path76) - currentNode*(min(1, node26path76) - 1))) &  (currentPath'=(76 * min(1, node26path76) - currentPath*(min(1,node26path76) - 1))) & (success'=min(1, node26path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path77 * min(1,node26path77) - currentNode*(min(1, node26path77) - 1))) &  (currentPath'=(77 * min(1, node26path77) - currentPath*(min(1,node26path77) - 1))) & (success'=min(1, node26path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path78 * min(1,node26path78) - currentNode*(min(1, node26path78) - 1))) &  (currentPath'=(78 * min(1, node26path78) - currentPath*(min(1,node26path78) - 1))) & (success'=min(1, node26path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path79 * min(1,node26path79) - currentNode*(min(1, node26path79) - 1))) &  (currentPath'=(79 * min(1, node26path79) - currentPath*(min(1,node26path79) - 1))) & (success'=min(1, node26path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path80 * min(1,node26path80) - currentNode*(min(1, node26path80) - 1))) &  (currentPath'=(80 * min(1, node26path80) - currentPath*(min(1,node26path80) - 1))) & (success'=min(1, node26path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path81 * min(1,node26path81) - currentNode*(min(1, node26path81) - 1))) &  (currentPath'=(81 * min(1, node26path81) - currentPath*(min(1,node26path81) - 1))) & (success'=min(1, node26path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path82 * min(1,node26path82) - currentNode*(min(1, node26path82) - 1))) &  (currentPath'=(82 * min(1, node26path82) - currentPath*(min(1,node26path82) - 1))) & (success'=min(1, node26path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path83 * min(1,node26path83) - currentNode*(min(1, node26path83) - 1))) &  (currentPath'=(83 * min(1, node26path83) - currentPath*(min(1,node26path83) - 1))) & (success'=min(1, node26path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path84 * min(1,node26path84) - currentNode*(min(1, node26path84) - 1))) &  (currentPath'=(84 * min(1, node26path84) - currentPath*(min(1,node26path84) - 1))) & (success'=min(1, node26path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path85 * min(1,node26path85) - currentNode*(min(1, node26path85) - 1))) &  (currentPath'=(85 * min(1, node26path85) - currentPath*(min(1,node26path85) - 1))) & (success'=min(1, node26path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path86 * min(1,node26path86) - currentNode*(min(1, node26path86) - 1))) &  (currentPath'=(86 * min(1, node26path86) - currentPath*(min(1,node26path86) - 1))) & (success'=min(1, node26path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path87 * min(1,node26path87) - currentNode*(min(1, node26path87) - 1))) &  (currentPath'=(87 * min(1, node26path87) - currentPath*(min(1,node26path87) - 1))) & (success'=min(1, node26path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path88 * min(1,node26path88) - currentNode*(min(1, node26path88) - 1))) &  (currentPath'=(88 * min(1, node26path88) - currentPath*(min(1,node26path88) - 1))) & (success'=min(1, node26path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path89 * min(1,node26path89) - currentNode*(min(1, node26path89) - 1))) &  (currentPath'=(89 * min(1, node26path89) - currentPath*(min(1,node26path89) - 1))) & (success'=min(1, node26path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path90 * min(1,node26path90) - currentNode*(min(1, node26path90) - 1))) &  (currentPath'=(90 * min(1, node26path90) - currentPath*(min(1,node26path90) - 1))) & (success'=min(1, node26path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path91 * min(1,node26path91) - currentNode*(min(1, node26path91) - 1))) &  (currentPath'=(91 * min(1, node26path91) - currentPath*(min(1,node26path91) - 1))) & (success'=min(1, node26path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path92 * min(1,node26path92) - currentNode*(min(1, node26path92) - 1))) &  (currentPath'=(92 * min(1, node26path92) - currentPath*(min(1,node26path92) - 1))) & (success'=min(1, node26path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path93 * min(1,node26path93) - currentNode*(min(1, node26path93) - 1))) &  (currentPath'=(93 * min(1, node26path93) - currentPath*(min(1,node26path93) - 1))) & (success'=min(1, node26path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path94 * min(1,node26path94) - currentNode*(min(1, node26path94) - 1))) &  (currentPath'=(94 * min(1, node26path94) - currentPath*(min(1,node26path94) - 1))) & (success'=min(1, node26path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path95 * min(1,node26path95) - currentNode*(min(1, node26path95) - 1))) &  (currentPath'=(95 * min(1, node26path95) - currentPath*(min(1,node26path95) - 1))) & (success'=min(1, node26path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path96 * min(1,node26path96) - currentNode*(min(1, node26path96) - 1))) &  (currentPath'=(96 * min(1, node26path96) - currentPath*(min(1,node26path96) - 1))) & (success'=min(1, node26path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path97 * min(1,node26path97) - currentNode*(min(1, node26path97) - 1))) &  (currentPath'=(97 * min(1, node26path97) - currentPath*(min(1,node26path97) - 1))) & (success'=min(1, node26path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path98 * min(1,node26path98) - currentNode*(min(1, node26path98) - 1))) &  (currentPath'=(98 * min(1, node26path98) - currentPath*(min(1,node26path98) - 1))) & (success'=min(1, node26path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path99 * min(1,node26path99) - currentNode*(min(1, node26path99) - 1))) &  (currentPath'=(99 * min(1, node26path99) - currentPath*(min(1,node26path99) - 1))) & (success'=min(1, node26path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node26path100 * min(1,node26path100) - currentNode*(min(1, node26path100) - 1))) &  (currentPath'=(100 * min(1, node26path100) - currentPath*(min(1,node26path100) - 1))) & (success'=min(1, node26path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 27) ->
 numPathsInv: (currentNode'=(node27path1 * min(1,node27path1) - currentNode*(min(1, node27path1) - 1))) &  (currentPath'=(1 * min(1, node27path1) - currentPath*(min(1,node27path1) - 1))) & (success'=min(1, node27path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path2 * min(1,node27path2) - currentNode*(min(1, node27path2) - 1))) &  (currentPath'=(2 * min(1, node27path2) - currentPath*(min(1,node27path2) - 1))) & (success'=min(1, node27path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path3 * min(1,node27path3) - currentNode*(min(1, node27path3) - 1))) &  (currentPath'=(3 * min(1, node27path3) - currentPath*(min(1,node27path3) - 1))) & (success'=min(1, node27path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path4 * min(1,node27path4) - currentNode*(min(1, node27path4) - 1))) &  (currentPath'=(4 * min(1, node27path4) - currentPath*(min(1,node27path4) - 1))) & (success'=min(1, node27path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path5 * min(1,node27path5) - currentNode*(min(1, node27path5) - 1))) &  (currentPath'=(5 * min(1, node27path5) - currentPath*(min(1,node27path5) - 1))) & (success'=min(1, node27path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path6 * min(1,node27path6) - currentNode*(min(1, node27path6) - 1))) &  (currentPath'=(6 * min(1, node27path6) - currentPath*(min(1,node27path6) - 1))) & (success'=min(1, node27path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path7 * min(1,node27path7) - currentNode*(min(1, node27path7) - 1))) &  (currentPath'=(7 * min(1, node27path7) - currentPath*(min(1,node27path7) - 1))) & (success'=min(1, node27path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path8 * min(1,node27path8) - currentNode*(min(1, node27path8) - 1))) &  (currentPath'=(8 * min(1, node27path8) - currentPath*(min(1,node27path8) - 1))) & (success'=min(1, node27path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path9 * min(1,node27path9) - currentNode*(min(1, node27path9) - 1))) &  (currentPath'=(9 * min(1, node27path9) - currentPath*(min(1,node27path9) - 1))) & (success'=min(1, node27path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path10 * min(1,node27path10) - currentNode*(min(1, node27path10) - 1))) &  (currentPath'=(10 * min(1, node27path10) - currentPath*(min(1,node27path10) - 1))) & (success'=min(1, node27path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path11 * min(1,node27path11) - currentNode*(min(1, node27path11) - 1))) &  (currentPath'=(11 * min(1, node27path11) - currentPath*(min(1,node27path11) - 1))) & (success'=min(1, node27path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path12 * min(1,node27path12) - currentNode*(min(1, node27path12) - 1))) &  (currentPath'=(12 * min(1, node27path12) - currentPath*(min(1,node27path12) - 1))) & (success'=min(1, node27path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path13 * min(1,node27path13) - currentNode*(min(1, node27path13) - 1))) &  (currentPath'=(13 * min(1, node27path13) - currentPath*(min(1,node27path13) - 1))) & (success'=min(1, node27path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path14 * min(1,node27path14) - currentNode*(min(1, node27path14) - 1))) &  (currentPath'=(14 * min(1, node27path14) - currentPath*(min(1,node27path14) - 1))) & (success'=min(1, node27path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path15 * min(1,node27path15) - currentNode*(min(1, node27path15) - 1))) &  (currentPath'=(15 * min(1, node27path15) - currentPath*(min(1,node27path15) - 1))) & (success'=min(1, node27path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path16 * min(1,node27path16) - currentNode*(min(1, node27path16) - 1))) &  (currentPath'=(16 * min(1, node27path16) - currentPath*(min(1,node27path16) - 1))) & (success'=min(1, node27path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path17 * min(1,node27path17) - currentNode*(min(1, node27path17) - 1))) &  (currentPath'=(17 * min(1, node27path17) - currentPath*(min(1,node27path17) - 1))) & (success'=min(1, node27path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path18 * min(1,node27path18) - currentNode*(min(1, node27path18) - 1))) &  (currentPath'=(18 * min(1, node27path18) - currentPath*(min(1,node27path18) - 1))) & (success'=min(1, node27path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path19 * min(1,node27path19) - currentNode*(min(1, node27path19) - 1))) &  (currentPath'=(19 * min(1, node27path19) - currentPath*(min(1,node27path19) - 1))) & (success'=min(1, node27path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path20 * min(1,node27path20) - currentNode*(min(1, node27path20) - 1))) &  (currentPath'=(20 * min(1, node27path20) - currentPath*(min(1,node27path20) - 1))) & (success'=min(1, node27path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path21 * min(1,node27path21) - currentNode*(min(1, node27path21) - 1))) &  (currentPath'=(21 * min(1, node27path21) - currentPath*(min(1,node27path21) - 1))) & (success'=min(1, node27path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path22 * min(1,node27path22) - currentNode*(min(1, node27path22) - 1))) &  (currentPath'=(22 * min(1, node27path22) - currentPath*(min(1,node27path22) - 1))) & (success'=min(1, node27path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path23 * min(1,node27path23) - currentNode*(min(1, node27path23) - 1))) &  (currentPath'=(23 * min(1, node27path23) - currentPath*(min(1,node27path23) - 1))) & (success'=min(1, node27path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path24 * min(1,node27path24) - currentNode*(min(1, node27path24) - 1))) &  (currentPath'=(24 * min(1, node27path24) - currentPath*(min(1,node27path24) - 1))) & (success'=min(1, node27path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path25 * min(1,node27path25) - currentNode*(min(1, node27path25) - 1))) &  (currentPath'=(25 * min(1, node27path25) - currentPath*(min(1,node27path25) - 1))) & (success'=min(1, node27path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path26 * min(1,node27path26) - currentNode*(min(1, node27path26) - 1))) &  (currentPath'=(26 * min(1, node27path26) - currentPath*(min(1,node27path26) - 1))) & (success'=min(1, node27path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path27 * min(1,node27path27) - currentNode*(min(1, node27path27) - 1))) &  (currentPath'=(27 * min(1, node27path27) - currentPath*(min(1,node27path27) - 1))) & (success'=min(1, node27path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path28 * min(1,node27path28) - currentNode*(min(1, node27path28) - 1))) &  (currentPath'=(28 * min(1, node27path28) - currentPath*(min(1,node27path28) - 1))) & (success'=min(1, node27path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path29 * min(1,node27path29) - currentNode*(min(1, node27path29) - 1))) &  (currentPath'=(29 * min(1, node27path29) - currentPath*(min(1,node27path29) - 1))) & (success'=min(1, node27path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path30 * min(1,node27path30) - currentNode*(min(1, node27path30) - 1))) &  (currentPath'=(30 * min(1, node27path30) - currentPath*(min(1,node27path30) - 1))) & (success'=min(1, node27path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path31 * min(1,node27path31) - currentNode*(min(1, node27path31) - 1))) &  (currentPath'=(31 * min(1, node27path31) - currentPath*(min(1,node27path31) - 1))) & (success'=min(1, node27path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path32 * min(1,node27path32) - currentNode*(min(1, node27path32) - 1))) &  (currentPath'=(32 * min(1, node27path32) - currentPath*(min(1,node27path32) - 1))) & (success'=min(1, node27path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path33 * min(1,node27path33) - currentNode*(min(1, node27path33) - 1))) &  (currentPath'=(33 * min(1, node27path33) - currentPath*(min(1,node27path33) - 1))) & (success'=min(1, node27path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path34 * min(1,node27path34) - currentNode*(min(1, node27path34) - 1))) &  (currentPath'=(34 * min(1, node27path34) - currentPath*(min(1,node27path34) - 1))) & (success'=min(1, node27path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path35 * min(1,node27path35) - currentNode*(min(1, node27path35) - 1))) &  (currentPath'=(35 * min(1, node27path35) - currentPath*(min(1,node27path35) - 1))) & (success'=min(1, node27path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path36 * min(1,node27path36) - currentNode*(min(1, node27path36) - 1))) &  (currentPath'=(36 * min(1, node27path36) - currentPath*(min(1,node27path36) - 1))) & (success'=min(1, node27path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path37 * min(1,node27path37) - currentNode*(min(1, node27path37) - 1))) &  (currentPath'=(37 * min(1, node27path37) - currentPath*(min(1,node27path37) - 1))) & (success'=min(1, node27path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path38 * min(1,node27path38) - currentNode*(min(1, node27path38) - 1))) &  (currentPath'=(38 * min(1, node27path38) - currentPath*(min(1,node27path38) - 1))) & (success'=min(1, node27path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path39 * min(1,node27path39) - currentNode*(min(1, node27path39) - 1))) &  (currentPath'=(39 * min(1, node27path39) - currentPath*(min(1,node27path39) - 1))) & (success'=min(1, node27path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path40 * min(1,node27path40) - currentNode*(min(1, node27path40) - 1))) &  (currentPath'=(40 * min(1, node27path40) - currentPath*(min(1,node27path40) - 1))) & (success'=min(1, node27path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path41 * min(1,node27path41) - currentNode*(min(1, node27path41) - 1))) &  (currentPath'=(41 * min(1, node27path41) - currentPath*(min(1,node27path41) - 1))) & (success'=min(1, node27path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path42 * min(1,node27path42) - currentNode*(min(1, node27path42) - 1))) &  (currentPath'=(42 * min(1, node27path42) - currentPath*(min(1,node27path42) - 1))) & (success'=min(1, node27path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path43 * min(1,node27path43) - currentNode*(min(1, node27path43) - 1))) &  (currentPath'=(43 * min(1, node27path43) - currentPath*(min(1,node27path43) - 1))) & (success'=min(1, node27path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path44 * min(1,node27path44) - currentNode*(min(1, node27path44) - 1))) &  (currentPath'=(44 * min(1, node27path44) - currentPath*(min(1,node27path44) - 1))) & (success'=min(1, node27path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path45 * min(1,node27path45) - currentNode*(min(1, node27path45) - 1))) &  (currentPath'=(45 * min(1, node27path45) - currentPath*(min(1,node27path45) - 1))) & (success'=min(1, node27path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path46 * min(1,node27path46) - currentNode*(min(1, node27path46) - 1))) &  (currentPath'=(46 * min(1, node27path46) - currentPath*(min(1,node27path46) - 1))) & (success'=min(1, node27path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path47 * min(1,node27path47) - currentNode*(min(1, node27path47) - 1))) &  (currentPath'=(47 * min(1, node27path47) - currentPath*(min(1,node27path47) - 1))) & (success'=min(1, node27path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path48 * min(1,node27path48) - currentNode*(min(1, node27path48) - 1))) &  (currentPath'=(48 * min(1, node27path48) - currentPath*(min(1,node27path48) - 1))) & (success'=min(1, node27path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path49 * min(1,node27path49) - currentNode*(min(1, node27path49) - 1))) &  (currentPath'=(49 * min(1, node27path49) - currentPath*(min(1,node27path49) - 1))) & (success'=min(1, node27path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path50 * min(1,node27path50) - currentNode*(min(1, node27path50) - 1))) &  (currentPath'=(50 * min(1, node27path50) - currentPath*(min(1,node27path50) - 1))) & (success'=min(1, node27path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path51 * min(1,node27path51) - currentNode*(min(1, node27path51) - 1))) &  (currentPath'=(51 * min(1, node27path51) - currentPath*(min(1,node27path51) - 1))) & (success'=min(1, node27path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path52 * min(1,node27path52) - currentNode*(min(1, node27path52) - 1))) &  (currentPath'=(52 * min(1, node27path52) - currentPath*(min(1,node27path52) - 1))) & (success'=min(1, node27path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path53 * min(1,node27path53) - currentNode*(min(1, node27path53) - 1))) &  (currentPath'=(53 * min(1, node27path53) - currentPath*(min(1,node27path53) - 1))) & (success'=min(1, node27path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path54 * min(1,node27path54) - currentNode*(min(1, node27path54) - 1))) &  (currentPath'=(54 * min(1, node27path54) - currentPath*(min(1,node27path54) - 1))) & (success'=min(1, node27path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path55 * min(1,node27path55) - currentNode*(min(1, node27path55) - 1))) &  (currentPath'=(55 * min(1, node27path55) - currentPath*(min(1,node27path55) - 1))) & (success'=min(1, node27path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path56 * min(1,node27path56) - currentNode*(min(1, node27path56) - 1))) &  (currentPath'=(56 * min(1, node27path56) - currentPath*(min(1,node27path56) - 1))) & (success'=min(1, node27path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path57 * min(1,node27path57) - currentNode*(min(1, node27path57) - 1))) &  (currentPath'=(57 * min(1, node27path57) - currentPath*(min(1,node27path57) - 1))) & (success'=min(1, node27path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path58 * min(1,node27path58) - currentNode*(min(1, node27path58) - 1))) &  (currentPath'=(58 * min(1, node27path58) - currentPath*(min(1,node27path58) - 1))) & (success'=min(1, node27path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path59 * min(1,node27path59) - currentNode*(min(1, node27path59) - 1))) &  (currentPath'=(59 * min(1, node27path59) - currentPath*(min(1,node27path59) - 1))) & (success'=min(1, node27path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path60 * min(1,node27path60) - currentNode*(min(1, node27path60) - 1))) &  (currentPath'=(60 * min(1, node27path60) - currentPath*(min(1,node27path60) - 1))) & (success'=min(1, node27path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path61 * min(1,node27path61) - currentNode*(min(1, node27path61) - 1))) &  (currentPath'=(61 * min(1, node27path61) - currentPath*(min(1,node27path61) - 1))) & (success'=min(1, node27path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path62 * min(1,node27path62) - currentNode*(min(1, node27path62) - 1))) &  (currentPath'=(62 * min(1, node27path62) - currentPath*(min(1,node27path62) - 1))) & (success'=min(1, node27path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path63 * min(1,node27path63) - currentNode*(min(1, node27path63) - 1))) &  (currentPath'=(63 * min(1, node27path63) - currentPath*(min(1,node27path63) - 1))) & (success'=min(1, node27path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path64 * min(1,node27path64) - currentNode*(min(1, node27path64) - 1))) &  (currentPath'=(64 * min(1, node27path64) - currentPath*(min(1,node27path64) - 1))) & (success'=min(1, node27path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path65 * min(1,node27path65) - currentNode*(min(1, node27path65) - 1))) &  (currentPath'=(65 * min(1, node27path65) - currentPath*(min(1,node27path65) - 1))) & (success'=min(1, node27path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path66 * min(1,node27path66) - currentNode*(min(1, node27path66) - 1))) &  (currentPath'=(66 * min(1, node27path66) - currentPath*(min(1,node27path66) - 1))) & (success'=min(1, node27path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path67 * min(1,node27path67) - currentNode*(min(1, node27path67) - 1))) &  (currentPath'=(67 * min(1, node27path67) - currentPath*(min(1,node27path67) - 1))) & (success'=min(1, node27path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path68 * min(1,node27path68) - currentNode*(min(1, node27path68) - 1))) &  (currentPath'=(68 * min(1, node27path68) - currentPath*(min(1,node27path68) - 1))) & (success'=min(1, node27path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path69 * min(1,node27path69) - currentNode*(min(1, node27path69) - 1))) &  (currentPath'=(69 * min(1, node27path69) - currentPath*(min(1,node27path69) - 1))) & (success'=min(1, node27path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path70 * min(1,node27path70) - currentNode*(min(1, node27path70) - 1))) &  (currentPath'=(70 * min(1, node27path70) - currentPath*(min(1,node27path70) - 1))) & (success'=min(1, node27path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path71 * min(1,node27path71) - currentNode*(min(1, node27path71) - 1))) &  (currentPath'=(71 * min(1, node27path71) - currentPath*(min(1,node27path71) - 1))) & (success'=min(1, node27path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path72 * min(1,node27path72) - currentNode*(min(1, node27path72) - 1))) &  (currentPath'=(72 * min(1, node27path72) - currentPath*(min(1,node27path72) - 1))) & (success'=min(1, node27path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path73 * min(1,node27path73) - currentNode*(min(1, node27path73) - 1))) &  (currentPath'=(73 * min(1, node27path73) - currentPath*(min(1,node27path73) - 1))) & (success'=min(1, node27path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path74 * min(1,node27path74) - currentNode*(min(1, node27path74) - 1))) &  (currentPath'=(74 * min(1, node27path74) - currentPath*(min(1,node27path74) - 1))) & (success'=min(1, node27path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path75 * min(1,node27path75) - currentNode*(min(1, node27path75) - 1))) &  (currentPath'=(75 * min(1, node27path75) - currentPath*(min(1,node27path75) - 1))) & (success'=min(1, node27path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path76 * min(1,node27path76) - currentNode*(min(1, node27path76) - 1))) &  (currentPath'=(76 * min(1, node27path76) - currentPath*(min(1,node27path76) - 1))) & (success'=min(1, node27path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path77 * min(1,node27path77) - currentNode*(min(1, node27path77) - 1))) &  (currentPath'=(77 * min(1, node27path77) - currentPath*(min(1,node27path77) - 1))) & (success'=min(1, node27path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path78 * min(1,node27path78) - currentNode*(min(1, node27path78) - 1))) &  (currentPath'=(78 * min(1, node27path78) - currentPath*(min(1,node27path78) - 1))) & (success'=min(1, node27path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path79 * min(1,node27path79) - currentNode*(min(1, node27path79) - 1))) &  (currentPath'=(79 * min(1, node27path79) - currentPath*(min(1,node27path79) - 1))) & (success'=min(1, node27path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path80 * min(1,node27path80) - currentNode*(min(1, node27path80) - 1))) &  (currentPath'=(80 * min(1, node27path80) - currentPath*(min(1,node27path80) - 1))) & (success'=min(1, node27path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path81 * min(1,node27path81) - currentNode*(min(1, node27path81) - 1))) &  (currentPath'=(81 * min(1, node27path81) - currentPath*(min(1,node27path81) - 1))) & (success'=min(1, node27path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path82 * min(1,node27path82) - currentNode*(min(1, node27path82) - 1))) &  (currentPath'=(82 * min(1, node27path82) - currentPath*(min(1,node27path82) - 1))) & (success'=min(1, node27path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path83 * min(1,node27path83) - currentNode*(min(1, node27path83) - 1))) &  (currentPath'=(83 * min(1, node27path83) - currentPath*(min(1,node27path83) - 1))) & (success'=min(1, node27path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path84 * min(1,node27path84) - currentNode*(min(1, node27path84) - 1))) &  (currentPath'=(84 * min(1, node27path84) - currentPath*(min(1,node27path84) - 1))) & (success'=min(1, node27path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path85 * min(1,node27path85) - currentNode*(min(1, node27path85) - 1))) &  (currentPath'=(85 * min(1, node27path85) - currentPath*(min(1,node27path85) - 1))) & (success'=min(1, node27path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path86 * min(1,node27path86) - currentNode*(min(1, node27path86) - 1))) &  (currentPath'=(86 * min(1, node27path86) - currentPath*(min(1,node27path86) - 1))) & (success'=min(1, node27path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path87 * min(1,node27path87) - currentNode*(min(1, node27path87) - 1))) &  (currentPath'=(87 * min(1, node27path87) - currentPath*(min(1,node27path87) - 1))) & (success'=min(1, node27path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path88 * min(1,node27path88) - currentNode*(min(1, node27path88) - 1))) &  (currentPath'=(88 * min(1, node27path88) - currentPath*(min(1,node27path88) - 1))) & (success'=min(1, node27path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path89 * min(1,node27path89) - currentNode*(min(1, node27path89) - 1))) &  (currentPath'=(89 * min(1, node27path89) - currentPath*(min(1,node27path89) - 1))) & (success'=min(1, node27path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path90 * min(1,node27path90) - currentNode*(min(1, node27path90) - 1))) &  (currentPath'=(90 * min(1, node27path90) - currentPath*(min(1,node27path90) - 1))) & (success'=min(1, node27path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path91 * min(1,node27path91) - currentNode*(min(1, node27path91) - 1))) &  (currentPath'=(91 * min(1, node27path91) - currentPath*(min(1,node27path91) - 1))) & (success'=min(1, node27path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path92 * min(1,node27path92) - currentNode*(min(1, node27path92) - 1))) &  (currentPath'=(92 * min(1, node27path92) - currentPath*(min(1,node27path92) - 1))) & (success'=min(1, node27path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path93 * min(1,node27path93) - currentNode*(min(1, node27path93) - 1))) &  (currentPath'=(93 * min(1, node27path93) - currentPath*(min(1,node27path93) - 1))) & (success'=min(1, node27path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path94 * min(1,node27path94) - currentNode*(min(1, node27path94) - 1))) &  (currentPath'=(94 * min(1, node27path94) - currentPath*(min(1,node27path94) - 1))) & (success'=min(1, node27path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path95 * min(1,node27path95) - currentNode*(min(1, node27path95) - 1))) &  (currentPath'=(95 * min(1, node27path95) - currentPath*(min(1,node27path95) - 1))) & (success'=min(1, node27path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path96 * min(1,node27path96) - currentNode*(min(1, node27path96) - 1))) &  (currentPath'=(96 * min(1, node27path96) - currentPath*(min(1,node27path96) - 1))) & (success'=min(1, node27path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path97 * min(1,node27path97) - currentNode*(min(1, node27path97) - 1))) &  (currentPath'=(97 * min(1, node27path97) - currentPath*(min(1,node27path97) - 1))) & (success'=min(1, node27path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path98 * min(1,node27path98) - currentNode*(min(1, node27path98) - 1))) &  (currentPath'=(98 * min(1, node27path98) - currentPath*(min(1,node27path98) - 1))) & (success'=min(1, node27path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path99 * min(1,node27path99) - currentNode*(min(1, node27path99) - 1))) &  (currentPath'=(99 * min(1, node27path99) - currentPath*(min(1,node27path99) - 1))) & (success'=min(1, node27path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node27path100 * min(1,node27path100) - currentNode*(min(1, node27path100) - 1))) &  (currentPath'=(100 * min(1, node27path100) - currentPath*(min(1,node27path100) - 1))) & (success'=min(1, node27path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 28) ->
 numPathsInv: (currentNode'=(node28path1 * min(1,node28path1) - currentNode*(min(1, node28path1) - 1))) &  (currentPath'=(1 * min(1, node28path1) - currentPath*(min(1,node28path1) - 1))) & (success'=min(1, node28path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path2 * min(1,node28path2) - currentNode*(min(1, node28path2) - 1))) &  (currentPath'=(2 * min(1, node28path2) - currentPath*(min(1,node28path2) - 1))) & (success'=min(1, node28path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path3 * min(1,node28path3) - currentNode*(min(1, node28path3) - 1))) &  (currentPath'=(3 * min(1, node28path3) - currentPath*(min(1,node28path3) - 1))) & (success'=min(1, node28path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path4 * min(1,node28path4) - currentNode*(min(1, node28path4) - 1))) &  (currentPath'=(4 * min(1, node28path4) - currentPath*(min(1,node28path4) - 1))) & (success'=min(1, node28path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path5 * min(1,node28path5) - currentNode*(min(1, node28path5) - 1))) &  (currentPath'=(5 * min(1, node28path5) - currentPath*(min(1,node28path5) - 1))) & (success'=min(1, node28path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path6 * min(1,node28path6) - currentNode*(min(1, node28path6) - 1))) &  (currentPath'=(6 * min(1, node28path6) - currentPath*(min(1,node28path6) - 1))) & (success'=min(1, node28path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path7 * min(1,node28path7) - currentNode*(min(1, node28path7) - 1))) &  (currentPath'=(7 * min(1, node28path7) - currentPath*(min(1,node28path7) - 1))) & (success'=min(1, node28path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path8 * min(1,node28path8) - currentNode*(min(1, node28path8) - 1))) &  (currentPath'=(8 * min(1, node28path8) - currentPath*(min(1,node28path8) - 1))) & (success'=min(1, node28path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path9 * min(1,node28path9) - currentNode*(min(1, node28path9) - 1))) &  (currentPath'=(9 * min(1, node28path9) - currentPath*(min(1,node28path9) - 1))) & (success'=min(1, node28path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path10 * min(1,node28path10) - currentNode*(min(1, node28path10) - 1))) &  (currentPath'=(10 * min(1, node28path10) - currentPath*(min(1,node28path10) - 1))) & (success'=min(1, node28path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path11 * min(1,node28path11) - currentNode*(min(1, node28path11) - 1))) &  (currentPath'=(11 * min(1, node28path11) - currentPath*(min(1,node28path11) - 1))) & (success'=min(1, node28path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path12 * min(1,node28path12) - currentNode*(min(1, node28path12) - 1))) &  (currentPath'=(12 * min(1, node28path12) - currentPath*(min(1,node28path12) - 1))) & (success'=min(1, node28path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path13 * min(1,node28path13) - currentNode*(min(1, node28path13) - 1))) &  (currentPath'=(13 * min(1, node28path13) - currentPath*(min(1,node28path13) - 1))) & (success'=min(1, node28path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path14 * min(1,node28path14) - currentNode*(min(1, node28path14) - 1))) &  (currentPath'=(14 * min(1, node28path14) - currentPath*(min(1,node28path14) - 1))) & (success'=min(1, node28path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path15 * min(1,node28path15) - currentNode*(min(1, node28path15) - 1))) &  (currentPath'=(15 * min(1, node28path15) - currentPath*(min(1,node28path15) - 1))) & (success'=min(1, node28path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path16 * min(1,node28path16) - currentNode*(min(1, node28path16) - 1))) &  (currentPath'=(16 * min(1, node28path16) - currentPath*(min(1,node28path16) - 1))) & (success'=min(1, node28path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path17 * min(1,node28path17) - currentNode*(min(1, node28path17) - 1))) &  (currentPath'=(17 * min(1, node28path17) - currentPath*(min(1,node28path17) - 1))) & (success'=min(1, node28path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path18 * min(1,node28path18) - currentNode*(min(1, node28path18) - 1))) &  (currentPath'=(18 * min(1, node28path18) - currentPath*(min(1,node28path18) - 1))) & (success'=min(1, node28path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path19 * min(1,node28path19) - currentNode*(min(1, node28path19) - 1))) &  (currentPath'=(19 * min(1, node28path19) - currentPath*(min(1,node28path19) - 1))) & (success'=min(1, node28path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path20 * min(1,node28path20) - currentNode*(min(1, node28path20) - 1))) &  (currentPath'=(20 * min(1, node28path20) - currentPath*(min(1,node28path20) - 1))) & (success'=min(1, node28path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path21 * min(1,node28path21) - currentNode*(min(1, node28path21) - 1))) &  (currentPath'=(21 * min(1, node28path21) - currentPath*(min(1,node28path21) - 1))) & (success'=min(1, node28path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path22 * min(1,node28path22) - currentNode*(min(1, node28path22) - 1))) &  (currentPath'=(22 * min(1, node28path22) - currentPath*(min(1,node28path22) - 1))) & (success'=min(1, node28path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path23 * min(1,node28path23) - currentNode*(min(1, node28path23) - 1))) &  (currentPath'=(23 * min(1, node28path23) - currentPath*(min(1,node28path23) - 1))) & (success'=min(1, node28path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path24 * min(1,node28path24) - currentNode*(min(1, node28path24) - 1))) &  (currentPath'=(24 * min(1, node28path24) - currentPath*(min(1,node28path24) - 1))) & (success'=min(1, node28path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path25 * min(1,node28path25) - currentNode*(min(1, node28path25) - 1))) &  (currentPath'=(25 * min(1, node28path25) - currentPath*(min(1,node28path25) - 1))) & (success'=min(1, node28path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path26 * min(1,node28path26) - currentNode*(min(1, node28path26) - 1))) &  (currentPath'=(26 * min(1, node28path26) - currentPath*(min(1,node28path26) - 1))) & (success'=min(1, node28path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path27 * min(1,node28path27) - currentNode*(min(1, node28path27) - 1))) &  (currentPath'=(27 * min(1, node28path27) - currentPath*(min(1,node28path27) - 1))) & (success'=min(1, node28path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path28 * min(1,node28path28) - currentNode*(min(1, node28path28) - 1))) &  (currentPath'=(28 * min(1, node28path28) - currentPath*(min(1,node28path28) - 1))) & (success'=min(1, node28path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path29 * min(1,node28path29) - currentNode*(min(1, node28path29) - 1))) &  (currentPath'=(29 * min(1, node28path29) - currentPath*(min(1,node28path29) - 1))) & (success'=min(1, node28path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path30 * min(1,node28path30) - currentNode*(min(1, node28path30) - 1))) &  (currentPath'=(30 * min(1, node28path30) - currentPath*(min(1,node28path30) - 1))) & (success'=min(1, node28path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path31 * min(1,node28path31) - currentNode*(min(1, node28path31) - 1))) &  (currentPath'=(31 * min(1, node28path31) - currentPath*(min(1,node28path31) - 1))) & (success'=min(1, node28path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path32 * min(1,node28path32) - currentNode*(min(1, node28path32) - 1))) &  (currentPath'=(32 * min(1, node28path32) - currentPath*(min(1,node28path32) - 1))) & (success'=min(1, node28path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path33 * min(1,node28path33) - currentNode*(min(1, node28path33) - 1))) &  (currentPath'=(33 * min(1, node28path33) - currentPath*(min(1,node28path33) - 1))) & (success'=min(1, node28path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path34 * min(1,node28path34) - currentNode*(min(1, node28path34) - 1))) &  (currentPath'=(34 * min(1, node28path34) - currentPath*(min(1,node28path34) - 1))) & (success'=min(1, node28path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path35 * min(1,node28path35) - currentNode*(min(1, node28path35) - 1))) &  (currentPath'=(35 * min(1, node28path35) - currentPath*(min(1,node28path35) - 1))) & (success'=min(1, node28path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path36 * min(1,node28path36) - currentNode*(min(1, node28path36) - 1))) &  (currentPath'=(36 * min(1, node28path36) - currentPath*(min(1,node28path36) - 1))) & (success'=min(1, node28path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path37 * min(1,node28path37) - currentNode*(min(1, node28path37) - 1))) &  (currentPath'=(37 * min(1, node28path37) - currentPath*(min(1,node28path37) - 1))) & (success'=min(1, node28path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path38 * min(1,node28path38) - currentNode*(min(1, node28path38) - 1))) &  (currentPath'=(38 * min(1, node28path38) - currentPath*(min(1,node28path38) - 1))) & (success'=min(1, node28path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path39 * min(1,node28path39) - currentNode*(min(1, node28path39) - 1))) &  (currentPath'=(39 * min(1, node28path39) - currentPath*(min(1,node28path39) - 1))) & (success'=min(1, node28path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path40 * min(1,node28path40) - currentNode*(min(1, node28path40) - 1))) &  (currentPath'=(40 * min(1, node28path40) - currentPath*(min(1,node28path40) - 1))) & (success'=min(1, node28path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path41 * min(1,node28path41) - currentNode*(min(1, node28path41) - 1))) &  (currentPath'=(41 * min(1, node28path41) - currentPath*(min(1,node28path41) - 1))) & (success'=min(1, node28path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path42 * min(1,node28path42) - currentNode*(min(1, node28path42) - 1))) &  (currentPath'=(42 * min(1, node28path42) - currentPath*(min(1,node28path42) - 1))) & (success'=min(1, node28path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path43 * min(1,node28path43) - currentNode*(min(1, node28path43) - 1))) &  (currentPath'=(43 * min(1, node28path43) - currentPath*(min(1,node28path43) - 1))) & (success'=min(1, node28path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path44 * min(1,node28path44) - currentNode*(min(1, node28path44) - 1))) &  (currentPath'=(44 * min(1, node28path44) - currentPath*(min(1,node28path44) - 1))) & (success'=min(1, node28path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path45 * min(1,node28path45) - currentNode*(min(1, node28path45) - 1))) &  (currentPath'=(45 * min(1, node28path45) - currentPath*(min(1,node28path45) - 1))) & (success'=min(1, node28path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path46 * min(1,node28path46) - currentNode*(min(1, node28path46) - 1))) &  (currentPath'=(46 * min(1, node28path46) - currentPath*(min(1,node28path46) - 1))) & (success'=min(1, node28path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path47 * min(1,node28path47) - currentNode*(min(1, node28path47) - 1))) &  (currentPath'=(47 * min(1, node28path47) - currentPath*(min(1,node28path47) - 1))) & (success'=min(1, node28path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path48 * min(1,node28path48) - currentNode*(min(1, node28path48) - 1))) &  (currentPath'=(48 * min(1, node28path48) - currentPath*(min(1,node28path48) - 1))) & (success'=min(1, node28path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path49 * min(1,node28path49) - currentNode*(min(1, node28path49) - 1))) &  (currentPath'=(49 * min(1, node28path49) - currentPath*(min(1,node28path49) - 1))) & (success'=min(1, node28path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path50 * min(1,node28path50) - currentNode*(min(1, node28path50) - 1))) &  (currentPath'=(50 * min(1, node28path50) - currentPath*(min(1,node28path50) - 1))) & (success'=min(1, node28path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path51 * min(1,node28path51) - currentNode*(min(1, node28path51) - 1))) &  (currentPath'=(51 * min(1, node28path51) - currentPath*(min(1,node28path51) - 1))) & (success'=min(1, node28path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path52 * min(1,node28path52) - currentNode*(min(1, node28path52) - 1))) &  (currentPath'=(52 * min(1, node28path52) - currentPath*(min(1,node28path52) - 1))) & (success'=min(1, node28path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path53 * min(1,node28path53) - currentNode*(min(1, node28path53) - 1))) &  (currentPath'=(53 * min(1, node28path53) - currentPath*(min(1,node28path53) - 1))) & (success'=min(1, node28path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path54 * min(1,node28path54) - currentNode*(min(1, node28path54) - 1))) &  (currentPath'=(54 * min(1, node28path54) - currentPath*(min(1,node28path54) - 1))) & (success'=min(1, node28path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path55 * min(1,node28path55) - currentNode*(min(1, node28path55) - 1))) &  (currentPath'=(55 * min(1, node28path55) - currentPath*(min(1,node28path55) - 1))) & (success'=min(1, node28path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path56 * min(1,node28path56) - currentNode*(min(1, node28path56) - 1))) &  (currentPath'=(56 * min(1, node28path56) - currentPath*(min(1,node28path56) - 1))) & (success'=min(1, node28path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path57 * min(1,node28path57) - currentNode*(min(1, node28path57) - 1))) &  (currentPath'=(57 * min(1, node28path57) - currentPath*(min(1,node28path57) - 1))) & (success'=min(1, node28path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path58 * min(1,node28path58) - currentNode*(min(1, node28path58) - 1))) &  (currentPath'=(58 * min(1, node28path58) - currentPath*(min(1,node28path58) - 1))) & (success'=min(1, node28path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path59 * min(1,node28path59) - currentNode*(min(1, node28path59) - 1))) &  (currentPath'=(59 * min(1, node28path59) - currentPath*(min(1,node28path59) - 1))) & (success'=min(1, node28path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path60 * min(1,node28path60) - currentNode*(min(1, node28path60) - 1))) &  (currentPath'=(60 * min(1, node28path60) - currentPath*(min(1,node28path60) - 1))) & (success'=min(1, node28path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path61 * min(1,node28path61) - currentNode*(min(1, node28path61) - 1))) &  (currentPath'=(61 * min(1, node28path61) - currentPath*(min(1,node28path61) - 1))) & (success'=min(1, node28path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path62 * min(1,node28path62) - currentNode*(min(1, node28path62) - 1))) &  (currentPath'=(62 * min(1, node28path62) - currentPath*(min(1,node28path62) - 1))) & (success'=min(1, node28path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path63 * min(1,node28path63) - currentNode*(min(1, node28path63) - 1))) &  (currentPath'=(63 * min(1, node28path63) - currentPath*(min(1,node28path63) - 1))) & (success'=min(1, node28path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path64 * min(1,node28path64) - currentNode*(min(1, node28path64) - 1))) &  (currentPath'=(64 * min(1, node28path64) - currentPath*(min(1,node28path64) - 1))) & (success'=min(1, node28path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path65 * min(1,node28path65) - currentNode*(min(1, node28path65) - 1))) &  (currentPath'=(65 * min(1, node28path65) - currentPath*(min(1,node28path65) - 1))) & (success'=min(1, node28path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path66 * min(1,node28path66) - currentNode*(min(1, node28path66) - 1))) &  (currentPath'=(66 * min(1, node28path66) - currentPath*(min(1,node28path66) - 1))) & (success'=min(1, node28path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path67 * min(1,node28path67) - currentNode*(min(1, node28path67) - 1))) &  (currentPath'=(67 * min(1, node28path67) - currentPath*(min(1,node28path67) - 1))) & (success'=min(1, node28path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path68 * min(1,node28path68) - currentNode*(min(1, node28path68) - 1))) &  (currentPath'=(68 * min(1, node28path68) - currentPath*(min(1,node28path68) - 1))) & (success'=min(1, node28path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path69 * min(1,node28path69) - currentNode*(min(1, node28path69) - 1))) &  (currentPath'=(69 * min(1, node28path69) - currentPath*(min(1,node28path69) - 1))) & (success'=min(1, node28path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path70 * min(1,node28path70) - currentNode*(min(1, node28path70) - 1))) &  (currentPath'=(70 * min(1, node28path70) - currentPath*(min(1,node28path70) - 1))) & (success'=min(1, node28path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path71 * min(1,node28path71) - currentNode*(min(1, node28path71) - 1))) &  (currentPath'=(71 * min(1, node28path71) - currentPath*(min(1,node28path71) - 1))) & (success'=min(1, node28path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path72 * min(1,node28path72) - currentNode*(min(1, node28path72) - 1))) &  (currentPath'=(72 * min(1, node28path72) - currentPath*(min(1,node28path72) - 1))) & (success'=min(1, node28path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path73 * min(1,node28path73) - currentNode*(min(1, node28path73) - 1))) &  (currentPath'=(73 * min(1, node28path73) - currentPath*(min(1,node28path73) - 1))) & (success'=min(1, node28path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path74 * min(1,node28path74) - currentNode*(min(1, node28path74) - 1))) &  (currentPath'=(74 * min(1, node28path74) - currentPath*(min(1,node28path74) - 1))) & (success'=min(1, node28path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path75 * min(1,node28path75) - currentNode*(min(1, node28path75) - 1))) &  (currentPath'=(75 * min(1, node28path75) - currentPath*(min(1,node28path75) - 1))) & (success'=min(1, node28path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path76 * min(1,node28path76) - currentNode*(min(1, node28path76) - 1))) &  (currentPath'=(76 * min(1, node28path76) - currentPath*(min(1,node28path76) - 1))) & (success'=min(1, node28path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path77 * min(1,node28path77) - currentNode*(min(1, node28path77) - 1))) &  (currentPath'=(77 * min(1, node28path77) - currentPath*(min(1,node28path77) - 1))) & (success'=min(1, node28path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path78 * min(1,node28path78) - currentNode*(min(1, node28path78) - 1))) &  (currentPath'=(78 * min(1, node28path78) - currentPath*(min(1,node28path78) - 1))) & (success'=min(1, node28path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path79 * min(1,node28path79) - currentNode*(min(1, node28path79) - 1))) &  (currentPath'=(79 * min(1, node28path79) - currentPath*(min(1,node28path79) - 1))) & (success'=min(1, node28path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path80 * min(1,node28path80) - currentNode*(min(1, node28path80) - 1))) &  (currentPath'=(80 * min(1, node28path80) - currentPath*(min(1,node28path80) - 1))) & (success'=min(1, node28path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path81 * min(1,node28path81) - currentNode*(min(1, node28path81) - 1))) &  (currentPath'=(81 * min(1, node28path81) - currentPath*(min(1,node28path81) - 1))) & (success'=min(1, node28path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path82 * min(1,node28path82) - currentNode*(min(1, node28path82) - 1))) &  (currentPath'=(82 * min(1, node28path82) - currentPath*(min(1,node28path82) - 1))) & (success'=min(1, node28path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path83 * min(1,node28path83) - currentNode*(min(1, node28path83) - 1))) &  (currentPath'=(83 * min(1, node28path83) - currentPath*(min(1,node28path83) - 1))) & (success'=min(1, node28path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path84 * min(1,node28path84) - currentNode*(min(1, node28path84) - 1))) &  (currentPath'=(84 * min(1, node28path84) - currentPath*(min(1,node28path84) - 1))) & (success'=min(1, node28path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path85 * min(1,node28path85) - currentNode*(min(1, node28path85) - 1))) &  (currentPath'=(85 * min(1, node28path85) - currentPath*(min(1,node28path85) - 1))) & (success'=min(1, node28path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path86 * min(1,node28path86) - currentNode*(min(1, node28path86) - 1))) &  (currentPath'=(86 * min(1, node28path86) - currentPath*(min(1,node28path86) - 1))) & (success'=min(1, node28path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path87 * min(1,node28path87) - currentNode*(min(1, node28path87) - 1))) &  (currentPath'=(87 * min(1, node28path87) - currentPath*(min(1,node28path87) - 1))) & (success'=min(1, node28path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path88 * min(1,node28path88) - currentNode*(min(1, node28path88) - 1))) &  (currentPath'=(88 * min(1, node28path88) - currentPath*(min(1,node28path88) - 1))) & (success'=min(1, node28path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path89 * min(1,node28path89) - currentNode*(min(1, node28path89) - 1))) &  (currentPath'=(89 * min(1, node28path89) - currentPath*(min(1,node28path89) - 1))) & (success'=min(1, node28path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path90 * min(1,node28path90) - currentNode*(min(1, node28path90) - 1))) &  (currentPath'=(90 * min(1, node28path90) - currentPath*(min(1,node28path90) - 1))) & (success'=min(1, node28path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path91 * min(1,node28path91) - currentNode*(min(1, node28path91) - 1))) &  (currentPath'=(91 * min(1, node28path91) - currentPath*(min(1,node28path91) - 1))) & (success'=min(1, node28path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path92 * min(1,node28path92) - currentNode*(min(1, node28path92) - 1))) &  (currentPath'=(92 * min(1, node28path92) - currentPath*(min(1,node28path92) - 1))) & (success'=min(1, node28path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path93 * min(1,node28path93) - currentNode*(min(1, node28path93) - 1))) &  (currentPath'=(93 * min(1, node28path93) - currentPath*(min(1,node28path93) - 1))) & (success'=min(1, node28path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path94 * min(1,node28path94) - currentNode*(min(1, node28path94) - 1))) &  (currentPath'=(94 * min(1, node28path94) - currentPath*(min(1,node28path94) - 1))) & (success'=min(1, node28path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path95 * min(1,node28path95) - currentNode*(min(1, node28path95) - 1))) &  (currentPath'=(95 * min(1, node28path95) - currentPath*(min(1,node28path95) - 1))) & (success'=min(1, node28path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path96 * min(1,node28path96) - currentNode*(min(1, node28path96) - 1))) &  (currentPath'=(96 * min(1, node28path96) - currentPath*(min(1,node28path96) - 1))) & (success'=min(1, node28path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path97 * min(1,node28path97) - currentNode*(min(1, node28path97) - 1))) &  (currentPath'=(97 * min(1, node28path97) - currentPath*(min(1,node28path97) - 1))) & (success'=min(1, node28path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path98 * min(1,node28path98) - currentNode*(min(1, node28path98) - 1))) &  (currentPath'=(98 * min(1, node28path98) - currentPath*(min(1,node28path98) - 1))) & (success'=min(1, node28path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path99 * min(1,node28path99) - currentNode*(min(1, node28path99) - 1))) &  (currentPath'=(99 * min(1, node28path99) - currentPath*(min(1,node28path99) - 1))) & (success'=min(1, node28path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node28path100 * min(1,node28path100) - currentNode*(min(1, node28path100) - 1))) &  (currentPath'=(100 * min(1, node28path100) - currentPath*(min(1,node28path100) - 1))) & (success'=min(1, node28path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 29) ->
 numPathsInv: (currentNode'=(node29path1 * min(1,node29path1) - currentNode*(min(1, node29path1) - 1))) &  (currentPath'=(1 * min(1, node29path1) - currentPath*(min(1,node29path1) - 1))) & (success'=min(1, node29path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path2 * min(1,node29path2) - currentNode*(min(1, node29path2) - 1))) &  (currentPath'=(2 * min(1, node29path2) - currentPath*(min(1,node29path2) - 1))) & (success'=min(1, node29path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path3 * min(1,node29path3) - currentNode*(min(1, node29path3) - 1))) &  (currentPath'=(3 * min(1, node29path3) - currentPath*(min(1,node29path3) - 1))) & (success'=min(1, node29path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path4 * min(1,node29path4) - currentNode*(min(1, node29path4) - 1))) &  (currentPath'=(4 * min(1, node29path4) - currentPath*(min(1,node29path4) - 1))) & (success'=min(1, node29path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path5 * min(1,node29path5) - currentNode*(min(1, node29path5) - 1))) &  (currentPath'=(5 * min(1, node29path5) - currentPath*(min(1,node29path5) - 1))) & (success'=min(1, node29path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path6 * min(1,node29path6) - currentNode*(min(1, node29path6) - 1))) &  (currentPath'=(6 * min(1, node29path6) - currentPath*(min(1,node29path6) - 1))) & (success'=min(1, node29path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path7 * min(1,node29path7) - currentNode*(min(1, node29path7) - 1))) &  (currentPath'=(7 * min(1, node29path7) - currentPath*(min(1,node29path7) - 1))) & (success'=min(1, node29path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path8 * min(1,node29path8) - currentNode*(min(1, node29path8) - 1))) &  (currentPath'=(8 * min(1, node29path8) - currentPath*(min(1,node29path8) - 1))) & (success'=min(1, node29path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path9 * min(1,node29path9) - currentNode*(min(1, node29path9) - 1))) &  (currentPath'=(9 * min(1, node29path9) - currentPath*(min(1,node29path9) - 1))) & (success'=min(1, node29path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path10 * min(1,node29path10) - currentNode*(min(1, node29path10) - 1))) &  (currentPath'=(10 * min(1, node29path10) - currentPath*(min(1,node29path10) - 1))) & (success'=min(1, node29path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path11 * min(1,node29path11) - currentNode*(min(1, node29path11) - 1))) &  (currentPath'=(11 * min(1, node29path11) - currentPath*(min(1,node29path11) - 1))) & (success'=min(1, node29path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path12 * min(1,node29path12) - currentNode*(min(1, node29path12) - 1))) &  (currentPath'=(12 * min(1, node29path12) - currentPath*(min(1,node29path12) - 1))) & (success'=min(1, node29path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path13 * min(1,node29path13) - currentNode*(min(1, node29path13) - 1))) &  (currentPath'=(13 * min(1, node29path13) - currentPath*(min(1,node29path13) - 1))) & (success'=min(1, node29path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path14 * min(1,node29path14) - currentNode*(min(1, node29path14) - 1))) &  (currentPath'=(14 * min(1, node29path14) - currentPath*(min(1,node29path14) - 1))) & (success'=min(1, node29path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path15 * min(1,node29path15) - currentNode*(min(1, node29path15) - 1))) &  (currentPath'=(15 * min(1, node29path15) - currentPath*(min(1,node29path15) - 1))) & (success'=min(1, node29path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path16 * min(1,node29path16) - currentNode*(min(1, node29path16) - 1))) &  (currentPath'=(16 * min(1, node29path16) - currentPath*(min(1,node29path16) - 1))) & (success'=min(1, node29path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path17 * min(1,node29path17) - currentNode*(min(1, node29path17) - 1))) &  (currentPath'=(17 * min(1, node29path17) - currentPath*(min(1,node29path17) - 1))) & (success'=min(1, node29path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path18 * min(1,node29path18) - currentNode*(min(1, node29path18) - 1))) &  (currentPath'=(18 * min(1, node29path18) - currentPath*(min(1,node29path18) - 1))) & (success'=min(1, node29path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path19 * min(1,node29path19) - currentNode*(min(1, node29path19) - 1))) &  (currentPath'=(19 * min(1, node29path19) - currentPath*(min(1,node29path19) - 1))) & (success'=min(1, node29path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path20 * min(1,node29path20) - currentNode*(min(1, node29path20) - 1))) &  (currentPath'=(20 * min(1, node29path20) - currentPath*(min(1,node29path20) - 1))) & (success'=min(1, node29path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path21 * min(1,node29path21) - currentNode*(min(1, node29path21) - 1))) &  (currentPath'=(21 * min(1, node29path21) - currentPath*(min(1,node29path21) - 1))) & (success'=min(1, node29path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path22 * min(1,node29path22) - currentNode*(min(1, node29path22) - 1))) &  (currentPath'=(22 * min(1, node29path22) - currentPath*(min(1,node29path22) - 1))) & (success'=min(1, node29path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path23 * min(1,node29path23) - currentNode*(min(1, node29path23) - 1))) &  (currentPath'=(23 * min(1, node29path23) - currentPath*(min(1,node29path23) - 1))) & (success'=min(1, node29path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path24 * min(1,node29path24) - currentNode*(min(1, node29path24) - 1))) &  (currentPath'=(24 * min(1, node29path24) - currentPath*(min(1,node29path24) - 1))) & (success'=min(1, node29path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path25 * min(1,node29path25) - currentNode*(min(1, node29path25) - 1))) &  (currentPath'=(25 * min(1, node29path25) - currentPath*(min(1,node29path25) - 1))) & (success'=min(1, node29path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path26 * min(1,node29path26) - currentNode*(min(1, node29path26) - 1))) &  (currentPath'=(26 * min(1, node29path26) - currentPath*(min(1,node29path26) - 1))) & (success'=min(1, node29path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path27 * min(1,node29path27) - currentNode*(min(1, node29path27) - 1))) &  (currentPath'=(27 * min(1, node29path27) - currentPath*(min(1,node29path27) - 1))) & (success'=min(1, node29path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path28 * min(1,node29path28) - currentNode*(min(1, node29path28) - 1))) &  (currentPath'=(28 * min(1, node29path28) - currentPath*(min(1,node29path28) - 1))) & (success'=min(1, node29path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path29 * min(1,node29path29) - currentNode*(min(1, node29path29) - 1))) &  (currentPath'=(29 * min(1, node29path29) - currentPath*(min(1,node29path29) - 1))) & (success'=min(1, node29path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path30 * min(1,node29path30) - currentNode*(min(1, node29path30) - 1))) &  (currentPath'=(30 * min(1, node29path30) - currentPath*(min(1,node29path30) - 1))) & (success'=min(1, node29path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path31 * min(1,node29path31) - currentNode*(min(1, node29path31) - 1))) &  (currentPath'=(31 * min(1, node29path31) - currentPath*(min(1,node29path31) - 1))) & (success'=min(1, node29path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path32 * min(1,node29path32) - currentNode*(min(1, node29path32) - 1))) &  (currentPath'=(32 * min(1, node29path32) - currentPath*(min(1,node29path32) - 1))) & (success'=min(1, node29path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path33 * min(1,node29path33) - currentNode*(min(1, node29path33) - 1))) &  (currentPath'=(33 * min(1, node29path33) - currentPath*(min(1,node29path33) - 1))) & (success'=min(1, node29path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path34 * min(1,node29path34) - currentNode*(min(1, node29path34) - 1))) &  (currentPath'=(34 * min(1, node29path34) - currentPath*(min(1,node29path34) - 1))) & (success'=min(1, node29path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path35 * min(1,node29path35) - currentNode*(min(1, node29path35) - 1))) &  (currentPath'=(35 * min(1, node29path35) - currentPath*(min(1,node29path35) - 1))) & (success'=min(1, node29path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path36 * min(1,node29path36) - currentNode*(min(1, node29path36) - 1))) &  (currentPath'=(36 * min(1, node29path36) - currentPath*(min(1,node29path36) - 1))) & (success'=min(1, node29path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path37 * min(1,node29path37) - currentNode*(min(1, node29path37) - 1))) &  (currentPath'=(37 * min(1, node29path37) - currentPath*(min(1,node29path37) - 1))) & (success'=min(1, node29path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path38 * min(1,node29path38) - currentNode*(min(1, node29path38) - 1))) &  (currentPath'=(38 * min(1, node29path38) - currentPath*(min(1,node29path38) - 1))) & (success'=min(1, node29path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path39 * min(1,node29path39) - currentNode*(min(1, node29path39) - 1))) &  (currentPath'=(39 * min(1, node29path39) - currentPath*(min(1,node29path39) - 1))) & (success'=min(1, node29path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path40 * min(1,node29path40) - currentNode*(min(1, node29path40) - 1))) &  (currentPath'=(40 * min(1, node29path40) - currentPath*(min(1,node29path40) - 1))) & (success'=min(1, node29path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path41 * min(1,node29path41) - currentNode*(min(1, node29path41) - 1))) &  (currentPath'=(41 * min(1, node29path41) - currentPath*(min(1,node29path41) - 1))) & (success'=min(1, node29path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path42 * min(1,node29path42) - currentNode*(min(1, node29path42) - 1))) &  (currentPath'=(42 * min(1, node29path42) - currentPath*(min(1,node29path42) - 1))) & (success'=min(1, node29path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path43 * min(1,node29path43) - currentNode*(min(1, node29path43) - 1))) &  (currentPath'=(43 * min(1, node29path43) - currentPath*(min(1,node29path43) - 1))) & (success'=min(1, node29path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path44 * min(1,node29path44) - currentNode*(min(1, node29path44) - 1))) &  (currentPath'=(44 * min(1, node29path44) - currentPath*(min(1,node29path44) - 1))) & (success'=min(1, node29path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path45 * min(1,node29path45) - currentNode*(min(1, node29path45) - 1))) &  (currentPath'=(45 * min(1, node29path45) - currentPath*(min(1,node29path45) - 1))) & (success'=min(1, node29path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path46 * min(1,node29path46) - currentNode*(min(1, node29path46) - 1))) &  (currentPath'=(46 * min(1, node29path46) - currentPath*(min(1,node29path46) - 1))) & (success'=min(1, node29path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path47 * min(1,node29path47) - currentNode*(min(1, node29path47) - 1))) &  (currentPath'=(47 * min(1, node29path47) - currentPath*(min(1,node29path47) - 1))) & (success'=min(1, node29path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path48 * min(1,node29path48) - currentNode*(min(1, node29path48) - 1))) &  (currentPath'=(48 * min(1, node29path48) - currentPath*(min(1,node29path48) - 1))) & (success'=min(1, node29path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path49 * min(1,node29path49) - currentNode*(min(1, node29path49) - 1))) &  (currentPath'=(49 * min(1, node29path49) - currentPath*(min(1,node29path49) - 1))) & (success'=min(1, node29path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path50 * min(1,node29path50) - currentNode*(min(1, node29path50) - 1))) &  (currentPath'=(50 * min(1, node29path50) - currentPath*(min(1,node29path50) - 1))) & (success'=min(1, node29path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path51 * min(1,node29path51) - currentNode*(min(1, node29path51) - 1))) &  (currentPath'=(51 * min(1, node29path51) - currentPath*(min(1,node29path51) - 1))) & (success'=min(1, node29path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path52 * min(1,node29path52) - currentNode*(min(1, node29path52) - 1))) &  (currentPath'=(52 * min(1, node29path52) - currentPath*(min(1,node29path52) - 1))) & (success'=min(1, node29path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path53 * min(1,node29path53) - currentNode*(min(1, node29path53) - 1))) &  (currentPath'=(53 * min(1, node29path53) - currentPath*(min(1,node29path53) - 1))) & (success'=min(1, node29path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path54 * min(1,node29path54) - currentNode*(min(1, node29path54) - 1))) &  (currentPath'=(54 * min(1, node29path54) - currentPath*(min(1,node29path54) - 1))) & (success'=min(1, node29path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path55 * min(1,node29path55) - currentNode*(min(1, node29path55) - 1))) &  (currentPath'=(55 * min(1, node29path55) - currentPath*(min(1,node29path55) - 1))) & (success'=min(1, node29path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path56 * min(1,node29path56) - currentNode*(min(1, node29path56) - 1))) &  (currentPath'=(56 * min(1, node29path56) - currentPath*(min(1,node29path56) - 1))) & (success'=min(1, node29path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path57 * min(1,node29path57) - currentNode*(min(1, node29path57) - 1))) &  (currentPath'=(57 * min(1, node29path57) - currentPath*(min(1,node29path57) - 1))) & (success'=min(1, node29path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path58 * min(1,node29path58) - currentNode*(min(1, node29path58) - 1))) &  (currentPath'=(58 * min(1, node29path58) - currentPath*(min(1,node29path58) - 1))) & (success'=min(1, node29path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path59 * min(1,node29path59) - currentNode*(min(1, node29path59) - 1))) &  (currentPath'=(59 * min(1, node29path59) - currentPath*(min(1,node29path59) - 1))) & (success'=min(1, node29path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path60 * min(1,node29path60) - currentNode*(min(1, node29path60) - 1))) &  (currentPath'=(60 * min(1, node29path60) - currentPath*(min(1,node29path60) - 1))) & (success'=min(1, node29path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path61 * min(1,node29path61) - currentNode*(min(1, node29path61) - 1))) &  (currentPath'=(61 * min(1, node29path61) - currentPath*(min(1,node29path61) - 1))) & (success'=min(1, node29path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path62 * min(1,node29path62) - currentNode*(min(1, node29path62) - 1))) &  (currentPath'=(62 * min(1, node29path62) - currentPath*(min(1,node29path62) - 1))) & (success'=min(1, node29path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path63 * min(1,node29path63) - currentNode*(min(1, node29path63) - 1))) &  (currentPath'=(63 * min(1, node29path63) - currentPath*(min(1,node29path63) - 1))) & (success'=min(1, node29path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path64 * min(1,node29path64) - currentNode*(min(1, node29path64) - 1))) &  (currentPath'=(64 * min(1, node29path64) - currentPath*(min(1,node29path64) - 1))) & (success'=min(1, node29path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path65 * min(1,node29path65) - currentNode*(min(1, node29path65) - 1))) &  (currentPath'=(65 * min(1, node29path65) - currentPath*(min(1,node29path65) - 1))) & (success'=min(1, node29path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path66 * min(1,node29path66) - currentNode*(min(1, node29path66) - 1))) &  (currentPath'=(66 * min(1, node29path66) - currentPath*(min(1,node29path66) - 1))) & (success'=min(1, node29path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path67 * min(1,node29path67) - currentNode*(min(1, node29path67) - 1))) &  (currentPath'=(67 * min(1, node29path67) - currentPath*(min(1,node29path67) - 1))) & (success'=min(1, node29path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path68 * min(1,node29path68) - currentNode*(min(1, node29path68) - 1))) &  (currentPath'=(68 * min(1, node29path68) - currentPath*(min(1,node29path68) - 1))) & (success'=min(1, node29path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path69 * min(1,node29path69) - currentNode*(min(1, node29path69) - 1))) &  (currentPath'=(69 * min(1, node29path69) - currentPath*(min(1,node29path69) - 1))) & (success'=min(1, node29path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path70 * min(1,node29path70) - currentNode*(min(1, node29path70) - 1))) &  (currentPath'=(70 * min(1, node29path70) - currentPath*(min(1,node29path70) - 1))) & (success'=min(1, node29path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path71 * min(1,node29path71) - currentNode*(min(1, node29path71) - 1))) &  (currentPath'=(71 * min(1, node29path71) - currentPath*(min(1,node29path71) - 1))) & (success'=min(1, node29path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path72 * min(1,node29path72) - currentNode*(min(1, node29path72) - 1))) &  (currentPath'=(72 * min(1, node29path72) - currentPath*(min(1,node29path72) - 1))) & (success'=min(1, node29path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path73 * min(1,node29path73) - currentNode*(min(1, node29path73) - 1))) &  (currentPath'=(73 * min(1, node29path73) - currentPath*(min(1,node29path73) - 1))) & (success'=min(1, node29path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path74 * min(1,node29path74) - currentNode*(min(1, node29path74) - 1))) &  (currentPath'=(74 * min(1, node29path74) - currentPath*(min(1,node29path74) - 1))) & (success'=min(1, node29path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path75 * min(1,node29path75) - currentNode*(min(1, node29path75) - 1))) &  (currentPath'=(75 * min(1, node29path75) - currentPath*(min(1,node29path75) - 1))) & (success'=min(1, node29path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path76 * min(1,node29path76) - currentNode*(min(1, node29path76) - 1))) &  (currentPath'=(76 * min(1, node29path76) - currentPath*(min(1,node29path76) - 1))) & (success'=min(1, node29path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path77 * min(1,node29path77) - currentNode*(min(1, node29path77) - 1))) &  (currentPath'=(77 * min(1, node29path77) - currentPath*(min(1,node29path77) - 1))) & (success'=min(1, node29path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path78 * min(1,node29path78) - currentNode*(min(1, node29path78) - 1))) &  (currentPath'=(78 * min(1, node29path78) - currentPath*(min(1,node29path78) - 1))) & (success'=min(1, node29path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path79 * min(1,node29path79) - currentNode*(min(1, node29path79) - 1))) &  (currentPath'=(79 * min(1, node29path79) - currentPath*(min(1,node29path79) - 1))) & (success'=min(1, node29path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path80 * min(1,node29path80) - currentNode*(min(1, node29path80) - 1))) &  (currentPath'=(80 * min(1, node29path80) - currentPath*(min(1,node29path80) - 1))) & (success'=min(1, node29path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path81 * min(1,node29path81) - currentNode*(min(1, node29path81) - 1))) &  (currentPath'=(81 * min(1, node29path81) - currentPath*(min(1,node29path81) - 1))) & (success'=min(1, node29path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path82 * min(1,node29path82) - currentNode*(min(1, node29path82) - 1))) &  (currentPath'=(82 * min(1, node29path82) - currentPath*(min(1,node29path82) - 1))) & (success'=min(1, node29path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path83 * min(1,node29path83) - currentNode*(min(1, node29path83) - 1))) &  (currentPath'=(83 * min(1, node29path83) - currentPath*(min(1,node29path83) - 1))) & (success'=min(1, node29path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path84 * min(1,node29path84) - currentNode*(min(1, node29path84) - 1))) &  (currentPath'=(84 * min(1, node29path84) - currentPath*(min(1,node29path84) - 1))) & (success'=min(1, node29path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path85 * min(1,node29path85) - currentNode*(min(1, node29path85) - 1))) &  (currentPath'=(85 * min(1, node29path85) - currentPath*(min(1,node29path85) - 1))) & (success'=min(1, node29path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path86 * min(1,node29path86) - currentNode*(min(1, node29path86) - 1))) &  (currentPath'=(86 * min(1, node29path86) - currentPath*(min(1,node29path86) - 1))) & (success'=min(1, node29path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path87 * min(1,node29path87) - currentNode*(min(1, node29path87) - 1))) &  (currentPath'=(87 * min(1, node29path87) - currentPath*(min(1,node29path87) - 1))) & (success'=min(1, node29path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path88 * min(1,node29path88) - currentNode*(min(1, node29path88) - 1))) &  (currentPath'=(88 * min(1, node29path88) - currentPath*(min(1,node29path88) - 1))) & (success'=min(1, node29path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path89 * min(1,node29path89) - currentNode*(min(1, node29path89) - 1))) &  (currentPath'=(89 * min(1, node29path89) - currentPath*(min(1,node29path89) - 1))) & (success'=min(1, node29path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path90 * min(1,node29path90) - currentNode*(min(1, node29path90) - 1))) &  (currentPath'=(90 * min(1, node29path90) - currentPath*(min(1,node29path90) - 1))) & (success'=min(1, node29path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path91 * min(1,node29path91) - currentNode*(min(1, node29path91) - 1))) &  (currentPath'=(91 * min(1, node29path91) - currentPath*(min(1,node29path91) - 1))) & (success'=min(1, node29path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path92 * min(1,node29path92) - currentNode*(min(1, node29path92) - 1))) &  (currentPath'=(92 * min(1, node29path92) - currentPath*(min(1,node29path92) - 1))) & (success'=min(1, node29path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path93 * min(1,node29path93) - currentNode*(min(1, node29path93) - 1))) &  (currentPath'=(93 * min(1, node29path93) - currentPath*(min(1,node29path93) - 1))) & (success'=min(1, node29path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path94 * min(1,node29path94) - currentNode*(min(1, node29path94) - 1))) &  (currentPath'=(94 * min(1, node29path94) - currentPath*(min(1,node29path94) - 1))) & (success'=min(1, node29path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path95 * min(1,node29path95) - currentNode*(min(1, node29path95) - 1))) &  (currentPath'=(95 * min(1, node29path95) - currentPath*(min(1,node29path95) - 1))) & (success'=min(1, node29path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path96 * min(1,node29path96) - currentNode*(min(1, node29path96) - 1))) &  (currentPath'=(96 * min(1, node29path96) - currentPath*(min(1,node29path96) - 1))) & (success'=min(1, node29path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path97 * min(1,node29path97) - currentNode*(min(1, node29path97) - 1))) &  (currentPath'=(97 * min(1, node29path97) - currentPath*(min(1,node29path97) - 1))) & (success'=min(1, node29path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path98 * min(1,node29path98) - currentNode*(min(1, node29path98) - 1))) &  (currentPath'=(98 * min(1, node29path98) - currentPath*(min(1,node29path98) - 1))) & (success'=min(1, node29path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path99 * min(1,node29path99) - currentNode*(min(1, node29path99) - 1))) &  (currentPath'=(99 * min(1, node29path99) - currentPath*(min(1,node29path99) - 1))) & (success'=min(1, node29path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node29path100 * min(1,node29path100) - currentNode*(min(1, node29path100) - 1))) &  (currentPath'=(100 * min(1, node29path100) - currentPath*(min(1,node29path100) - 1))) & (success'=min(1, node29path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 30) ->
 numPathsInv: (currentNode'=(node30path1 * min(1,node30path1) - currentNode*(min(1, node30path1) - 1))) &  (currentPath'=(1 * min(1, node30path1) - currentPath*(min(1,node30path1) - 1))) & (success'=min(1, node30path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path2 * min(1,node30path2) - currentNode*(min(1, node30path2) - 1))) &  (currentPath'=(2 * min(1, node30path2) - currentPath*(min(1,node30path2) - 1))) & (success'=min(1, node30path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path3 * min(1,node30path3) - currentNode*(min(1, node30path3) - 1))) &  (currentPath'=(3 * min(1, node30path3) - currentPath*(min(1,node30path3) - 1))) & (success'=min(1, node30path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path4 * min(1,node30path4) - currentNode*(min(1, node30path4) - 1))) &  (currentPath'=(4 * min(1, node30path4) - currentPath*(min(1,node30path4) - 1))) & (success'=min(1, node30path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path5 * min(1,node30path5) - currentNode*(min(1, node30path5) - 1))) &  (currentPath'=(5 * min(1, node30path5) - currentPath*(min(1,node30path5) - 1))) & (success'=min(1, node30path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path6 * min(1,node30path6) - currentNode*(min(1, node30path6) - 1))) &  (currentPath'=(6 * min(1, node30path6) - currentPath*(min(1,node30path6) - 1))) & (success'=min(1, node30path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path7 * min(1,node30path7) - currentNode*(min(1, node30path7) - 1))) &  (currentPath'=(7 * min(1, node30path7) - currentPath*(min(1,node30path7) - 1))) & (success'=min(1, node30path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path8 * min(1,node30path8) - currentNode*(min(1, node30path8) - 1))) &  (currentPath'=(8 * min(1, node30path8) - currentPath*(min(1,node30path8) - 1))) & (success'=min(1, node30path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path9 * min(1,node30path9) - currentNode*(min(1, node30path9) - 1))) &  (currentPath'=(9 * min(1, node30path9) - currentPath*(min(1,node30path9) - 1))) & (success'=min(1, node30path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path10 * min(1,node30path10) - currentNode*(min(1, node30path10) - 1))) &  (currentPath'=(10 * min(1, node30path10) - currentPath*(min(1,node30path10) - 1))) & (success'=min(1, node30path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path11 * min(1,node30path11) - currentNode*(min(1, node30path11) - 1))) &  (currentPath'=(11 * min(1, node30path11) - currentPath*(min(1,node30path11) - 1))) & (success'=min(1, node30path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path12 * min(1,node30path12) - currentNode*(min(1, node30path12) - 1))) &  (currentPath'=(12 * min(1, node30path12) - currentPath*(min(1,node30path12) - 1))) & (success'=min(1, node30path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path13 * min(1,node30path13) - currentNode*(min(1, node30path13) - 1))) &  (currentPath'=(13 * min(1, node30path13) - currentPath*(min(1,node30path13) - 1))) & (success'=min(1, node30path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path14 * min(1,node30path14) - currentNode*(min(1, node30path14) - 1))) &  (currentPath'=(14 * min(1, node30path14) - currentPath*(min(1,node30path14) - 1))) & (success'=min(1, node30path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path15 * min(1,node30path15) - currentNode*(min(1, node30path15) - 1))) &  (currentPath'=(15 * min(1, node30path15) - currentPath*(min(1,node30path15) - 1))) & (success'=min(1, node30path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path16 * min(1,node30path16) - currentNode*(min(1, node30path16) - 1))) &  (currentPath'=(16 * min(1, node30path16) - currentPath*(min(1,node30path16) - 1))) & (success'=min(1, node30path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path17 * min(1,node30path17) - currentNode*(min(1, node30path17) - 1))) &  (currentPath'=(17 * min(1, node30path17) - currentPath*(min(1,node30path17) - 1))) & (success'=min(1, node30path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path18 * min(1,node30path18) - currentNode*(min(1, node30path18) - 1))) &  (currentPath'=(18 * min(1, node30path18) - currentPath*(min(1,node30path18) - 1))) & (success'=min(1, node30path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path19 * min(1,node30path19) - currentNode*(min(1, node30path19) - 1))) &  (currentPath'=(19 * min(1, node30path19) - currentPath*(min(1,node30path19) - 1))) & (success'=min(1, node30path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path20 * min(1,node30path20) - currentNode*(min(1, node30path20) - 1))) &  (currentPath'=(20 * min(1, node30path20) - currentPath*(min(1,node30path20) - 1))) & (success'=min(1, node30path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path21 * min(1,node30path21) - currentNode*(min(1, node30path21) - 1))) &  (currentPath'=(21 * min(1, node30path21) - currentPath*(min(1,node30path21) - 1))) & (success'=min(1, node30path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path22 * min(1,node30path22) - currentNode*(min(1, node30path22) - 1))) &  (currentPath'=(22 * min(1, node30path22) - currentPath*(min(1,node30path22) - 1))) & (success'=min(1, node30path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path23 * min(1,node30path23) - currentNode*(min(1, node30path23) - 1))) &  (currentPath'=(23 * min(1, node30path23) - currentPath*(min(1,node30path23) - 1))) & (success'=min(1, node30path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path24 * min(1,node30path24) - currentNode*(min(1, node30path24) - 1))) &  (currentPath'=(24 * min(1, node30path24) - currentPath*(min(1,node30path24) - 1))) & (success'=min(1, node30path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path25 * min(1,node30path25) - currentNode*(min(1, node30path25) - 1))) &  (currentPath'=(25 * min(1, node30path25) - currentPath*(min(1,node30path25) - 1))) & (success'=min(1, node30path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path26 * min(1,node30path26) - currentNode*(min(1, node30path26) - 1))) &  (currentPath'=(26 * min(1, node30path26) - currentPath*(min(1,node30path26) - 1))) & (success'=min(1, node30path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path27 * min(1,node30path27) - currentNode*(min(1, node30path27) - 1))) &  (currentPath'=(27 * min(1, node30path27) - currentPath*(min(1,node30path27) - 1))) & (success'=min(1, node30path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path28 * min(1,node30path28) - currentNode*(min(1, node30path28) - 1))) &  (currentPath'=(28 * min(1, node30path28) - currentPath*(min(1,node30path28) - 1))) & (success'=min(1, node30path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path29 * min(1,node30path29) - currentNode*(min(1, node30path29) - 1))) &  (currentPath'=(29 * min(1, node30path29) - currentPath*(min(1,node30path29) - 1))) & (success'=min(1, node30path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path30 * min(1,node30path30) - currentNode*(min(1, node30path30) - 1))) &  (currentPath'=(30 * min(1, node30path30) - currentPath*(min(1,node30path30) - 1))) & (success'=min(1, node30path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path31 * min(1,node30path31) - currentNode*(min(1, node30path31) - 1))) &  (currentPath'=(31 * min(1, node30path31) - currentPath*(min(1,node30path31) - 1))) & (success'=min(1, node30path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path32 * min(1,node30path32) - currentNode*(min(1, node30path32) - 1))) &  (currentPath'=(32 * min(1, node30path32) - currentPath*(min(1,node30path32) - 1))) & (success'=min(1, node30path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path33 * min(1,node30path33) - currentNode*(min(1, node30path33) - 1))) &  (currentPath'=(33 * min(1, node30path33) - currentPath*(min(1,node30path33) - 1))) & (success'=min(1, node30path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path34 * min(1,node30path34) - currentNode*(min(1, node30path34) - 1))) &  (currentPath'=(34 * min(1, node30path34) - currentPath*(min(1,node30path34) - 1))) & (success'=min(1, node30path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path35 * min(1,node30path35) - currentNode*(min(1, node30path35) - 1))) &  (currentPath'=(35 * min(1, node30path35) - currentPath*(min(1,node30path35) - 1))) & (success'=min(1, node30path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path36 * min(1,node30path36) - currentNode*(min(1, node30path36) - 1))) &  (currentPath'=(36 * min(1, node30path36) - currentPath*(min(1,node30path36) - 1))) & (success'=min(1, node30path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path37 * min(1,node30path37) - currentNode*(min(1, node30path37) - 1))) &  (currentPath'=(37 * min(1, node30path37) - currentPath*(min(1,node30path37) - 1))) & (success'=min(1, node30path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path38 * min(1,node30path38) - currentNode*(min(1, node30path38) - 1))) &  (currentPath'=(38 * min(1, node30path38) - currentPath*(min(1,node30path38) - 1))) & (success'=min(1, node30path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path39 * min(1,node30path39) - currentNode*(min(1, node30path39) - 1))) &  (currentPath'=(39 * min(1, node30path39) - currentPath*(min(1,node30path39) - 1))) & (success'=min(1, node30path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path40 * min(1,node30path40) - currentNode*(min(1, node30path40) - 1))) &  (currentPath'=(40 * min(1, node30path40) - currentPath*(min(1,node30path40) - 1))) & (success'=min(1, node30path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path41 * min(1,node30path41) - currentNode*(min(1, node30path41) - 1))) &  (currentPath'=(41 * min(1, node30path41) - currentPath*(min(1,node30path41) - 1))) & (success'=min(1, node30path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path42 * min(1,node30path42) - currentNode*(min(1, node30path42) - 1))) &  (currentPath'=(42 * min(1, node30path42) - currentPath*(min(1,node30path42) - 1))) & (success'=min(1, node30path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path43 * min(1,node30path43) - currentNode*(min(1, node30path43) - 1))) &  (currentPath'=(43 * min(1, node30path43) - currentPath*(min(1,node30path43) - 1))) & (success'=min(1, node30path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path44 * min(1,node30path44) - currentNode*(min(1, node30path44) - 1))) &  (currentPath'=(44 * min(1, node30path44) - currentPath*(min(1,node30path44) - 1))) & (success'=min(1, node30path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path45 * min(1,node30path45) - currentNode*(min(1, node30path45) - 1))) &  (currentPath'=(45 * min(1, node30path45) - currentPath*(min(1,node30path45) - 1))) & (success'=min(1, node30path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path46 * min(1,node30path46) - currentNode*(min(1, node30path46) - 1))) &  (currentPath'=(46 * min(1, node30path46) - currentPath*(min(1,node30path46) - 1))) & (success'=min(1, node30path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path47 * min(1,node30path47) - currentNode*(min(1, node30path47) - 1))) &  (currentPath'=(47 * min(1, node30path47) - currentPath*(min(1,node30path47) - 1))) & (success'=min(1, node30path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path48 * min(1,node30path48) - currentNode*(min(1, node30path48) - 1))) &  (currentPath'=(48 * min(1, node30path48) - currentPath*(min(1,node30path48) - 1))) & (success'=min(1, node30path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path49 * min(1,node30path49) - currentNode*(min(1, node30path49) - 1))) &  (currentPath'=(49 * min(1, node30path49) - currentPath*(min(1,node30path49) - 1))) & (success'=min(1, node30path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path50 * min(1,node30path50) - currentNode*(min(1, node30path50) - 1))) &  (currentPath'=(50 * min(1, node30path50) - currentPath*(min(1,node30path50) - 1))) & (success'=min(1, node30path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path51 * min(1,node30path51) - currentNode*(min(1, node30path51) - 1))) &  (currentPath'=(51 * min(1, node30path51) - currentPath*(min(1,node30path51) - 1))) & (success'=min(1, node30path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path52 * min(1,node30path52) - currentNode*(min(1, node30path52) - 1))) &  (currentPath'=(52 * min(1, node30path52) - currentPath*(min(1,node30path52) - 1))) & (success'=min(1, node30path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path53 * min(1,node30path53) - currentNode*(min(1, node30path53) - 1))) &  (currentPath'=(53 * min(1, node30path53) - currentPath*(min(1,node30path53) - 1))) & (success'=min(1, node30path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path54 * min(1,node30path54) - currentNode*(min(1, node30path54) - 1))) &  (currentPath'=(54 * min(1, node30path54) - currentPath*(min(1,node30path54) - 1))) & (success'=min(1, node30path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path55 * min(1,node30path55) - currentNode*(min(1, node30path55) - 1))) &  (currentPath'=(55 * min(1, node30path55) - currentPath*(min(1,node30path55) - 1))) & (success'=min(1, node30path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path56 * min(1,node30path56) - currentNode*(min(1, node30path56) - 1))) &  (currentPath'=(56 * min(1, node30path56) - currentPath*(min(1,node30path56) - 1))) & (success'=min(1, node30path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path57 * min(1,node30path57) - currentNode*(min(1, node30path57) - 1))) &  (currentPath'=(57 * min(1, node30path57) - currentPath*(min(1,node30path57) - 1))) & (success'=min(1, node30path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path58 * min(1,node30path58) - currentNode*(min(1, node30path58) - 1))) &  (currentPath'=(58 * min(1, node30path58) - currentPath*(min(1,node30path58) - 1))) & (success'=min(1, node30path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path59 * min(1,node30path59) - currentNode*(min(1, node30path59) - 1))) &  (currentPath'=(59 * min(1, node30path59) - currentPath*(min(1,node30path59) - 1))) & (success'=min(1, node30path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path60 * min(1,node30path60) - currentNode*(min(1, node30path60) - 1))) &  (currentPath'=(60 * min(1, node30path60) - currentPath*(min(1,node30path60) - 1))) & (success'=min(1, node30path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path61 * min(1,node30path61) - currentNode*(min(1, node30path61) - 1))) &  (currentPath'=(61 * min(1, node30path61) - currentPath*(min(1,node30path61) - 1))) & (success'=min(1, node30path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path62 * min(1,node30path62) - currentNode*(min(1, node30path62) - 1))) &  (currentPath'=(62 * min(1, node30path62) - currentPath*(min(1,node30path62) - 1))) & (success'=min(1, node30path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path63 * min(1,node30path63) - currentNode*(min(1, node30path63) - 1))) &  (currentPath'=(63 * min(1, node30path63) - currentPath*(min(1,node30path63) - 1))) & (success'=min(1, node30path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path64 * min(1,node30path64) - currentNode*(min(1, node30path64) - 1))) &  (currentPath'=(64 * min(1, node30path64) - currentPath*(min(1,node30path64) - 1))) & (success'=min(1, node30path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path65 * min(1,node30path65) - currentNode*(min(1, node30path65) - 1))) &  (currentPath'=(65 * min(1, node30path65) - currentPath*(min(1,node30path65) - 1))) & (success'=min(1, node30path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path66 * min(1,node30path66) - currentNode*(min(1, node30path66) - 1))) &  (currentPath'=(66 * min(1, node30path66) - currentPath*(min(1,node30path66) - 1))) & (success'=min(1, node30path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path67 * min(1,node30path67) - currentNode*(min(1, node30path67) - 1))) &  (currentPath'=(67 * min(1, node30path67) - currentPath*(min(1,node30path67) - 1))) & (success'=min(1, node30path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path68 * min(1,node30path68) - currentNode*(min(1, node30path68) - 1))) &  (currentPath'=(68 * min(1, node30path68) - currentPath*(min(1,node30path68) - 1))) & (success'=min(1, node30path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path69 * min(1,node30path69) - currentNode*(min(1, node30path69) - 1))) &  (currentPath'=(69 * min(1, node30path69) - currentPath*(min(1,node30path69) - 1))) & (success'=min(1, node30path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path70 * min(1,node30path70) - currentNode*(min(1, node30path70) - 1))) &  (currentPath'=(70 * min(1, node30path70) - currentPath*(min(1,node30path70) - 1))) & (success'=min(1, node30path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path71 * min(1,node30path71) - currentNode*(min(1, node30path71) - 1))) &  (currentPath'=(71 * min(1, node30path71) - currentPath*(min(1,node30path71) - 1))) & (success'=min(1, node30path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path72 * min(1,node30path72) - currentNode*(min(1, node30path72) - 1))) &  (currentPath'=(72 * min(1, node30path72) - currentPath*(min(1,node30path72) - 1))) & (success'=min(1, node30path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path73 * min(1,node30path73) - currentNode*(min(1, node30path73) - 1))) &  (currentPath'=(73 * min(1, node30path73) - currentPath*(min(1,node30path73) - 1))) & (success'=min(1, node30path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path74 * min(1,node30path74) - currentNode*(min(1, node30path74) - 1))) &  (currentPath'=(74 * min(1, node30path74) - currentPath*(min(1,node30path74) - 1))) & (success'=min(1, node30path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path75 * min(1,node30path75) - currentNode*(min(1, node30path75) - 1))) &  (currentPath'=(75 * min(1, node30path75) - currentPath*(min(1,node30path75) - 1))) & (success'=min(1, node30path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path76 * min(1,node30path76) - currentNode*(min(1, node30path76) - 1))) &  (currentPath'=(76 * min(1, node30path76) - currentPath*(min(1,node30path76) - 1))) & (success'=min(1, node30path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path77 * min(1,node30path77) - currentNode*(min(1, node30path77) - 1))) &  (currentPath'=(77 * min(1, node30path77) - currentPath*(min(1,node30path77) - 1))) & (success'=min(1, node30path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path78 * min(1,node30path78) - currentNode*(min(1, node30path78) - 1))) &  (currentPath'=(78 * min(1, node30path78) - currentPath*(min(1,node30path78) - 1))) & (success'=min(1, node30path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path79 * min(1,node30path79) - currentNode*(min(1, node30path79) - 1))) &  (currentPath'=(79 * min(1, node30path79) - currentPath*(min(1,node30path79) - 1))) & (success'=min(1, node30path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path80 * min(1,node30path80) - currentNode*(min(1, node30path80) - 1))) &  (currentPath'=(80 * min(1, node30path80) - currentPath*(min(1,node30path80) - 1))) & (success'=min(1, node30path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path81 * min(1,node30path81) - currentNode*(min(1, node30path81) - 1))) &  (currentPath'=(81 * min(1, node30path81) - currentPath*(min(1,node30path81) - 1))) & (success'=min(1, node30path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path82 * min(1,node30path82) - currentNode*(min(1, node30path82) - 1))) &  (currentPath'=(82 * min(1, node30path82) - currentPath*(min(1,node30path82) - 1))) & (success'=min(1, node30path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path83 * min(1,node30path83) - currentNode*(min(1, node30path83) - 1))) &  (currentPath'=(83 * min(1, node30path83) - currentPath*(min(1,node30path83) - 1))) & (success'=min(1, node30path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path84 * min(1,node30path84) - currentNode*(min(1, node30path84) - 1))) &  (currentPath'=(84 * min(1, node30path84) - currentPath*(min(1,node30path84) - 1))) & (success'=min(1, node30path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path85 * min(1,node30path85) - currentNode*(min(1, node30path85) - 1))) &  (currentPath'=(85 * min(1, node30path85) - currentPath*(min(1,node30path85) - 1))) & (success'=min(1, node30path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path86 * min(1,node30path86) - currentNode*(min(1, node30path86) - 1))) &  (currentPath'=(86 * min(1, node30path86) - currentPath*(min(1,node30path86) - 1))) & (success'=min(1, node30path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path87 * min(1,node30path87) - currentNode*(min(1, node30path87) - 1))) &  (currentPath'=(87 * min(1, node30path87) - currentPath*(min(1,node30path87) - 1))) & (success'=min(1, node30path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path88 * min(1,node30path88) - currentNode*(min(1, node30path88) - 1))) &  (currentPath'=(88 * min(1, node30path88) - currentPath*(min(1,node30path88) - 1))) & (success'=min(1, node30path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path89 * min(1,node30path89) - currentNode*(min(1, node30path89) - 1))) &  (currentPath'=(89 * min(1, node30path89) - currentPath*(min(1,node30path89) - 1))) & (success'=min(1, node30path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path90 * min(1,node30path90) - currentNode*(min(1, node30path90) - 1))) &  (currentPath'=(90 * min(1, node30path90) - currentPath*(min(1,node30path90) - 1))) & (success'=min(1, node30path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path91 * min(1,node30path91) - currentNode*(min(1, node30path91) - 1))) &  (currentPath'=(91 * min(1, node30path91) - currentPath*(min(1,node30path91) - 1))) & (success'=min(1, node30path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path92 * min(1,node30path92) - currentNode*(min(1, node30path92) - 1))) &  (currentPath'=(92 * min(1, node30path92) - currentPath*(min(1,node30path92) - 1))) & (success'=min(1, node30path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path93 * min(1,node30path93) - currentNode*(min(1, node30path93) - 1))) &  (currentPath'=(93 * min(1, node30path93) - currentPath*(min(1,node30path93) - 1))) & (success'=min(1, node30path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path94 * min(1,node30path94) - currentNode*(min(1, node30path94) - 1))) &  (currentPath'=(94 * min(1, node30path94) - currentPath*(min(1,node30path94) - 1))) & (success'=min(1, node30path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path95 * min(1,node30path95) - currentNode*(min(1, node30path95) - 1))) &  (currentPath'=(95 * min(1, node30path95) - currentPath*(min(1,node30path95) - 1))) & (success'=min(1, node30path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path96 * min(1,node30path96) - currentNode*(min(1, node30path96) - 1))) &  (currentPath'=(96 * min(1, node30path96) - currentPath*(min(1,node30path96) - 1))) & (success'=min(1, node30path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path97 * min(1,node30path97) - currentNode*(min(1, node30path97) - 1))) &  (currentPath'=(97 * min(1, node30path97) - currentPath*(min(1,node30path97) - 1))) & (success'=min(1, node30path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path98 * min(1,node30path98) - currentNode*(min(1, node30path98) - 1))) &  (currentPath'=(98 * min(1, node30path98) - currentPath*(min(1,node30path98) - 1))) & (success'=min(1, node30path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path99 * min(1,node30path99) - currentNode*(min(1, node30path99) - 1))) &  (currentPath'=(99 * min(1, node30path99) - currentPath*(min(1,node30path99) - 1))) & (success'=min(1, node30path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node30path100 * min(1,node30path100) - currentNode*(min(1, node30path100) - 1))) &  (currentPath'=(100 * min(1, node30path100) - currentPath*(min(1,node30path100) - 1))) & (success'=min(1, node30path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 31) ->
 numPathsInv: (currentNode'=(node31path1 * min(1,node31path1) - currentNode*(min(1, node31path1) - 1))) &  (currentPath'=(1 * min(1, node31path1) - currentPath*(min(1,node31path1) - 1))) & (success'=min(1, node31path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path2 * min(1,node31path2) - currentNode*(min(1, node31path2) - 1))) &  (currentPath'=(2 * min(1, node31path2) - currentPath*(min(1,node31path2) - 1))) & (success'=min(1, node31path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path3 * min(1,node31path3) - currentNode*(min(1, node31path3) - 1))) &  (currentPath'=(3 * min(1, node31path3) - currentPath*(min(1,node31path3) - 1))) & (success'=min(1, node31path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path4 * min(1,node31path4) - currentNode*(min(1, node31path4) - 1))) &  (currentPath'=(4 * min(1, node31path4) - currentPath*(min(1,node31path4) - 1))) & (success'=min(1, node31path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path5 * min(1,node31path5) - currentNode*(min(1, node31path5) - 1))) &  (currentPath'=(5 * min(1, node31path5) - currentPath*(min(1,node31path5) - 1))) & (success'=min(1, node31path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path6 * min(1,node31path6) - currentNode*(min(1, node31path6) - 1))) &  (currentPath'=(6 * min(1, node31path6) - currentPath*(min(1,node31path6) - 1))) & (success'=min(1, node31path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path7 * min(1,node31path7) - currentNode*(min(1, node31path7) - 1))) &  (currentPath'=(7 * min(1, node31path7) - currentPath*(min(1,node31path7) - 1))) & (success'=min(1, node31path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path8 * min(1,node31path8) - currentNode*(min(1, node31path8) - 1))) &  (currentPath'=(8 * min(1, node31path8) - currentPath*(min(1,node31path8) - 1))) & (success'=min(1, node31path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path9 * min(1,node31path9) - currentNode*(min(1, node31path9) - 1))) &  (currentPath'=(9 * min(1, node31path9) - currentPath*(min(1,node31path9) - 1))) & (success'=min(1, node31path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path10 * min(1,node31path10) - currentNode*(min(1, node31path10) - 1))) &  (currentPath'=(10 * min(1, node31path10) - currentPath*(min(1,node31path10) - 1))) & (success'=min(1, node31path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path11 * min(1,node31path11) - currentNode*(min(1, node31path11) - 1))) &  (currentPath'=(11 * min(1, node31path11) - currentPath*(min(1,node31path11) - 1))) & (success'=min(1, node31path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path12 * min(1,node31path12) - currentNode*(min(1, node31path12) - 1))) &  (currentPath'=(12 * min(1, node31path12) - currentPath*(min(1,node31path12) - 1))) & (success'=min(1, node31path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path13 * min(1,node31path13) - currentNode*(min(1, node31path13) - 1))) &  (currentPath'=(13 * min(1, node31path13) - currentPath*(min(1,node31path13) - 1))) & (success'=min(1, node31path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path14 * min(1,node31path14) - currentNode*(min(1, node31path14) - 1))) &  (currentPath'=(14 * min(1, node31path14) - currentPath*(min(1,node31path14) - 1))) & (success'=min(1, node31path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path15 * min(1,node31path15) - currentNode*(min(1, node31path15) - 1))) &  (currentPath'=(15 * min(1, node31path15) - currentPath*(min(1,node31path15) - 1))) & (success'=min(1, node31path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path16 * min(1,node31path16) - currentNode*(min(1, node31path16) - 1))) &  (currentPath'=(16 * min(1, node31path16) - currentPath*(min(1,node31path16) - 1))) & (success'=min(1, node31path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path17 * min(1,node31path17) - currentNode*(min(1, node31path17) - 1))) &  (currentPath'=(17 * min(1, node31path17) - currentPath*(min(1,node31path17) - 1))) & (success'=min(1, node31path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path18 * min(1,node31path18) - currentNode*(min(1, node31path18) - 1))) &  (currentPath'=(18 * min(1, node31path18) - currentPath*(min(1,node31path18) - 1))) & (success'=min(1, node31path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path19 * min(1,node31path19) - currentNode*(min(1, node31path19) - 1))) &  (currentPath'=(19 * min(1, node31path19) - currentPath*(min(1,node31path19) - 1))) & (success'=min(1, node31path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path20 * min(1,node31path20) - currentNode*(min(1, node31path20) - 1))) &  (currentPath'=(20 * min(1, node31path20) - currentPath*(min(1,node31path20) - 1))) & (success'=min(1, node31path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path21 * min(1,node31path21) - currentNode*(min(1, node31path21) - 1))) &  (currentPath'=(21 * min(1, node31path21) - currentPath*(min(1,node31path21) - 1))) & (success'=min(1, node31path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path22 * min(1,node31path22) - currentNode*(min(1, node31path22) - 1))) &  (currentPath'=(22 * min(1, node31path22) - currentPath*(min(1,node31path22) - 1))) & (success'=min(1, node31path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path23 * min(1,node31path23) - currentNode*(min(1, node31path23) - 1))) &  (currentPath'=(23 * min(1, node31path23) - currentPath*(min(1,node31path23) - 1))) & (success'=min(1, node31path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path24 * min(1,node31path24) - currentNode*(min(1, node31path24) - 1))) &  (currentPath'=(24 * min(1, node31path24) - currentPath*(min(1,node31path24) - 1))) & (success'=min(1, node31path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path25 * min(1,node31path25) - currentNode*(min(1, node31path25) - 1))) &  (currentPath'=(25 * min(1, node31path25) - currentPath*(min(1,node31path25) - 1))) & (success'=min(1, node31path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path26 * min(1,node31path26) - currentNode*(min(1, node31path26) - 1))) &  (currentPath'=(26 * min(1, node31path26) - currentPath*(min(1,node31path26) - 1))) & (success'=min(1, node31path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path27 * min(1,node31path27) - currentNode*(min(1, node31path27) - 1))) &  (currentPath'=(27 * min(1, node31path27) - currentPath*(min(1,node31path27) - 1))) & (success'=min(1, node31path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path28 * min(1,node31path28) - currentNode*(min(1, node31path28) - 1))) &  (currentPath'=(28 * min(1, node31path28) - currentPath*(min(1,node31path28) - 1))) & (success'=min(1, node31path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path29 * min(1,node31path29) - currentNode*(min(1, node31path29) - 1))) &  (currentPath'=(29 * min(1, node31path29) - currentPath*(min(1,node31path29) - 1))) & (success'=min(1, node31path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path30 * min(1,node31path30) - currentNode*(min(1, node31path30) - 1))) &  (currentPath'=(30 * min(1, node31path30) - currentPath*(min(1,node31path30) - 1))) & (success'=min(1, node31path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path31 * min(1,node31path31) - currentNode*(min(1, node31path31) - 1))) &  (currentPath'=(31 * min(1, node31path31) - currentPath*(min(1,node31path31) - 1))) & (success'=min(1, node31path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path32 * min(1,node31path32) - currentNode*(min(1, node31path32) - 1))) &  (currentPath'=(32 * min(1, node31path32) - currentPath*(min(1,node31path32) - 1))) & (success'=min(1, node31path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path33 * min(1,node31path33) - currentNode*(min(1, node31path33) - 1))) &  (currentPath'=(33 * min(1, node31path33) - currentPath*(min(1,node31path33) - 1))) & (success'=min(1, node31path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path34 * min(1,node31path34) - currentNode*(min(1, node31path34) - 1))) &  (currentPath'=(34 * min(1, node31path34) - currentPath*(min(1,node31path34) - 1))) & (success'=min(1, node31path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path35 * min(1,node31path35) - currentNode*(min(1, node31path35) - 1))) &  (currentPath'=(35 * min(1, node31path35) - currentPath*(min(1,node31path35) - 1))) & (success'=min(1, node31path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path36 * min(1,node31path36) - currentNode*(min(1, node31path36) - 1))) &  (currentPath'=(36 * min(1, node31path36) - currentPath*(min(1,node31path36) - 1))) & (success'=min(1, node31path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path37 * min(1,node31path37) - currentNode*(min(1, node31path37) - 1))) &  (currentPath'=(37 * min(1, node31path37) - currentPath*(min(1,node31path37) - 1))) & (success'=min(1, node31path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path38 * min(1,node31path38) - currentNode*(min(1, node31path38) - 1))) &  (currentPath'=(38 * min(1, node31path38) - currentPath*(min(1,node31path38) - 1))) & (success'=min(1, node31path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path39 * min(1,node31path39) - currentNode*(min(1, node31path39) - 1))) &  (currentPath'=(39 * min(1, node31path39) - currentPath*(min(1,node31path39) - 1))) & (success'=min(1, node31path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path40 * min(1,node31path40) - currentNode*(min(1, node31path40) - 1))) &  (currentPath'=(40 * min(1, node31path40) - currentPath*(min(1,node31path40) - 1))) & (success'=min(1, node31path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path41 * min(1,node31path41) - currentNode*(min(1, node31path41) - 1))) &  (currentPath'=(41 * min(1, node31path41) - currentPath*(min(1,node31path41) - 1))) & (success'=min(1, node31path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path42 * min(1,node31path42) - currentNode*(min(1, node31path42) - 1))) &  (currentPath'=(42 * min(1, node31path42) - currentPath*(min(1,node31path42) - 1))) & (success'=min(1, node31path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path43 * min(1,node31path43) - currentNode*(min(1, node31path43) - 1))) &  (currentPath'=(43 * min(1, node31path43) - currentPath*(min(1,node31path43) - 1))) & (success'=min(1, node31path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path44 * min(1,node31path44) - currentNode*(min(1, node31path44) - 1))) &  (currentPath'=(44 * min(1, node31path44) - currentPath*(min(1,node31path44) - 1))) & (success'=min(1, node31path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path45 * min(1,node31path45) - currentNode*(min(1, node31path45) - 1))) &  (currentPath'=(45 * min(1, node31path45) - currentPath*(min(1,node31path45) - 1))) & (success'=min(1, node31path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path46 * min(1,node31path46) - currentNode*(min(1, node31path46) - 1))) &  (currentPath'=(46 * min(1, node31path46) - currentPath*(min(1,node31path46) - 1))) & (success'=min(1, node31path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path47 * min(1,node31path47) - currentNode*(min(1, node31path47) - 1))) &  (currentPath'=(47 * min(1, node31path47) - currentPath*(min(1,node31path47) - 1))) & (success'=min(1, node31path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path48 * min(1,node31path48) - currentNode*(min(1, node31path48) - 1))) &  (currentPath'=(48 * min(1, node31path48) - currentPath*(min(1,node31path48) - 1))) & (success'=min(1, node31path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path49 * min(1,node31path49) - currentNode*(min(1, node31path49) - 1))) &  (currentPath'=(49 * min(1, node31path49) - currentPath*(min(1,node31path49) - 1))) & (success'=min(1, node31path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path50 * min(1,node31path50) - currentNode*(min(1, node31path50) - 1))) &  (currentPath'=(50 * min(1, node31path50) - currentPath*(min(1,node31path50) - 1))) & (success'=min(1, node31path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path51 * min(1,node31path51) - currentNode*(min(1, node31path51) - 1))) &  (currentPath'=(51 * min(1, node31path51) - currentPath*(min(1,node31path51) - 1))) & (success'=min(1, node31path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path52 * min(1,node31path52) - currentNode*(min(1, node31path52) - 1))) &  (currentPath'=(52 * min(1, node31path52) - currentPath*(min(1,node31path52) - 1))) & (success'=min(1, node31path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path53 * min(1,node31path53) - currentNode*(min(1, node31path53) - 1))) &  (currentPath'=(53 * min(1, node31path53) - currentPath*(min(1,node31path53) - 1))) & (success'=min(1, node31path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path54 * min(1,node31path54) - currentNode*(min(1, node31path54) - 1))) &  (currentPath'=(54 * min(1, node31path54) - currentPath*(min(1,node31path54) - 1))) & (success'=min(1, node31path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path55 * min(1,node31path55) - currentNode*(min(1, node31path55) - 1))) &  (currentPath'=(55 * min(1, node31path55) - currentPath*(min(1,node31path55) - 1))) & (success'=min(1, node31path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path56 * min(1,node31path56) - currentNode*(min(1, node31path56) - 1))) &  (currentPath'=(56 * min(1, node31path56) - currentPath*(min(1,node31path56) - 1))) & (success'=min(1, node31path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path57 * min(1,node31path57) - currentNode*(min(1, node31path57) - 1))) &  (currentPath'=(57 * min(1, node31path57) - currentPath*(min(1,node31path57) - 1))) & (success'=min(1, node31path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path58 * min(1,node31path58) - currentNode*(min(1, node31path58) - 1))) &  (currentPath'=(58 * min(1, node31path58) - currentPath*(min(1,node31path58) - 1))) & (success'=min(1, node31path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path59 * min(1,node31path59) - currentNode*(min(1, node31path59) - 1))) &  (currentPath'=(59 * min(1, node31path59) - currentPath*(min(1,node31path59) - 1))) & (success'=min(1, node31path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path60 * min(1,node31path60) - currentNode*(min(1, node31path60) - 1))) &  (currentPath'=(60 * min(1, node31path60) - currentPath*(min(1,node31path60) - 1))) & (success'=min(1, node31path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path61 * min(1,node31path61) - currentNode*(min(1, node31path61) - 1))) &  (currentPath'=(61 * min(1, node31path61) - currentPath*(min(1,node31path61) - 1))) & (success'=min(1, node31path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path62 * min(1,node31path62) - currentNode*(min(1, node31path62) - 1))) &  (currentPath'=(62 * min(1, node31path62) - currentPath*(min(1,node31path62) - 1))) & (success'=min(1, node31path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path63 * min(1,node31path63) - currentNode*(min(1, node31path63) - 1))) &  (currentPath'=(63 * min(1, node31path63) - currentPath*(min(1,node31path63) - 1))) & (success'=min(1, node31path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path64 * min(1,node31path64) - currentNode*(min(1, node31path64) - 1))) &  (currentPath'=(64 * min(1, node31path64) - currentPath*(min(1,node31path64) - 1))) & (success'=min(1, node31path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path65 * min(1,node31path65) - currentNode*(min(1, node31path65) - 1))) &  (currentPath'=(65 * min(1, node31path65) - currentPath*(min(1,node31path65) - 1))) & (success'=min(1, node31path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path66 * min(1,node31path66) - currentNode*(min(1, node31path66) - 1))) &  (currentPath'=(66 * min(1, node31path66) - currentPath*(min(1,node31path66) - 1))) & (success'=min(1, node31path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path67 * min(1,node31path67) - currentNode*(min(1, node31path67) - 1))) &  (currentPath'=(67 * min(1, node31path67) - currentPath*(min(1,node31path67) - 1))) & (success'=min(1, node31path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path68 * min(1,node31path68) - currentNode*(min(1, node31path68) - 1))) &  (currentPath'=(68 * min(1, node31path68) - currentPath*(min(1,node31path68) - 1))) & (success'=min(1, node31path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path69 * min(1,node31path69) - currentNode*(min(1, node31path69) - 1))) &  (currentPath'=(69 * min(1, node31path69) - currentPath*(min(1,node31path69) - 1))) & (success'=min(1, node31path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path70 * min(1,node31path70) - currentNode*(min(1, node31path70) - 1))) &  (currentPath'=(70 * min(1, node31path70) - currentPath*(min(1,node31path70) - 1))) & (success'=min(1, node31path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path71 * min(1,node31path71) - currentNode*(min(1, node31path71) - 1))) &  (currentPath'=(71 * min(1, node31path71) - currentPath*(min(1,node31path71) - 1))) & (success'=min(1, node31path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path72 * min(1,node31path72) - currentNode*(min(1, node31path72) - 1))) &  (currentPath'=(72 * min(1, node31path72) - currentPath*(min(1,node31path72) - 1))) & (success'=min(1, node31path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path73 * min(1,node31path73) - currentNode*(min(1, node31path73) - 1))) &  (currentPath'=(73 * min(1, node31path73) - currentPath*(min(1,node31path73) - 1))) & (success'=min(1, node31path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path74 * min(1,node31path74) - currentNode*(min(1, node31path74) - 1))) &  (currentPath'=(74 * min(1, node31path74) - currentPath*(min(1,node31path74) - 1))) & (success'=min(1, node31path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path75 * min(1,node31path75) - currentNode*(min(1, node31path75) - 1))) &  (currentPath'=(75 * min(1, node31path75) - currentPath*(min(1,node31path75) - 1))) & (success'=min(1, node31path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path76 * min(1,node31path76) - currentNode*(min(1, node31path76) - 1))) &  (currentPath'=(76 * min(1, node31path76) - currentPath*(min(1,node31path76) - 1))) & (success'=min(1, node31path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path77 * min(1,node31path77) - currentNode*(min(1, node31path77) - 1))) &  (currentPath'=(77 * min(1, node31path77) - currentPath*(min(1,node31path77) - 1))) & (success'=min(1, node31path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path78 * min(1,node31path78) - currentNode*(min(1, node31path78) - 1))) &  (currentPath'=(78 * min(1, node31path78) - currentPath*(min(1,node31path78) - 1))) & (success'=min(1, node31path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path79 * min(1,node31path79) - currentNode*(min(1, node31path79) - 1))) &  (currentPath'=(79 * min(1, node31path79) - currentPath*(min(1,node31path79) - 1))) & (success'=min(1, node31path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path80 * min(1,node31path80) - currentNode*(min(1, node31path80) - 1))) &  (currentPath'=(80 * min(1, node31path80) - currentPath*(min(1,node31path80) - 1))) & (success'=min(1, node31path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path81 * min(1,node31path81) - currentNode*(min(1, node31path81) - 1))) &  (currentPath'=(81 * min(1, node31path81) - currentPath*(min(1,node31path81) - 1))) & (success'=min(1, node31path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path82 * min(1,node31path82) - currentNode*(min(1, node31path82) - 1))) &  (currentPath'=(82 * min(1, node31path82) - currentPath*(min(1,node31path82) - 1))) & (success'=min(1, node31path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path83 * min(1,node31path83) - currentNode*(min(1, node31path83) - 1))) &  (currentPath'=(83 * min(1, node31path83) - currentPath*(min(1,node31path83) - 1))) & (success'=min(1, node31path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path84 * min(1,node31path84) - currentNode*(min(1, node31path84) - 1))) &  (currentPath'=(84 * min(1, node31path84) - currentPath*(min(1,node31path84) - 1))) & (success'=min(1, node31path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path85 * min(1,node31path85) - currentNode*(min(1, node31path85) - 1))) &  (currentPath'=(85 * min(1, node31path85) - currentPath*(min(1,node31path85) - 1))) & (success'=min(1, node31path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path86 * min(1,node31path86) - currentNode*(min(1, node31path86) - 1))) &  (currentPath'=(86 * min(1, node31path86) - currentPath*(min(1,node31path86) - 1))) & (success'=min(1, node31path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path87 * min(1,node31path87) - currentNode*(min(1, node31path87) - 1))) &  (currentPath'=(87 * min(1, node31path87) - currentPath*(min(1,node31path87) - 1))) & (success'=min(1, node31path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path88 * min(1,node31path88) - currentNode*(min(1, node31path88) - 1))) &  (currentPath'=(88 * min(1, node31path88) - currentPath*(min(1,node31path88) - 1))) & (success'=min(1, node31path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path89 * min(1,node31path89) - currentNode*(min(1, node31path89) - 1))) &  (currentPath'=(89 * min(1, node31path89) - currentPath*(min(1,node31path89) - 1))) & (success'=min(1, node31path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path90 * min(1,node31path90) - currentNode*(min(1, node31path90) - 1))) &  (currentPath'=(90 * min(1, node31path90) - currentPath*(min(1,node31path90) - 1))) & (success'=min(1, node31path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path91 * min(1,node31path91) - currentNode*(min(1, node31path91) - 1))) &  (currentPath'=(91 * min(1, node31path91) - currentPath*(min(1,node31path91) - 1))) & (success'=min(1, node31path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path92 * min(1,node31path92) - currentNode*(min(1, node31path92) - 1))) &  (currentPath'=(92 * min(1, node31path92) - currentPath*(min(1,node31path92) - 1))) & (success'=min(1, node31path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path93 * min(1,node31path93) - currentNode*(min(1, node31path93) - 1))) &  (currentPath'=(93 * min(1, node31path93) - currentPath*(min(1,node31path93) - 1))) & (success'=min(1, node31path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path94 * min(1,node31path94) - currentNode*(min(1, node31path94) - 1))) &  (currentPath'=(94 * min(1, node31path94) - currentPath*(min(1,node31path94) - 1))) & (success'=min(1, node31path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path95 * min(1,node31path95) - currentNode*(min(1, node31path95) - 1))) &  (currentPath'=(95 * min(1, node31path95) - currentPath*(min(1,node31path95) - 1))) & (success'=min(1, node31path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path96 * min(1,node31path96) - currentNode*(min(1, node31path96) - 1))) &  (currentPath'=(96 * min(1, node31path96) - currentPath*(min(1,node31path96) - 1))) & (success'=min(1, node31path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path97 * min(1,node31path97) - currentNode*(min(1, node31path97) - 1))) &  (currentPath'=(97 * min(1, node31path97) - currentPath*(min(1,node31path97) - 1))) & (success'=min(1, node31path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path98 * min(1,node31path98) - currentNode*(min(1, node31path98) - 1))) &  (currentPath'=(98 * min(1, node31path98) - currentPath*(min(1,node31path98) - 1))) & (success'=min(1, node31path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path99 * min(1,node31path99) - currentNode*(min(1, node31path99) - 1))) &  (currentPath'=(99 * min(1, node31path99) - currentPath*(min(1,node31path99) - 1))) & (success'=min(1, node31path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node31path100 * min(1,node31path100) - currentNode*(min(1, node31path100) - 1))) &  (currentPath'=(100 * min(1, node31path100) - currentPath*(min(1,node31path100) - 1))) & (success'=min(1, node31path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 32) ->
 numPathsInv: (currentNode'=(node32path1 * min(1,node32path1) - currentNode*(min(1, node32path1) - 1))) &  (currentPath'=(1 * min(1, node32path1) - currentPath*(min(1,node32path1) - 1))) & (success'=min(1, node32path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path2 * min(1,node32path2) - currentNode*(min(1, node32path2) - 1))) &  (currentPath'=(2 * min(1, node32path2) - currentPath*(min(1,node32path2) - 1))) & (success'=min(1, node32path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path3 * min(1,node32path3) - currentNode*(min(1, node32path3) - 1))) &  (currentPath'=(3 * min(1, node32path3) - currentPath*(min(1,node32path3) - 1))) & (success'=min(1, node32path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path4 * min(1,node32path4) - currentNode*(min(1, node32path4) - 1))) &  (currentPath'=(4 * min(1, node32path4) - currentPath*(min(1,node32path4) - 1))) & (success'=min(1, node32path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path5 * min(1,node32path5) - currentNode*(min(1, node32path5) - 1))) &  (currentPath'=(5 * min(1, node32path5) - currentPath*(min(1,node32path5) - 1))) & (success'=min(1, node32path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path6 * min(1,node32path6) - currentNode*(min(1, node32path6) - 1))) &  (currentPath'=(6 * min(1, node32path6) - currentPath*(min(1,node32path6) - 1))) & (success'=min(1, node32path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path7 * min(1,node32path7) - currentNode*(min(1, node32path7) - 1))) &  (currentPath'=(7 * min(1, node32path7) - currentPath*(min(1,node32path7) - 1))) & (success'=min(1, node32path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path8 * min(1,node32path8) - currentNode*(min(1, node32path8) - 1))) &  (currentPath'=(8 * min(1, node32path8) - currentPath*(min(1,node32path8) - 1))) & (success'=min(1, node32path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path9 * min(1,node32path9) - currentNode*(min(1, node32path9) - 1))) &  (currentPath'=(9 * min(1, node32path9) - currentPath*(min(1,node32path9) - 1))) & (success'=min(1, node32path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path10 * min(1,node32path10) - currentNode*(min(1, node32path10) - 1))) &  (currentPath'=(10 * min(1, node32path10) - currentPath*(min(1,node32path10) - 1))) & (success'=min(1, node32path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path11 * min(1,node32path11) - currentNode*(min(1, node32path11) - 1))) &  (currentPath'=(11 * min(1, node32path11) - currentPath*(min(1,node32path11) - 1))) & (success'=min(1, node32path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path12 * min(1,node32path12) - currentNode*(min(1, node32path12) - 1))) &  (currentPath'=(12 * min(1, node32path12) - currentPath*(min(1,node32path12) - 1))) & (success'=min(1, node32path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path13 * min(1,node32path13) - currentNode*(min(1, node32path13) - 1))) &  (currentPath'=(13 * min(1, node32path13) - currentPath*(min(1,node32path13) - 1))) & (success'=min(1, node32path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path14 * min(1,node32path14) - currentNode*(min(1, node32path14) - 1))) &  (currentPath'=(14 * min(1, node32path14) - currentPath*(min(1,node32path14) - 1))) & (success'=min(1, node32path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path15 * min(1,node32path15) - currentNode*(min(1, node32path15) - 1))) &  (currentPath'=(15 * min(1, node32path15) - currentPath*(min(1,node32path15) - 1))) & (success'=min(1, node32path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path16 * min(1,node32path16) - currentNode*(min(1, node32path16) - 1))) &  (currentPath'=(16 * min(1, node32path16) - currentPath*(min(1,node32path16) - 1))) & (success'=min(1, node32path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path17 * min(1,node32path17) - currentNode*(min(1, node32path17) - 1))) &  (currentPath'=(17 * min(1, node32path17) - currentPath*(min(1,node32path17) - 1))) & (success'=min(1, node32path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path18 * min(1,node32path18) - currentNode*(min(1, node32path18) - 1))) &  (currentPath'=(18 * min(1, node32path18) - currentPath*(min(1,node32path18) - 1))) & (success'=min(1, node32path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path19 * min(1,node32path19) - currentNode*(min(1, node32path19) - 1))) &  (currentPath'=(19 * min(1, node32path19) - currentPath*(min(1,node32path19) - 1))) & (success'=min(1, node32path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path20 * min(1,node32path20) - currentNode*(min(1, node32path20) - 1))) &  (currentPath'=(20 * min(1, node32path20) - currentPath*(min(1,node32path20) - 1))) & (success'=min(1, node32path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path21 * min(1,node32path21) - currentNode*(min(1, node32path21) - 1))) &  (currentPath'=(21 * min(1, node32path21) - currentPath*(min(1,node32path21) - 1))) & (success'=min(1, node32path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path22 * min(1,node32path22) - currentNode*(min(1, node32path22) - 1))) &  (currentPath'=(22 * min(1, node32path22) - currentPath*(min(1,node32path22) - 1))) & (success'=min(1, node32path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path23 * min(1,node32path23) - currentNode*(min(1, node32path23) - 1))) &  (currentPath'=(23 * min(1, node32path23) - currentPath*(min(1,node32path23) - 1))) & (success'=min(1, node32path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path24 * min(1,node32path24) - currentNode*(min(1, node32path24) - 1))) &  (currentPath'=(24 * min(1, node32path24) - currentPath*(min(1,node32path24) - 1))) & (success'=min(1, node32path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path25 * min(1,node32path25) - currentNode*(min(1, node32path25) - 1))) &  (currentPath'=(25 * min(1, node32path25) - currentPath*(min(1,node32path25) - 1))) & (success'=min(1, node32path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path26 * min(1,node32path26) - currentNode*(min(1, node32path26) - 1))) &  (currentPath'=(26 * min(1, node32path26) - currentPath*(min(1,node32path26) - 1))) & (success'=min(1, node32path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path27 * min(1,node32path27) - currentNode*(min(1, node32path27) - 1))) &  (currentPath'=(27 * min(1, node32path27) - currentPath*(min(1,node32path27) - 1))) & (success'=min(1, node32path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path28 * min(1,node32path28) - currentNode*(min(1, node32path28) - 1))) &  (currentPath'=(28 * min(1, node32path28) - currentPath*(min(1,node32path28) - 1))) & (success'=min(1, node32path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path29 * min(1,node32path29) - currentNode*(min(1, node32path29) - 1))) &  (currentPath'=(29 * min(1, node32path29) - currentPath*(min(1,node32path29) - 1))) & (success'=min(1, node32path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path30 * min(1,node32path30) - currentNode*(min(1, node32path30) - 1))) &  (currentPath'=(30 * min(1, node32path30) - currentPath*(min(1,node32path30) - 1))) & (success'=min(1, node32path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path31 * min(1,node32path31) - currentNode*(min(1, node32path31) - 1))) &  (currentPath'=(31 * min(1, node32path31) - currentPath*(min(1,node32path31) - 1))) & (success'=min(1, node32path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path32 * min(1,node32path32) - currentNode*(min(1, node32path32) - 1))) &  (currentPath'=(32 * min(1, node32path32) - currentPath*(min(1,node32path32) - 1))) & (success'=min(1, node32path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path33 * min(1,node32path33) - currentNode*(min(1, node32path33) - 1))) &  (currentPath'=(33 * min(1, node32path33) - currentPath*(min(1,node32path33) - 1))) & (success'=min(1, node32path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path34 * min(1,node32path34) - currentNode*(min(1, node32path34) - 1))) &  (currentPath'=(34 * min(1, node32path34) - currentPath*(min(1,node32path34) - 1))) & (success'=min(1, node32path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path35 * min(1,node32path35) - currentNode*(min(1, node32path35) - 1))) &  (currentPath'=(35 * min(1, node32path35) - currentPath*(min(1,node32path35) - 1))) & (success'=min(1, node32path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path36 * min(1,node32path36) - currentNode*(min(1, node32path36) - 1))) &  (currentPath'=(36 * min(1, node32path36) - currentPath*(min(1,node32path36) - 1))) & (success'=min(1, node32path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path37 * min(1,node32path37) - currentNode*(min(1, node32path37) - 1))) &  (currentPath'=(37 * min(1, node32path37) - currentPath*(min(1,node32path37) - 1))) & (success'=min(1, node32path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path38 * min(1,node32path38) - currentNode*(min(1, node32path38) - 1))) &  (currentPath'=(38 * min(1, node32path38) - currentPath*(min(1,node32path38) - 1))) & (success'=min(1, node32path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path39 * min(1,node32path39) - currentNode*(min(1, node32path39) - 1))) &  (currentPath'=(39 * min(1, node32path39) - currentPath*(min(1,node32path39) - 1))) & (success'=min(1, node32path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path40 * min(1,node32path40) - currentNode*(min(1, node32path40) - 1))) &  (currentPath'=(40 * min(1, node32path40) - currentPath*(min(1,node32path40) - 1))) & (success'=min(1, node32path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path41 * min(1,node32path41) - currentNode*(min(1, node32path41) - 1))) &  (currentPath'=(41 * min(1, node32path41) - currentPath*(min(1,node32path41) - 1))) & (success'=min(1, node32path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path42 * min(1,node32path42) - currentNode*(min(1, node32path42) - 1))) &  (currentPath'=(42 * min(1, node32path42) - currentPath*(min(1,node32path42) - 1))) & (success'=min(1, node32path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path43 * min(1,node32path43) - currentNode*(min(1, node32path43) - 1))) &  (currentPath'=(43 * min(1, node32path43) - currentPath*(min(1,node32path43) - 1))) & (success'=min(1, node32path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path44 * min(1,node32path44) - currentNode*(min(1, node32path44) - 1))) &  (currentPath'=(44 * min(1, node32path44) - currentPath*(min(1,node32path44) - 1))) & (success'=min(1, node32path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path45 * min(1,node32path45) - currentNode*(min(1, node32path45) - 1))) &  (currentPath'=(45 * min(1, node32path45) - currentPath*(min(1,node32path45) - 1))) & (success'=min(1, node32path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path46 * min(1,node32path46) - currentNode*(min(1, node32path46) - 1))) &  (currentPath'=(46 * min(1, node32path46) - currentPath*(min(1,node32path46) - 1))) & (success'=min(1, node32path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path47 * min(1,node32path47) - currentNode*(min(1, node32path47) - 1))) &  (currentPath'=(47 * min(1, node32path47) - currentPath*(min(1,node32path47) - 1))) & (success'=min(1, node32path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path48 * min(1,node32path48) - currentNode*(min(1, node32path48) - 1))) &  (currentPath'=(48 * min(1, node32path48) - currentPath*(min(1,node32path48) - 1))) & (success'=min(1, node32path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path49 * min(1,node32path49) - currentNode*(min(1, node32path49) - 1))) &  (currentPath'=(49 * min(1, node32path49) - currentPath*(min(1,node32path49) - 1))) & (success'=min(1, node32path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path50 * min(1,node32path50) - currentNode*(min(1, node32path50) - 1))) &  (currentPath'=(50 * min(1, node32path50) - currentPath*(min(1,node32path50) - 1))) & (success'=min(1, node32path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path51 * min(1,node32path51) - currentNode*(min(1, node32path51) - 1))) &  (currentPath'=(51 * min(1, node32path51) - currentPath*(min(1,node32path51) - 1))) & (success'=min(1, node32path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path52 * min(1,node32path52) - currentNode*(min(1, node32path52) - 1))) &  (currentPath'=(52 * min(1, node32path52) - currentPath*(min(1,node32path52) - 1))) & (success'=min(1, node32path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path53 * min(1,node32path53) - currentNode*(min(1, node32path53) - 1))) &  (currentPath'=(53 * min(1, node32path53) - currentPath*(min(1,node32path53) - 1))) & (success'=min(1, node32path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path54 * min(1,node32path54) - currentNode*(min(1, node32path54) - 1))) &  (currentPath'=(54 * min(1, node32path54) - currentPath*(min(1,node32path54) - 1))) & (success'=min(1, node32path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path55 * min(1,node32path55) - currentNode*(min(1, node32path55) - 1))) &  (currentPath'=(55 * min(1, node32path55) - currentPath*(min(1,node32path55) - 1))) & (success'=min(1, node32path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path56 * min(1,node32path56) - currentNode*(min(1, node32path56) - 1))) &  (currentPath'=(56 * min(1, node32path56) - currentPath*(min(1,node32path56) - 1))) & (success'=min(1, node32path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path57 * min(1,node32path57) - currentNode*(min(1, node32path57) - 1))) &  (currentPath'=(57 * min(1, node32path57) - currentPath*(min(1,node32path57) - 1))) & (success'=min(1, node32path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path58 * min(1,node32path58) - currentNode*(min(1, node32path58) - 1))) &  (currentPath'=(58 * min(1, node32path58) - currentPath*(min(1,node32path58) - 1))) & (success'=min(1, node32path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path59 * min(1,node32path59) - currentNode*(min(1, node32path59) - 1))) &  (currentPath'=(59 * min(1, node32path59) - currentPath*(min(1,node32path59) - 1))) & (success'=min(1, node32path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path60 * min(1,node32path60) - currentNode*(min(1, node32path60) - 1))) &  (currentPath'=(60 * min(1, node32path60) - currentPath*(min(1,node32path60) - 1))) & (success'=min(1, node32path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path61 * min(1,node32path61) - currentNode*(min(1, node32path61) - 1))) &  (currentPath'=(61 * min(1, node32path61) - currentPath*(min(1,node32path61) - 1))) & (success'=min(1, node32path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path62 * min(1,node32path62) - currentNode*(min(1, node32path62) - 1))) &  (currentPath'=(62 * min(1, node32path62) - currentPath*(min(1,node32path62) - 1))) & (success'=min(1, node32path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path63 * min(1,node32path63) - currentNode*(min(1, node32path63) - 1))) &  (currentPath'=(63 * min(1, node32path63) - currentPath*(min(1,node32path63) - 1))) & (success'=min(1, node32path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path64 * min(1,node32path64) - currentNode*(min(1, node32path64) - 1))) &  (currentPath'=(64 * min(1, node32path64) - currentPath*(min(1,node32path64) - 1))) & (success'=min(1, node32path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path65 * min(1,node32path65) - currentNode*(min(1, node32path65) - 1))) &  (currentPath'=(65 * min(1, node32path65) - currentPath*(min(1,node32path65) - 1))) & (success'=min(1, node32path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path66 * min(1,node32path66) - currentNode*(min(1, node32path66) - 1))) &  (currentPath'=(66 * min(1, node32path66) - currentPath*(min(1,node32path66) - 1))) & (success'=min(1, node32path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path67 * min(1,node32path67) - currentNode*(min(1, node32path67) - 1))) &  (currentPath'=(67 * min(1, node32path67) - currentPath*(min(1,node32path67) - 1))) & (success'=min(1, node32path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path68 * min(1,node32path68) - currentNode*(min(1, node32path68) - 1))) &  (currentPath'=(68 * min(1, node32path68) - currentPath*(min(1,node32path68) - 1))) & (success'=min(1, node32path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path69 * min(1,node32path69) - currentNode*(min(1, node32path69) - 1))) &  (currentPath'=(69 * min(1, node32path69) - currentPath*(min(1,node32path69) - 1))) & (success'=min(1, node32path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path70 * min(1,node32path70) - currentNode*(min(1, node32path70) - 1))) &  (currentPath'=(70 * min(1, node32path70) - currentPath*(min(1,node32path70) - 1))) & (success'=min(1, node32path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path71 * min(1,node32path71) - currentNode*(min(1, node32path71) - 1))) &  (currentPath'=(71 * min(1, node32path71) - currentPath*(min(1,node32path71) - 1))) & (success'=min(1, node32path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path72 * min(1,node32path72) - currentNode*(min(1, node32path72) - 1))) &  (currentPath'=(72 * min(1, node32path72) - currentPath*(min(1,node32path72) - 1))) & (success'=min(1, node32path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path73 * min(1,node32path73) - currentNode*(min(1, node32path73) - 1))) &  (currentPath'=(73 * min(1, node32path73) - currentPath*(min(1,node32path73) - 1))) & (success'=min(1, node32path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path74 * min(1,node32path74) - currentNode*(min(1, node32path74) - 1))) &  (currentPath'=(74 * min(1, node32path74) - currentPath*(min(1,node32path74) - 1))) & (success'=min(1, node32path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path75 * min(1,node32path75) - currentNode*(min(1, node32path75) - 1))) &  (currentPath'=(75 * min(1, node32path75) - currentPath*(min(1,node32path75) - 1))) & (success'=min(1, node32path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path76 * min(1,node32path76) - currentNode*(min(1, node32path76) - 1))) &  (currentPath'=(76 * min(1, node32path76) - currentPath*(min(1,node32path76) - 1))) & (success'=min(1, node32path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path77 * min(1,node32path77) - currentNode*(min(1, node32path77) - 1))) &  (currentPath'=(77 * min(1, node32path77) - currentPath*(min(1,node32path77) - 1))) & (success'=min(1, node32path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path78 * min(1,node32path78) - currentNode*(min(1, node32path78) - 1))) &  (currentPath'=(78 * min(1, node32path78) - currentPath*(min(1,node32path78) - 1))) & (success'=min(1, node32path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path79 * min(1,node32path79) - currentNode*(min(1, node32path79) - 1))) &  (currentPath'=(79 * min(1, node32path79) - currentPath*(min(1,node32path79) - 1))) & (success'=min(1, node32path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path80 * min(1,node32path80) - currentNode*(min(1, node32path80) - 1))) &  (currentPath'=(80 * min(1, node32path80) - currentPath*(min(1,node32path80) - 1))) & (success'=min(1, node32path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path81 * min(1,node32path81) - currentNode*(min(1, node32path81) - 1))) &  (currentPath'=(81 * min(1, node32path81) - currentPath*(min(1,node32path81) - 1))) & (success'=min(1, node32path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path82 * min(1,node32path82) - currentNode*(min(1, node32path82) - 1))) &  (currentPath'=(82 * min(1, node32path82) - currentPath*(min(1,node32path82) - 1))) & (success'=min(1, node32path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path83 * min(1,node32path83) - currentNode*(min(1, node32path83) - 1))) &  (currentPath'=(83 * min(1, node32path83) - currentPath*(min(1,node32path83) - 1))) & (success'=min(1, node32path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path84 * min(1,node32path84) - currentNode*(min(1, node32path84) - 1))) &  (currentPath'=(84 * min(1, node32path84) - currentPath*(min(1,node32path84) - 1))) & (success'=min(1, node32path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path85 * min(1,node32path85) - currentNode*(min(1, node32path85) - 1))) &  (currentPath'=(85 * min(1, node32path85) - currentPath*(min(1,node32path85) - 1))) & (success'=min(1, node32path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path86 * min(1,node32path86) - currentNode*(min(1, node32path86) - 1))) &  (currentPath'=(86 * min(1, node32path86) - currentPath*(min(1,node32path86) - 1))) & (success'=min(1, node32path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path87 * min(1,node32path87) - currentNode*(min(1, node32path87) - 1))) &  (currentPath'=(87 * min(1, node32path87) - currentPath*(min(1,node32path87) - 1))) & (success'=min(1, node32path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path88 * min(1,node32path88) - currentNode*(min(1, node32path88) - 1))) &  (currentPath'=(88 * min(1, node32path88) - currentPath*(min(1,node32path88) - 1))) & (success'=min(1, node32path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path89 * min(1,node32path89) - currentNode*(min(1, node32path89) - 1))) &  (currentPath'=(89 * min(1, node32path89) - currentPath*(min(1,node32path89) - 1))) & (success'=min(1, node32path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path90 * min(1,node32path90) - currentNode*(min(1, node32path90) - 1))) &  (currentPath'=(90 * min(1, node32path90) - currentPath*(min(1,node32path90) - 1))) & (success'=min(1, node32path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path91 * min(1,node32path91) - currentNode*(min(1, node32path91) - 1))) &  (currentPath'=(91 * min(1, node32path91) - currentPath*(min(1,node32path91) - 1))) & (success'=min(1, node32path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path92 * min(1,node32path92) - currentNode*(min(1, node32path92) - 1))) &  (currentPath'=(92 * min(1, node32path92) - currentPath*(min(1,node32path92) - 1))) & (success'=min(1, node32path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path93 * min(1,node32path93) - currentNode*(min(1, node32path93) - 1))) &  (currentPath'=(93 * min(1, node32path93) - currentPath*(min(1,node32path93) - 1))) & (success'=min(1, node32path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path94 * min(1,node32path94) - currentNode*(min(1, node32path94) - 1))) &  (currentPath'=(94 * min(1, node32path94) - currentPath*(min(1,node32path94) - 1))) & (success'=min(1, node32path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path95 * min(1,node32path95) - currentNode*(min(1, node32path95) - 1))) &  (currentPath'=(95 * min(1, node32path95) - currentPath*(min(1,node32path95) - 1))) & (success'=min(1, node32path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path96 * min(1,node32path96) - currentNode*(min(1, node32path96) - 1))) &  (currentPath'=(96 * min(1, node32path96) - currentPath*(min(1,node32path96) - 1))) & (success'=min(1, node32path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path97 * min(1,node32path97) - currentNode*(min(1, node32path97) - 1))) &  (currentPath'=(97 * min(1, node32path97) - currentPath*(min(1,node32path97) - 1))) & (success'=min(1, node32path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path98 * min(1,node32path98) - currentNode*(min(1, node32path98) - 1))) &  (currentPath'=(98 * min(1, node32path98) - currentPath*(min(1,node32path98) - 1))) & (success'=min(1, node32path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path99 * min(1,node32path99) - currentNode*(min(1, node32path99) - 1))) &  (currentPath'=(99 * min(1, node32path99) - currentPath*(min(1,node32path99) - 1))) & (success'=min(1, node32path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node32path100 * min(1,node32path100) - currentNode*(min(1, node32path100) - 1))) &  (currentPath'=(100 * min(1, node32path100) - currentPath*(min(1,node32path100) - 1))) & (success'=min(1, node32path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 33) ->
 numPathsInv: (currentNode'=(node33path1 * min(1,node33path1) - currentNode*(min(1, node33path1) - 1))) &  (currentPath'=(1 * min(1, node33path1) - currentPath*(min(1,node33path1) - 1))) & (success'=min(1, node33path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path2 * min(1,node33path2) - currentNode*(min(1, node33path2) - 1))) &  (currentPath'=(2 * min(1, node33path2) - currentPath*(min(1,node33path2) - 1))) & (success'=min(1, node33path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path3 * min(1,node33path3) - currentNode*(min(1, node33path3) - 1))) &  (currentPath'=(3 * min(1, node33path3) - currentPath*(min(1,node33path3) - 1))) & (success'=min(1, node33path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path4 * min(1,node33path4) - currentNode*(min(1, node33path4) - 1))) &  (currentPath'=(4 * min(1, node33path4) - currentPath*(min(1,node33path4) - 1))) & (success'=min(1, node33path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path5 * min(1,node33path5) - currentNode*(min(1, node33path5) - 1))) &  (currentPath'=(5 * min(1, node33path5) - currentPath*(min(1,node33path5) - 1))) & (success'=min(1, node33path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path6 * min(1,node33path6) - currentNode*(min(1, node33path6) - 1))) &  (currentPath'=(6 * min(1, node33path6) - currentPath*(min(1,node33path6) - 1))) & (success'=min(1, node33path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path7 * min(1,node33path7) - currentNode*(min(1, node33path7) - 1))) &  (currentPath'=(7 * min(1, node33path7) - currentPath*(min(1,node33path7) - 1))) & (success'=min(1, node33path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path8 * min(1,node33path8) - currentNode*(min(1, node33path8) - 1))) &  (currentPath'=(8 * min(1, node33path8) - currentPath*(min(1,node33path8) - 1))) & (success'=min(1, node33path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path9 * min(1,node33path9) - currentNode*(min(1, node33path9) - 1))) &  (currentPath'=(9 * min(1, node33path9) - currentPath*(min(1,node33path9) - 1))) & (success'=min(1, node33path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path10 * min(1,node33path10) - currentNode*(min(1, node33path10) - 1))) &  (currentPath'=(10 * min(1, node33path10) - currentPath*(min(1,node33path10) - 1))) & (success'=min(1, node33path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path11 * min(1,node33path11) - currentNode*(min(1, node33path11) - 1))) &  (currentPath'=(11 * min(1, node33path11) - currentPath*(min(1,node33path11) - 1))) & (success'=min(1, node33path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path12 * min(1,node33path12) - currentNode*(min(1, node33path12) - 1))) &  (currentPath'=(12 * min(1, node33path12) - currentPath*(min(1,node33path12) - 1))) & (success'=min(1, node33path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path13 * min(1,node33path13) - currentNode*(min(1, node33path13) - 1))) &  (currentPath'=(13 * min(1, node33path13) - currentPath*(min(1,node33path13) - 1))) & (success'=min(1, node33path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path14 * min(1,node33path14) - currentNode*(min(1, node33path14) - 1))) &  (currentPath'=(14 * min(1, node33path14) - currentPath*(min(1,node33path14) - 1))) & (success'=min(1, node33path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path15 * min(1,node33path15) - currentNode*(min(1, node33path15) - 1))) &  (currentPath'=(15 * min(1, node33path15) - currentPath*(min(1,node33path15) - 1))) & (success'=min(1, node33path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path16 * min(1,node33path16) - currentNode*(min(1, node33path16) - 1))) &  (currentPath'=(16 * min(1, node33path16) - currentPath*(min(1,node33path16) - 1))) & (success'=min(1, node33path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path17 * min(1,node33path17) - currentNode*(min(1, node33path17) - 1))) &  (currentPath'=(17 * min(1, node33path17) - currentPath*(min(1,node33path17) - 1))) & (success'=min(1, node33path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path18 * min(1,node33path18) - currentNode*(min(1, node33path18) - 1))) &  (currentPath'=(18 * min(1, node33path18) - currentPath*(min(1,node33path18) - 1))) & (success'=min(1, node33path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path19 * min(1,node33path19) - currentNode*(min(1, node33path19) - 1))) &  (currentPath'=(19 * min(1, node33path19) - currentPath*(min(1,node33path19) - 1))) & (success'=min(1, node33path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path20 * min(1,node33path20) - currentNode*(min(1, node33path20) - 1))) &  (currentPath'=(20 * min(1, node33path20) - currentPath*(min(1,node33path20) - 1))) & (success'=min(1, node33path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path21 * min(1,node33path21) - currentNode*(min(1, node33path21) - 1))) &  (currentPath'=(21 * min(1, node33path21) - currentPath*(min(1,node33path21) - 1))) & (success'=min(1, node33path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path22 * min(1,node33path22) - currentNode*(min(1, node33path22) - 1))) &  (currentPath'=(22 * min(1, node33path22) - currentPath*(min(1,node33path22) - 1))) & (success'=min(1, node33path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path23 * min(1,node33path23) - currentNode*(min(1, node33path23) - 1))) &  (currentPath'=(23 * min(1, node33path23) - currentPath*(min(1,node33path23) - 1))) & (success'=min(1, node33path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path24 * min(1,node33path24) - currentNode*(min(1, node33path24) - 1))) &  (currentPath'=(24 * min(1, node33path24) - currentPath*(min(1,node33path24) - 1))) & (success'=min(1, node33path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path25 * min(1,node33path25) - currentNode*(min(1, node33path25) - 1))) &  (currentPath'=(25 * min(1, node33path25) - currentPath*(min(1,node33path25) - 1))) & (success'=min(1, node33path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path26 * min(1,node33path26) - currentNode*(min(1, node33path26) - 1))) &  (currentPath'=(26 * min(1, node33path26) - currentPath*(min(1,node33path26) - 1))) & (success'=min(1, node33path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path27 * min(1,node33path27) - currentNode*(min(1, node33path27) - 1))) &  (currentPath'=(27 * min(1, node33path27) - currentPath*(min(1,node33path27) - 1))) & (success'=min(1, node33path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path28 * min(1,node33path28) - currentNode*(min(1, node33path28) - 1))) &  (currentPath'=(28 * min(1, node33path28) - currentPath*(min(1,node33path28) - 1))) & (success'=min(1, node33path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path29 * min(1,node33path29) - currentNode*(min(1, node33path29) - 1))) &  (currentPath'=(29 * min(1, node33path29) - currentPath*(min(1,node33path29) - 1))) & (success'=min(1, node33path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path30 * min(1,node33path30) - currentNode*(min(1, node33path30) - 1))) &  (currentPath'=(30 * min(1, node33path30) - currentPath*(min(1,node33path30) - 1))) & (success'=min(1, node33path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path31 * min(1,node33path31) - currentNode*(min(1, node33path31) - 1))) &  (currentPath'=(31 * min(1, node33path31) - currentPath*(min(1,node33path31) - 1))) & (success'=min(1, node33path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path32 * min(1,node33path32) - currentNode*(min(1, node33path32) - 1))) &  (currentPath'=(32 * min(1, node33path32) - currentPath*(min(1,node33path32) - 1))) & (success'=min(1, node33path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path33 * min(1,node33path33) - currentNode*(min(1, node33path33) - 1))) &  (currentPath'=(33 * min(1, node33path33) - currentPath*(min(1,node33path33) - 1))) & (success'=min(1, node33path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path34 * min(1,node33path34) - currentNode*(min(1, node33path34) - 1))) &  (currentPath'=(34 * min(1, node33path34) - currentPath*(min(1,node33path34) - 1))) & (success'=min(1, node33path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path35 * min(1,node33path35) - currentNode*(min(1, node33path35) - 1))) &  (currentPath'=(35 * min(1, node33path35) - currentPath*(min(1,node33path35) - 1))) & (success'=min(1, node33path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path36 * min(1,node33path36) - currentNode*(min(1, node33path36) - 1))) &  (currentPath'=(36 * min(1, node33path36) - currentPath*(min(1,node33path36) - 1))) & (success'=min(1, node33path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path37 * min(1,node33path37) - currentNode*(min(1, node33path37) - 1))) &  (currentPath'=(37 * min(1, node33path37) - currentPath*(min(1,node33path37) - 1))) & (success'=min(1, node33path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path38 * min(1,node33path38) - currentNode*(min(1, node33path38) - 1))) &  (currentPath'=(38 * min(1, node33path38) - currentPath*(min(1,node33path38) - 1))) & (success'=min(1, node33path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path39 * min(1,node33path39) - currentNode*(min(1, node33path39) - 1))) &  (currentPath'=(39 * min(1, node33path39) - currentPath*(min(1,node33path39) - 1))) & (success'=min(1, node33path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path40 * min(1,node33path40) - currentNode*(min(1, node33path40) - 1))) &  (currentPath'=(40 * min(1, node33path40) - currentPath*(min(1,node33path40) - 1))) & (success'=min(1, node33path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path41 * min(1,node33path41) - currentNode*(min(1, node33path41) - 1))) &  (currentPath'=(41 * min(1, node33path41) - currentPath*(min(1,node33path41) - 1))) & (success'=min(1, node33path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path42 * min(1,node33path42) - currentNode*(min(1, node33path42) - 1))) &  (currentPath'=(42 * min(1, node33path42) - currentPath*(min(1,node33path42) - 1))) & (success'=min(1, node33path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path43 * min(1,node33path43) - currentNode*(min(1, node33path43) - 1))) &  (currentPath'=(43 * min(1, node33path43) - currentPath*(min(1,node33path43) - 1))) & (success'=min(1, node33path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path44 * min(1,node33path44) - currentNode*(min(1, node33path44) - 1))) &  (currentPath'=(44 * min(1, node33path44) - currentPath*(min(1,node33path44) - 1))) & (success'=min(1, node33path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path45 * min(1,node33path45) - currentNode*(min(1, node33path45) - 1))) &  (currentPath'=(45 * min(1, node33path45) - currentPath*(min(1,node33path45) - 1))) & (success'=min(1, node33path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path46 * min(1,node33path46) - currentNode*(min(1, node33path46) - 1))) &  (currentPath'=(46 * min(1, node33path46) - currentPath*(min(1,node33path46) - 1))) & (success'=min(1, node33path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path47 * min(1,node33path47) - currentNode*(min(1, node33path47) - 1))) &  (currentPath'=(47 * min(1, node33path47) - currentPath*(min(1,node33path47) - 1))) & (success'=min(1, node33path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path48 * min(1,node33path48) - currentNode*(min(1, node33path48) - 1))) &  (currentPath'=(48 * min(1, node33path48) - currentPath*(min(1,node33path48) - 1))) & (success'=min(1, node33path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path49 * min(1,node33path49) - currentNode*(min(1, node33path49) - 1))) &  (currentPath'=(49 * min(1, node33path49) - currentPath*(min(1,node33path49) - 1))) & (success'=min(1, node33path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path50 * min(1,node33path50) - currentNode*(min(1, node33path50) - 1))) &  (currentPath'=(50 * min(1, node33path50) - currentPath*(min(1,node33path50) - 1))) & (success'=min(1, node33path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path51 * min(1,node33path51) - currentNode*(min(1, node33path51) - 1))) &  (currentPath'=(51 * min(1, node33path51) - currentPath*(min(1,node33path51) - 1))) & (success'=min(1, node33path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path52 * min(1,node33path52) - currentNode*(min(1, node33path52) - 1))) &  (currentPath'=(52 * min(1, node33path52) - currentPath*(min(1,node33path52) - 1))) & (success'=min(1, node33path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path53 * min(1,node33path53) - currentNode*(min(1, node33path53) - 1))) &  (currentPath'=(53 * min(1, node33path53) - currentPath*(min(1,node33path53) - 1))) & (success'=min(1, node33path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path54 * min(1,node33path54) - currentNode*(min(1, node33path54) - 1))) &  (currentPath'=(54 * min(1, node33path54) - currentPath*(min(1,node33path54) - 1))) & (success'=min(1, node33path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path55 * min(1,node33path55) - currentNode*(min(1, node33path55) - 1))) &  (currentPath'=(55 * min(1, node33path55) - currentPath*(min(1,node33path55) - 1))) & (success'=min(1, node33path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path56 * min(1,node33path56) - currentNode*(min(1, node33path56) - 1))) &  (currentPath'=(56 * min(1, node33path56) - currentPath*(min(1,node33path56) - 1))) & (success'=min(1, node33path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path57 * min(1,node33path57) - currentNode*(min(1, node33path57) - 1))) &  (currentPath'=(57 * min(1, node33path57) - currentPath*(min(1,node33path57) - 1))) & (success'=min(1, node33path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path58 * min(1,node33path58) - currentNode*(min(1, node33path58) - 1))) &  (currentPath'=(58 * min(1, node33path58) - currentPath*(min(1,node33path58) - 1))) & (success'=min(1, node33path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path59 * min(1,node33path59) - currentNode*(min(1, node33path59) - 1))) &  (currentPath'=(59 * min(1, node33path59) - currentPath*(min(1,node33path59) - 1))) & (success'=min(1, node33path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path60 * min(1,node33path60) - currentNode*(min(1, node33path60) - 1))) &  (currentPath'=(60 * min(1, node33path60) - currentPath*(min(1,node33path60) - 1))) & (success'=min(1, node33path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path61 * min(1,node33path61) - currentNode*(min(1, node33path61) - 1))) &  (currentPath'=(61 * min(1, node33path61) - currentPath*(min(1,node33path61) - 1))) & (success'=min(1, node33path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path62 * min(1,node33path62) - currentNode*(min(1, node33path62) - 1))) &  (currentPath'=(62 * min(1, node33path62) - currentPath*(min(1,node33path62) - 1))) & (success'=min(1, node33path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path63 * min(1,node33path63) - currentNode*(min(1, node33path63) - 1))) &  (currentPath'=(63 * min(1, node33path63) - currentPath*(min(1,node33path63) - 1))) & (success'=min(1, node33path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path64 * min(1,node33path64) - currentNode*(min(1, node33path64) - 1))) &  (currentPath'=(64 * min(1, node33path64) - currentPath*(min(1,node33path64) - 1))) & (success'=min(1, node33path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path65 * min(1,node33path65) - currentNode*(min(1, node33path65) - 1))) &  (currentPath'=(65 * min(1, node33path65) - currentPath*(min(1,node33path65) - 1))) & (success'=min(1, node33path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path66 * min(1,node33path66) - currentNode*(min(1, node33path66) - 1))) &  (currentPath'=(66 * min(1, node33path66) - currentPath*(min(1,node33path66) - 1))) & (success'=min(1, node33path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path67 * min(1,node33path67) - currentNode*(min(1, node33path67) - 1))) &  (currentPath'=(67 * min(1, node33path67) - currentPath*(min(1,node33path67) - 1))) & (success'=min(1, node33path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path68 * min(1,node33path68) - currentNode*(min(1, node33path68) - 1))) &  (currentPath'=(68 * min(1, node33path68) - currentPath*(min(1,node33path68) - 1))) & (success'=min(1, node33path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path69 * min(1,node33path69) - currentNode*(min(1, node33path69) - 1))) &  (currentPath'=(69 * min(1, node33path69) - currentPath*(min(1,node33path69) - 1))) & (success'=min(1, node33path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path70 * min(1,node33path70) - currentNode*(min(1, node33path70) - 1))) &  (currentPath'=(70 * min(1, node33path70) - currentPath*(min(1,node33path70) - 1))) & (success'=min(1, node33path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path71 * min(1,node33path71) - currentNode*(min(1, node33path71) - 1))) &  (currentPath'=(71 * min(1, node33path71) - currentPath*(min(1,node33path71) - 1))) & (success'=min(1, node33path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path72 * min(1,node33path72) - currentNode*(min(1, node33path72) - 1))) &  (currentPath'=(72 * min(1, node33path72) - currentPath*(min(1,node33path72) - 1))) & (success'=min(1, node33path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path73 * min(1,node33path73) - currentNode*(min(1, node33path73) - 1))) &  (currentPath'=(73 * min(1, node33path73) - currentPath*(min(1,node33path73) - 1))) & (success'=min(1, node33path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path74 * min(1,node33path74) - currentNode*(min(1, node33path74) - 1))) &  (currentPath'=(74 * min(1, node33path74) - currentPath*(min(1,node33path74) - 1))) & (success'=min(1, node33path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path75 * min(1,node33path75) - currentNode*(min(1, node33path75) - 1))) &  (currentPath'=(75 * min(1, node33path75) - currentPath*(min(1,node33path75) - 1))) & (success'=min(1, node33path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path76 * min(1,node33path76) - currentNode*(min(1, node33path76) - 1))) &  (currentPath'=(76 * min(1, node33path76) - currentPath*(min(1,node33path76) - 1))) & (success'=min(1, node33path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path77 * min(1,node33path77) - currentNode*(min(1, node33path77) - 1))) &  (currentPath'=(77 * min(1, node33path77) - currentPath*(min(1,node33path77) - 1))) & (success'=min(1, node33path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path78 * min(1,node33path78) - currentNode*(min(1, node33path78) - 1))) &  (currentPath'=(78 * min(1, node33path78) - currentPath*(min(1,node33path78) - 1))) & (success'=min(1, node33path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path79 * min(1,node33path79) - currentNode*(min(1, node33path79) - 1))) &  (currentPath'=(79 * min(1, node33path79) - currentPath*(min(1,node33path79) - 1))) & (success'=min(1, node33path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path80 * min(1,node33path80) - currentNode*(min(1, node33path80) - 1))) &  (currentPath'=(80 * min(1, node33path80) - currentPath*(min(1,node33path80) - 1))) & (success'=min(1, node33path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path81 * min(1,node33path81) - currentNode*(min(1, node33path81) - 1))) &  (currentPath'=(81 * min(1, node33path81) - currentPath*(min(1,node33path81) - 1))) & (success'=min(1, node33path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path82 * min(1,node33path82) - currentNode*(min(1, node33path82) - 1))) &  (currentPath'=(82 * min(1, node33path82) - currentPath*(min(1,node33path82) - 1))) & (success'=min(1, node33path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path83 * min(1,node33path83) - currentNode*(min(1, node33path83) - 1))) &  (currentPath'=(83 * min(1, node33path83) - currentPath*(min(1,node33path83) - 1))) & (success'=min(1, node33path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path84 * min(1,node33path84) - currentNode*(min(1, node33path84) - 1))) &  (currentPath'=(84 * min(1, node33path84) - currentPath*(min(1,node33path84) - 1))) & (success'=min(1, node33path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path85 * min(1,node33path85) - currentNode*(min(1, node33path85) - 1))) &  (currentPath'=(85 * min(1, node33path85) - currentPath*(min(1,node33path85) - 1))) & (success'=min(1, node33path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path86 * min(1,node33path86) - currentNode*(min(1, node33path86) - 1))) &  (currentPath'=(86 * min(1, node33path86) - currentPath*(min(1,node33path86) - 1))) & (success'=min(1, node33path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path87 * min(1,node33path87) - currentNode*(min(1, node33path87) - 1))) &  (currentPath'=(87 * min(1, node33path87) - currentPath*(min(1,node33path87) - 1))) & (success'=min(1, node33path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path88 * min(1,node33path88) - currentNode*(min(1, node33path88) - 1))) &  (currentPath'=(88 * min(1, node33path88) - currentPath*(min(1,node33path88) - 1))) & (success'=min(1, node33path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path89 * min(1,node33path89) - currentNode*(min(1, node33path89) - 1))) &  (currentPath'=(89 * min(1, node33path89) - currentPath*(min(1,node33path89) - 1))) & (success'=min(1, node33path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path90 * min(1,node33path90) - currentNode*(min(1, node33path90) - 1))) &  (currentPath'=(90 * min(1, node33path90) - currentPath*(min(1,node33path90) - 1))) & (success'=min(1, node33path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path91 * min(1,node33path91) - currentNode*(min(1, node33path91) - 1))) &  (currentPath'=(91 * min(1, node33path91) - currentPath*(min(1,node33path91) - 1))) & (success'=min(1, node33path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path92 * min(1,node33path92) - currentNode*(min(1, node33path92) - 1))) &  (currentPath'=(92 * min(1, node33path92) - currentPath*(min(1,node33path92) - 1))) & (success'=min(1, node33path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path93 * min(1,node33path93) - currentNode*(min(1, node33path93) - 1))) &  (currentPath'=(93 * min(1, node33path93) - currentPath*(min(1,node33path93) - 1))) & (success'=min(1, node33path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path94 * min(1,node33path94) - currentNode*(min(1, node33path94) - 1))) &  (currentPath'=(94 * min(1, node33path94) - currentPath*(min(1,node33path94) - 1))) & (success'=min(1, node33path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path95 * min(1,node33path95) - currentNode*(min(1, node33path95) - 1))) &  (currentPath'=(95 * min(1, node33path95) - currentPath*(min(1,node33path95) - 1))) & (success'=min(1, node33path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path96 * min(1,node33path96) - currentNode*(min(1, node33path96) - 1))) &  (currentPath'=(96 * min(1, node33path96) - currentPath*(min(1,node33path96) - 1))) & (success'=min(1, node33path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path97 * min(1,node33path97) - currentNode*(min(1, node33path97) - 1))) &  (currentPath'=(97 * min(1, node33path97) - currentPath*(min(1,node33path97) - 1))) & (success'=min(1, node33path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path98 * min(1,node33path98) - currentNode*(min(1, node33path98) - 1))) &  (currentPath'=(98 * min(1, node33path98) - currentPath*(min(1,node33path98) - 1))) & (success'=min(1, node33path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path99 * min(1,node33path99) - currentNode*(min(1, node33path99) - 1))) &  (currentPath'=(99 * min(1, node33path99) - currentPath*(min(1,node33path99) - 1))) & (success'=min(1, node33path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node33path100 * min(1,node33path100) - currentNode*(min(1, node33path100) - 1))) &  (currentPath'=(100 * min(1, node33path100) - currentPath*(min(1,node33path100) - 1))) & (success'=min(1, node33path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 34) ->
 numPathsInv: (currentNode'=(node34path1 * min(1,node34path1) - currentNode*(min(1, node34path1) - 1))) &  (currentPath'=(1 * min(1, node34path1) - currentPath*(min(1,node34path1) - 1))) & (success'=min(1, node34path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path2 * min(1,node34path2) - currentNode*(min(1, node34path2) - 1))) &  (currentPath'=(2 * min(1, node34path2) - currentPath*(min(1,node34path2) - 1))) & (success'=min(1, node34path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path3 * min(1,node34path3) - currentNode*(min(1, node34path3) - 1))) &  (currentPath'=(3 * min(1, node34path3) - currentPath*(min(1,node34path3) - 1))) & (success'=min(1, node34path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path4 * min(1,node34path4) - currentNode*(min(1, node34path4) - 1))) &  (currentPath'=(4 * min(1, node34path4) - currentPath*(min(1,node34path4) - 1))) & (success'=min(1, node34path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path5 * min(1,node34path5) - currentNode*(min(1, node34path5) - 1))) &  (currentPath'=(5 * min(1, node34path5) - currentPath*(min(1,node34path5) - 1))) & (success'=min(1, node34path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path6 * min(1,node34path6) - currentNode*(min(1, node34path6) - 1))) &  (currentPath'=(6 * min(1, node34path6) - currentPath*(min(1,node34path6) - 1))) & (success'=min(1, node34path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path7 * min(1,node34path7) - currentNode*(min(1, node34path7) - 1))) &  (currentPath'=(7 * min(1, node34path7) - currentPath*(min(1,node34path7) - 1))) & (success'=min(1, node34path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path8 * min(1,node34path8) - currentNode*(min(1, node34path8) - 1))) &  (currentPath'=(8 * min(1, node34path8) - currentPath*(min(1,node34path8) - 1))) & (success'=min(1, node34path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path9 * min(1,node34path9) - currentNode*(min(1, node34path9) - 1))) &  (currentPath'=(9 * min(1, node34path9) - currentPath*(min(1,node34path9) - 1))) & (success'=min(1, node34path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path10 * min(1,node34path10) - currentNode*(min(1, node34path10) - 1))) &  (currentPath'=(10 * min(1, node34path10) - currentPath*(min(1,node34path10) - 1))) & (success'=min(1, node34path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path11 * min(1,node34path11) - currentNode*(min(1, node34path11) - 1))) &  (currentPath'=(11 * min(1, node34path11) - currentPath*(min(1,node34path11) - 1))) & (success'=min(1, node34path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path12 * min(1,node34path12) - currentNode*(min(1, node34path12) - 1))) &  (currentPath'=(12 * min(1, node34path12) - currentPath*(min(1,node34path12) - 1))) & (success'=min(1, node34path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path13 * min(1,node34path13) - currentNode*(min(1, node34path13) - 1))) &  (currentPath'=(13 * min(1, node34path13) - currentPath*(min(1,node34path13) - 1))) & (success'=min(1, node34path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path14 * min(1,node34path14) - currentNode*(min(1, node34path14) - 1))) &  (currentPath'=(14 * min(1, node34path14) - currentPath*(min(1,node34path14) - 1))) & (success'=min(1, node34path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path15 * min(1,node34path15) - currentNode*(min(1, node34path15) - 1))) &  (currentPath'=(15 * min(1, node34path15) - currentPath*(min(1,node34path15) - 1))) & (success'=min(1, node34path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path16 * min(1,node34path16) - currentNode*(min(1, node34path16) - 1))) &  (currentPath'=(16 * min(1, node34path16) - currentPath*(min(1,node34path16) - 1))) & (success'=min(1, node34path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path17 * min(1,node34path17) - currentNode*(min(1, node34path17) - 1))) &  (currentPath'=(17 * min(1, node34path17) - currentPath*(min(1,node34path17) - 1))) & (success'=min(1, node34path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path18 * min(1,node34path18) - currentNode*(min(1, node34path18) - 1))) &  (currentPath'=(18 * min(1, node34path18) - currentPath*(min(1,node34path18) - 1))) & (success'=min(1, node34path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path19 * min(1,node34path19) - currentNode*(min(1, node34path19) - 1))) &  (currentPath'=(19 * min(1, node34path19) - currentPath*(min(1,node34path19) - 1))) & (success'=min(1, node34path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path20 * min(1,node34path20) - currentNode*(min(1, node34path20) - 1))) &  (currentPath'=(20 * min(1, node34path20) - currentPath*(min(1,node34path20) - 1))) & (success'=min(1, node34path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path21 * min(1,node34path21) - currentNode*(min(1, node34path21) - 1))) &  (currentPath'=(21 * min(1, node34path21) - currentPath*(min(1,node34path21) - 1))) & (success'=min(1, node34path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path22 * min(1,node34path22) - currentNode*(min(1, node34path22) - 1))) &  (currentPath'=(22 * min(1, node34path22) - currentPath*(min(1,node34path22) - 1))) & (success'=min(1, node34path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path23 * min(1,node34path23) - currentNode*(min(1, node34path23) - 1))) &  (currentPath'=(23 * min(1, node34path23) - currentPath*(min(1,node34path23) - 1))) & (success'=min(1, node34path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path24 * min(1,node34path24) - currentNode*(min(1, node34path24) - 1))) &  (currentPath'=(24 * min(1, node34path24) - currentPath*(min(1,node34path24) - 1))) & (success'=min(1, node34path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path25 * min(1,node34path25) - currentNode*(min(1, node34path25) - 1))) &  (currentPath'=(25 * min(1, node34path25) - currentPath*(min(1,node34path25) - 1))) & (success'=min(1, node34path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path26 * min(1,node34path26) - currentNode*(min(1, node34path26) - 1))) &  (currentPath'=(26 * min(1, node34path26) - currentPath*(min(1,node34path26) - 1))) & (success'=min(1, node34path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path27 * min(1,node34path27) - currentNode*(min(1, node34path27) - 1))) &  (currentPath'=(27 * min(1, node34path27) - currentPath*(min(1,node34path27) - 1))) & (success'=min(1, node34path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path28 * min(1,node34path28) - currentNode*(min(1, node34path28) - 1))) &  (currentPath'=(28 * min(1, node34path28) - currentPath*(min(1,node34path28) - 1))) & (success'=min(1, node34path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path29 * min(1,node34path29) - currentNode*(min(1, node34path29) - 1))) &  (currentPath'=(29 * min(1, node34path29) - currentPath*(min(1,node34path29) - 1))) & (success'=min(1, node34path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path30 * min(1,node34path30) - currentNode*(min(1, node34path30) - 1))) &  (currentPath'=(30 * min(1, node34path30) - currentPath*(min(1,node34path30) - 1))) & (success'=min(1, node34path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path31 * min(1,node34path31) - currentNode*(min(1, node34path31) - 1))) &  (currentPath'=(31 * min(1, node34path31) - currentPath*(min(1,node34path31) - 1))) & (success'=min(1, node34path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path32 * min(1,node34path32) - currentNode*(min(1, node34path32) - 1))) &  (currentPath'=(32 * min(1, node34path32) - currentPath*(min(1,node34path32) - 1))) & (success'=min(1, node34path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path33 * min(1,node34path33) - currentNode*(min(1, node34path33) - 1))) &  (currentPath'=(33 * min(1, node34path33) - currentPath*(min(1,node34path33) - 1))) & (success'=min(1, node34path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path34 * min(1,node34path34) - currentNode*(min(1, node34path34) - 1))) &  (currentPath'=(34 * min(1, node34path34) - currentPath*(min(1,node34path34) - 1))) & (success'=min(1, node34path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path35 * min(1,node34path35) - currentNode*(min(1, node34path35) - 1))) &  (currentPath'=(35 * min(1, node34path35) - currentPath*(min(1,node34path35) - 1))) & (success'=min(1, node34path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path36 * min(1,node34path36) - currentNode*(min(1, node34path36) - 1))) &  (currentPath'=(36 * min(1, node34path36) - currentPath*(min(1,node34path36) - 1))) & (success'=min(1, node34path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path37 * min(1,node34path37) - currentNode*(min(1, node34path37) - 1))) &  (currentPath'=(37 * min(1, node34path37) - currentPath*(min(1,node34path37) - 1))) & (success'=min(1, node34path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path38 * min(1,node34path38) - currentNode*(min(1, node34path38) - 1))) &  (currentPath'=(38 * min(1, node34path38) - currentPath*(min(1,node34path38) - 1))) & (success'=min(1, node34path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path39 * min(1,node34path39) - currentNode*(min(1, node34path39) - 1))) &  (currentPath'=(39 * min(1, node34path39) - currentPath*(min(1,node34path39) - 1))) & (success'=min(1, node34path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path40 * min(1,node34path40) - currentNode*(min(1, node34path40) - 1))) &  (currentPath'=(40 * min(1, node34path40) - currentPath*(min(1,node34path40) - 1))) & (success'=min(1, node34path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path41 * min(1,node34path41) - currentNode*(min(1, node34path41) - 1))) &  (currentPath'=(41 * min(1, node34path41) - currentPath*(min(1,node34path41) - 1))) & (success'=min(1, node34path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path42 * min(1,node34path42) - currentNode*(min(1, node34path42) - 1))) &  (currentPath'=(42 * min(1, node34path42) - currentPath*(min(1,node34path42) - 1))) & (success'=min(1, node34path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path43 * min(1,node34path43) - currentNode*(min(1, node34path43) - 1))) &  (currentPath'=(43 * min(1, node34path43) - currentPath*(min(1,node34path43) - 1))) & (success'=min(1, node34path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path44 * min(1,node34path44) - currentNode*(min(1, node34path44) - 1))) &  (currentPath'=(44 * min(1, node34path44) - currentPath*(min(1,node34path44) - 1))) & (success'=min(1, node34path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path45 * min(1,node34path45) - currentNode*(min(1, node34path45) - 1))) &  (currentPath'=(45 * min(1, node34path45) - currentPath*(min(1,node34path45) - 1))) & (success'=min(1, node34path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path46 * min(1,node34path46) - currentNode*(min(1, node34path46) - 1))) &  (currentPath'=(46 * min(1, node34path46) - currentPath*(min(1,node34path46) - 1))) & (success'=min(1, node34path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path47 * min(1,node34path47) - currentNode*(min(1, node34path47) - 1))) &  (currentPath'=(47 * min(1, node34path47) - currentPath*(min(1,node34path47) - 1))) & (success'=min(1, node34path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path48 * min(1,node34path48) - currentNode*(min(1, node34path48) - 1))) &  (currentPath'=(48 * min(1, node34path48) - currentPath*(min(1,node34path48) - 1))) & (success'=min(1, node34path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path49 * min(1,node34path49) - currentNode*(min(1, node34path49) - 1))) &  (currentPath'=(49 * min(1, node34path49) - currentPath*(min(1,node34path49) - 1))) & (success'=min(1, node34path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path50 * min(1,node34path50) - currentNode*(min(1, node34path50) - 1))) &  (currentPath'=(50 * min(1, node34path50) - currentPath*(min(1,node34path50) - 1))) & (success'=min(1, node34path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path51 * min(1,node34path51) - currentNode*(min(1, node34path51) - 1))) &  (currentPath'=(51 * min(1, node34path51) - currentPath*(min(1,node34path51) - 1))) & (success'=min(1, node34path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path52 * min(1,node34path52) - currentNode*(min(1, node34path52) - 1))) &  (currentPath'=(52 * min(1, node34path52) - currentPath*(min(1,node34path52) - 1))) & (success'=min(1, node34path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path53 * min(1,node34path53) - currentNode*(min(1, node34path53) - 1))) &  (currentPath'=(53 * min(1, node34path53) - currentPath*(min(1,node34path53) - 1))) & (success'=min(1, node34path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path54 * min(1,node34path54) - currentNode*(min(1, node34path54) - 1))) &  (currentPath'=(54 * min(1, node34path54) - currentPath*(min(1,node34path54) - 1))) & (success'=min(1, node34path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path55 * min(1,node34path55) - currentNode*(min(1, node34path55) - 1))) &  (currentPath'=(55 * min(1, node34path55) - currentPath*(min(1,node34path55) - 1))) & (success'=min(1, node34path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path56 * min(1,node34path56) - currentNode*(min(1, node34path56) - 1))) &  (currentPath'=(56 * min(1, node34path56) - currentPath*(min(1,node34path56) - 1))) & (success'=min(1, node34path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path57 * min(1,node34path57) - currentNode*(min(1, node34path57) - 1))) &  (currentPath'=(57 * min(1, node34path57) - currentPath*(min(1,node34path57) - 1))) & (success'=min(1, node34path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path58 * min(1,node34path58) - currentNode*(min(1, node34path58) - 1))) &  (currentPath'=(58 * min(1, node34path58) - currentPath*(min(1,node34path58) - 1))) & (success'=min(1, node34path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path59 * min(1,node34path59) - currentNode*(min(1, node34path59) - 1))) &  (currentPath'=(59 * min(1, node34path59) - currentPath*(min(1,node34path59) - 1))) & (success'=min(1, node34path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path60 * min(1,node34path60) - currentNode*(min(1, node34path60) - 1))) &  (currentPath'=(60 * min(1, node34path60) - currentPath*(min(1,node34path60) - 1))) & (success'=min(1, node34path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path61 * min(1,node34path61) - currentNode*(min(1, node34path61) - 1))) &  (currentPath'=(61 * min(1, node34path61) - currentPath*(min(1,node34path61) - 1))) & (success'=min(1, node34path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path62 * min(1,node34path62) - currentNode*(min(1, node34path62) - 1))) &  (currentPath'=(62 * min(1, node34path62) - currentPath*(min(1,node34path62) - 1))) & (success'=min(1, node34path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path63 * min(1,node34path63) - currentNode*(min(1, node34path63) - 1))) &  (currentPath'=(63 * min(1, node34path63) - currentPath*(min(1,node34path63) - 1))) & (success'=min(1, node34path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path64 * min(1,node34path64) - currentNode*(min(1, node34path64) - 1))) &  (currentPath'=(64 * min(1, node34path64) - currentPath*(min(1,node34path64) - 1))) & (success'=min(1, node34path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path65 * min(1,node34path65) - currentNode*(min(1, node34path65) - 1))) &  (currentPath'=(65 * min(1, node34path65) - currentPath*(min(1,node34path65) - 1))) & (success'=min(1, node34path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path66 * min(1,node34path66) - currentNode*(min(1, node34path66) - 1))) &  (currentPath'=(66 * min(1, node34path66) - currentPath*(min(1,node34path66) - 1))) & (success'=min(1, node34path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path67 * min(1,node34path67) - currentNode*(min(1, node34path67) - 1))) &  (currentPath'=(67 * min(1, node34path67) - currentPath*(min(1,node34path67) - 1))) & (success'=min(1, node34path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path68 * min(1,node34path68) - currentNode*(min(1, node34path68) - 1))) &  (currentPath'=(68 * min(1, node34path68) - currentPath*(min(1,node34path68) - 1))) & (success'=min(1, node34path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path69 * min(1,node34path69) - currentNode*(min(1, node34path69) - 1))) &  (currentPath'=(69 * min(1, node34path69) - currentPath*(min(1,node34path69) - 1))) & (success'=min(1, node34path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path70 * min(1,node34path70) - currentNode*(min(1, node34path70) - 1))) &  (currentPath'=(70 * min(1, node34path70) - currentPath*(min(1,node34path70) - 1))) & (success'=min(1, node34path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path71 * min(1,node34path71) - currentNode*(min(1, node34path71) - 1))) &  (currentPath'=(71 * min(1, node34path71) - currentPath*(min(1,node34path71) - 1))) & (success'=min(1, node34path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path72 * min(1,node34path72) - currentNode*(min(1, node34path72) - 1))) &  (currentPath'=(72 * min(1, node34path72) - currentPath*(min(1,node34path72) - 1))) & (success'=min(1, node34path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path73 * min(1,node34path73) - currentNode*(min(1, node34path73) - 1))) &  (currentPath'=(73 * min(1, node34path73) - currentPath*(min(1,node34path73) - 1))) & (success'=min(1, node34path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path74 * min(1,node34path74) - currentNode*(min(1, node34path74) - 1))) &  (currentPath'=(74 * min(1, node34path74) - currentPath*(min(1,node34path74) - 1))) & (success'=min(1, node34path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path75 * min(1,node34path75) - currentNode*(min(1, node34path75) - 1))) &  (currentPath'=(75 * min(1, node34path75) - currentPath*(min(1,node34path75) - 1))) & (success'=min(1, node34path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path76 * min(1,node34path76) - currentNode*(min(1, node34path76) - 1))) &  (currentPath'=(76 * min(1, node34path76) - currentPath*(min(1,node34path76) - 1))) & (success'=min(1, node34path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path77 * min(1,node34path77) - currentNode*(min(1, node34path77) - 1))) &  (currentPath'=(77 * min(1, node34path77) - currentPath*(min(1,node34path77) - 1))) & (success'=min(1, node34path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path78 * min(1,node34path78) - currentNode*(min(1, node34path78) - 1))) &  (currentPath'=(78 * min(1, node34path78) - currentPath*(min(1,node34path78) - 1))) & (success'=min(1, node34path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path79 * min(1,node34path79) - currentNode*(min(1, node34path79) - 1))) &  (currentPath'=(79 * min(1, node34path79) - currentPath*(min(1,node34path79) - 1))) & (success'=min(1, node34path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path80 * min(1,node34path80) - currentNode*(min(1, node34path80) - 1))) &  (currentPath'=(80 * min(1, node34path80) - currentPath*(min(1,node34path80) - 1))) & (success'=min(1, node34path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path81 * min(1,node34path81) - currentNode*(min(1, node34path81) - 1))) &  (currentPath'=(81 * min(1, node34path81) - currentPath*(min(1,node34path81) - 1))) & (success'=min(1, node34path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path82 * min(1,node34path82) - currentNode*(min(1, node34path82) - 1))) &  (currentPath'=(82 * min(1, node34path82) - currentPath*(min(1,node34path82) - 1))) & (success'=min(1, node34path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path83 * min(1,node34path83) - currentNode*(min(1, node34path83) - 1))) &  (currentPath'=(83 * min(1, node34path83) - currentPath*(min(1,node34path83) - 1))) & (success'=min(1, node34path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path84 * min(1,node34path84) - currentNode*(min(1, node34path84) - 1))) &  (currentPath'=(84 * min(1, node34path84) - currentPath*(min(1,node34path84) - 1))) & (success'=min(1, node34path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path85 * min(1,node34path85) - currentNode*(min(1, node34path85) - 1))) &  (currentPath'=(85 * min(1, node34path85) - currentPath*(min(1,node34path85) - 1))) & (success'=min(1, node34path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path86 * min(1,node34path86) - currentNode*(min(1, node34path86) - 1))) &  (currentPath'=(86 * min(1, node34path86) - currentPath*(min(1,node34path86) - 1))) & (success'=min(1, node34path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path87 * min(1,node34path87) - currentNode*(min(1, node34path87) - 1))) &  (currentPath'=(87 * min(1, node34path87) - currentPath*(min(1,node34path87) - 1))) & (success'=min(1, node34path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path88 * min(1,node34path88) - currentNode*(min(1, node34path88) - 1))) &  (currentPath'=(88 * min(1, node34path88) - currentPath*(min(1,node34path88) - 1))) & (success'=min(1, node34path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path89 * min(1,node34path89) - currentNode*(min(1, node34path89) - 1))) &  (currentPath'=(89 * min(1, node34path89) - currentPath*(min(1,node34path89) - 1))) & (success'=min(1, node34path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path90 * min(1,node34path90) - currentNode*(min(1, node34path90) - 1))) &  (currentPath'=(90 * min(1, node34path90) - currentPath*(min(1,node34path90) - 1))) & (success'=min(1, node34path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path91 * min(1,node34path91) - currentNode*(min(1, node34path91) - 1))) &  (currentPath'=(91 * min(1, node34path91) - currentPath*(min(1,node34path91) - 1))) & (success'=min(1, node34path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path92 * min(1,node34path92) - currentNode*(min(1, node34path92) - 1))) &  (currentPath'=(92 * min(1, node34path92) - currentPath*(min(1,node34path92) - 1))) & (success'=min(1, node34path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path93 * min(1,node34path93) - currentNode*(min(1, node34path93) - 1))) &  (currentPath'=(93 * min(1, node34path93) - currentPath*(min(1,node34path93) - 1))) & (success'=min(1, node34path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path94 * min(1,node34path94) - currentNode*(min(1, node34path94) - 1))) &  (currentPath'=(94 * min(1, node34path94) - currentPath*(min(1,node34path94) - 1))) & (success'=min(1, node34path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path95 * min(1,node34path95) - currentNode*(min(1, node34path95) - 1))) &  (currentPath'=(95 * min(1, node34path95) - currentPath*(min(1,node34path95) - 1))) & (success'=min(1, node34path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path96 * min(1,node34path96) - currentNode*(min(1, node34path96) - 1))) &  (currentPath'=(96 * min(1, node34path96) - currentPath*(min(1,node34path96) - 1))) & (success'=min(1, node34path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path97 * min(1,node34path97) - currentNode*(min(1, node34path97) - 1))) &  (currentPath'=(97 * min(1, node34path97) - currentPath*(min(1,node34path97) - 1))) & (success'=min(1, node34path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path98 * min(1,node34path98) - currentNode*(min(1, node34path98) - 1))) &  (currentPath'=(98 * min(1, node34path98) - currentPath*(min(1,node34path98) - 1))) & (success'=min(1, node34path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path99 * min(1,node34path99) - currentNode*(min(1, node34path99) - 1))) &  (currentPath'=(99 * min(1, node34path99) - currentPath*(min(1,node34path99) - 1))) & (success'=min(1, node34path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node34path100 * min(1,node34path100) - currentNode*(min(1, node34path100) - 1))) &  (currentPath'=(100 * min(1, node34path100) - currentPath*(min(1,node34path100) - 1))) & (success'=min(1, node34path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 35) ->
 numPathsInv: (currentNode'=(node35path1 * min(1,node35path1) - currentNode*(min(1, node35path1) - 1))) &  (currentPath'=(1 * min(1, node35path1) - currentPath*(min(1,node35path1) - 1))) & (success'=min(1, node35path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path2 * min(1,node35path2) - currentNode*(min(1, node35path2) - 1))) &  (currentPath'=(2 * min(1, node35path2) - currentPath*(min(1,node35path2) - 1))) & (success'=min(1, node35path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path3 * min(1,node35path3) - currentNode*(min(1, node35path3) - 1))) &  (currentPath'=(3 * min(1, node35path3) - currentPath*(min(1,node35path3) - 1))) & (success'=min(1, node35path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path4 * min(1,node35path4) - currentNode*(min(1, node35path4) - 1))) &  (currentPath'=(4 * min(1, node35path4) - currentPath*(min(1,node35path4) - 1))) & (success'=min(1, node35path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path5 * min(1,node35path5) - currentNode*(min(1, node35path5) - 1))) &  (currentPath'=(5 * min(1, node35path5) - currentPath*(min(1,node35path5) - 1))) & (success'=min(1, node35path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path6 * min(1,node35path6) - currentNode*(min(1, node35path6) - 1))) &  (currentPath'=(6 * min(1, node35path6) - currentPath*(min(1,node35path6) - 1))) & (success'=min(1, node35path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path7 * min(1,node35path7) - currentNode*(min(1, node35path7) - 1))) &  (currentPath'=(7 * min(1, node35path7) - currentPath*(min(1,node35path7) - 1))) & (success'=min(1, node35path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path8 * min(1,node35path8) - currentNode*(min(1, node35path8) - 1))) &  (currentPath'=(8 * min(1, node35path8) - currentPath*(min(1,node35path8) - 1))) & (success'=min(1, node35path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path9 * min(1,node35path9) - currentNode*(min(1, node35path9) - 1))) &  (currentPath'=(9 * min(1, node35path9) - currentPath*(min(1,node35path9) - 1))) & (success'=min(1, node35path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path10 * min(1,node35path10) - currentNode*(min(1, node35path10) - 1))) &  (currentPath'=(10 * min(1, node35path10) - currentPath*(min(1,node35path10) - 1))) & (success'=min(1, node35path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path11 * min(1,node35path11) - currentNode*(min(1, node35path11) - 1))) &  (currentPath'=(11 * min(1, node35path11) - currentPath*(min(1,node35path11) - 1))) & (success'=min(1, node35path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path12 * min(1,node35path12) - currentNode*(min(1, node35path12) - 1))) &  (currentPath'=(12 * min(1, node35path12) - currentPath*(min(1,node35path12) - 1))) & (success'=min(1, node35path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path13 * min(1,node35path13) - currentNode*(min(1, node35path13) - 1))) &  (currentPath'=(13 * min(1, node35path13) - currentPath*(min(1,node35path13) - 1))) & (success'=min(1, node35path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path14 * min(1,node35path14) - currentNode*(min(1, node35path14) - 1))) &  (currentPath'=(14 * min(1, node35path14) - currentPath*(min(1,node35path14) - 1))) & (success'=min(1, node35path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path15 * min(1,node35path15) - currentNode*(min(1, node35path15) - 1))) &  (currentPath'=(15 * min(1, node35path15) - currentPath*(min(1,node35path15) - 1))) & (success'=min(1, node35path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path16 * min(1,node35path16) - currentNode*(min(1, node35path16) - 1))) &  (currentPath'=(16 * min(1, node35path16) - currentPath*(min(1,node35path16) - 1))) & (success'=min(1, node35path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path17 * min(1,node35path17) - currentNode*(min(1, node35path17) - 1))) &  (currentPath'=(17 * min(1, node35path17) - currentPath*(min(1,node35path17) - 1))) & (success'=min(1, node35path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path18 * min(1,node35path18) - currentNode*(min(1, node35path18) - 1))) &  (currentPath'=(18 * min(1, node35path18) - currentPath*(min(1,node35path18) - 1))) & (success'=min(1, node35path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path19 * min(1,node35path19) - currentNode*(min(1, node35path19) - 1))) &  (currentPath'=(19 * min(1, node35path19) - currentPath*(min(1,node35path19) - 1))) & (success'=min(1, node35path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path20 * min(1,node35path20) - currentNode*(min(1, node35path20) - 1))) &  (currentPath'=(20 * min(1, node35path20) - currentPath*(min(1,node35path20) - 1))) & (success'=min(1, node35path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path21 * min(1,node35path21) - currentNode*(min(1, node35path21) - 1))) &  (currentPath'=(21 * min(1, node35path21) - currentPath*(min(1,node35path21) - 1))) & (success'=min(1, node35path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path22 * min(1,node35path22) - currentNode*(min(1, node35path22) - 1))) &  (currentPath'=(22 * min(1, node35path22) - currentPath*(min(1,node35path22) - 1))) & (success'=min(1, node35path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path23 * min(1,node35path23) - currentNode*(min(1, node35path23) - 1))) &  (currentPath'=(23 * min(1, node35path23) - currentPath*(min(1,node35path23) - 1))) & (success'=min(1, node35path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path24 * min(1,node35path24) - currentNode*(min(1, node35path24) - 1))) &  (currentPath'=(24 * min(1, node35path24) - currentPath*(min(1,node35path24) - 1))) & (success'=min(1, node35path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path25 * min(1,node35path25) - currentNode*(min(1, node35path25) - 1))) &  (currentPath'=(25 * min(1, node35path25) - currentPath*(min(1,node35path25) - 1))) & (success'=min(1, node35path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path26 * min(1,node35path26) - currentNode*(min(1, node35path26) - 1))) &  (currentPath'=(26 * min(1, node35path26) - currentPath*(min(1,node35path26) - 1))) & (success'=min(1, node35path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path27 * min(1,node35path27) - currentNode*(min(1, node35path27) - 1))) &  (currentPath'=(27 * min(1, node35path27) - currentPath*(min(1,node35path27) - 1))) & (success'=min(1, node35path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path28 * min(1,node35path28) - currentNode*(min(1, node35path28) - 1))) &  (currentPath'=(28 * min(1, node35path28) - currentPath*(min(1,node35path28) - 1))) & (success'=min(1, node35path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path29 * min(1,node35path29) - currentNode*(min(1, node35path29) - 1))) &  (currentPath'=(29 * min(1, node35path29) - currentPath*(min(1,node35path29) - 1))) & (success'=min(1, node35path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path30 * min(1,node35path30) - currentNode*(min(1, node35path30) - 1))) &  (currentPath'=(30 * min(1, node35path30) - currentPath*(min(1,node35path30) - 1))) & (success'=min(1, node35path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path31 * min(1,node35path31) - currentNode*(min(1, node35path31) - 1))) &  (currentPath'=(31 * min(1, node35path31) - currentPath*(min(1,node35path31) - 1))) & (success'=min(1, node35path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path32 * min(1,node35path32) - currentNode*(min(1, node35path32) - 1))) &  (currentPath'=(32 * min(1, node35path32) - currentPath*(min(1,node35path32) - 1))) & (success'=min(1, node35path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path33 * min(1,node35path33) - currentNode*(min(1, node35path33) - 1))) &  (currentPath'=(33 * min(1, node35path33) - currentPath*(min(1,node35path33) - 1))) & (success'=min(1, node35path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path34 * min(1,node35path34) - currentNode*(min(1, node35path34) - 1))) &  (currentPath'=(34 * min(1, node35path34) - currentPath*(min(1,node35path34) - 1))) & (success'=min(1, node35path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path35 * min(1,node35path35) - currentNode*(min(1, node35path35) - 1))) &  (currentPath'=(35 * min(1, node35path35) - currentPath*(min(1,node35path35) - 1))) & (success'=min(1, node35path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path36 * min(1,node35path36) - currentNode*(min(1, node35path36) - 1))) &  (currentPath'=(36 * min(1, node35path36) - currentPath*(min(1,node35path36) - 1))) & (success'=min(1, node35path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path37 * min(1,node35path37) - currentNode*(min(1, node35path37) - 1))) &  (currentPath'=(37 * min(1, node35path37) - currentPath*(min(1,node35path37) - 1))) & (success'=min(1, node35path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path38 * min(1,node35path38) - currentNode*(min(1, node35path38) - 1))) &  (currentPath'=(38 * min(1, node35path38) - currentPath*(min(1,node35path38) - 1))) & (success'=min(1, node35path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path39 * min(1,node35path39) - currentNode*(min(1, node35path39) - 1))) &  (currentPath'=(39 * min(1, node35path39) - currentPath*(min(1,node35path39) - 1))) & (success'=min(1, node35path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path40 * min(1,node35path40) - currentNode*(min(1, node35path40) - 1))) &  (currentPath'=(40 * min(1, node35path40) - currentPath*(min(1,node35path40) - 1))) & (success'=min(1, node35path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path41 * min(1,node35path41) - currentNode*(min(1, node35path41) - 1))) &  (currentPath'=(41 * min(1, node35path41) - currentPath*(min(1,node35path41) - 1))) & (success'=min(1, node35path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path42 * min(1,node35path42) - currentNode*(min(1, node35path42) - 1))) &  (currentPath'=(42 * min(1, node35path42) - currentPath*(min(1,node35path42) - 1))) & (success'=min(1, node35path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path43 * min(1,node35path43) - currentNode*(min(1, node35path43) - 1))) &  (currentPath'=(43 * min(1, node35path43) - currentPath*(min(1,node35path43) - 1))) & (success'=min(1, node35path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path44 * min(1,node35path44) - currentNode*(min(1, node35path44) - 1))) &  (currentPath'=(44 * min(1, node35path44) - currentPath*(min(1,node35path44) - 1))) & (success'=min(1, node35path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path45 * min(1,node35path45) - currentNode*(min(1, node35path45) - 1))) &  (currentPath'=(45 * min(1, node35path45) - currentPath*(min(1,node35path45) - 1))) & (success'=min(1, node35path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path46 * min(1,node35path46) - currentNode*(min(1, node35path46) - 1))) &  (currentPath'=(46 * min(1, node35path46) - currentPath*(min(1,node35path46) - 1))) & (success'=min(1, node35path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path47 * min(1,node35path47) - currentNode*(min(1, node35path47) - 1))) &  (currentPath'=(47 * min(1, node35path47) - currentPath*(min(1,node35path47) - 1))) & (success'=min(1, node35path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path48 * min(1,node35path48) - currentNode*(min(1, node35path48) - 1))) &  (currentPath'=(48 * min(1, node35path48) - currentPath*(min(1,node35path48) - 1))) & (success'=min(1, node35path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path49 * min(1,node35path49) - currentNode*(min(1, node35path49) - 1))) &  (currentPath'=(49 * min(1, node35path49) - currentPath*(min(1,node35path49) - 1))) & (success'=min(1, node35path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path50 * min(1,node35path50) - currentNode*(min(1, node35path50) - 1))) &  (currentPath'=(50 * min(1, node35path50) - currentPath*(min(1,node35path50) - 1))) & (success'=min(1, node35path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path51 * min(1,node35path51) - currentNode*(min(1, node35path51) - 1))) &  (currentPath'=(51 * min(1, node35path51) - currentPath*(min(1,node35path51) - 1))) & (success'=min(1, node35path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path52 * min(1,node35path52) - currentNode*(min(1, node35path52) - 1))) &  (currentPath'=(52 * min(1, node35path52) - currentPath*(min(1,node35path52) - 1))) & (success'=min(1, node35path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path53 * min(1,node35path53) - currentNode*(min(1, node35path53) - 1))) &  (currentPath'=(53 * min(1, node35path53) - currentPath*(min(1,node35path53) - 1))) & (success'=min(1, node35path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path54 * min(1,node35path54) - currentNode*(min(1, node35path54) - 1))) &  (currentPath'=(54 * min(1, node35path54) - currentPath*(min(1,node35path54) - 1))) & (success'=min(1, node35path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path55 * min(1,node35path55) - currentNode*(min(1, node35path55) - 1))) &  (currentPath'=(55 * min(1, node35path55) - currentPath*(min(1,node35path55) - 1))) & (success'=min(1, node35path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path56 * min(1,node35path56) - currentNode*(min(1, node35path56) - 1))) &  (currentPath'=(56 * min(1, node35path56) - currentPath*(min(1,node35path56) - 1))) & (success'=min(1, node35path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path57 * min(1,node35path57) - currentNode*(min(1, node35path57) - 1))) &  (currentPath'=(57 * min(1, node35path57) - currentPath*(min(1,node35path57) - 1))) & (success'=min(1, node35path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path58 * min(1,node35path58) - currentNode*(min(1, node35path58) - 1))) &  (currentPath'=(58 * min(1, node35path58) - currentPath*(min(1,node35path58) - 1))) & (success'=min(1, node35path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path59 * min(1,node35path59) - currentNode*(min(1, node35path59) - 1))) &  (currentPath'=(59 * min(1, node35path59) - currentPath*(min(1,node35path59) - 1))) & (success'=min(1, node35path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path60 * min(1,node35path60) - currentNode*(min(1, node35path60) - 1))) &  (currentPath'=(60 * min(1, node35path60) - currentPath*(min(1,node35path60) - 1))) & (success'=min(1, node35path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path61 * min(1,node35path61) - currentNode*(min(1, node35path61) - 1))) &  (currentPath'=(61 * min(1, node35path61) - currentPath*(min(1,node35path61) - 1))) & (success'=min(1, node35path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path62 * min(1,node35path62) - currentNode*(min(1, node35path62) - 1))) &  (currentPath'=(62 * min(1, node35path62) - currentPath*(min(1,node35path62) - 1))) & (success'=min(1, node35path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path63 * min(1,node35path63) - currentNode*(min(1, node35path63) - 1))) &  (currentPath'=(63 * min(1, node35path63) - currentPath*(min(1,node35path63) - 1))) & (success'=min(1, node35path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path64 * min(1,node35path64) - currentNode*(min(1, node35path64) - 1))) &  (currentPath'=(64 * min(1, node35path64) - currentPath*(min(1,node35path64) - 1))) & (success'=min(1, node35path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path65 * min(1,node35path65) - currentNode*(min(1, node35path65) - 1))) &  (currentPath'=(65 * min(1, node35path65) - currentPath*(min(1,node35path65) - 1))) & (success'=min(1, node35path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path66 * min(1,node35path66) - currentNode*(min(1, node35path66) - 1))) &  (currentPath'=(66 * min(1, node35path66) - currentPath*(min(1,node35path66) - 1))) & (success'=min(1, node35path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path67 * min(1,node35path67) - currentNode*(min(1, node35path67) - 1))) &  (currentPath'=(67 * min(1, node35path67) - currentPath*(min(1,node35path67) - 1))) & (success'=min(1, node35path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path68 * min(1,node35path68) - currentNode*(min(1, node35path68) - 1))) &  (currentPath'=(68 * min(1, node35path68) - currentPath*(min(1,node35path68) - 1))) & (success'=min(1, node35path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path69 * min(1,node35path69) - currentNode*(min(1, node35path69) - 1))) &  (currentPath'=(69 * min(1, node35path69) - currentPath*(min(1,node35path69) - 1))) & (success'=min(1, node35path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path70 * min(1,node35path70) - currentNode*(min(1, node35path70) - 1))) &  (currentPath'=(70 * min(1, node35path70) - currentPath*(min(1,node35path70) - 1))) & (success'=min(1, node35path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path71 * min(1,node35path71) - currentNode*(min(1, node35path71) - 1))) &  (currentPath'=(71 * min(1, node35path71) - currentPath*(min(1,node35path71) - 1))) & (success'=min(1, node35path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path72 * min(1,node35path72) - currentNode*(min(1, node35path72) - 1))) &  (currentPath'=(72 * min(1, node35path72) - currentPath*(min(1,node35path72) - 1))) & (success'=min(1, node35path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path73 * min(1,node35path73) - currentNode*(min(1, node35path73) - 1))) &  (currentPath'=(73 * min(1, node35path73) - currentPath*(min(1,node35path73) - 1))) & (success'=min(1, node35path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path74 * min(1,node35path74) - currentNode*(min(1, node35path74) - 1))) &  (currentPath'=(74 * min(1, node35path74) - currentPath*(min(1,node35path74) - 1))) & (success'=min(1, node35path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path75 * min(1,node35path75) - currentNode*(min(1, node35path75) - 1))) &  (currentPath'=(75 * min(1, node35path75) - currentPath*(min(1,node35path75) - 1))) & (success'=min(1, node35path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path76 * min(1,node35path76) - currentNode*(min(1, node35path76) - 1))) &  (currentPath'=(76 * min(1, node35path76) - currentPath*(min(1,node35path76) - 1))) & (success'=min(1, node35path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path77 * min(1,node35path77) - currentNode*(min(1, node35path77) - 1))) &  (currentPath'=(77 * min(1, node35path77) - currentPath*(min(1,node35path77) - 1))) & (success'=min(1, node35path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path78 * min(1,node35path78) - currentNode*(min(1, node35path78) - 1))) &  (currentPath'=(78 * min(1, node35path78) - currentPath*(min(1,node35path78) - 1))) & (success'=min(1, node35path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path79 * min(1,node35path79) - currentNode*(min(1, node35path79) - 1))) &  (currentPath'=(79 * min(1, node35path79) - currentPath*(min(1,node35path79) - 1))) & (success'=min(1, node35path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path80 * min(1,node35path80) - currentNode*(min(1, node35path80) - 1))) &  (currentPath'=(80 * min(1, node35path80) - currentPath*(min(1,node35path80) - 1))) & (success'=min(1, node35path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path81 * min(1,node35path81) - currentNode*(min(1, node35path81) - 1))) &  (currentPath'=(81 * min(1, node35path81) - currentPath*(min(1,node35path81) - 1))) & (success'=min(1, node35path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path82 * min(1,node35path82) - currentNode*(min(1, node35path82) - 1))) &  (currentPath'=(82 * min(1, node35path82) - currentPath*(min(1,node35path82) - 1))) & (success'=min(1, node35path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path83 * min(1,node35path83) - currentNode*(min(1, node35path83) - 1))) &  (currentPath'=(83 * min(1, node35path83) - currentPath*(min(1,node35path83) - 1))) & (success'=min(1, node35path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path84 * min(1,node35path84) - currentNode*(min(1, node35path84) - 1))) &  (currentPath'=(84 * min(1, node35path84) - currentPath*(min(1,node35path84) - 1))) & (success'=min(1, node35path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path85 * min(1,node35path85) - currentNode*(min(1, node35path85) - 1))) &  (currentPath'=(85 * min(1, node35path85) - currentPath*(min(1,node35path85) - 1))) & (success'=min(1, node35path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path86 * min(1,node35path86) - currentNode*(min(1, node35path86) - 1))) &  (currentPath'=(86 * min(1, node35path86) - currentPath*(min(1,node35path86) - 1))) & (success'=min(1, node35path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path87 * min(1,node35path87) - currentNode*(min(1, node35path87) - 1))) &  (currentPath'=(87 * min(1, node35path87) - currentPath*(min(1,node35path87) - 1))) & (success'=min(1, node35path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path88 * min(1,node35path88) - currentNode*(min(1, node35path88) - 1))) &  (currentPath'=(88 * min(1, node35path88) - currentPath*(min(1,node35path88) - 1))) & (success'=min(1, node35path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path89 * min(1,node35path89) - currentNode*(min(1, node35path89) - 1))) &  (currentPath'=(89 * min(1, node35path89) - currentPath*(min(1,node35path89) - 1))) & (success'=min(1, node35path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path90 * min(1,node35path90) - currentNode*(min(1, node35path90) - 1))) &  (currentPath'=(90 * min(1, node35path90) - currentPath*(min(1,node35path90) - 1))) & (success'=min(1, node35path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path91 * min(1,node35path91) - currentNode*(min(1, node35path91) - 1))) &  (currentPath'=(91 * min(1, node35path91) - currentPath*(min(1,node35path91) - 1))) & (success'=min(1, node35path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path92 * min(1,node35path92) - currentNode*(min(1, node35path92) - 1))) &  (currentPath'=(92 * min(1, node35path92) - currentPath*(min(1,node35path92) - 1))) & (success'=min(1, node35path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path93 * min(1,node35path93) - currentNode*(min(1, node35path93) - 1))) &  (currentPath'=(93 * min(1, node35path93) - currentPath*(min(1,node35path93) - 1))) & (success'=min(1, node35path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path94 * min(1,node35path94) - currentNode*(min(1, node35path94) - 1))) &  (currentPath'=(94 * min(1, node35path94) - currentPath*(min(1,node35path94) - 1))) & (success'=min(1, node35path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path95 * min(1,node35path95) - currentNode*(min(1, node35path95) - 1))) &  (currentPath'=(95 * min(1, node35path95) - currentPath*(min(1,node35path95) - 1))) & (success'=min(1, node35path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path96 * min(1,node35path96) - currentNode*(min(1, node35path96) - 1))) &  (currentPath'=(96 * min(1, node35path96) - currentPath*(min(1,node35path96) - 1))) & (success'=min(1, node35path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path97 * min(1,node35path97) - currentNode*(min(1, node35path97) - 1))) &  (currentPath'=(97 * min(1, node35path97) - currentPath*(min(1,node35path97) - 1))) & (success'=min(1, node35path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path98 * min(1,node35path98) - currentNode*(min(1, node35path98) - 1))) &  (currentPath'=(98 * min(1, node35path98) - currentPath*(min(1,node35path98) - 1))) & (success'=min(1, node35path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path99 * min(1,node35path99) - currentNode*(min(1, node35path99) - 1))) &  (currentPath'=(99 * min(1, node35path99) - currentPath*(min(1,node35path99) - 1))) & (success'=min(1, node35path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node35path100 * min(1,node35path100) - currentNode*(min(1, node35path100) - 1))) &  (currentPath'=(100 * min(1, node35path100) - currentPath*(min(1,node35path100) - 1))) & (success'=min(1, node35path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 36) ->
 numPathsInv: (currentNode'=(node36path1 * min(1,node36path1) - currentNode*(min(1, node36path1) - 1))) &  (currentPath'=(1 * min(1, node36path1) - currentPath*(min(1,node36path1) - 1))) & (success'=min(1, node36path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path2 * min(1,node36path2) - currentNode*(min(1, node36path2) - 1))) &  (currentPath'=(2 * min(1, node36path2) - currentPath*(min(1,node36path2) - 1))) & (success'=min(1, node36path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path3 * min(1,node36path3) - currentNode*(min(1, node36path3) - 1))) &  (currentPath'=(3 * min(1, node36path3) - currentPath*(min(1,node36path3) - 1))) & (success'=min(1, node36path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path4 * min(1,node36path4) - currentNode*(min(1, node36path4) - 1))) &  (currentPath'=(4 * min(1, node36path4) - currentPath*(min(1,node36path4) - 1))) & (success'=min(1, node36path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path5 * min(1,node36path5) - currentNode*(min(1, node36path5) - 1))) &  (currentPath'=(5 * min(1, node36path5) - currentPath*(min(1,node36path5) - 1))) & (success'=min(1, node36path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path6 * min(1,node36path6) - currentNode*(min(1, node36path6) - 1))) &  (currentPath'=(6 * min(1, node36path6) - currentPath*(min(1,node36path6) - 1))) & (success'=min(1, node36path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path7 * min(1,node36path7) - currentNode*(min(1, node36path7) - 1))) &  (currentPath'=(7 * min(1, node36path7) - currentPath*(min(1,node36path7) - 1))) & (success'=min(1, node36path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path8 * min(1,node36path8) - currentNode*(min(1, node36path8) - 1))) &  (currentPath'=(8 * min(1, node36path8) - currentPath*(min(1,node36path8) - 1))) & (success'=min(1, node36path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path9 * min(1,node36path9) - currentNode*(min(1, node36path9) - 1))) &  (currentPath'=(9 * min(1, node36path9) - currentPath*(min(1,node36path9) - 1))) & (success'=min(1, node36path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path10 * min(1,node36path10) - currentNode*(min(1, node36path10) - 1))) &  (currentPath'=(10 * min(1, node36path10) - currentPath*(min(1,node36path10) - 1))) & (success'=min(1, node36path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path11 * min(1,node36path11) - currentNode*(min(1, node36path11) - 1))) &  (currentPath'=(11 * min(1, node36path11) - currentPath*(min(1,node36path11) - 1))) & (success'=min(1, node36path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path12 * min(1,node36path12) - currentNode*(min(1, node36path12) - 1))) &  (currentPath'=(12 * min(1, node36path12) - currentPath*(min(1,node36path12) - 1))) & (success'=min(1, node36path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path13 * min(1,node36path13) - currentNode*(min(1, node36path13) - 1))) &  (currentPath'=(13 * min(1, node36path13) - currentPath*(min(1,node36path13) - 1))) & (success'=min(1, node36path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path14 * min(1,node36path14) - currentNode*(min(1, node36path14) - 1))) &  (currentPath'=(14 * min(1, node36path14) - currentPath*(min(1,node36path14) - 1))) & (success'=min(1, node36path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path15 * min(1,node36path15) - currentNode*(min(1, node36path15) - 1))) &  (currentPath'=(15 * min(1, node36path15) - currentPath*(min(1,node36path15) - 1))) & (success'=min(1, node36path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path16 * min(1,node36path16) - currentNode*(min(1, node36path16) - 1))) &  (currentPath'=(16 * min(1, node36path16) - currentPath*(min(1,node36path16) - 1))) & (success'=min(1, node36path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path17 * min(1,node36path17) - currentNode*(min(1, node36path17) - 1))) &  (currentPath'=(17 * min(1, node36path17) - currentPath*(min(1,node36path17) - 1))) & (success'=min(1, node36path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path18 * min(1,node36path18) - currentNode*(min(1, node36path18) - 1))) &  (currentPath'=(18 * min(1, node36path18) - currentPath*(min(1,node36path18) - 1))) & (success'=min(1, node36path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path19 * min(1,node36path19) - currentNode*(min(1, node36path19) - 1))) &  (currentPath'=(19 * min(1, node36path19) - currentPath*(min(1,node36path19) - 1))) & (success'=min(1, node36path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path20 * min(1,node36path20) - currentNode*(min(1, node36path20) - 1))) &  (currentPath'=(20 * min(1, node36path20) - currentPath*(min(1,node36path20) - 1))) & (success'=min(1, node36path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path21 * min(1,node36path21) - currentNode*(min(1, node36path21) - 1))) &  (currentPath'=(21 * min(1, node36path21) - currentPath*(min(1,node36path21) - 1))) & (success'=min(1, node36path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path22 * min(1,node36path22) - currentNode*(min(1, node36path22) - 1))) &  (currentPath'=(22 * min(1, node36path22) - currentPath*(min(1,node36path22) - 1))) & (success'=min(1, node36path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path23 * min(1,node36path23) - currentNode*(min(1, node36path23) - 1))) &  (currentPath'=(23 * min(1, node36path23) - currentPath*(min(1,node36path23) - 1))) & (success'=min(1, node36path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path24 * min(1,node36path24) - currentNode*(min(1, node36path24) - 1))) &  (currentPath'=(24 * min(1, node36path24) - currentPath*(min(1,node36path24) - 1))) & (success'=min(1, node36path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path25 * min(1,node36path25) - currentNode*(min(1, node36path25) - 1))) &  (currentPath'=(25 * min(1, node36path25) - currentPath*(min(1,node36path25) - 1))) & (success'=min(1, node36path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path26 * min(1,node36path26) - currentNode*(min(1, node36path26) - 1))) &  (currentPath'=(26 * min(1, node36path26) - currentPath*(min(1,node36path26) - 1))) & (success'=min(1, node36path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path27 * min(1,node36path27) - currentNode*(min(1, node36path27) - 1))) &  (currentPath'=(27 * min(1, node36path27) - currentPath*(min(1,node36path27) - 1))) & (success'=min(1, node36path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path28 * min(1,node36path28) - currentNode*(min(1, node36path28) - 1))) &  (currentPath'=(28 * min(1, node36path28) - currentPath*(min(1,node36path28) - 1))) & (success'=min(1, node36path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path29 * min(1,node36path29) - currentNode*(min(1, node36path29) - 1))) &  (currentPath'=(29 * min(1, node36path29) - currentPath*(min(1,node36path29) - 1))) & (success'=min(1, node36path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path30 * min(1,node36path30) - currentNode*(min(1, node36path30) - 1))) &  (currentPath'=(30 * min(1, node36path30) - currentPath*(min(1,node36path30) - 1))) & (success'=min(1, node36path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path31 * min(1,node36path31) - currentNode*(min(1, node36path31) - 1))) &  (currentPath'=(31 * min(1, node36path31) - currentPath*(min(1,node36path31) - 1))) & (success'=min(1, node36path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path32 * min(1,node36path32) - currentNode*(min(1, node36path32) - 1))) &  (currentPath'=(32 * min(1, node36path32) - currentPath*(min(1,node36path32) - 1))) & (success'=min(1, node36path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path33 * min(1,node36path33) - currentNode*(min(1, node36path33) - 1))) &  (currentPath'=(33 * min(1, node36path33) - currentPath*(min(1,node36path33) - 1))) & (success'=min(1, node36path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path34 * min(1,node36path34) - currentNode*(min(1, node36path34) - 1))) &  (currentPath'=(34 * min(1, node36path34) - currentPath*(min(1,node36path34) - 1))) & (success'=min(1, node36path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path35 * min(1,node36path35) - currentNode*(min(1, node36path35) - 1))) &  (currentPath'=(35 * min(1, node36path35) - currentPath*(min(1,node36path35) - 1))) & (success'=min(1, node36path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path36 * min(1,node36path36) - currentNode*(min(1, node36path36) - 1))) &  (currentPath'=(36 * min(1, node36path36) - currentPath*(min(1,node36path36) - 1))) & (success'=min(1, node36path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path37 * min(1,node36path37) - currentNode*(min(1, node36path37) - 1))) &  (currentPath'=(37 * min(1, node36path37) - currentPath*(min(1,node36path37) - 1))) & (success'=min(1, node36path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path38 * min(1,node36path38) - currentNode*(min(1, node36path38) - 1))) &  (currentPath'=(38 * min(1, node36path38) - currentPath*(min(1,node36path38) - 1))) & (success'=min(1, node36path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path39 * min(1,node36path39) - currentNode*(min(1, node36path39) - 1))) &  (currentPath'=(39 * min(1, node36path39) - currentPath*(min(1,node36path39) - 1))) & (success'=min(1, node36path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path40 * min(1,node36path40) - currentNode*(min(1, node36path40) - 1))) &  (currentPath'=(40 * min(1, node36path40) - currentPath*(min(1,node36path40) - 1))) & (success'=min(1, node36path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path41 * min(1,node36path41) - currentNode*(min(1, node36path41) - 1))) &  (currentPath'=(41 * min(1, node36path41) - currentPath*(min(1,node36path41) - 1))) & (success'=min(1, node36path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path42 * min(1,node36path42) - currentNode*(min(1, node36path42) - 1))) &  (currentPath'=(42 * min(1, node36path42) - currentPath*(min(1,node36path42) - 1))) & (success'=min(1, node36path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path43 * min(1,node36path43) - currentNode*(min(1, node36path43) - 1))) &  (currentPath'=(43 * min(1, node36path43) - currentPath*(min(1,node36path43) - 1))) & (success'=min(1, node36path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path44 * min(1,node36path44) - currentNode*(min(1, node36path44) - 1))) &  (currentPath'=(44 * min(1, node36path44) - currentPath*(min(1,node36path44) - 1))) & (success'=min(1, node36path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path45 * min(1,node36path45) - currentNode*(min(1, node36path45) - 1))) &  (currentPath'=(45 * min(1, node36path45) - currentPath*(min(1,node36path45) - 1))) & (success'=min(1, node36path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path46 * min(1,node36path46) - currentNode*(min(1, node36path46) - 1))) &  (currentPath'=(46 * min(1, node36path46) - currentPath*(min(1,node36path46) - 1))) & (success'=min(1, node36path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path47 * min(1,node36path47) - currentNode*(min(1, node36path47) - 1))) &  (currentPath'=(47 * min(1, node36path47) - currentPath*(min(1,node36path47) - 1))) & (success'=min(1, node36path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path48 * min(1,node36path48) - currentNode*(min(1, node36path48) - 1))) &  (currentPath'=(48 * min(1, node36path48) - currentPath*(min(1,node36path48) - 1))) & (success'=min(1, node36path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path49 * min(1,node36path49) - currentNode*(min(1, node36path49) - 1))) &  (currentPath'=(49 * min(1, node36path49) - currentPath*(min(1,node36path49) - 1))) & (success'=min(1, node36path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path50 * min(1,node36path50) - currentNode*(min(1, node36path50) - 1))) &  (currentPath'=(50 * min(1, node36path50) - currentPath*(min(1,node36path50) - 1))) & (success'=min(1, node36path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path51 * min(1,node36path51) - currentNode*(min(1, node36path51) - 1))) &  (currentPath'=(51 * min(1, node36path51) - currentPath*(min(1,node36path51) - 1))) & (success'=min(1, node36path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path52 * min(1,node36path52) - currentNode*(min(1, node36path52) - 1))) &  (currentPath'=(52 * min(1, node36path52) - currentPath*(min(1,node36path52) - 1))) & (success'=min(1, node36path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path53 * min(1,node36path53) - currentNode*(min(1, node36path53) - 1))) &  (currentPath'=(53 * min(1, node36path53) - currentPath*(min(1,node36path53) - 1))) & (success'=min(1, node36path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path54 * min(1,node36path54) - currentNode*(min(1, node36path54) - 1))) &  (currentPath'=(54 * min(1, node36path54) - currentPath*(min(1,node36path54) - 1))) & (success'=min(1, node36path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path55 * min(1,node36path55) - currentNode*(min(1, node36path55) - 1))) &  (currentPath'=(55 * min(1, node36path55) - currentPath*(min(1,node36path55) - 1))) & (success'=min(1, node36path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path56 * min(1,node36path56) - currentNode*(min(1, node36path56) - 1))) &  (currentPath'=(56 * min(1, node36path56) - currentPath*(min(1,node36path56) - 1))) & (success'=min(1, node36path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path57 * min(1,node36path57) - currentNode*(min(1, node36path57) - 1))) &  (currentPath'=(57 * min(1, node36path57) - currentPath*(min(1,node36path57) - 1))) & (success'=min(1, node36path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path58 * min(1,node36path58) - currentNode*(min(1, node36path58) - 1))) &  (currentPath'=(58 * min(1, node36path58) - currentPath*(min(1,node36path58) - 1))) & (success'=min(1, node36path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path59 * min(1,node36path59) - currentNode*(min(1, node36path59) - 1))) &  (currentPath'=(59 * min(1, node36path59) - currentPath*(min(1,node36path59) - 1))) & (success'=min(1, node36path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path60 * min(1,node36path60) - currentNode*(min(1, node36path60) - 1))) &  (currentPath'=(60 * min(1, node36path60) - currentPath*(min(1,node36path60) - 1))) & (success'=min(1, node36path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path61 * min(1,node36path61) - currentNode*(min(1, node36path61) - 1))) &  (currentPath'=(61 * min(1, node36path61) - currentPath*(min(1,node36path61) - 1))) & (success'=min(1, node36path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path62 * min(1,node36path62) - currentNode*(min(1, node36path62) - 1))) &  (currentPath'=(62 * min(1, node36path62) - currentPath*(min(1,node36path62) - 1))) & (success'=min(1, node36path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path63 * min(1,node36path63) - currentNode*(min(1, node36path63) - 1))) &  (currentPath'=(63 * min(1, node36path63) - currentPath*(min(1,node36path63) - 1))) & (success'=min(1, node36path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path64 * min(1,node36path64) - currentNode*(min(1, node36path64) - 1))) &  (currentPath'=(64 * min(1, node36path64) - currentPath*(min(1,node36path64) - 1))) & (success'=min(1, node36path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path65 * min(1,node36path65) - currentNode*(min(1, node36path65) - 1))) &  (currentPath'=(65 * min(1, node36path65) - currentPath*(min(1,node36path65) - 1))) & (success'=min(1, node36path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path66 * min(1,node36path66) - currentNode*(min(1, node36path66) - 1))) &  (currentPath'=(66 * min(1, node36path66) - currentPath*(min(1,node36path66) - 1))) & (success'=min(1, node36path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path67 * min(1,node36path67) - currentNode*(min(1, node36path67) - 1))) &  (currentPath'=(67 * min(1, node36path67) - currentPath*(min(1,node36path67) - 1))) & (success'=min(1, node36path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path68 * min(1,node36path68) - currentNode*(min(1, node36path68) - 1))) &  (currentPath'=(68 * min(1, node36path68) - currentPath*(min(1,node36path68) - 1))) & (success'=min(1, node36path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path69 * min(1,node36path69) - currentNode*(min(1, node36path69) - 1))) &  (currentPath'=(69 * min(1, node36path69) - currentPath*(min(1,node36path69) - 1))) & (success'=min(1, node36path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path70 * min(1,node36path70) - currentNode*(min(1, node36path70) - 1))) &  (currentPath'=(70 * min(1, node36path70) - currentPath*(min(1,node36path70) - 1))) & (success'=min(1, node36path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path71 * min(1,node36path71) - currentNode*(min(1, node36path71) - 1))) &  (currentPath'=(71 * min(1, node36path71) - currentPath*(min(1,node36path71) - 1))) & (success'=min(1, node36path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path72 * min(1,node36path72) - currentNode*(min(1, node36path72) - 1))) &  (currentPath'=(72 * min(1, node36path72) - currentPath*(min(1,node36path72) - 1))) & (success'=min(1, node36path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path73 * min(1,node36path73) - currentNode*(min(1, node36path73) - 1))) &  (currentPath'=(73 * min(1, node36path73) - currentPath*(min(1,node36path73) - 1))) & (success'=min(1, node36path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path74 * min(1,node36path74) - currentNode*(min(1, node36path74) - 1))) &  (currentPath'=(74 * min(1, node36path74) - currentPath*(min(1,node36path74) - 1))) & (success'=min(1, node36path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path75 * min(1,node36path75) - currentNode*(min(1, node36path75) - 1))) &  (currentPath'=(75 * min(1, node36path75) - currentPath*(min(1,node36path75) - 1))) & (success'=min(1, node36path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path76 * min(1,node36path76) - currentNode*(min(1, node36path76) - 1))) &  (currentPath'=(76 * min(1, node36path76) - currentPath*(min(1,node36path76) - 1))) & (success'=min(1, node36path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path77 * min(1,node36path77) - currentNode*(min(1, node36path77) - 1))) &  (currentPath'=(77 * min(1, node36path77) - currentPath*(min(1,node36path77) - 1))) & (success'=min(1, node36path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path78 * min(1,node36path78) - currentNode*(min(1, node36path78) - 1))) &  (currentPath'=(78 * min(1, node36path78) - currentPath*(min(1,node36path78) - 1))) & (success'=min(1, node36path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path79 * min(1,node36path79) - currentNode*(min(1, node36path79) - 1))) &  (currentPath'=(79 * min(1, node36path79) - currentPath*(min(1,node36path79) - 1))) & (success'=min(1, node36path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path80 * min(1,node36path80) - currentNode*(min(1, node36path80) - 1))) &  (currentPath'=(80 * min(1, node36path80) - currentPath*(min(1,node36path80) - 1))) & (success'=min(1, node36path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path81 * min(1,node36path81) - currentNode*(min(1, node36path81) - 1))) &  (currentPath'=(81 * min(1, node36path81) - currentPath*(min(1,node36path81) - 1))) & (success'=min(1, node36path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path82 * min(1,node36path82) - currentNode*(min(1, node36path82) - 1))) &  (currentPath'=(82 * min(1, node36path82) - currentPath*(min(1,node36path82) - 1))) & (success'=min(1, node36path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path83 * min(1,node36path83) - currentNode*(min(1, node36path83) - 1))) &  (currentPath'=(83 * min(1, node36path83) - currentPath*(min(1,node36path83) - 1))) & (success'=min(1, node36path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path84 * min(1,node36path84) - currentNode*(min(1, node36path84) - 1))) &  (currentPath'=(84 * min(1, node36path84) - currentPath*(min(1,node36path84) - 1))) & (success'=min(1, node36path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path85 * min(1,node36path85) - currentNode*(min(1, node36path85) - 1))) &  (currentPath'=(85 * min(1, node36path85) - currentPath*(min(1,node36path85) - 1))) & (success'=min(1, node36path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path86 * min(1,node36path86) - currentNode*(min(1, node36path86) - 1))) &  (currentPath'=(86 * min(1, node36path86) - currentPath*(min(1,node36path86) - 1))) & (success'=min(1, node36path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path87 * min(1,node36path87) - currentNode*(min(1, node36path87) - 1))) &  (currentPath'=(87 * min(1, node36path87) - currentPath*(min(1,node36path87) - 1))) & (success'=min(1, node36path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path88 * min(1,node36path88) - currentNode*(min(1, node36path88) - 1))) &  (currentPath'=(88 * min(1, node36path88) - currentPath*(min(1,node36path88) - 1))) & (success'=min(1, node36path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path89 * min(1,node36path89) - currentNode*(min(1, node36path89) - 1))) &  (currentPath'=(89 * min(1, node36path89) - currentPath*(min(1,node36path89) - 1))) & (success'=min(1, node36path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path90 * min(1,node36path90) - currentNode*(min(1, node36path90) - 1))) &  (currentPath'=(90 * min(1, node36path90) - currentPath*(min(1,node36path90) - 1))) & (success'=min(1, node36path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path91 * min(1,node36path91) - currentNode*(min(1, node36path91) - 1))) &  (currentPath'=(91 * min(1, node36path91) - currentPath*(min(1,node36path91) - 1))) & (success'=min(1, node36path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path92 * min(1,node36path92) - currentNode*(min(1, node36path92) - 1))) &  (currentPath'=(92 * min(1, node36path92) - currentPath*(min(1,node36path92) - 1))) & (success'=min(1, node36path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path93 * min(1,node36path93) - currentNode*(min(1, node36path93) - 1))) &  (currentPath'=(93 * min(1, node36path93) - currentPath*(min(1,node36path93) - 1))) & (success'=min(1, node36path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path94 * min(1,node36path94) - currentNode*(min(1, node36path94) - 1))) &  (currentPath'=(94 * min(1, node36path94) - currentPath*(min(1,node36path94) - 1))) & (success'=min(1, node36path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path95 * min(1,node36path95) - currentNode*(min(1, node36path95) - 1))) &  (currentPath'=(95 * min(1, node36path95) - currentPath*(min(1,node36path95) - 1))) & (success'=min(1, node36path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path96 * min(1,node36path96) - currentNode*(min(1, node36path96) - 1))) &  (currentPath'=(96 * min(1, node36path96) - currentPath*(min(1,node36path96) - 1))) & (success'=min(1, node36path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path97 * min(1,node36path97) - currentNode*(min(1, node36path97) - 1))) &  (currentPath'=(97 * min(1, node36path97) - currentPath*(min(1,node36path97) - 1))) & (success'=min(1, node36path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path98 * min(1,node36path98) - currentNode*(min(1, node36path98) - 1))) &  (currentPath'=(98 * min(1, node36path98) - currentPath*(min(1,node36path98) - 1))) & (success'=min(1, node36path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path99 * min(1,node36path99) - currentNode*(min(1, node36path99) - 1))) &  (currentPath'=(99 * min(1, node36path99) - currentPath*(min(1,node36path99) - 1))) & (success'=min(1, node36path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node36path100 * min(1,node36path100) - currentNode*(min(1, node36path100) - 1))) &  (currentPath'=(100 * min(1, node36path100) - currentPath*(min(1,node36path100) - 1))) & (success'=min(1, node36path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 37) ->
 numPathsInv: (currentNode'=(node37path1 * min(1,node37path1) - currentNode*(min(1, node37path1) - 1))) &  (currentPath'=(1 * min(1, node37path1) - currentPath*(min(1,node37path1) - 1))) & (success'=min(1, node37path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path2 * min(1,node37path2) - currentNode*(min(1, node37path2) - 1))) &  (currentPath'=(2 * min(1, node37path2) - currentPath*(min(1,node37path2) - 1))) & (success'=min(1, node37path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path3 * min(1,node37path3) - currentNode*(min(1, node37path3) - 1))) &  (currentPath'=(3 * min(1, node37path3) - currentPath*(min(1,node37path3) - 1))) & (success'=min(1, node37path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path4 * min(1,node37path4) - currentNode*(min(1, node37path4) - 1))) &  (currentPath'=(4 * min(1, node37path4) - currentPath*(min(1,node37path4) - 1))) & (success'=min(1, node37path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path5 * min(1,node37path5) - currentNode*(min(1, node37path5) - 1))) &  (currentPath'=(5 * min(1, node37path5) - currentPath*(min(1,node37path5) - 1))) & (success'=min(1, node37path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path6 * min(1,node37path6) - currentNode*(min(1, node37path6) - 1))) &  (currentPath'=(6 * min(1, node37path6) - currentPath*(min(1,node37path6) - 1))) & (success'=min(1, node37path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path7 * min(1,node37path7) - currentNode*(min(1, node37path7) - 1))) &  (currentPath'=(7 * min(1, node37path7) - currentPath*(min(1,node37path7) - 1))) & (success'=min(1, node37path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path8 * min(1,node37path8) - currentNode*(min(1, node37path8) - 1))) &  (currentPath'=(8 * min(1, node37path8) - currentPath*(min(1,node37path8) - 1))) & (success'=min(1, node37path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path9 * min(1,node37path9) - currentNode*(min(1, node37path9) - 1))) &  (currentPath'=(9 * min(1, node37path9) - currentPath*(min(1,node37path9) - 1))) & (success'=min(1, node37path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path10 * min(1,node37path10) - currentNode*(min(1, node37path10) - 1))) &  (currentPath'=(10 * min(1, node37path10) - currentPath*(min(1,node37path10) - 1))) & (success'=min(1, node37path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path11 * min(1,node37path11) - currentNode*(min(1, node37path11) - 1))) &  (currentPath'=(11 * min(1, node37path11) - currentPath*(min(1,node37path11) - 1))) & (success'=min(1, node37path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path12 * min(1,node37path12) - currentNode*(min(1, node37path12) - 1))) &  (currentPath'=(12 * min(1, node37path12) - currentPath*(min(1,node37path12) - 1))) & (success'=min(1, node37path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path13 * min(1,node37path13) - currentNode*(min(1, node37path13) - 1))) &  (currentPath'=(13 * min(1, node37path13) - currentPath*(min(1,node37path13) - 1))) & (success'=min(1, node37path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path14 * min(1,node37path14) - currentNode*(min(1, node37path14) - 1))) &  (currentPath'=(14 * min(1, node37path14) - currentPath*(min(1,node37path14) - 1))) & (success'=min(1, node37path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path15 * min(1,node37path15) - currentNode*(min(1, node37path15) - 1))) &  (currentPath'=(15 * min(1, node37path15) - currentPath*(min(1,node37path15) - 1))) & (success'=min(1, node37path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path16 * min(1,node37path16) - currentNode*(min(1, node37path16) - 1))) &  (currentPath'=(16 * min(1, node37path16) - currentPath*(min(1,node37path16) - 1))) & (success'=min(1, node37path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path17 * min(1,node37path17) - currentNode*(min(1, node37path17) - 1))) &  (currentPath'=(17 * min(1, node37path17) - currentPath*(min(1,node37path17) - 1))) & (success'=min(1, node37path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path18 * min(1,node37path18) - currentNode*(min(1, node37path18) - 1))) &  (currentPath'=(18 * min(1, node37path18) - currentPath*(min(1,node37path18) - 1))) & (success'=min(1, node37path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path19 * min(1,node37path19) - currentNode*(min(1, node37path19) - 1))) &  (currentPath'=(19 * min(1, node37path19) - currentPath*(min(1,node37path19) - 1))) & (success'=min(1, node37path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path20 * min(1,node37path20) - currentNode*(min(1, node37path20) - 1))) &  (currentPath'=(20 * min(1, node37path20) - currentPath*(min(1,node37path20) - 1))) & (success'=min(1, node37path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path21 * min(1,node37path21) - currentNode*(min(1, node37path21) - 1))) &  (currentPath'=(21 * min(1, node37path21) - currentPath*(min(1,node37path21) - 1))) & (success'=min(1, node37path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path22 * min(1,node37path22) - currentNode*(min(1, node37path22) - 1))) &  (currentPath'=(22 * min(1, node37path22) - currentPath*(min(1,node37path22) - 1))) & (success'=min(1, node37path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path23 * min(1,node37path23) - currentNode*(min(1, node37path23) - 1))) &  (currentPath'=(23 * min(1, node37path23) - currentPath*(min(1,node37path23) - 1))) & (success'=min(1, node37path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path24 * min(1,node37path24) - currentNode*(min(1, node37path24) - 1))) &  (currentPath'=(24 * min(1, node37path24) - currentPath*(min(1,node37path24) - 1))) & (success'=min(1, node37path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path25 * min(1,node37path25) - currentNode*(min(1, node37path25) - 1))) &  (currentPath'=(25 * min(1, node37path25) - currentPath*(min(1,node37path25) - 1))) & (success'=min(1, node37path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path26 * min(1,node37path26) - currentNode*(min(1, node37path26) - 1))) &  (currentPath'=(26 * min(1, node37path26) - currentPath*(min(1,node37path26) - 1))) & (success'=min(1, node37path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path27 * min(1,node37path27) - currentNode*(min(1, node37path27) - 1))) &  (currentPath'=(27 * min(1, node37path27) - currentPath*(min(1,node37path27) - 1))) & (success'=min(1, node37path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path28 * min(1,node37path28) - currentNode*(min(1, node37path28) - 1))) &  (currentPath'=(28 * min(1, node37path28) - currentPath*(min(1,node37path28) - 1))) & (success'=min(1, node37path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path29 * min(1,node37path29) - currentNode*(min(1, node37path29) - 1))) &  (currentPath'=(29 * min(1, node37path29) - currentPath*(min(1,node37path29) - 1))) & (success'=min(1, node37path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path30 * min(1,node37path30) - currentNode*(min(1, node37path30) - 1))) &  (currentPath'=(30 * min(1, node37path30) - currentPath*(min(1,node37path30) - 1))) & (success'=min(1, node37path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path31 * min(1,node37path31) - currentNode*(min(1, node37path31) - 1))) &  (currentPath'=(31 * min(1, node37path31) - currentPath*(min(1,node37path31) - 1))) & (success'=min(1, node37path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path32 * min(1,node37path32) - currentNode*(min(1, node37path32) - 1))) &  (currentPath'=(32 * min(1, node37path32) - currentPath*(min(1,node37path32) - 1))) & (success'=min(1, node37path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path33 * min(1,node37path33) - currentNode*(min(1, node37path33) - 1))) &  (currentPath'=(33 * min(1, node37path33) - currentPath*(min(1,node37path33) - 1))) & (success'=min(1, node37path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path34 * min(1,node37path34) - currentNode*(min(1, node37path34) - 1))) &  (currentPath'=(34 * min(1, node37path34) - currentPath*(min(1,node37path34) - 1))) & (success'=min(1, node37path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path35 * min(1,node37path35) - currentNode*(min(1, node37path35) - 1))) &  (currentPath'=(35 * min(1, node37path35) - currentPath*(min(1,node37path35) - 1))) & (success'=min(1, node37path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path36 * min(1,node37path36) - currentNode*(min(1, node37path36) - 1))) &  (currentPath'=(36 * min(1, node37path36) - currentPath*(min(1,node37path36) - 1))) & (success'=min(1, node37path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path37 * min(1,node37path37) - currentNode*(min(1, node37path37) - 1))) &  (currentPath'=(37 * min(1, node37path37) - currentPath*(min(1,node37path37) - 1))) & (success'=min(1, node37path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path38 * min(1,node37path38) - currentNode*(min(1, node37path38) - 1))) &  (currentPath'=(38 * min(1, node37path38) - currentPath*(min(1,node37path38) - 1))) & (success'=min(1, node37path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path39 * min(1,node37path39) - currentNode*(min(1, node37path39) - 1))) &  (currentPath'=(39 * min(1, node37path39) - currentPath*(min(1,node37path39) - 1))) & (success'=min(1, node37path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path40 * min(1,node37path40) - currentNode*(min(1, node37path40) - 1))) &  (currentPath'=(40 * min(1, node37path40) - currentPath*(min(1,node37path40) - 1))) & (success'=min(1, node37path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path41 * min(1,node37path41) - currentNode*(min(1, node37path41) - 1))) &  (currentPath'=(41 * min(1, node37path41) - currentPath*(min(1,node37path41) - 1))) & (success'=min(1, node37path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path42 * min(1,node37path42) - currentNode*(min(1, node37path42) - 1))) &  (currentPath'=(42 * min(1, node37path42) - currentPath*(min(1,node37path42) - 1))) & (success'=min(1, node37path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path43 * min(1,node37path43) - currentNode*(min(1, node37path43) - 1))) &  (currentPath'=(43 * min(1, node37path43) - currentPath*(min(1,node37path43) - 1))) & (success'=min(1, node37path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path44 * min(1,node37path44) - currentNode*(min(1, node37path44) - 1))) &  (currentPath'=(44 * min(1, node37path44) - currentPath*(min(1,node37path44) - 1))) & (success'=min(1, node37path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path45 * min(1,node37path45) - currentNode*(min(1, node37path45) - 1))) &  (currentPath'=(45 * min(1, node37path45) - currentPath*(min(1,node37path45) - 1))) & (success'=min(1, node37path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path46 * min(1,node37path46) - currentNode*(min(1, node37path46) - 1))) &  (currentPath'=(46 * min(1, node37path46) - currentPath*(min(1,node37path46) - 1))) & (success'=min(1, node37path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path47 * min(1,node37path47) - currentNode*(min(1, node37path47) - 1))) &  (currentPath'=(47 * min(1, node37path47) - currentPath*(min(1,node37path47) - 1))) & (success'=min(1, node37path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path48 * min(1,node37path48) - currentNode*(min(1, node37path48) - 1))) &  (currentPath'=(48 * min(1, node37path48) - currentPath*(min(1,node37path48) - 1))) & (success'=min(1, node37path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path49 * min(1,node37path49) - currentNode*(min(1, node37path49) - 1))) &  (currentPath'=(49 * min(1, node37path49) - currentPath*(min(1,node37path49) - 1))) & (success'=min(1, node37path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path50 * min(1,node37path50) - currentNode*(min(1, node37path50) - 1))) &  (currentPath'=(50 * min(1, node37path50) - currentPath*(min(1,node37path50) - 1))) & (success'=min(1, node37path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path51 * min(1,node37path51) - currentNode*(min(1, node37path51) - 1))) &  (currentPath'=(51 * min(1, node37path51) - currentPath*(min(1,node37path51) - 1))) & (success'=min(1, node37path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path52 * min(1,node37path52) - currentNode*(min(1, node37path52) - 1))) &  (currentPath'=(52 * min(1, node37path52) - currentPath*(min(1,node37path52) - 1))) & (success'=min(1, node37path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path53 * min(1,node37path53) - currentNode*(min(1, node37path53) - 1))) &  (currentPath'=(53 * min(1, node37path53) - currentPath*(min(1,node37path53) - 1))) & (success'=min(1, node37path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path54 * min(1,node37path54) - currentNode*(min(1, node37path54) - 1))) &  (currentPath'=(54 * min(1, node37path54) - currentPath*(min(1,node37path54) - 1))) & (success'=min(1, node37path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path55 * min(1,node37path55) - currentNode*(min(1, node37path55) - 1))) &  (currentPath'=(55 * min(1, node37path55) - currentPath*(min(1,node37path55) - 1))) & (success'=min(1, node37path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path56 * min(1,node37path56) - currentNode*(min(1, node37path56) - 1))) &  (currentPath'=(56 * min(1, node37path56) - currentPath*(min(1,node37path56) - 1))) & (success'=min(1, node37path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path57 * min(1,node37path57) - currentNode*(min(1, node37path57) - 1))) &  (currentPath'=(57 * min(1, node37path57) - currentPath*(min(1,node37path57) - 1))) & (success'=min(1, node37path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path58 * min(1,node37path58) - currentNode*(min(1, node37path58) - 1))) &  (currentPath'=(58 * min(1, node37path58) - currentPath*(min(1,node37path58) - 1))) & (success'=min(1, node37path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path59 * min(1,node37path59) - currentNode*(min(1, node37path59) - 1))) &  (currentPath'=(59 * min(1, node37path59) - currentPath*(min(1,node37path59) - 1))) & (success'=min(1, node37path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path60 * min(1,node37path60) - currentNode*(min(1, node37path60) - 1))) &  (currentPath'=(60 * min(1, node37path60) - currentPath*(min(1,node37path60) - 1))) & (success'=min(1, node37path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path61 * min(1,node37path61) - currentNode*(min(1, node37path61) - 1))) &  (currentPath'=(61 * min(1, node37path61) - currentPath*(min(1,node37path61) - 1))) & (success'=min(1, node37path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path62 * min(1,node37path62) - currentNode*(min(1, node37path62) - 1))) &  (currentPath'=(62 * min(1, node37path62) - currentPath*(min(1,node37path62) - 1))) & (success'=min(1, node37path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path63 * min(1,node37path63) - currentNode*(min(1, node37path63) - 1))) &  (currentPath'=(63 * min(1, node37path63) - currentPath*(min(1,node37path63) - 1))) & (success'=min(1, node37path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path64 * min(1,node37path64) - currentNode*(min(1, node37path64) - 1))) &  (currentPath'=(64 * min(1, node37path64) - currentPath*(min(1,node37path64) - 1))) & (success'=min(1, node37path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path65 * min(1,node37path65) - currentNode*(min(1, node37path65) - 1))) &  (currentPath'=(65 * min(1, node37path65) - currentPath*(min(1,node37path65) - 1))) & (success'=min(1, node37path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path66 * min(1,node37path66) - currentNode*(min(1, node37path66) - 1))) &  (currentPath'=(66 * min(1, node37path66) - currentPath*(min(1,node37path66) - 1))) & (success'=min(1, node37path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path67 * min(1,node37path67) - currentNode*(min(1, node37path67) - 1))) &  (currentPath'=(67 * min(1, node37path67) - currentPath*(min(1,node37path67) - 1))) & (success'=min(1, node37path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path68 * min(1,node37path68) - currentNode*(min(1, node37path68) - 1))) &  (currentPath'=(68 * min(1, node37path68) - currentPath*(min(1,node37path68) - 1))) & (success'=min(1, node37path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path69 * min(1,node37path69) - currentNode*(min(1, node37path69) - 1))) &  (currentPath'=(69 * min(1, node37path69) - currentPath*(min(1,node37path69) - 1))) & (success'=min(1, node37path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path70 * min(1,node37path70) - currentNode*(min(1, node37path70) - 1))) &  (currentPath'=(70 * min(1, node37path70) - currentPath*(min(1,node37path70) - 1))) & (success'=min(1, node37path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path71 * min(1,node37path71) - currentNode*(min(1, node37path71) - 1))) &  (currentPath'=(71 * min(1, node37path71) - currentPath*(min(1,node37path71) - 1))) & (success'=min(1, node37path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path72 * min(1,node37path72) - currentNode*(min(1, node37path72) - 1))) &  (currentPath'=(72 * min(1, node37path72) - currentPath*(min(1,node37path72) - 1))) & (success'=min(1, node37path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path73 * min(1,node37path73) - currentNode*(min(1, node37path73) - 1))) &  (currentPath'=(73 * min(1, node37path73) - currentPath*(min(1,node37path73) - 1))) & (success'=min(1, node37path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path74 * min(1,node37path74) - currentNode*(min(1, node37path74) - 1))) &  (currentPath'=(74 * min(1, node37path74) - currentPath*(min(1,node37path74) - 1))) & (success'=min(1, node37path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path75 * min(1,node37path75) - currentNode*(min(1, node37path75) - 1))) &  (currentPath'=(75 * min(1, node37path75) - currentPath*(min(1,node37path75) - 1))) & (success'=min(1, node37path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path76 * min(1,node37path76) - currentNode*(min(1, node37path76) - 1))) &  (currentPath'=(76 * min(1, node37path76) - currentPath*(min(1,node37path76) - 1))) & (success'=min(1, node37path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path77 * min(1,node37path77) - currentNode*(min(1, node37path77) - 1))) &  (currentPath'=(77 * min(1, node37path77) - currentPath*(min(1,node37path77) - 1))) & (success'=min(1, node37path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path78 * min(1,node37path78) - currentNode*(min(1, node37path78) - 1))) &  (currentPath'=(78 * min(1, node37path78) - currentPath*(min(1,node37path78) - 1))) & (success'=min(1, node37path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path79 * min(1,node37path79) - currentNode*(min(1, node37path79) - 1))) &  (currentPath'=(79 * min(1, node37path79) - currentPath*(min(1,node37path79) - 1))) & (success'=min(1, node37path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path80 * min(1,node37path80) - currentNode*(min(1, node37path80) - 1))) &  (currentPath'=(80 * min(1, node37path80) - currentPath*(min(1,node37path80) - 1))) & (success'=min(1, node37path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path81 * min(1,node37path81) - currentNode*(min(1, node37path81) - 1))) &  (currentPath'=(81 * min(1, node37path81) - currentPath*(min(1,node37path81) - 1))) & (success'=min(1, node37path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path82 * min(1,node37path82) - currentNode*(min(1, node37path82) - 1))) &  (currentPath'=(82 * min(1, node37path82) - currentPath*(min(1,node37path82) - 1))) & (success'=min(1, node37path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path83 * min(1,node37path83) - currentNode*(min(1, node37path83) - 1))) &  (currentPath'=(83 * min(1, node37path83) - currentPath*(min(1,node37path83) - 1))) & (success'=min(1, node37path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path84 * min(1,node37path84) - currentNode*(min(1, node37path84) - 1))) &  (currentPath'=(84 * min(1, node37path84) - currentPath*(min(1,node37path84) - 1))) & (success'=min(1, node37path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path85 * min(1,node37path85) - currentNode*(min(1, node37path85) - 1))) &  (currentPath'=(85 * min(1, node37path85) - currentPath*(min(1,node37path85) - 1))) & (success'=min(1, node37path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path86 * min(1,node37path86) - currentNode*(min(1, node37path86) - 1))) &  (currentPath'=(86 * min(1, node37path86) - currentPath*(min(1,node37path86) - 1))) & (success'=min(1, node37path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path87 * min(1,node37path87) - currentNode*(min(1, node37path87) - 1))) &  (currentPath'=(87 * min(1, node37path87) - currentPath*(min(1,node37path87) - 1))) & (success'=min(1, node37path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path88 * min(1,node37path88) - currentNode*(min(1, node37path88) - 1))) &  (currentPath'=(88 * min(1, node37path88) - currentPath*(min(1,node37path88) - 1))) & (success'=min(1, node37path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path89 * min(1,node37path89) - currentNode*(min(1, node37path89) - 1))) &  (currentPath'=(89 * min(1, node37path89) - currentPath*(min(1,node37path89) - 1))) & (success'=min(1, node37path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path90 * min(1,node37path90) - currentNode*(min(1, node37path90) - 1))) &  (currentPath'=(90 * min(1, node37path90) - currentPath*(min(1,node37path90) - 1))) & (success'=min(1, node37path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path91 * min(1,node37path91) - currentNode*(min(1, node37path91) - 1))) &  (currentPath'=(91 * min(1, node37path91) - currentPath*(min(1,node37path91) - 1))) & (success'=min(1, node37path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path92 * min(1,node37path92) - currentNode*(min(1, node37path92) - 1))) &  (currentPath'=(92 * min(1, node37path92) - currentPath*(min(1,node37path92) - 1))) & (success'=min(1, node37path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path93 * min(1,node37path93) - currentNode*(min(1, node37path93) - 1))) &  (currentPath'=(93 * min(1, node37path93) - currentPath*(min(1,node37path93) - 1))) & (success'=min(1, node37path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path94 * min(1,node37path94) - currentNode*(min(1, node37path94) - 1))) &  (currentPath'=(94 * min(1, node37path94) - currentPath*(min(1,node37path94) - 1))) & (success'=min(1, node37path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path95 * min(1,node37path95) - currentNode*(min(1, node37path95) - 1))) &  (currentPath'=(95 * min(1, node37path95) - currentPath*(min(1,node37path95) - 1))) & (success'=min(1, node37path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path96 * min(1,node37path96) - currentNode*(min(1, node37path96) - 1))) &  (currentPath'=(96 * min(1, node37path96) - currentPath*(min(1,node37path96) - 1))) & (success'=min(1, node37path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path97 * min(1,node37path97) - currentNode*(min(1, node37path97) - 1))) &  (currentPath'=(97 * min(1, node37path97) - currentPath*(min(1,node37path97) - 1))) & (success'=min(1, node37path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path98 * min(1,node37path98) - currentNode*(min(1, node37path98) - 1))) &  (currentPath'=(98 * min(1, node37path98) - currentPath*(min(1,node37path98) - 1))) & (success'=min(1, node37path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path99 * min(1,node37path99) - currentNode*(min(1, node37path99) - 1))) &  (currentPath'=(99 * min(1, node37path99) - currentPath*(min(1,node37path99) - 1))) & (success'=min(1, node37path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node37path100 * min(1,node37path100) - currentNode*(min(1, node37path100) - 1))) &  (currentPath'=(100 * min(1, node37path100) - currentPath*(min(1,node37path100) - 1))) & (success'=min(1, node37path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 38) ->
 numPathsInv: (currentNode'=(node38path1 * min(1,node38path1) - currentNode*(min(1, node38path1) - 1))) &  (currentPath'=(1 * min(1, node38path1) - currentPath*(min(1,node38path1) - 1))) & (success'=min(1, node38path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path2 * min(1,node38path2) - currentNode*(min(1, node38path2) - 1))) &  (currentPath'=(2 * min(1, node38path2) - currentPath*(min(1,node38path2) - 1))) & (success'=min(1, node38path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path3 * min(1,node38path3) - currentNode*(min(1, node38path3) - 1))) &  (currentPath'=(3 * min(1, node38path3) - currentPath*(min(1,node38path3) - 1))) & (success'=min(1, node38path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path4 * min(1,node38path4) - currentNode*(min(1, node38path4) - 1))) &  (currentPath'=(4 * min(1, node38path4) - currentPath*(min(1,node38path4) - 1))) & (success'=min(1, node38path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path5 * min(1,node38path5) - currentNode*(min(1, node38path5) - 1))) &  (currentPath'=(5 * min(1, node38path5) - currentPath*(min(1,node38path5) - 1))) & (success'=min(1, node38path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path6 * min(1,node38path6) - currentNode*(min(1, node38path6) - 1))) &  (currentPath'=(6 * min(1, node38path6) - currentPath*(min(1,node38path6) - 1))) & (success'=min(1, node38path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path7 * min(1,node38path7) - currentNode*(min(1, node38path7) - 1))) &  (currentPath'=(7 * min(1, node38path7) - currentPath*(min(1,node38path7) - 1))) & (success'=min(1, node38path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path8 * min(1,node38path8) - currentNode*(min(1, node38path8) - 1))) &  (currentPath'=(8 * min(1, node38path8) - currentPath*(min(1,node38path8) - 1))) & (success'=min(1, node38path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path9 * min(1,node38path9) - currentNode*(min(1, node38path9) - 1))) &  (currentPath'=(9 * min(1, node38path9) - currentPath*(min(1,node38path9) - 1))) & (success'=min(1, node38path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path10 * min(1,node38path10) - currentNode*(min(1, node38path10) - 1))) &  (currentPath'=(10 * min(1, node38path10) - currentPath*(min(1,node38path10) - 1))) & (success'=min(1, node38path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path11 * min(1,node38path11) - currentNode*(min(1, node38path11) - 1))) &  (currentPath'=(11 * min(1, node38path11) - currentPath*(min(1,node38path11) - 1))) & (success'=min(1, node38path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path12 * min(1,node38path12) - currentNode*(min(1, node38path12) - 1))) &  (currentPath'=(12 * min(1, node38path12) - currentPath*(min(1,node38path12) - 1))) & (success'=min(1, node38path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path13 * min(1,node38path13) - currentNode*(min(1, node38path13) - 1))) &  (currentPath'=(13 * min(1, node38path13) - currentPath*(min(1,node38path13) - 1))) & (success'=min(1, node38path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path14 * min(1,node38path14) - currentNode*(min(1, node38path14) - 1))) &  (currentPath'=(14 * min(1, node38path14) - currentPath*(min(1,node38path14) - 1))) & (success'=min(1, node38path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path15 * min(1,node38path15) - currentNode*(min(1, node38path15) - 1))) &  (currentPath'=(15 * min(1, node38path15) - currentPath*(min(1,node38path15) - 1))) & (success'=min(1, node38path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path16 * min(1,node38path16) - currentNode*(min(1, node38path16) - 1))) &  (currentPath'=(16 * min(1, node38path16) - currentPath*(min(1,node38path16) - 1))) & (success'=min(1, node38path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path17 * min(1,node38path17) - currentNode*(min(1, node38path17) - 1))) &  (currentPath'=(17 * min(1, node38path17) - currentPath*(min(1,node38path17) - 1))) & (success'=min(1, node38path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path18 * min(1,node38path18) - currentNode*(min(1, node38path18) - 1))) &  (currentPath'=(18 * min(1, node38path18) - currentPath*(min(1,node38path18) - 1))) & (success'=min(1, node38path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path19 * min(1,node38path19) - currentNode*(min(1, node38path19) - 1))) &  (currentPath'=(19 * min(1, node38path19) - currentPath*(min(1,node38path19) - 1))) & (success'=min(1, node38path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path20 * min(1,node38path20) - currentNode*(min(1, node38path20) - 1))) &  (currentPath'=(20 * min(1, node38path20) - currentPath*(min(1,node38path20) - 1))) & (success'=min(1, node38path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path21 * min(1,node38path21) - currentNode*(min(1, node38path21) - 1))) &  (currentPath'=(21 * min(1, node38path21) - currentPath*(min(1,node38path21) - 1))) & (success'=min(1, node38path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path22 * min(1,node38path22) - currentNode*(min(1, node38path22) - 1))) &  (currentPath'=(22 * min(1, node38path22) - currentPath*(min(1,node38path22) - 1))) & (success'=min(1, node38path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path23 * min(1,node38path23) - currentNode*(min(1, node38path23) - 1))) &  (currentPath'=(23 * min(1, node38path23) - currentPath*(min(1,node38path23) - 1))) & (success'=min(1, node38path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path24 * min(1,node38path24) - currentNode*(min(1, node38path24) - 1))) &  (currentPath'=(24 * min(1, node38path24) - currentPath*(min(1,node38path24) - 1))) & (success'=min(1, node38path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path25 * min(1,node38path25) - currentNode*(min(1, node38path25) - 1))) &  (currentPath'=(25 * min(1, node38path25) - currentPath*(min(1,node38path25) - 1))) & (success'=min(1, node38path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path26 * min(1,node38path26) - currentNode*(min(1, node38path26) - 1))) &  (currentPath'=(26 * min(1, node38path26) - currentPath*(min(1,node38path26) - 1))) & (success'=min(1, node38path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path27 * min(1,node38path27) - currentNode*(min(1, node38path27) - 1))) &  (currentPath'=(27 * min(1, node38path27) - currentPath*(min(1,node38path27) - 1))) & (success'=min(1, node38path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path28 * min(1,node38path28) - currentNode*(min(1, node38path28) - 1))) &  (currentPath'=(28 * min(1, node38path28) - currentPath*(min(1,node38path28) - 1))) & (success'=min(1, node38path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path29 * min(1,node38path29) - currentNode*(min(1, node38path29) - 1))) &  (currentPath'=(29 * min(1, node38path29) - currentPath*(min(1,node38path29) - 1))) & (success'=min(1, node38path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path30 * min(1,node38path30) - currentNode*(min(1, node38path30) - 1))) &  (currentPath'=(30 * min(1, node38path30) - currentPath*(min(1,node38path30) - 1))) & (success'=min(1, node38path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path31 * min(1,node38path31) - currentNode*(min(1, node38path31) - 1))) &  (currentPath'=(31 * min(1, node38path31) - currentPath*(min(1,node38path31) - 1))) & (success'=min(1, node38path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path32 * min(1,node38path32) - currentNode*(min(1, node38path32) - 1))) &  (currentPath'=(32 * min(1, node38path32) - currentPath*(min(1,node38path32) - 1))) & (success'=min(1, node38path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path33 * min(1,node38path33) - currentNode*(min(1, node38path33) - 1))) &  (currentPath'=(33 * min(1, node38path33) - currentPath*(min(1,node38path33) - 1))) & (success'=min(1, node38path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path34 * min(1,node38path34) - currentNode*(min(1, node38path34) - 1))) &  (currentPath'=(34 * min(1, node38path34) - currentPath*(min(1,node38path34) - 1))) & (success'=min(1, node38path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path35 * min(1,node38path35) - currentNode*(min(1, node38path35) - 1))) &  (currentPath'=(35 * min(1, node38path35) - currentPath*(min(1,node38path35) - 1))) & (success'=min(1, node38path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path36 * min(1,node38path36) - currentNode*(min(1, node38path36) - 1))) &  (currentPath'=(36 * min(1, node38path36) - currentPath*(min(1,node38path36) - 1))) & (success'=min(1, node38path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path37 * min(1,node38path37) - currentNode*(min(1, node38path37) - 1))) &  (currentPath'=(37 * min(1, node38path37) - currentPath*(min(1,node38path37) - 1))) & (success'=min(1, node38path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path38 * min(1,node38path38) - currentNode*(min(1, node38path38) - 1))) &  (currentPath'=(38 * min(1, node38path38) - currentPath*(min(1,node38path38) - 1))) & (success'=min(1, node38path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path39 * min(1,node38path39) - currentNode*(min(1, node38path39) - 1))) &  (currentPath'=(39 * min(1, node38path39) - currentPath*(min(1,node38path39) - 1))) & (success'=min(1, node38path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path40 * min(1,node38path40) - currentNode*(min(1, node38path40) - 1))) &  (currentPath'=(40 * min(1, node38path40) - currentPath*(min(1,node38path40) - 1))) & (success'=min(1, node38path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path41 * min(1,node38path41) - currentNode*(min(1, node38path41) - 1))) &  (currentPath'=(41 * min(1, node38path41) - currentPath*(min(1,node38path41) - 1))) & (success'=min(1, node38path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path42 * min(1,node38path42) - currentNode*(min(1, node38path42) - 1))) &  (currentPath'=(42 * min(1, node38path42) - currentPath*(min(1,node38path42) - 1))) & (success'=min(1, node38path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path43 * min(1,node38path43) - currentNode*(min(1, node38path43) - 1))) &  (currentPath'=(43 * min(1, node38path43) - currentPath*(min(1,node38path43) - 1))) & (success'=min(1, node38path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path44 * min(1,node38path44) - currentNode*(min(1, node38path44) - 1))) &  (currentPath'=(44 * min(1, node38path44) - currentPath*(min(1,node38path44) - 1))) & (success'=min(1, node38path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path45 * min(1,node38path45) - currentNode*(min(1, node38path45) - 1))) &  (currentPath'=(45 * min(1, node38path45) - currentPath*(min(1,node38path45) - 1))) & (success'=min(1, node38path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path46 * min(1,node38path46) - currentNode*(min(1, node38path46) - 1))) &  (currentPath'=(46 * min(1, node38path46) - currentPath*(min(1,node38path46) - 1))) & (success'=min(1, node38path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path47 * min(1,node38path47) - currentNode*(min(1, node38path47) - 1))) &  (currentPath'=(47 * min(1, node38path47) - currentPath*(min(1,node38path47) - 1))) & (success'=min(1, node38path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path48 * min(1,node38path48) - currentNode*(min(1, node38path48) - 1))) &  (currentPath'=(48 * min(1, node38path48) - currentPath*(min(1,node38path48) - 1))) & (success'=min(1, node38path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path49 * min(1,node38path49) - currentNode*(min(1, node38path49) - 1))) &  (currentPath'=(49 * min(1, node38path49) - currentPath*(min(1,node38path49) - 1))) & (success'=min(1, node38path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path50 * min(1,node38path50) - currentNode*(min(1, node38path50) - 1))) &  (currentPath'=(50 * min(1, node38path50) - currentPath*(min(1,node38path50) - 1))) & (success'=min(1, node38path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path51 * min(1,node38path51) - currentNode*(min(1, node38path51) - 1))) &  (currentPath'=(51 * min(1, node38path51) - currentPath*(min(1,node38path51) - 1))) & (success'=min(1, node38path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path52 * min(1,node38path52) - currentNode*(min(1, node38path52) - 1))) &  (currentPath'=(52 * min(1, node38path52) - currentPath*(min(1,node38path52) - 1))) & (success'=min(1, node38path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path53 * min(1,node38path53) - currentNode*(min(1, node38path53) - 1))) &  (currentPath'=(53 * min(1, node38path53) - currentPath*(min(1,node38path53) - 1))) & (success'=min(1, node38path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path54 * min(1,node38path54) - currentNode*(min(1, node38path54) - 1))) &  (currentPath'=(54 * min(1, node38path54) - currentPath*(min(1,node38path54) - 1))) & (success'=min(1, node38path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path55 * min(1,node38path55) - currentNode*(min(1, node38path55) - 1))) &  (currentPath'=(55 * min(1, node38path55) - currentPath*(min(1,node38path55) - 1))) & (success'=min(1, node38path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path56 * min(1,node38path56) - currentNode*(min(1, node38path56) - 1))) &  (currentPath'=(56 * min(1, node38path56) - currentPath*(min(1,node38path56) - 1))) & (success'=min(1, node38path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path57 * min(1,node38path57) - currentNode*(min(1, node38path57) - 1))) &  (currentPath'=(57 * min(1, node38path57) - currentPath*(min(1,node38path57) - 1))) & (success'=min(1, node38path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path58 * min(1,node38path58) - currentNode*(min(1, node38path58) - 1))) &  (currentPath'=(58 * min(1, node38path58) - currentPath*(min(1,node38path58) - 1))) & (success'=min(1, node38path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path59 * min(1,node38path59) - currentNode*(min(1, node38path59) - 1))) &  (currentPath'=(59 * min(1, node38path59) - currentPath*(min(1,node38path59) - 1))) & (success'=min(1, node38path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path60 * min(1,node38path60) - currentNode*(min(1, node38path60) - 1))) &  (currentPath'=(60 * min(1, node38path60) - currentPath*(min(1,node38path60) - 1))) & (success'=min(1, node38path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path61 * min(1,node38path61) - currentNode*(min(1, node38path61) - 1))) &  (currentPath'=(61 * min(1, node38path61) - currentPath*(min(1,node38path61) - 1))) & (success'=min(1, node38path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path62 * min(1,node38path62) - currentNode*(min(1, node38path62) - 1))) &  (currentPath'=(62 * min(1, node38path62) - currentPath*(min(1,node38path62) - 1))) & (success'=min(1, node38path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path63 * min(1,node38path63) - currentNode*(min(1, node38path63) - 1))) &  (currentPath'=(63 * min(1, node38path63) - currentPath*(min(1,node38path63) - 1))) & (success'=min(1, node38path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path64 * min(1,node38path64) - currentNode*(min(1, node38path64) - 1))) &  (currentPath'=(64 * min(1, node38path64) - currentPath*(min(1,node38path64) - 1))) & (success'=min(1, node38path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path65 * min(1,node38path65) - currentNode*(min(1, node38path65) - 1))) &  (currentPath'=(65 * min(1, node38path65) - currentPath*(min(1,node38path65) - 1))) & (success'=min(1, node38path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path66 * min(1,node38path66) - currentNode*(min(1, node38path66) - 1))) &  (currentPath'=(66 * min(1, node38path66) - currentPath*(min(1,node38path66) - 1))) & (success'=min(1, node38path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path67 * min(1,node38path67) - currentNode*(min(1, node38path67) - 1))) &  (currentPath'=(67 * min(1, node38path67) - currentPath*(min(1,node38path67) - 1))) & (success'=min(1, node38path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path68 * min(1,node38path68) - currentNode*(min(1, node38path68) - 1))) &  (currentPath'=(68 * min(1, node38path68) - currentPath*(min(1,node38path68) - 1))) & (success'=min(1, node38path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path69 * min(1,node38path69) - currentNode*(min(1, node38path69) - 1))) &  (currentPath'=(69 * min(1, node38path69) - currentPath*(min(1,node38path69) - 1))) & (success'=min(1, node38path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path70 * min(1,node38path70) - currentNode*(min(1, node38path70) - 1))) &  (currentPath'=(70 * min(1, node38path70) - currentPath*(min(1,node38path70) - 1))) & (success'=min(1, node38path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path71 * min(1,node38path71) - currentNode*(min(1, node38path71) - 1))) &  (currentPath'=(71 * min(1, node38path71) - currentPath*(min(1,node38path71) - 1))) & (success'=min(1, node38path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path72 * min(1,node38path72) - currentNode*(min(1, node38path72) - 1))) &  (currentPath'=(72 * min(1, node38path72) - currentPath*(min(1,node38path72) - 1))) & (success'=min(1, node38path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path73 * min(1,node38path73) - currentNode*(min(1, node38path73) - 1))) &  (currentPath'=(73 * min(1, node38path73) - currentPath*(min(1,node38path73) - 1))) & (success'=min(1, node38path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path74 * min(1,node38path74) - currentNode*(min(1, node38path74) - 1))) &  (currentPath'=(74 * min(1, node38path74) - currentPath*(min(1,node38path74) - 1))) & (success'=min(1, node38path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path75 * min(1,node38path75) - currentNode*(min(1, node38path75) - 1))) &  (currentPath'=(75 * min(1, node38path75) - currentPath*(min(1,node38path75) - 1))) & (success'=min(1, node38path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path76 * min(1,node38path76) - currentNode*(min(1, node38path76) - 1))) &  (currentPath'=(76 * min(1, node38path76) - currentPath*(min(1,node38path76) - 1))) & (success'=min(1, node38path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path77 * min(1,node38path77) - currentNode*(min(1, node38path77) - 1))) &  (currentPath'=(77 * min(1, node38path77) - currentPath*(min(1,node38path77) - 1))) & (success'=min(1, node38path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path78 * min(1,node38path78) - currentNode*(min(1, node38path78) - 1))) &  (currentPath'=(78 * min(1, node38path78) - currentPath*(min(1,node38path78) - 1))) & (success'=min(1, node38path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path79 * min(1,node38path79) - currentNode*(min(1, node38path79) - 1))) &  (currentPath'=(79 * min(1, node38path79) - currentPath*(min(1,node38path79) - 1))) & (success'=min(1, node38path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path80 * min(1,node38path80) - currentNode*(min(1, node38path80) - 1))) &  (currentPath'=(80 * min(1, node38path80) - currentPath*(min(1,node38path80) - 1))) & (success'=min(1, node38path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path81 * min(1,node38path81) - currentNode*(min(1, node38path81) - 1))) &  (currentPath'=(81 * min(1, node38path81) - currentPath*(min(1,node38path81) - 1))) & (success'=min(1, node38path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path82 * min(1,node38path82) - currentNode*(min(1, node38path82) - 1))) &  (currentPath'=(82 * min(1, node38path82) - currentPath*(min(1,node38path82) - 1))) & (success'=min(1, node38path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path83 * min(1,node38path83) - currentNode*(min(1, node38path83) - 1))) &  (currentPath'=(83 * min(1, node38path83) - currentPath*(min(1,node38path83) - 1))) & (success'=min(1, node38path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path84 * min(1,node38path84) - currentNode*(min(1, node38path84) - 1))) &  (currentPath'=(84 * min(1, node38path84) - currentPath*(min(1,node38path84) - 1))) & (success'=min(1, node38path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path85 * min(1,node38path85) - currentNode*(min(1, node38path85) - 1))) &  (currentPath'=(85 * min(1, node38path85) - currentPath*(min(1,node38path85) - 1))) & (success'=min(1, node38path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path86 * min(1,node38path86) - currentNode*(min(1, node38path86) - 1))) &  (currentPath'=(86 * min(1, node38path86) - currentPath*(min(1,node38path86) - 1))) & (success'=min(1, node38path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path87 * min(1,node38path87) - currentNode*(min(1, node38path87) - 1))) &  (currentPath'=(87 * min(1, node38path87) - currentPath*(min(1,node38path87) - 1))) & (success'=min(1, node38path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path88 * min(1,node38path88) - currentNode*(min(1, node38path88) - 1))) &  (currentPath'=(88 * min(1, node38path88) - currentPath*(min(1,node38path88) - 1))) & (success'=min(1, node38path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path89 * min(1,node38path89) - currentNode*(min(1, node38path89) - 1))) &  (currentPath'=(89 * min(1, node38path89) - currentPath*(min(1,node38path89) - 1))) & (success'=min(1, node38path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path90 * min(1,node38path90) - currentNode*(min(1, node38path90) - 1))) &  (currentPath'=(90 * min(1, node38path90) - currentPath*(min(1,node38path90) - 1))) & (success'=min(1, node38path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path91 * min(1,node38path91) - currentNode*(min(1, node38path91) - 1))) &  (currentPath'=(91 * min(1, node38path91) - currentPath*(min(1,node38path91) - 1))) & (success'=min(1, node38path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path92 * min(1,node38path92) - currentNode*(min(1, node38path92) - 1))) &  (currentPath'=(92 * min(1, node38path92) - currentPath*(min(1,node38path92) - 1))) & (success'=min(1, node38path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path93 * min(1,node38path93) - currentNode*(min(1, node38path93) - 1))) &  (currentPath'=(93 * min(1, node38path93) - currentPath*(min(1,node38path93) - 1))) & (success'=min(1, node38path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path94 * min(1,node38path94) - currentNode*(min(1, node38path94) - 1))) &  (currentPath'=(94 * min(1, node38path94) - currentPath*(min(1,node38path94) - 1))) & (success'=min(1, node38path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path95 * min(1,node38path95) - currentNode*(min(1, node38path95) - 1))) &  (currentPath'=(95 * min(1, node38path95) - currentPath*(min(1,node38path95) - 1))) & (success'=min(1, node38path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path96 * min(1,node38path96) - currentNode*(min(1, node38path96) - 1))) &  (currentPath'=(96 * min(1, node38path96) - currentPath*(min(1,node38path96) - 1))) & (success'=min(1, node38path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path97 * min(1,node38path97) - currentNode*(min(1, node38path97) - 1))) &  (currentPath'=(97 * min(1, node38path97) - currentPath*(min(1,node38path97) - 1))) & (success'=min(1, node38path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path98 * min(1,node38path98) - currentNode*(min(1, node38path98) - 1))) &  (currentPath'=(98 * min(1, node38path98) - currentPath*(min(1,node38path98) - 1))) & (success'=min(1, node38path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path99 * min(1,node38path99) - currentNode*(min(1, node38path99) - 1))) &  (currentPath'=(99 * min(1, node38path99) - currentPath*(min(1,node38path99) - 1))) & (success'=min(1, node38path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node38path100 * min(1,node38path100) - currentNode*(min(1, node38path100) - 1))) &  (currentPath'=(100 * min(1, node38path100) - currentPath*(min(1,node38path100) - 1))) & (success'=min(1, node38path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 39) ->
 numPathsInv: (currentNode'=(node39path1 * min(1,node39path1) - currentNode*(min(1, node39path1) - 1))) &  (currentPath'=(1 * min(1, node39path1) - currentPath*(min(1,node39path1) - 1))) & (success'=min(1, node39path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path2 * min(1,node39path2) - currentNode*(min(1, node39path2) - 1))) &  (currentPath'=(2 * min(1, node39path2) - currentPath*(min(1,node39path2) - 1))) & (success'=min(1, node39path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path3 * min(1,node39path3) - currentNode*(min(1, node39path3) - 1))) &  (currentPath'=(3 * min(1, node39path3) - currentPath*(min(1,node39path3) - 1))) & (success'=min(1, node39path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path4 * min(1,node39path4) - currentNode*(min(1, node39path4) - 1))) &  (currentPath'=(4 * min(1, node39path4) - currentPath*(min(1,node39path4) - 1))) & (success'=min(1, node39path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path5 * min(1,node39path5) - currentNode*(min(1, node39path5) - 1))) &  (currentPath'=(5 * min(1, node39path5) - currentPath*(min(1,node39path5) - 1))) & (success'=min(1, node39path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path6 * min(1,node39path6) - currentNode*(min(1, node39path6) - 1))) &  (currentPath'=(6 * min(1, node39path6) - currentPath*(min(1,node39path6) - 1))) & (success'=min(1, node39path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path7 * min(1,node39path7) - currentNode*(min(1, node39path7) - 1))) &  (currentPath'=(7 * min(1, node39path7) - currentPath*(min(1,node39path7) - 1))) & (success'=min(1, node39path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path8 * min(1,node39path8) - currentNode*(min(1, node39path8) - 1))) &  (currentPath'=(8 * min(1, node39path8) - currentPath*(min(1,node39path8) - 1))) & (success'=min(1, node39path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path9 * min(1,node39path9) - currentNode*(min(1, node39path9) - 1))) &  (currentPath'=(9 * min(1, node39path9) - currentPath*(min(1,node39path9) - 1))) & (success'=min(1, node39path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path10 * min(1,node39path10) - currentNode*(min(1, node39path10) - 1))) &  (currentPath'=(10 * min(1, node39path10) - currentPath*(min(1,node39path10) - 1))) & (success'=min(1, node39path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path11 * min(1,node39path11) - currentNode*(min(1, node39path11) - 1))) &  (currentPath'=(11 * min(1, node39path11) - currentPath*(min(1,node39path11) - 1))) & (success'=min(1, node39path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path12 * min(1,node39path12) - currentNode*(min(1, node39path12) - 1))) &  (currentPath'=(12 * min(1, node39path12) - currentPath*(min(1,node39path12) - 1))) & (success'=min(1, node39path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path13 * min(1,node39path13) - currentNode*(min(1, node39path13) - 1))) &  (currentPath'=(13 * min(1, node39path13) - currentPath*(min(1,node39path13) - 1))) & (success'=min(1, node39path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path14 * min(1,node39path14) - currentNode*(min(1, node39path14) - 1))) &  (currentPath'=(14 * min(1, node39path14) - currentPath*(min(1,node39path14) - 1))) & (success'=min(1, node39path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path15 * min(1,node39path15) - currentNode*(min(1, node39path15) - 1))) &  (currentPath'=(15 * min(1, node39path15) - currentPath*(min(1,node39path15) - 1))) & (success'=min(1, node39path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path16 * min(1,node39path16) - currentNode*(min(1, node39path16) - 1))) &  (currentPath'=(16 * min(1, node39path16) - currentPath*(min(1,node39path16) - 1))) & (success'=min(1, node39path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path17 * min(1,node39path17) - currentNode*(min(1, node39path17) - 1))) &  (currentPath'=(17 * min(1, node39path17) - currentPath*(min(1,node39path17) - 1))) & (success'=min(1, node39path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path18 * min(1,node39path18) - currentNode*(min(1, node39path18) - 1))) &  (currentPath'=(18 * min(1, node39path18) - currentPath*(min(1,node39path18) - 1))) & (success'=min(1, node39path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path19 * min(1,node39path19) - currentNode*(min(1, node39path19) - 1))) &  (currentPath'=(19 * min(1, node39path19) - currentPath*(min(1,node39path19) - 1))) & (success'=min(1, node39path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path20 * min(1,node39path20) - currentNode*(min(1, node39path20) - 1))) &  (currentPath'=(20 * min(1, node39path20) - currentPath*(min(1,node39path20) - 1))) & (success'=min(1, node39path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path21 * min(1,node39path21) - currentNode*(min(1, node39path21) - 1))) &  (currentPath'=(21 * min(1, node39path21) - currentPath*(min(1,node39path21) - 1))) & (success'=min(1, node39path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path22 * min(1,node39path22) - currentNode*(min(1, node39path22) - 1))) &  (currentPath'=(22 * min(1, node39path22) - currentPath*(min(1,node39path22) - 1))) & (success'=min(1, node39path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path23 * min(1,node39path23) - currentNode*(min(1, node39path23) - 1))) &  (currentPath'=(23 * min(1, node39path23) - currentPath*(min(1,node39path23) - 1))) & (success'=min(1, node39path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path24 * min(1,node39path24) - currentNode*(min(1, node39path24) - 1))) &  (currentPath'=(24 * min(1, node39path24) - currentPath*(min(1,node39path24) - 1))) & (success'=min(1, node39path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path25 * min(1,node39path25) - currentNode*(min(1, node39path25) - 1))) &  (currentPath'=(25 * min(1, node39path25) - currentPath*(min(1,node39path25) - 1))) & (success'=min(1, node39path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path26 * min(1,node39path26) - currentNode*(min(1, node39path26) - 1))) &  (currentPath'=(26 * min(1, node39path26) - currentPath*(min(1,node39path26) - 1))) & (success'=min(1, node39path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path27 * min(1,node39path27) - currentNode*(min(1, node39path27) - 1))) &  (currentPath'=(27 * min(1, node39path27) - currentPath*(min(1,node39path27) - 1))) & (success'=min(1, node39path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path28 * min(1,node39path28) - currentNode*(min(1, node39path28) - 1))) &  (currentPath'=(28 * min(1, node39path28) - currentPath*(min(1,node39path28) - 1))) & (success'=min(1, node39path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path29 * min(1,node39path29) - currentNode*(min(1, node39path29) - 1))) &  (currentPath'=(29 * min(1, node39path29) - currentPath*(min(1,node39path29) - 1))) & (success'=min(1, node39path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path30 * min(1,node39path30) - currentNode*(min(1, node39path30) - 1))) &  (currentPath'=(30 * min(1, node39path30) - currentPath*(min(1,node39path30) - 1))) & (success'=min(1, node39path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path31 * min(1,node39path31) - currentNode*(min(1, node39path31) - 1))) &  (currentPath'=(31 * min(1, node39path31) - currentPath*(min(1,node39path31) - 1))) & (success'=min(1, node39path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path32 * min(1,node39path32) - currentNode*(min(1, node39path32) - 1))) &  (currentPath'=(32 * min(1, node39path32) - currentPath*(min(1,node39path32) - 1))) & (success'=min(1, node39path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path33 * min(1,node39path33) - currentNode*(min(1, node39path33) - 1))) &  (currentPath'=(33 * min(1, node39path33) - currentPath*(min(1,node39path33) - 1))) & (success'=min(1, node39path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path34 * min(1,node39path34) - currentNode*(min(1, node39path34) - 1))) &  (currentPath'=(34 * min(1, node39path34) - currentPath*(min(1,node39path34) - 1))) & (success'=min(1, node39path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path35 * min(1,node39path35) - currentNode*(min(1, node39path35) - 1))) &  (currentPath'=(35 * min(1, node39path35) - currentPath*(min(1,node39path35) - 1))) & (success'=min(1, node39path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path36 * min(1,node39path36) - currentNode*(min(1, node39path36) - 1))) &  (currentPath'=(36 * min(1, node39path36) - currentPath*(min(1,node39path36) - 1))) & (success'=min(1, node39path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path37 * min(1,node39path37) - currentNode*(min(1, node39path37) - 1))) &  (currentPath'=(37 * min(1, node39path37) - currentPath*(min(1,node39path37) - 1))) & (success'=min(1, node39path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path38 * min(1,node39path38) - currentNode*(min(1, node39path38) - 1))) &  (currentPath'=(38 * min(1, node39path38) - currentPath*(min(1,node39path38) - 1))) & (success'=min(1, node39path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path39 * min(1,node39path39) - currentNode*(min(1, node39path39) - 1))) &  (currentPath'=(39 * min(1, node39path39) - currentPath*(min(1,node39path39) - 1))) & (success'=min(1, node39path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path40 * min(1,node39path40) - currentNode*(min(1, node39path40) - 1))) &  (currentPath'=(40 * min(1, node39path40) - currentPath*(min(1,node39path40) - 1))) & (success'=min(1, node39path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path41 * min(1,node39path41) - currentNode*(min(1, node39path41) - 1))) &  (currentPath'=(41 * min(1, node39path41) - currentPath*(min(1,node39path41) - 1))) & (success'=min(1, node39path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path42 * min(1,node39path42) - currentNode*(min(1, node39path42) - 1))) &  (currentPath'=(42 * min(1, node39path42) - currentPath*(min(1,node39path42) - 1))) & (success'=min(1, node39path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path43 * min(1,node39path43) - currentNode*(min(1, node39path43) - 1))) &  (currentPath'=(43 * min(1, node39path43) - currentPath*(min(1,node39path43) - 1))) & (success'=min(1, node39path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path44 * min(1,node39path44) - currentNode*(min(1, node39path44) - 1))) &  (currentPath'=(44 * min(1, node39path44) - currentPath*(min(1,node39path44) - 1))) & (success'=min(1, node39path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path45 * min(1,node39path45) - currentNode*(min(1, node39path45) - 1))) &  (currentPath'=(45 * min(1, node39path45) - currentPath*(min(1,node39path45) - 1))) & (success'=min(1, node39path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path46 * min(1,node39path46) - currentNode*(min(1, node39path46) - 1))) &  (currentPath'=(46 * min(1, node39path46) - currentPath*(min(1,node39path46) - 1))) & (success'=min(1, node39path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path47 * min(1,node39path47) - currentNode*(min(1, node39path47) - 1))) &  (currentPath'=(47 * min(1, node39path47) - currentPath*(min(1,node39path47) - 1))) & (success'=min(1, node39path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path48 * min(1,node39path48) - currentNode*(min(1, node39path48) - 1))) &  (currentPath'=(48 * min(1, node39path48) - currentPath*(min(1,node39path48) - 1))) & (success'=min(1, node39path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path49 * min(1,node39path49) - currentNode*(min(1, node39path49) - 1))) &  (currentPath'=(49 * min(1, node39path49) - currentPath*(min(1,node39path49) - 1))) & (success'=min(1, node39path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path50 * min(1,node39path50) - currentNode*(min(1, node39path50) - 1))) &  (currentPath'=(50 * min(1, node39path50) - currentPath*(min(1,node39path50) - 1))) & (success'=min(1, node39path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path51 * min(1,node39path51) - currentNode*(min(1, node39path51) - 1))) &  (currentPath'=(51 * min(1, node39path51) - currentPath*(min(1,node39path51) - 1))) & (success'=min(1, node39path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path52 * min(1,node39path52) - currentNode*(min(1, node39path52) - 1))) &  (currentPath'=(52 * min(1, node39path52) - currentPath*(min(1,node39path52) - 1))) & (success'=min(1, node39path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path53 * min(1,node39path53) - currentNode*(min(1, node39path53) - 1))) &  (currentPath'=(53 * min(1, node39path53) - currentPath*(min(1,node39path53) - 1))) & (success'=min(1, node39path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path54 * min(1,node39path54) - currentNode*(min(1, node39path54) - 1))) &  (currentPath'=(54 * min(1, node39path54) - currentPath*(min(1,node39path54) - 1))) & (success'=min(1, node39path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path55 * min(1,node39path55) - currentNode*(min(1, node39path55) - 1))) &  (currentPath'=(55 * min(1, node39path55) - currentPath*(min(1,node39path55) - 1))) & (success'=min(1, node39path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path56 * min(1,node39path56) - currentNode*(min(1, node39path56) - 1))) &  (currentPath'=(56 * min(1, node39path56) - currentPath*(min(1,node39path56) - 1))) & (success'=min(1, node39path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path57 * min(1,node39path57) - currentNode*(min(1, node39path57) - 1))) &  (currentPath'=(57 * min(1, node39path57) - currentPath*(min(1,node39path57) - 1))) & (success'=min(1, node39path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path58 * min(1,node39path58) - currentNode*(min(1, node39path58) - 1))) &  (currentPath'=(58 * min(1, node39path58) - currentPath*(min(1,node39path58) - 1))) & (success'=min(1, node39path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path59 * min(1,node39path59) - currentNode*(min(1, node39path59) - 1))) &  (currentPath'=(59 * min(1, node39path59) - currentPath*(min(1,node39path59) - 1))) & (success'=min(1, node39path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path60 * min(1,node39path60) - currentNode*(min(1, node39path60) - 1))) &  (currentPath'=(60 * min(1, node39path60) - currentPath*(min(1,node39path60) - 1))) & (success'=min(1, node39path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path61 * min(1,node39path61) - currentNode*(min(1, node39path61) - 1))) &  (currentPath'=(61 * min(1, node39path61) - currentPath*(min(1,node39path61) - 1))) & (success'=min(1, node39path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path62 * min(1,node39path62) - currentNode*(min(1, node39path62) - 1))) &  (currentPath'=(62 * min(1, node39path62) - currentPath*(min(1,node39path62) - 1))) & (success'=min(1, node39path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path63 * min(1,node39path63) - currentNode*(min(1, node39path63) - 1))) &  (currentPath'=(63 * min(1, node39path63) - currentPath*(min(1,node39path63) - 1))) & (success'=min(1, node39path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path64 * min(1,node39path64) - currentNode*(min(1, node39path64) - 1))) &  (currentPath'=(64 * min(1, node39path64) - currentPath*(min(1,node39path64) - 1))) & (success'=min(1, node39path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path65 * min(1,node39path65) - currentNode*(min(1, node39path65) - 1))) &  (currentPath'=(65 * min(1, node39path65) - currentPath*(min(1,node39path65) - 1))) & (success'=min(1, node39path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path66 * min(1,node39path66) - currentNode*(min(1, node39path66) - 1))) &  (currentPath'=(66 * min(1, node39path66) - currentPath*(min(1,node39path66) - 1))) & (success'=min(1, node39path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path67 * min(1,node39path67) - currentNode*(min(1, node39path67) - 1))) &  (currentPath'=(67 * min(1, node39path67) - currentPath*(min(1,node39path67) - 1))) & (success'=min(1, node39path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path68 * min(1,node39path68) - currentNode*(min(1, node39path68) - 1))) &  (currentPath'=(68 * min(1, node39path68) - currentPath*(min(1,node39path68) - 1))) & (success'=min(1, node39path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path69 * min(1,node39path69) - currentNode*(min(1, node39path69) - 1))) &  (currentPath'=(69 * min(1, node39path69) - currentPath*(min(1,node39path69) - 1))) & (success'=min(1, node39path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path70 * min(1,node39path70) - currentNode*(min(1, node39path70) - 1))) &  (currentPath'=(70 * min(1, node39path70) - currentPath*(min(1,node39path70) - 1))) & (success'=min(1, node39path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path71 * min(1,node39path71) - currentNode*(min(1, node39path71) - 1))) &  (currentPath'=(71 * min(1, node39path71) - currentPath*(min(1,node39path71) - 1))) & (success'=min(1, node39path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path72 * min(1,node39path72) - currentNode*(min(1, node39path72) - 1))) &  (currentPath'=(72 * min(1, node39path72) - currentPath*(min(1,node39path72) - 1))) & (success'=min(1, node39path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path73 * min(1,node39path73) - currentNode*(min(1, node39path73) - 1))) &  (currentPath'=(73 * min(1, node39path73) - currentPath*(min(1,node39path73) - 1))) & (success'=min(1, node39path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path74 * min(1,node39path74) - currentNode*(min(1, node39path74) - 1))) &  (currentPath'=(74 * min(1, node39path74) - currentPath*(min(1,node39path74) - 1))) & (success'=min(1, node39path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path75 * min(1,node39path75) - currentNode*(min(1, node39path75) - 1))) &  (currentPath'=(75 * min(1, node39path75) - currentPath*(min(1,node39path75) - 1))) & (success'=min(1, node39path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path76 * min(1,node39path76) - currentNode*(min(1, node39path76) - 1))) &  (currentPath'=(76 * min(1, node39path76) - currentPath*(min(1,node39path76) - 1))) & (success'=min(1, node39path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path77 * min(1,node39path77) - currentNode*(min(1, node39path77) - 1))) &  (currentPath'=(77 * min(1, node39path77) - currentPath*(min(1,node39path77) - 1))) & (success'=min(1, node39path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path78 * min(1,node39path78) - currentNode*(min(1, node39path78) - 1))) &  (currentPath'=(78 * min(1, node39path78) - currentPath*(min(1,node39path78) - 1))) & (success'=min(1, node39path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path79 * min(1,node39path79) - currentNode*(min(1, node39path79) - 1))) &  (currentPath'=(79 * min(1, node39path79) - currentPath*(min(1,node39path79) - 1))) & (success'=min(1, node39path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path80 * min(1,node39path80) - currentNode*(min(1, node39path80) - 1))) &  (currentPath'=(80 * min(1, node39path80) - currentPath*(min(1,node39path80) - 1))) & (success'=min(1, node39path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path81 * min(1,node39path81) - currentNode*(min(1, node39path81) - 1))) &  (currentPath'=(81 * min(1, node39path81) - currentPath*(min(1,node39path81) - 1))) & (success'=min(1, node39path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path82 * min(1,node39path82) - currentNode*(min(1, node39path82) - 1))) &  (currentPath'=(82 * min(1, node39path82) - currentPath*(min(1,node39path82) - 1))) & (success'=min(1, node39path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path83 * min(1,node39path83) - currentNode*(min(1, node39path83) - 1))) &  (currentPath'=(83 * min(1, node39path83) - currentPath*(min(1,node39path83) - 1))) & (success'=min(1, node39path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path84 * min(1,node39path84) - currentNode*(min(1, node39path84) - 1))) &  (currentPath'=(84 * min(1, node39path84) - currentPath*(min(1,node39path84) - 1))) & (success'=min(1, node39path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path85 * min(1,node39path85) - currentNode*(min(1, node39path85) - 1))) &  (currentPath'=(85 * min(1, node39path85) - currentPath*(min(1,node39path85) - 1))) & (success'=min(1, node39path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path86 * min(1,node39path86) - currentNode*(min(1, node39path86) - 1))) &  (currentPath'=(86 * min(1, node39path86) - currentPath*(min(1,node39path86) - 1))) & (success'=min(1, node39path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path87 * min(1,node39path87) - currentNode*(min(1, node39path87) - 1))) &  (currentPath'=(87 * min(1, node39path87) - currentPath*(min(1,node39path87) - 1))) & (success'=min(1, node39path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path88 * min(1,node39path88) - currentNode*(min(1, node39path88) - 1))) &  (currentPath'=(88 * min(1, node39path88) - currentPath*(min(1,node39path88) - 1))) & (success'=min(1, node39path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path89 * min(1,node39path89) - currentNode*(min(1, node39path89) - 1))) &  (currentPath'=(89 * min(1, node39path89) - currentPath*(min(1,node39path89) - 1))) & (success'=min(1, node39path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path90 * min(1,node39path90) - currentNode*(min(1, node39path90) - 1))) &  (currentPath'=(90 * min(1, node39path90) - currentPath*(min(1,node39path90) - 1))) & (success'=min(1, node39path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path91 * min(1,node39path91) - currentNode*(min(1, node39path91) - 1))) &  (currentPath'=(91 * min(1, node39path91) - currentPath*(min(1,node39path91) - 1))) & (success'=min(1, node39path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path92 * min(1,node39path92) - currentNode*(min(1, node39path92) - 1))) &  (currentPath'=(92 * min(1, node39path92) - currentPath*(min(1,node39path92) - 1))) & (success'=min(1, node39path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path93 * min(1,node39path93) - currentNode*(min(1, node39path93) - 1))) &  (currentPath'=(93 * min(1, node39path93) - currentPath*(min(1,node39path93) - 1))) & (success'=min(1, node39path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path94 * min(1,node39path94) - currentNode*(min(1, node39path94) - 1))) &  (currentPath'=(94 * min(1, node39path94) - currentPath*(min(1,node39path94) - 1))) & (success'=min(1, node39path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path95 * min(1,node39path95) - currentNode*(min(1, node39path95) - 1))) &  (currentPath'=(95 * min(1, node39path95) - currentPath*(min(1,node39path95) - 1))) & (success'=min(1, node39path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path96 * min(1,node39path96) - currentNode*(min(1, node39path96) - 1))) &  (currentPath'=(96 * min(1, node39path96) - currentPath*(min(1,node39path96) - 1))) & (success'=min(1, node39path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path97 * min(1,node39path97) - currentNode*(min(1, node39path97) - 1))) &  (currentPath'=(97 * min(1, node39path97) - currentPath*(min(1,node39path97) - 1))) & (success'=min(1, node39path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path98 * min(1,node39path98) - currentNode*(min(1, node39path98) - 1))) &  (currentPath'=(98 * min(1, node39path98) - currentPath*(min(1,node39path98) - 1))) & (success'=min(1, node39path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path99 * min(1,node39path99) - currentNode*(min(1, node39path99) - 1))) &  (currentPath'=(99 * min(1, node39path99) - currentPath*(min(1,node39path99) - 1))) & (success'=min(1, node39path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node39path100 * min(1,node39path100) - currentNode*(min(1, node39path100) - 1))) &  (currentPath'=(100 * min(1, node39path100) - currentPath*(min(1,node39path100) - 1))) & (success'=min(1, node39path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 40) ->
 numPathsInv: (currentNode'=(node40path1 * min(1,node40path1) - currentNode*(min(1, node40path1) - 1))) &  (currentPath'=(1 * min(1, node40path1) - currentPath*(min(1,node40path1) - 1))) & (success'=min(1, node40path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path2 * min(1,node40path2) - currentNode*(min(1, node40path2) - 1))) &  (currentPath'=(2 * min(1, node40path2) - currentPath*(min(1,node40path2) - 1))) & (success'=min(1, node40path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path3 * min(1,node40path3) - currentNode*(min(1, node40path3) - 1))) &  (currentPath'=(3 * min(1, node40path3) - currentPath*(min(1,node40path3) - 1))) & (success'=min(1, node40path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path4 * min(1,node40path4) - currentNode*(min(1, node40path4) - 1))) &  (currentPath'=(4 * min(1, node40path4) - currentPath*(min(1,node40path4) - 1))) & (success'=min(1, node40path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path5 * min(1,node40path5) - currentNode*(min(1, node40path5) - 1))) &  (currentPath'=(5 * min(1, node40path5) - currentPath*(min(1,node40path5) - 1))) & (success'=min(1, node40path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path6 * min(1,node40path6) - currentNode*(min(1, node40path6) - 1))) &  (currentPath'=(6 * min(1, node40path6) - currentPath*(min(1,node40path6) - 1))) & (success'=min(1, node40path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path7 * min(1,node40path7) - currentNode*(min(1, node40path7) - 1))) &  (currentPath'=(7 * min(1, node40path7) - currentPath*(min(1,node40path7) - 1))) & (success'=min(1, node40path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path8 * min(1,node40path8) - currentNode*(min(1, node40path8) - 1))) &  (currentPath'=(8 * min(1, node40path8) - currentPath*(min(1,node40path8) - 1))) & (success'=min(1, node40path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path9 * min(1,node40path9) - currentNode*(min(1, node40path9) - 1))) &  (currentPath'=(9 * min(1, node40path9) - currentPath*(min(1,node40path9) - 1))) & (success'=min(1, node40path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path10 * min(1,node40path10) - currentNode*(min(1, node40path10) - 1))) &  (currentPath'=(10 * min(1, node40path10) - currentPath*(min(1,node40path10) - 1))) & (success'=min(1, node40path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path11 * min(1,node40path11) - currentNode*(min(1, node40path11) - 1))) &  (currentPath'=(11 * min(1, node40path11) - currentPath*(min(1,node40path11) - 1))) & (success'=min(1, node40path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path12 * min(1,node40path12) - currentNode*(min(1, node40path12) - 1))) &  (currentPath'=(12 * min(1, node40path12) - currentPath*(min(1,node40path12) - 1))) & (success'=min(1, node40path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path13 * min(1,node40path13) - currentNode*(min(1, node40path13) - 1))) &  (currentPath'=(13 * min(1, node40path13) - currentPath*(min(1,node40path13) - 1))) & (success'=min(1, node40path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path14 * min(1,node40path14) - currentNode*(min(1, node40path14) - 1))) &  (currentPath'=(14 * min(1, node40path14) - currentPath*(min(1,node40path14) - 1))) & (success'=min(1, node40path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path15 * min(1,node40path15) - currentNode*(min(1, node40path15) - 1))) &  (currentPath'=(15 * min(1, node40path15) - currentPath*(min(1,node40path15) - 1))) & (success'=min(1, node40path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path16 * min(1,node40path16) - currentNode*(min(1, node40path16) - 1))) &  (currentPath'=(16 * min(1, node40path16) - currentPath*(min(1,node40path16) - 1))) & (success'=min(1, node40path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path17 * min(1,node40path17) - currentNode*(min(1, node40path17) - 1))) &  (currentPath'=(17 * min(1, node40path17) - currentPath*(min(1,node40path17) - 1))) & (success'=min(1, node40path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path18 * min(1,node40path18) - currentNode*(min(1, node40path18) - 1))) &  (currentPath'=(18 * min(1, node40path18) - currentPath*(min(1,node40path18) - 1))) & (success'=min(1, node40path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path19 * min(1,node40path19) - currentNode*(min(1, node40path19) - 1))) &  (currentPath'=(19 * min(1, node40path19) - currentPath*(min(1,node40path19) - 1))) & (success'=min(1, node40path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path20 * min(1,node40path20) - currentNode*(min(1, node40path20) - 1))) &  (currentPath'=(20 * min(1, node40path20) - currentPath*(min(1,node40path20) - 1))) & (success'=min(1, node40path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path21 * min(1,node40path21) - currentNode*(min(1, node40path21) - 1))) &  (currentPath'=(21 * min(1, node40path21) - currentPath*(min(1,node40path21) - 1))) & (success'=min(1, node40path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path22 * min(1,node40path22) - currentNode*(min(1, node40path22) - 1))) &  (currentPath'=(22 * min(1, node40path22) - currentPath*(min(1,node40path22) - 1))) & (success'=min(1, node40path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path23 * min(1,node40path23) - currentNode*(min(1, node40path23) - 1))) &  (currentPath'=(23 * min(1, node40path23) - currentPath*(min(1,node40path23) - 1))) & (success'=min(1, node40path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path24 * min(1,node40path24) - currentNode*(min(1, node40path24) - 1))) &  (currentPath'=(24 * min(1, node40path24) - currentPath*(min(1,node40path24) - 1))) & (success'=min(1, node40path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path25 * min(1,node40path25) - currentNode*(min(1, node40path25) - 1))) &  (currentPath'=(25 * min(1, node40path25) - currentPath*(min(1,node40path25) - 1))) & (success'=min(1, node40path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path26 * min(1,node40path26) - currentNode*(min(1, node40path26) - 1))) &  (currentPath'=(26 * min(1, node40path26) - currentPath*(min(1,node40path26) - 1))) & (success'=min(1, node40path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path27 * min(1,node40path27) - currentNode*(min(1, node40path27) - 1))) &  (currentPath'=(27 * min(1, node40path27) - currentPath*(min(1,node40path27) - 1))) & (success'=min(1, node40path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path28 * min(1,node40path28) - currentNode*(min(1, node40path28) - 1))) &  (currentPath'=(28 * min(1, node40path28) - currentPath*(min(1,node40path28) - 1))) & (success'=min(1, node40path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path29 * min(1,node40path29) - currentNode*(min(1, node40path29) - 1))) &  (currentPath'=(29 * min(1, node40path29) - currentPath*(min(1,node40path29) - 1))) & (success'=min(1, node40path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path30 * min(1,node40path30) - currentNode*(min(1, node40path30) - 1))) &  (currentPath'=(30 * min(1, node40path30) - currentPath*(min(1,node40path30) - 1))) & (success'=min(1, node40path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path31 * min(1,node40path31) - currentNode*(min(1, node40path31) - 1))) &  (currentPath'=(31 * min(1, node40path31) - currentPath*(min(1,node40path31) - 1))) & (success'=min(1, node40path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path32 * min(1,node40path32) - currentNode*(min(1, node40path32) - 1))) &  (currentPath'=(32 * min(1, node40path32) - currentPath*(min(1,node40path32) - 1))) & (success'=min(1, node40path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path33 * min(1,node40path33) - currentNode*(min(1, node40path33) - 1))) &  (currentPath'=(33 * min(1, node40path33) - currentPath*(min(1,node40path33) - 1))) & (success'=min(1, node40path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path34 * min(1,node40path34) - currentNode*(min(1, node40path34) - 1))) &  (currentPath'=(34 * min(1, node40path34) - currentPath*(min(1,node40path34) - 1))) & (success'=min(1, node40path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path35 * min(1,node40path35) - currentNode*(min(1, node40path35) - 1))) &  (currentPath'=(35 * min(1, node40path35) - currentPath*(min(1,node40path35) - 1))) & (success'=min(1, node40path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path36 * min(1,node40path36) - currentNode*(min(1, node40path36) - 1))) &  (currentPath'=(36 * min(1, node40path36) - currentPath*(min(1,node40path36) - 1))) & (success'=min(1, node40path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path37 * min(1,node40path37) - currentNode*(min(1, node40path37) - 1))) &  (currentPath'=(37 * min(1, node40path37) - currentPath*(min(1,node40path37) - 1))) & (success'=min(1, node40path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path38 * min(1,node40path38) - currentNode*(min(1, node40path38) - 1))) &  (currentPath'=(38 * min(1, node40path38) - currentPath*(min(1,node40path38) - 1))) & (success'=min(1, node40path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path39 * min(1,node40path39) - currentNode*(min(1, node40path39) - 1))) &  (currentPath'=(39 * min(1, node40path39) - currentPath*(min(1,node40path39) - 1))) & (success'=min(1, node40path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path40 * min(1,node40path40) - currentNode*(min(1, node40path40) - 1))) &  (currentPath'=(40 * min(1, node40path40) - currentPath*(min(1,node40path40) - 1))) & (success'=min(1, node40path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path41 * min(1,node40path41) - currentNode*(min(1, node40path41) - 1))) &  (currentPath'=(41 * min(1, node40path41) - currentPath*(min(1,node40path41) - 1))) & (success'=min(1, node40path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path42 * min(1,node40path42) - currentNode*(min(1, node40path42) - 1))) &  (currentPath'=(42 * min(1, node40path42) - currentPath*(min(1,node40path42) - 1))) & (success'=min(1, node40path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path43 * min(1,node40path43) - currentNode*(min(1, node40path43) - 1))) &  (currentPath'=(43 * min(1, node40path43) - currentPath*(min(1,node40path43) - 1))) & (success'=min(1, node40path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path44 * min(1,node40path44) - currentNode*(min(1, node40path44) - 1))) &  (currentPath'=(44 * min(1, node40path44) - currentPath*(min(1,node40path44) - 1))) & (success'=min(1, node40path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path45 * min(1,node40path45) - currentNode*(min(1, node40path45) - 1))) &  (currentPath'=(45 * min(1, node40path45) - currentPath*(min(1,node40path45) - 1))) & (success'=min(1, node40path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path46 * min(1,node40path46) - currentNode*(min(1, node40path46) - 1))) &  (currentPath'=(46 * min(1, node40path46) - currentPath*(min(1,node40path46) - 1))) & (success'=min(1, node40path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path47 * min(1,node40path47) - currentNode*(min(1, node40path47) - 1))) &  (currentPath'=(47 * min(1, node40path47) - currentPath*(min(1,node40path47) - 1))) & (success'=min(1, node40path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path48 * min(1,node40path48) - currentNode*(min(1, node40path48) - 1))) &  (currentPath'=(48 * min(1, node40path48) - currentPath*(min(1,node40path48) - 1))) & (success'=min(1, node40path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path49 * min(1,node40path49) - currentNode*(min(1, node40path49) - 1))) &  (currentPath'=(49 * min(1, node40path49) - currentPath*(min(1,node40path49) - 1))) & (success'=min(1, node40path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path50 * min(1,node40path50) - currentNode*(min(1, node40path50) - 1))) &  (currentPath'=(50 * min(1, node40path50) - currentPath*(min(1,node40path50) - 1))) & (success'=min(1, node40path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path51 * min(1,node40path51) - currentNode*(min(1, node40path51) - 1))) &  (currentPath'=(51 * min(1, node40path51) - currentPath*(min(1,node40path51) - 1))) & (success'=min(1, node40path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path52 * min(1,node40path52) - currentNode*(min(1, node40path52) - 1))) &  (currentPath'=(52 * min(1, node40path52) - currentPath*(min(1,node40path52) - 1))) & (success'=min(1, node40path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path53 * min(1,node40path53) - currentNode*(min(1, node40path53) - 1))) &  (currentPath'=(53 * min(1, node40path53) - currentPath*(min(1,node40path53) - 1))) & (success'=min(1, node40path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path54 * min(1,node40path54) - currentNode*(min(1, node40path54) - 1))) &  (currentPath'=(54 * min(1, node40path54) - currentPath*(min(1,node40path54) - 1))) & (success'=min(1, node40path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path55 * min(1,node40path55) - currentNode*(min(1, node40path55) - 1))) &  (currentPath'=(55 * min(1, node40path55) - currentPath*(min(1,node40path55) - 1))) & (success'=min(1, node40path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path56 * min(1,node40path56) - currentNode*(min(1, node40path56) - 1))) &  (currentPath'=(56 * min(1, node40path56) - currentPath*(min(1,node40path56) - 1))) & (success'=min(1, node40path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path57 * min(1,node40path57) - currentNode*(min(1, node40path57) - 1))) &  (currentPath'=(57 * min(1, node40path57) - currentPath*(min(1,node40path57) - 1))) & (success'=min(1, node40path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path58 * min(1,node40path58) - currentNode*(min(1, node40path58) - 1))) &  (currentPath'=(58 * min(1, node40path58) - currentPath*(min(1,node40path58) - 1))) & (success'=min(1, node40path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path59 * min(1,node40path59) - currentNode*(min(1, node40path59) - 1))) &  (currentPath'=(59 * min(1, node40path59) - currentPath*(min(1,node40path59) - 1))) & (success'=min(1, node40path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path60 * min(1,node40path60) - currentNode*(min(1, node40path60) - 1))) &  (currentPath'=(60 * min(1, node40path60) - currentPath*(min(1,node40path60) - 1))) & (success'=min(1, node40path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path61 * min(1,node40path61) - currentNode*(min(1, node40path61) - 1))) &  (currentPath'=(61 * min(1, node40path61) - currentPath*(min(1,node40path61) - 1))) & (success'=min(1, node40path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path62 * min(1,node40path62) - currentNode*(min(1, node40path62) - 1))) &  (currentPath'=(62 * min(1, node40path62) - currentPath*(min(1,node40path62) - 1))) & (success'=min(1, node40path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path63 * min(1,node40path63) - currentNode*(min(1, node40path63) - 1))) &  (currentPath'=(63 * min(1, node40path63) - currentPath*(min(1,node40path63) - 1))) & (success'=min(1, node40path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path64 * min(1,node40path64) - currentNode*(min(1, node40path64) - 1))) &  (currentPath'=(64 * min(1, node40path64) - currentPath*(min(1,node40path64) - 1))) & (success'=min(1, node40path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path65 * min(1,node40path65) - currentNode*(min(1, node40path65) - 1))) &  (currentPath'=(65 * min(1, node40path65) - currentPath*(min(1,node40path65) - 1))) & (success'=min(1, node40path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path66 * min(1,node40path66) - currentNode*(min(1, node40path66) - 1))) &  (currentPath'=(66 * min(1, node40path66) - currentPath*(min(1,node40path66) - 1))) & (success'=min(1, node40path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path67 * min(1,node40path67) - currentNode*(min(1, node40path67) - 1))) &  (currentPath'=(67 * min(1, node40path67) - currentPath*(min(1,node40path67) - 1))) & (success'=min(1, node40path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path68 * min(1,node40path68) - currentNode*(min(1, node40path68) - 1))) &  (currentPath'=(68 * min(1, node40path68) - currentPath*(min(1,node40path68) - 1))) & (success'=min(1, node40path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path69 * min(1,node40path69) - currentNode*(min(1, node40path69) - 1))) &  (currentPath'=(69 * min(1, node40path69) - currentPath*(min(1,node40path69) - 1))) & (success'=min(1, node40path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path70 * min(1,node40path70) - currentNode*(min(1, node40path70) - 1))) &  (currentPath'=(70 * min(1, node40path70) - currentPath*(min(1,node40path70) - 1))) & (success'=min(1, node40path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path71 * min(1,node40path71) - currentNode*(min(1, node40path71) - 1))) &  (currentPath'=(71 * min(1, node40path71) - currentPath*(min(1,node40path71) - 1))) & (success'=min(1, node40path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path72 * min(1,node40path72) - currentNode*(min(1, node40path72) - 1))) &  (currentPath'=(72 * min(1, node40path72) - currentPath*(min(1,node40path72) - 1))) & (success'=min(1, node40path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path73 * min(1,node40path73) - currentNode*(min(1, node40path73) - 1))) &  (currentPath'=(73 * min(1, node40path73) - currentPath*(min(1,node40path73) - 1))) & (success'=min(1, node40path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path74 * min(1,node40path74) - currentNode*(min(1, node40path74) - 1))) &  (currentPath'=(74 * min(1, node40path74) - currentPath*(min(1,node40path74) - 1))) & (success'=min(1, node40path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path75 * min(1,node40path75) - currentNode*(min(1, node40path75) - 1))) &  (currentPath'=(75 * min(1, node40path75) - currentPath*(min(1,node40path75) - 1))) & (success'=min(1, node40path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path76 * min(1,node40path76) - currentNode*(min(1, node40path76) - 1))) &  (currentPath'=(76 * min(1, node40path76) - currentPath*(min(1,node40path76) - 1))) & (success'=min(1, node40path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path77 * min(1,node40path77) - currentNode*(min(1, node40path77) - 1))) &  (currentPath'=(77 * min(1, node40path77) - currentPath*(min(1,node40path77) - 1))) & (success'=min(1, node40path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path78 * min(1,node40path78) - currentNode*(min(1, node40path78) - 1))) &  (currentPath'=(78 * min(1, node40path78) - currentPath*(min(1,node40path78) - 1))) & (success'=min(1, node40path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path79 * min(1,node40path79) - currentNode*(min(1, node40path79) - 1))) &  (currentPath'=(79 * min(1, node40path79) - currentPath*(min(1,node40path79) - 1))) & (success'=min(1, node40path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path80 * min(1,node40path80) - currentNode*(min(1, node40path80) - 1))) &  (currentPath'=(80 * min(1, node40path80) - currentPath*(min(1,node40path80) - 1))) & (success'=min(1, node40path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path81 * min(1,node40path81) - currentNode*(min(1, node40path81) - 1))) &  (currentPath'=(81 * min(1, node40path81) - currentPath*(min(1,node40path81) - 1))) & (success'=min(1, node40path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path82 * min(1,node40path82) - currentNode*(min(1, node40path82) - 1))) &  (currentPath'=(82 * min(1, node40path82) - currentPath*(min(1,node40path82) - 1))) & (success'=min(1, node40path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path83 * min(1,node40path83) - currentNode*(min(1, node40path83) - 1))) &  (currentPath'=(83 * min(1, node40path83) - currentPath*(min(1,node40path83) - 1))) & (success'=min(1, node40path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path84 * min(1,node40path84) - currentNode*(min(1, node40path84) - 1))) &  (currentPath'=(84 * min(1, node40path84) - currentPath*(min(1,node40path84) - 1))) & (success'=min(1, node40path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path85 * min(1,node40path85) - currentNode*(min(1, node40path85) - 1))) &  (currentPath'=(85 * min(1, node40path85) - currentPath*(min(1,node40path85) - 1))) & (success'=min(1, node40path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path86 * min(1,node40path86) - currentNode*(min(1, node40path86) - 1))) &  (currentPath'=(86 * min(1, node40path86) - currentPath*(min(1,node40path86) - 1))) & (success'=min(1, node40path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path87 * min(1,node40path87) - currentNode*(min(1, node40path87) - 1))) &  (currentPath'=(87 * min(1, node40path87) - currentPath*(min(1,node40path87) - 1))) & (success'=min(1, node40path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path88 * min(1,node40path88) - currentNode*(min(1, node40path88) - 1))) &  (currentPath'=(88 * min(1, node40path88) - currentPath*(min(1,node40path88) - 1))) & (success'=min(1, node40path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path89 * min(1,node40path89) - currentNode*(min(1, node40path89) - 1))) &  (currentPath'=(89 * min(1, node40path89) - currentPath*(min(1,node40path89) - 1))) & (success'=min(1, node40path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path90 * min(1,node40path90) - currentNode*(min(1, node40path90) - 1))) &  (currentPath'=(90 * min(1, node40path90) - currentPath*(min(1,node40path90) - 1))) & (success'=min(1, node40path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path91 * min(1,node40path91) - currentNode*(min(1, node40path91) - 1))) &  (currentPath'=(91 * min(1, node40path91) - currentPath*(min(1,node40path91) - 1))) & (success'=min(1, node40path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path92 * min(1,node40path92) - currentNode*(min(1, node40path92) - 1))) &  (currentPath'=(92 * min(1, node40path92) - currentPath*(min(1,node40path92) - 1))) & (success'=min(1, node40path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path93 * min(1,node40path93) - currentNode*(min(1, node40path93) - 1))) &  (currentPath'=(93 * min(1, node40path93) - currentPath*(min(1,node40path93) - 1))) & (success'=min(1, node40path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path94 * min(1,node40path94) - currentNode*(min(1, node40path94) - 1))) &  (currentPath'=(94 * min(1, node40path94) - currentPath*(min(1,node40path94) - 1))) & (success'=min(1, node40path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path95 * min(1,node40path95) - currentNode*(min(1, node40path95) - 1))) &  (currentPath'=(95 * min(1, node40path95) - currentPath*(min(1,node40path95) - 1))) & (success'=min(1, node40path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path96 * min(1,node40path96) - currentNode*(min(1, node40path96) - 1))) &  (currentPath'=(96 * min(1, node40path96) - currentPath*(min(1,node40path96) - 1))) & (success'=min(1, node40path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path97 * min(1,node40path97) - currentNode*(min(1, node40path97) - 1))) &  (currentPath'=(97 * min(1, node40path97) - currentPath*(min(1,node40path97) - 1))) & (success'=min(1, node40path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path98 * min(1,node40path98) - currentNode*(min(1, node40path98) - 1))) &  (currentPath'=(98 * min(1, node40path98) - currentPath*(min(1,node40path98) - 1))) & (success'=min(1, node40path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path99 * min(1,node40path99) - currentNode*(min(1, node40path99) - 1))) &  (currentPath'=(99 * min(1, node40path99) - currentPath*(min(1,node40path99) - 1))) & (success'=min(1, node40path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node40path100 * min(1,node40path100) - currentNode*(min(1, node40path100) - 1))) &  (currentPath'=(100 * min(1, node40path100) - currentPath*(min(1,node40path100) - 1))) & (success'=min(1, node40path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 41) ->
 numPathsInv: (currentNode'=(node41path1 * min(1,node41path1) - currentNode*(min(1, node41path1) - 1))) &  (currentPath'=(1 * min(1, node41path1) - currentPath*(min(1,node41path1) - 1))) & (success'=min(1, node41path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path2 * min(1,node41path2) - currentNode*(min(1, node41path2) - 1))) &  (currentPath'=(2 * min(1, node41path2) - currentPath*(min(1,node41path2) - 1))) & (success'=min(1, node41path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path3 * min(1,node41path3) - currentNode*(min(1, node41path3) - 1))) &  (currentPath'=(3 * min(1, node41path3) - currentPath*(min(1,node41path3) - 1))) & (success'=min(1, node41path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path4 * min(1,node41path4) - currentNode*(min(1, node41path4) - 1))) &  (currentPath'=(4 * min(1, node41path4) - currentPath*(min(1,node41path4) - 1))) & (success'=min(1, node41path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path5 * min(1,node41path5) - currentNode*(min(1, node41path5) - 1))) &  (currentPath'=(5 * min(1, node41path5) - currentPath*(min(1,node41path5) - 1))) & (success'=min(1, node41path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path6 * min(1,node41path6) - currentNode*(min(1, node41path6) - 1))) &  (currentPath'=(6 * min(1, node41path6) - currentPath*(min(1,node41path6) - 1))) & (success'=min(1, node41path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path7 * min(1,node41path7) - currentNode*(min(1, node41path7) - 1))) &  (currentPath'=(7 * min(1, node41path7) - currentPath*(min(1,node41path7) - 1))) & (success'=min(1, node41path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path8 * min(1,node41path8) - currentNode*(min(1, node41path8) - 1))) &  (currentPath'=(8 * min(1, node41path8) - currentPath*(min(1,node41path8) - 1))) & (success'=min(1, node41path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path9 * min(1,node41path9) - currentNode*(min(1, node41path9) - 1))) &  (currentPath'=(9 * min(1, node41path9) - currentPath*(min(1,node41path9) - 1))) & (success'=min(1, node41path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path10 * min(1,node41path10) - currentNode*(min(1, node41path10) - 1))) &  (currentPath'=(10 * min(1, node41path10) - currentPath*(min(1,node41path10) - 1))) & (success'=min(1, node41path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path11 * min(1,node41path11) - currentNode*(min(1, node41path11) - 1))) &  (currentPath'=(11 * min(1, node41path11) - currentPath*(min(1,node41path11) - 1))) & (success'=min(1, node41path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path12 * min(1,node41path12) - currentNode*(min(1, node41path12) - 1))) &  (currentPath'=(12 * min(1, node41path12) - currentPath*(min(1,node41path12) - 1))) & (success'=min(1, node41path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path13 * min(1,node41path13) - currentNode*(min(1, node41path13) - 1))) &  (currentPath'=(13 * min(1, node41path13) - currentPath*(min(1,node41path13) - 1))) & (success'=min(1, node41path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path14 * min(1,node41path14) - currentNode*(min(1, node41path14) - 1))) &  (currentPath'=(14 * min(1, node41path14) - currentPath*(min(1,node41path14) - 1))) & (success'=min(1, node41path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path15 * min(1,node41path15) - currentNode*(min(1, node41path15) - 1))) &  (currentPath'=(15 * min(1, node41path15) - currentPath*(min(1,node41path15) - 1))) & (success'=min(1, node41path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path16 * min(1,node41path16) - currentNode*(min(1, node41path16) - 1))) &  (currentPath'=(16 * min(1, node41path16) - currentPath*(min(1,node41path16) - 1))) & (success'=min(1, node41path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path17 * min(1,node41path17) - currentNode*(min(1, node41path17) - 1))) &  (currentPath'=(17 * min(1, node41path17) - currentPath*(min(1,node41path17) - 1))) & (success'=min(1, node41path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path18 * min(1,node41path18) - currentNode*(min(1, node41path18) - 1))) &  (currentPath'=(18 * min(1, node41path18) - currentPath*(min(1,node41path18) - 1))) & (success'=min(1, node41path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path19 * min(1,node41path19) - currentNode*(min(1, node41path19) - 1))) &  (currentPath'=(19 * min(1, node41path19) - currentPath*(min(1,node41path19) - 1))) & (success'=min(1, node41path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path20 * min(1,node41path20) - currentNode*(min(1, node41path20) - 1))) &  (currentPath'=(20 * min(1, node41path20) - currentPath*(min(1,node41path20) - 1))) & (success'=min(1, node41path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path21 * min(1,node41path21) - currentNode*(min(1, node41path21) - 1))) &  (currentPath'=(21 * min(1, node41path21) - currentPath*(min(1,node41path21) - 1))) & (success'=min(1, node41path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path22 * min(1,node41path22) - currentNode*(min(1, node41path22) - 1))) &  (currentPath'=(22 * min(1, node41path22) - currentPath*(min(1,node41path22) - 1))) & (success'=min(1, node41path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path23 * min(1,node41path23) - currentNode*(min(1, node41path23) - 1))) &  (currentPath'=(23 * min(1, node41path23) - currentPath*(min(1,node41path23) - 1))) & (success'=min(1, node41path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path24 * min(1,node41path24) - currentNode*(min(1, node41path24) - 1))) &  (currentPath'=(24 * min(1, node41path24) - currentPath*(min(1,node41path24) - 1))) & (success'=min(1, node41path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path25 * min(1,node41path25) - currentNode*(min(1, node41path25) - 1))) &  (currentPath'=(25 * min(1, node41path25) - currentPath*(min(1,node41path25) - 1))) & (success'=min(1, node41path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path26 * min(1,node41path26) - currentNode*(min(1, node41path26) - 1))) &  (currentPath'=(26 * min(1, node41path26) - currentPath*(min(1,node41path26) - 1))) & (success'=min(1, node41path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path27 * min(1,node41path27) - currentNode*(min(1, node41path27) - 1))) &  (currentPath'=(27 * min(1, node41path27) - currentPath*(min(1,node41path27) - 1))) & (success'=min(1, node41path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path28 * min(1,node41path28) - currentNode*(min(1, node41path28) - 1))) &  (currentPath'=(28 * min(1, node41path28) - currentPath*(min(1,node41path28) - 1))) & (success'=min(1, node41path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path29 * min(1,node41path29) - currentNode*(min(1, node41path29) - 1))) &  (currentPath'=(29 * min(1, node41path29) - currentPath*(min(1,node41path29) - 1))) & (success'=min(1, node41path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path30 * min(1,node41path30) - currentNode*(min(1, node41path30) - 1))) &  (currentPath'=(30 * min(1, node41path30) - currentPath*(min(1,node41path30) - 1))) & (success'=min(1, node41path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path31 * min(1,node41path31) - currentNode*(min(1, node41path31) - 1))) &  (currentPath'=(31 * min(1, node41path31) - currentPath*(min(1,node41path31) - 1))) & (success'=min(1, node41path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path32 * min(1,node41path32) - currentNode*(min(1, node41path32) - 1))) &  (currentPath'=(32 * min(1, node41path32) - currentPath*(min(1,node41path32) - 1))) & (success'=min(1, node41path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path33 * min(1,node41path33) - currentNode*(min(1, node41path33) - 1))) &  (currentPath'=(33 * min(1, node41path33) - currentPath*(min(1,node41path33) - 1))) & (success'=min(1, node41path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path34 * min(1,node41path34) - currentNode*(min(1, node41path34) - 1))) &  (currentPath'=(34 * min(1, node41path34) - currentPath*(min(1,node41path34) - 1))) & (success'=min(1, node41path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path35 * min(1,node41path35) - currentNode*(min(1, node41path35) - 1))) &  (currentPath'=(35 * min(1, node41path35) - currentPath*(min(1,node41path35) - 1))) & (success'=min(1, node41path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path36 * min(1,node41path36) - currentNode*(min(1, node41path36) - 1))) &  (currentPath'=(36 * min(1, node41path36) - currentPath*(min(1,node41path36) - 1))) & (success'=min(1, node41path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path37 * min(1,node41path37) - currentNode*(min(1, node41path37) - 1))) &  (currentPath'=(37 * min(1, node41path37) - currentPath*(min(1,node41path37) - 1))) & (success'=min(1, node41path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path38 * min(1,node41path38) - currentNode*(min(1, node41path38) - 1))) &  (currentPath'=(38 * min(1, node41path38) - currentPath*(min(1,node41path38) - 1))) & (success'=min(1, node41path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path39 * min(1,node41path39) - currentNode*(min(1, node41path39) - 1))) &  (currentPath'=(39 * min(1, node41path39) - currentPath*(min(1,node41path39) - 1))) & (success'=min(1, node41path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path40 * min(1,node41path40) - currentNode*(min(1, node41path40) - 1))) &  (currentPath'=(40 * min(1, node41path40) - currentPath*(min(1,node41path40) - 1))) & (success'=min(1, node41path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path41 * min(1,node41path41) - currentNode*(min(1, node41path41) - 1))) &  (currentPath'=(41 * min(1, node41path41) - currentPath*(min(1,node41path41) - 1))) & (success'=min(1, node41path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path42 * min(1,node41path42) - currentNode*(min(1, node41path42) - 1))) &  (currentPath'=(42 * min(1, node41path42) - currentPath*(min(1,node41path42) - 1))) & (success'=min(1, node41path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path43 * min(1,node41path43) - currentNode*(min(1, node41path43) - 1))) &  (currentPath'=(43 * min(1, node41path43) - currentPath*(min(1,node41path43) - 1))) & (success'=min(1, node41path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path44 * min(1,node41path44) - currentNode*(min(1, node41path44) - 1))) &  (currentPath'=(44 * min(1, node41path44) - currentPath*(min(1,node41path44) - 1))) & (success'=min(1, node41path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path45 * min(1,node41path45) - currentNode*(min(1, node41path45) - 1))) &  (currentPath'=(45 * min(1, node41path45) - currentPath*(min(1,node41path45) - 1))) & (success'=min(1, node41path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path46 * min(1,node41path46) - currentNode*(min(1, node41path46) - 1))) &  (currentPath'=(46 * min(1, node41path46) - currentPath*(min(1,node41path46) - 1))) & (success'=min(1, node41path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path47 * min(1,node41path47) - currentNode*(min(1, node41path47) - 1))) &  (currentPath'=(47 * min(1, node41path47) - currentPath*(min(1,node41path47) - 1))) & (success'=min(1, node41path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path48 * min(1,node41path48) - currentNode*(min(1, node41path48) - 1))) &  (currentPath'=(48 * min(1, node41path48) - currentPath*(min(1,node41path48) - 1))) & (success'=min(1, node41path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path49 * min(1,node41path49) - currentNode*(min(1, node41path49) - 1))) &  (currentPath'=(49 * min(1, node41path49) - currentPath*(min(1,node41path49) - 1))) & (success'=min(1, node41path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path50 * min(1,node41path50) - currentNode*(min(1, node41path50) - 1))) &  (currentPath'=(50 * min(1, node41path50) - currentPath*(min(1,node41path50) - 1))) & (success'=min(1, node41path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path51 * min(1,node41path51) - currentNode*(min(1, node41path51) - 1))) &  (currentPath'=(51 * min(1, node41path51) - currentPath*(min(1,node41path51) - 1))) & (success'=min(1, node41path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path52 * min(1,node41path52) - currentNode*(min(1, node41path52) - 1))) &  (currentPath'=(52 * min(1, node41path52) - currentPath*(min(1,node41path52) - 1))) & (success'=min(1, node41path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path53 * min(1,node41path53) - currentNode*(min(1, node41path53) - 1))) &  (currentPath'=(53 * min(1, node41path53) - currentPath*(min(1,node41path53) - 1))) & (success'=min(1, node41path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path54 * min(1,node41path54) - currentNode*(min(1, node41path54) - 1))) &  (currentPath'=(54 * min(1, node41path54) - currentPath*(min(1,node41path54) - 1))) & (success'=min(1, node41path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path55 * min(1,node41path55) - currentNode*(min(1, node41path55) - 1))) &  (currentPath'=(55 * min(1, node41path55) - currentPath*(min(1,node41path55) - 1))) & (success'=min(1, node41path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path56 * min(1,node41path56) - currentNode*(min(1, node41path56) - 1))) &  (currentPath'=(56 * min(1, node41path56) - currentPath*(min(1,node41path56) - 1))) & (success'=min(1, node41path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path57 * min(1,node41path57) - currentNode*(min(1, node41path57) - 1))) &  (currentPath'=(57 * min(1, node41path57) - currentPath*(min(1,node41path57) - 1))) & (success'=min(1, node41path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path58 * min(1,node41path58) - currentNode*(min(1, node41path58) - 1))) &  (currentPath'=(58 * min(1, node41path58) - currentPath*(min(1,node41path58) - 1))) & (success'=min(1, node41path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path59 * min(1,node41path59) - currentNode*(min(1, node41path59) - 1))) &  (currentPath'=(59 * min(1, node41path59) - currentPath*(min(1,node41path59) - 1))) & (success'=min(1, node41path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path60 * min(1,node41path60) - currentNode*(min(1, node41path60) - 1))) &  (currentPath'=(60 * min(1, node41path60) - currentPath*(min(1,node41path60) - 1))) & (success'=min(1, node41path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path61 * min(1,node41path61) - currentNode*(min(1, node41path61) - 1))) &  (currentPath'=(61 * min(1, node41path61) - currentPath*(min(1,node41path61) - 1))) & (success'=min(1, node41path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path62 * min(1,node41path62) - currentNode*(min(1, node41path62) - 1))) &  (currentPath'=(62 * min(1, node41path62) - currentPath*(min(1,node41path62) - 1))) & (success'=min(1, node41path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path63 * min(1,node41path63) - currentNode*(min(1, node41path63) - 1))) &  (currentPath'=(63 * min(1, node41path63) - currentPath*(min(1,node41path63) - 1))) & (success'=min(1, node41path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path64 * min(1,node41path64) - currentNode*(min(1, node41path64) - 1))) &  (currentPath'=(64 * min(1, node41path64) - currentPath*(min(1,node41path64) - 1))) & (success'=min(1, node41path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path65 * min(1,node41path65) - currentNode*(min(1, node41path65) - 1))) &  (currentPath'=(65 * min(1, node41path65) - currentPath*(min(1,node41path65) - 1))) & (success'=min(1, node41path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path66 * min(1,node41path66) - currentNode*(min(1, node41path66) - 1))) &  (currentPath'=(66 * min(1, node41path66) - currentPath*(min(1,node41path66) - 1))) & (success'=min(1, node41path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path67 * min(1,node41path67) - currentNode*(min(1, node41path67) - 1))) &  (currentPath'=(67 * min(1, node41path67) - currentPath*(min(1,node41path67) - 1))) & (success'=min(1, node41path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path68 * min(1,node41path68) - currentNode*(min(1, node41path68) - 1))) &  (currentPath'=(68 * min(1, node41path68) - currentPath*(min(1,node41path68) - 1))) & (success'=min(1, node41path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path69 * min(1,node41path69) - currentNode*(min(1, node41path69) - 1))) &  (currentPath'=(69 * min(1, node41path69) - currentPath*(min(1,node41path69) - 1))) & (success'=min(1, node41path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path70 * min(1,node41path70) - currentNode*(min(1, node41path70) - 1))) &  (currentPath'=(70 * min(1, node41path70) - currentPath*(min(1,node41path70) - 1))) & (success'=min(1, node41path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path71 * min(1,node41path71) - currentNode*(min(1, node41path71) - 1))) &  (currentPath'=(71 * min(1, node41path71) - currentPath*(min(1,node41path71) - 1))) & (success'=min(1, node41path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path72 * min(1,node41path72) - currentNode*(min(1, node41path72) - 1))) &  (currentPath'=(72 * min(1, node41path72) - currentPath*(min(1,node41path72) - 1))) & (success'=min(1, node41path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path73 * min(1,node41path73) - currentNode*(min(1, node41path73) - 1))) &  (currentPath'=(73 * min(1, node41path73) - currentPath*(min(1,node41path73) - 1))) & (success'=min(1, node41path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path74 * min(1,node41path74) - currentNode*(min(1, node41path74) - 1))) &  (currentPath'=(74 * min(1, node41path74) - currentPath*(min(1,node41path74) - 1))) & (success'=min(1, node41path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path75 * min(1,node41path75) - currentNode*(min(1, node41path75) - 1))) &  (currentPath'=(75 * min(1, node41path75) - currentPath*(min(1,node41path75) - 1))) & (success'=min(1, node41path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path76 * min(1,node41path76) - currentNode*(min(1, node41path76) - 1))) &  (currentPath'=(76 * min(1, node41path76) - currentPath*(min(1,node41path76) - 1))) & (success'=min(1, node41path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path77 * min(1,node41path77) - currentNode*(min(1, node41path77) - 1))) &  (currentPath'=(77 * min(1, node41path77) - currentPath*(min(1,node41path77) - 1))) & (success'=min(1, node41path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path78 * min(1,node41path78) - currentNode*(min(1, node41path78) - 1))) &  (currentPath'=(78 * min(1, node41path78) - currentPath*(min(1,node41path78) - 1))) & (success'=min(1, node41path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path79 * min(1,node41path79) - currentNode*(min(1, node41path79) - 1))) &  (currentPath'=(79 * min(1, node41path79) - currentPath*(min(1,node41path79) - 1))) & (success'=min(1, node41path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path80 * min(1,node41path80) - currentNode*(min(1, node41path80) - 1))) &  (currentPath'=(80 * min(1, node41path80) - currentPath*(min(1,node41path80) - 1))) & (success'=min(1, node41path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path81 * min(1,node41path81) - currentNode*(min(1, node41path81) - 1))) &  (currentPath'=(81 * min(1, node41path81) - currentPath*(min(1,node41path81) - 1))) & (success'=min(1, node41path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path82 * min(1,node41path82) - currentNode*(min(1, node41path82) - 1))) &  (currentPath'=(82 * min(1, node41path82) - currentPath*(min(1,node41path82) - 1))) & (success'=min(1, node41path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path83 * min(1,node41path83) - currentNode*(min(1, node41path83) - 1))) &  (currentPath'=(83 * min(1, node41path83) - currentPath*(min(1,node41path83) - 1))) & (success'=min(1, node41path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path84 * min(1,node41path84) - currentNode*(min(1, node41path84) - 1))) &  (currentPath'=(84 * min(1, node41path84) - currentPath*(min(1,node41path84) - 1))) & (success'=min(1, node41path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path85 * min(1,node41path85) - currentNode*(min(1, node41path85) - 1))) &  (currentPath'=(85 * min(1, node41path85) - currentPath*(min(1,node41path85) - 1))) & (success'=min(1, node41path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path86 * min(1,node41path86) - currentNode*(min(1, node41path86) - 1))) &  (currentPath'=(86 * min(1, node41path86) - currentPath*(min(1,node41path86) - 1))) & (success'=min(1, node41path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path87 * min(1,node41path87) - currentNode*(min(1, node41path87) - 1))) &  (currentPath'=(87 * min(1, node41path87) - currentPath*(min(1,node41path87) - 1))) & (success'=min(1, node41path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path88 * min(1,node41path88) - currentNode*(min(1, node41path88) - 1))) &  (currentPath'=(88 * min(1, node41path88) - currentPath*(min(1,node41path88) - 1))) & (success'=min(1, node41path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path89 * min(1,node41path89) - currentNode*(min(1, node41path89) - 1))) &  (currentPath'=(89 * min(1, node41path89) - currentPath*(min(1,node41path89) - 1))) & (success'=min(1, node41path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path90 * min(1,node41path90) - currentNode*(min(1, node41path90) - 1))) &  (currentPath'=(90 * min(1, node41path90) - currentPath*(min(1,node41path90) - 1))) & (success'=min(1, node41path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path91 * min(1,node41path91) - currentNode*(min(1, node41path91) - 1))) &  (currentPath'=(91 * min(1, node41path91) - currentPath*(min(1,node41path91) - 1))) & (success'=min(1, node41path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path92 * min(1,node41path92) - currentNode*(min(1, node41path92) - 1))) &  (currentPath'=(92 * min(1, node41path92) - currentPath*(min(1,node41path92) - 1))) & (success'=min(1, node41path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path93 * min(1,node41path93) - currentNode*(min(1, node41path93) - 1))) &  (currentPath'=(93 * min(1, node41path93) - currentPath*(min(1,node41path93) - 1))) & (success'=min(1, node41path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path94 * min(1,node41path94) - currentNode*(min(1, node41path94) - 1))) &  (currentPath'=(94 * min(1, node41path94) - currentPath*(min(1,node41path94) - 1))) & (success'=min(1, node41path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path95 * min(1,node41path95) - currentNode*(min(1, node41path95) - 1))) &  (currentPath'=(95 * min(1, node41path95) - currentPath*(min(1,node41path95) - 1))) & (success'=min(1, node41path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path96 * min(1,node41path96) - currentNode*(min(1, node41path96) - 1))) &  (currentPath'=(96 * min(1, node41path96) - currentPath*(min(1,node41path96) - 1))) & (success'=min(1, node41path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path97 * min(1,node41path97) - currentNode*(min(1, node41path97) - 1))) &  (currentPath'=(97 * min(1, node41path97) - currentPath*(min(1,node41path97) - 1))) & (success'=min(1, node41path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path98 * min(1,node41path98) - currentNode*(min(1, node41path98) - 1))) &  (currentPath'=(98 * min(1, node41path98) - currentPath*(min(1,node41path98) - 1))) & (success'=min(1, node41path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path99 * min(1,node41path99) - currentNode*(min(1, node41path99) - 1))) &  (currentPath'=(99 * min(1, node41path99) - currentPath*(min(1,node41path99) - 1))) & (success'=min(1, node41path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node41path100 * min(1,node41path100) - currentNode*(min(1, node41path100) - 1))) &  (currentPath'=(100 * min(1, node41path100) - currentPath*(min(1,node41path100) - 1))) & (success'=min(1, node41path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 42) ->
 numPathsInv: (currentNode'=(node42path1 * min(1,node42path1) - currentNode*(min(1, node42path1) - 1))) &  (currentPath'=(1 * min(1, node42path1) - currentPath*(min(1,node42path1) - 1))) & (success'=min(1, node42path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path2 * min(1,node42path2) - currentNode*(min(1, node42path2) - 1))) &  (currentPath'=(2 * min(1, node42path2) - currentPath*(min(1,node42path2) - 1))) & (success'=min(1, node42path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path3 * min(1,node42path3) - currentNode*(min(1, node42path3) - 1))) &  (currentPath'=(3 * min(1, node42path3) - currentPath*(min(1,node42path3) - 1))) & (success'=min(1, node42path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path4 * min(1,node42path4) - currentNode*(min(1, node42path4) - 1))) &  (currentPath'=(4 * min(1, node42path4) - currentPath*(min(1,node42path4) - 1))) & (success'=min(1, node42path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path5 * min(1,node42path5) - currentNode*(min(1, node42path5) - 1))) &  (currentPath'=(5 * min(1, node42path5) - currentPath*(min(1,node42path5) - 1))) & (success'=min(1, node42path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path6 * min(1,node42path6) - currentNode*(min(1, node42path6) - 1))) &  (currentPath'=(6 * min(1, node42path6) - currentPath*(min(1,node42path6) - 1))) & (success'=min(1, node42path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path7 * min(1,node42path7) - currentNode*(min(1, node42path7) - 1))) &  (currentPath'=(7 * min(1, node42path7) - currentPath*(min(1,node42path7) - 1))) & (success'=min(1, node42path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path8 * min(1,node42path8) - currentNode*(min(1, node42path8) - 1))) &  (currentPath'=(8 * min(1, node42path8) - currentPath*(min(1,node42path8) - 1))) & (success'=min(1, node42path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path9 * min(1,node42path9) - currentNode*(min(1, node42path9) - 1))) &  (currentPath'=(9 * min(1, node42path9) - currentPath*(min(1,node42path9) - 1))) & (success'=min(1, node42path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path10 * min(1,node42path10) - currentNode*(min(1, node42path10) - 1))) &  (currentPath'=(10 * min(1, node42path10) - currentPath*(min(1,node42path10) - 1))) & (success'=min(1, node42path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path11 * min(1,node42path11) - currentNode*(min(1, node42path11) - 1))) &  (currentPath'=(11 * min(1, node42path11) - currentPath*(min(1,node42path11) - 1))) & (success'=min(1, node42path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path12 * min(1,node42path12) - currentNode*(min(1, node42path12) - 1))) &  (currentPath'=(12 * min(1, node42path12) - currentPath*(min(1,node42path12) - 1))) & (success'=min(1, node42path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path13 * min(1,node42path13) - currentNode*(min(1, node42path13) - 1))) &  (currentPath'=(13 * min(1, node42path13) - currentPath*(min(1,node42path13) - 1))) & (success'=min(1, node42path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path14 * min(1,node42path14) - currentNode*(min(1, node42path14) - 1))) &  (currentPath'=(14 * min(1, node42path14) - currentPath*(min(1,node42path14) - 1))) & (success'=min(1, node42path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path15 * min(1,node42path15) - currentNode*(min(1, node42path15) - 1))) &  (currentPath'=(15 * min(1, node42path15) - currentPath*(min(1,node42path15) - 1))) & (success'=min(1, node42path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path16 * min(1,node42path16) - currentNode*(min(1, node42path16) - 1))) &  (currentPath'=(16 * min(1, node42path16) - currentPath*(min(1,node42path16) - 1))) & (success'=min(1, node42path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path17 * min(1,node42path17) - currentNode*(min(1, node42path17) - 1))) &  (currentPath'=(17 * min(1, node42path17) - currentPath*(min(1,node42path17) - 1))) & (success'=min(1, node42path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path18 * min(1,node42path18) - currentNode*(min(1, node42path18) - 1))) &  (currentPath'=(18 * min(1, node42path18) - currentPath*(min(1,node42path18) - 1))) & (success'=min(1, node42path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path19 * min(1,node42path19) - currentNode*(min(1, node42path19) - 1))) &  (currentPath'=(19 * min(1, node42path19) - currentPath*(min(1,node42path19) - 1))) & (success'=min(1, node42path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path20 * min(1,node42path20) - currentNode*(min(1, node42path20) - 1))) &  (currentPath'=(20 * min(1, node42path20) - currentPath*(min(1,node42path20) - 1))) & (success'=min(1, node42path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path21 * min(1,node42path21) - currentNode*(min(1, node42path21) - 1))) &  (currentPath'=(21 * min(1, node42path21) - currentPath*(min(1,node42path21) - 1))) & (success'=min(1, node42path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path22 * min(1,node42path22) - currentNode*(min(1, node42path22) - 1))) &  (currentPath'=(22 * min(1, node42path22) - currentPath*(min(1,node42path22) - 1))) & (success'=min(1, node42path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path23 * min(1,node42path23) - currentNode*(min(1, node42path23) - 1))) &  (currentPath'=(23 * min(1, node42path23) - currentPath*(min(1,node42path23) - 1))) & (success'=min(1, node42path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path24 * min(1,node42path24) - currentNode*(min(1, node42path24) - 1))) &  (currentPath'=(24 * min(1, node42path24) - currentPath*(min(1,node42path24) - 1))) & (success'=min(1, node42path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path25 * min(1,node42path25) - currentNode*(min(1, node42path25) - 1))) &  (currentPath'=(25 * min(1, node42path25) - currentPath*(min(1,node42path25) - 1))) & (success'=min(1, node42path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path26 * min(1,node42path26) - currentNode*(min(1, node42path26) - 1))) &  (currentPath'=(26 * min(1, node42path26) - currentPath*(min(1,node42path26) - 1))) & (success'=min(1, node42path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path27 * min(1,node42path27) - currentNode*(min(1, node42path27) - 1))) &  (currentPath'=(27 * min(1, node42path27) - currentPath*(min(1,node42path27) - 1))) & (success'=min(1, node42path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path28 * min(1,node42path28) - currentNode*(min(1, node42path28) - 1))) &  (currentPath'=(28 * min(1, node42path28) - currentPath*(min(1,node42path28) - 1))) & (success'=min(1, node42path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path29 * min(1,node42path29) - currentNode*(min(1, node42path29) - 1))) &  (currentPath'=(29 * min(1, node42path29) - currentPath*(min(1,node42path29) - 1))) & (success'=min(1, node42path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path30 * min(1,node42path30) - currentNode*(min(1, node42path30) - 1))) &  (currentPath'=(30 * min(1, node42path30) - currentPath*(min(1,node42path30) - 1))) & (success'=min(1, node42path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path31 * min(1,node42path31) - currentNode*(min(1, node42path31) - 1))) &  (currentPath'=(31 * min(1, node42path31) - currentPath*(min(1,node42path31) - 1))) & (success'=min(1, node42path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path32 * min(1,node42path32) - currentNode*(min(1, node42path32) - 1))) &  (currentPath'=(32 * min(1, node42path32) - currentPath*(min(1,node42path32) - 1))) & (success'=min(1, node42path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path33 * min(1,node42path33) - currentNode*(min(1, node42path33) - 1))) &  (currentPath'=(33 * min(1, node42path33) - currentPath*(min(1,node42path33) - 1))) & (success'=min(1, node42path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path34 * min(1,node42path34) - currentNode*(min(1, node42path34) - 1))) &  (currentPath'=(34 * min(1, node42path34) - currentPath*(min(1,node42path34) - 1))) & (success'=min(1, node42path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path35 * min(1,node42path35) - currentNode*(min(1, node42path35) - 1))) &  (currentPath'=(35 * min(1, node42path35) - currentPath*(min(1,node42path35) - 1))) & (success'=min(1, node42path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path36 * min(1,node42path36) - currentNode*(min(1, node42path36) - 1))) &  (currentPath'=(36 * min(1, node42path36) - currentPath*(min(1,node42path36) - 1))) & (success'=min(1, node42path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path37 * min(1,node42path37) - currentNode*(min(1, node42path37) - 1))) &  (currentPath'=(37 * min(1, node42path37) - currentPath*(min(1,node42path37) - 1))) & (success'=min(1, node42path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path38 * min(1,node42path38) - currentNode*(min(1, node42path38) - 1))) &  (currentPath'=(38 * min(1, node42path38) - currentPath*(min(1,node42path38) - 1))) & (success'=min(1, node42path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path39 * min(1,node42path39) - currentNode*(min(1, node42path39) - 1))) &  (currentPath'=(39 * min(1, node42path39) - currentPath*(min(1,node42path39) - 1))) & (success'=min(1, node42path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path40 * min(1,node42path40) - currentNode*(min(1, node42path40) - 1))) &  (currentPath'=(40 * min(1, node42path40) - currentPath*(min(1,node42path40) - 1))) & (success'=min(1, node42path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path41 * min(1,node42path41) - currentNode*(min(1, node42path41) - 1))) &  (currentPath'=(41 * min(1, node42path41) - currentPath*(min(1,node42path41) - 1))) & (success'=min(1, node42path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path42 * min(1,node42path42) - currentNode*(min(1, node42path42) - 1))) &  (currentPath'=(42 * min(1, node42path42) - currentPath*(min(1,node42path42) - 1))) & (success'=min(1, node42path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path43 * min(1,node42path43) - currentNode*(min(1, node42path43) - 1))) &  (currentPath'=(43 * min(1, node42path43) - currentPath*(min(1,node42path43) - 1))) & (success'=min(1, node42path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path44 * min(1,node42path44) - currentNode*(min(1, node42path44) - 1))) &  (currentPath'=(44 * min(1, node42path44) - currentPath*(min(1,node42path44) - 1))) & (success'=min(1, node42path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path45 * min(1,node42path45) - currentNode*(min(1, node42path45) - 1))) &  (currentPath'=(45 * min(1, node42path45) - currentPath*(min(1,node42path45) - 1))) & (success'=min(1, node42path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path46 * min(1,node42path46) - currentNode*(min(1, node42path46) - 1))) &  (currentPath'=(46 * min(1, node42path46) - currentPath*(min(1,node42path46) - 1))) & (success'=min(1, node42path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path47 * min(1,node42path47) - currentNode*(min(1, node42path47) - 1))) &  (currentPath'=(47 * min(1, node42path47) - currentPath*(min(1,node42path47) - 1))) & (success'=min(1, node42path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path48 * min(1,node42path48) - currentNode*(min(1, node42path48) - 1))) &  (currentPath'=(48 * min(1, node42path48) - currentPath*(min(1,node42path48) - 1))) & (success'=min(1, node42path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path49 * min(1,node42path49) - currentNode*(min(1, node42path49) - 1))) &  (currentPath'=(49 * min(1, node42path49) - currentPath*(min(1,node42path49) - 1))) & (success'=min(1, node42path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path50 * min(1,node42path50) - currentNode*(min(1, node42path50) - 1))) &  (currentPath'=(50 * min(1, node42path50) - currentPath*(min(1,node42path50) - 1))) & (success'=min(1, node42path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path51 * min(1,node42path51) - currentNode*(min(1, node42path51) - 1))) &  (currentPath'=(51 * min(1, node42path51) - currentPath*(min(1,node42path51) - 1))) & (success'=min(1, node42path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path52 * min(1,node42path52) - currentNode*(min(1, node42path52) - 1))) &  (currentPath'=(52 * min(1, node42path52) - currentPath*(min(1,node42path52) - 1))) & (success'=min(1, node42path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path53 * min(1,node42path53) - currentNode*(min(1, node42path53) - 1))) &  (currentPath'=(53 * min(1, node42path53) - currentPath*(min(1,node42path53) - 1))) & (success'=min(1, node42path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path54 * min(1,node42path54) - currentNode*(min(1, node42path54) - 1))) &  (currentPath'=(54 * min(1, node42path54) - currentPath*(min(1,node42path54) - 1))) & (success'=min(1, node42path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path55 * min(1,node42path55) - currentNode*(min(1, node42path55) - 1))) &  (currentPath'=(55 * min(1, node42path55) - currentPath*(min(1,node42path55) - 1))) & (success'=min(1, node42path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path56 * min(1,node42path56) - currentNode*(min(1, node42path56) - 1))) &  (currentPath'=(56 * min(1, node42path56) - currentPath*(min(1,node42path56) - 1))) & (success'=min(1, node42path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path57 * min(1,node42path57) - currentNode*(min(1, node42path57) - 1))) &  (currentPath'=(57 * min(1, node42path57) - currentPath*(min(1,node42path57) - 1))) & (success'=min(1, node42path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path58 * min(1,node42path58) - currentNode*(min(1, node42path58) - 1))) &  (currentPath'=(58 * min(1, node42path58) - currentPath*(min(1,node42path58) - 1))) & (success'=min(1, node42path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path59 * min(1,node42path59) - currentNode*(min(1, node42path59) - 1))) &  (currentPath'=(59 * min(1, node42path59) - currentPath*(min(1,node42path59) - 1))) & (success'=min(1, node42path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path60 * min(1,node42path60) - currentNode*(min(1, node42path60) - 1))) &  (currentPath'=(60 * min(1, node42path60) - currentPath*(min(1,node42path60) - 1))) & (success'=min(1, node42path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path61 * min(1,node42path61) - currentNode*(min(1, node42path61) - 1))) &  (currentPath'=(61 * min(1, node42path61) - currentPath*(min(1,node42path61) - 1))) & (success'=min(1, node42path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path62 * min(1,node42path62) - currentNode*(min(1, node42path62) - 1))) &  (currentPath'=(62 * min(1, node42path62) - currentPath*(min(1,node42path62) - 1))) & (success'=min(1, node42path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path63 * min(1,node42path63) - currentNode*(min(1, node42path63) - 1))) &  (currentPath'=(63 * min(1, node42path63) - currentPath*(min(1,node42path63) - 1))) & (success'=min(1, node42path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path64 * min(1,node42path64) - currentNode*(min(1, node42path64) - 1))) &  (currentPath'=(64 * min(1, node42path64) - currentPath*(min(1,node42path64) - 1))) & (success'=min(1, node42path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path65 * min(1,node42path65) - currentNode*(min(1, node42path65) - 1))) &  (currentPath'=(65 * min(1, node42path65) - currentPath*(min(1,node42path65) - 1))) & (success'=min(1, node42path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path66 * min(1,node42path66) - currentNode*(min(1, node42path66) - 1))) &  (currentPath'=(66 * min(1, node42path66) - currentPath*(min(1,node42path66) - 1))) & (success'=min(1, node42path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path67 * min(1,node42path67) - currentNode*(min(1, node42path67) - 1))) &  (currentPath'=(67 * min(1, node42path67) - currentPath*(min(1,node42path67) - 1))) & (success'=min(1, node42path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path68 * min(1,node42path68) - currentNode*(min(1, node42path68) - 1))) &  (currentPath'=(68 * min(1, node42path68) - currentPath*(min(1,node42path68) - 1))) & (success'=min(1, node42path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path69 * min(1,node42path69) - currentNode*(min(1, node42path69) - 1))) &  (currentPath'=(69 * min(1, node42path69) - currentPath*(min(1,node42path69) - 1))) & (success'=min(1, node42path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path70 * min(1,node42path70) - currentNode*(min(1, node42path70) - 1))) &  (currentPath'=(70 * min(1, node42path70) - currentPath*(min(1,node42path70) - 1))) & (success'=min(1, node42path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path71 * min(1,node42path71) - currentNode*(min(1, node42path71) - 1))) &  (currentPath'=(71 * min(1, node42path71) - currentPath*(min(1,node42path71) - 1))) & (success'=min(1, node42path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path72 * min(1,node42path72) - currentNode*(min(1, node42path72) - 1))) &  (currentPath'=(72 * min(1, node42path72) - currentPath*(min(1,node42path72) - 1))) & (success'=min(1, node42path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path73 * min(1,node42path73) - currentNode*(min(1, node42path73) - 1))) &  (currentPath'=(73 * min(1, node42path73) - currentPath*(min(1,node42path73) - 1))) & (success'=min(1, node42path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path74 * min(1,node42path74) - currentNode*(min(1, node42path74) - 1))) &  (currentPath'=(74 * min(1, node42path74) - currentPath*(min(1,node42path74) - 1))) & (success'=min(1, node42path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path75 * min(1,node42path75) - currentNode*(min(1, node42path75) - 1))) &  (currentPath'=(75 * min(1, node42path75) - currentPath*(min(1,node42path75) - 1))) & (success'=min(1, node42path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path76 * min(1,node42path76) - currentNode*(min(1, node42path76) - 1))) &  (currentPath'=(76 * min(1, node42path76) - currentPath*(min(1,node42path76) - 1))) & (success'=min(1, node42path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path77 * min(1,node42path77) - currentNode*(min(1, node42path77) - 1))) &  (currentPath'=(77 * min(1, node42path77) - currentPath*(min(1,node42path77) - 1))) & (success'=min(1, node42path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path78 * min(1,node42path78) - currentNode*(min(1, node42path78) - 1))) &  (currentPath'=(78 * min(1, node42path78) - currentPath*(min(1,node42path78) - 1))) & (success'=min(1, node42path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path79 * min(1,node42path79) - currentNode*(min(1, node42path79) - 1))) &  (currentPath'=(79 * min(1, node42path79) - currentPath*(min(1,node42path79) - 1))) & (success'=min(1, node42path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path80 * min(1,node42path80) - currentNode*(min(1, node42path80) - 1))) &  (currentPath'=(80 * min(1, node42path80) - currentPath*(min(1,node42path80) - 1))) & (success'=min(1, node42path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path81 * min(1,node42path81) - currentNode*(min(1, node42path81) - 1))) &  (currentPath'=(81 * min(1, node42path81) - currentPath*(min(1,node42path81) - 1))) & (success'=min(1, node42path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path82 * min(1,node42path82) - currentNode*(min(1, node42path82) - 1))) &  (currentPath'=(82 * min(1, node42path82) - currentPath*(min(1,node42path82) - 1))) & (success'=min(1, node42path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path83 * min(1,node42path83) - currentNode*(min(1, node42path83) - 1))) &  (currentPath'=(83 * min(1, node42path83) - currentPath*(min(1,node42path83) - 1))) & (success'=min(1, node42path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path84 * min(1,node42path84) - currentNode*(min(1, node42path84) - 1))) &  (currentPath'=(84 * min(1, node42path84) - currentPath*(min(1,node42path84) - 1))) & (success'=min(1, node42path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path85 * min(1,node42path85) - currentNode*(min(1, node42path85) - 1))) &  (currentPath'=(85 * min(1, node42path85) - currentPath*(min(1,node42path85) - 1))) & (success'=min(1, node42path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path86 * min(1,node42path86) - currentNode*(min(1, node42path86) - 1))) &  (currentPath'=(86 * min(1, node42path86) - currentPath*(min(1,node42path86) - 1))) & (success'=min(1, node42path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path87 * min(1,node42path87) - currentNode*(min(1, node42path87) - 1))) &  (currentPath'=(87 * min(1, node42path87) - currentPath*(min(1,node42path87) - 1))) & (success'=min(1, node42path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path88 * min(1,node42path88) - currentNode*(min(1, node42path88) - 1))) &  (currentPath'=(88 * min(1, node42path88) - currentPath*(min(1,node42path88) - 1))) & (success'=min(1, node42path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path89 * min(1,node42path89) - currentNode*(min(1, node42path89) - 1))) &  (currentPath'=(89 * min(1, node42path89) - currentPath*(min(1,node42path89) - 1))) & (success'=min(1, node42path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path90 * min(1,node42path90) - currentNode*(min(1, node42path90) - 1))) &  (currentPath'=(90 * min(1, node42path90) - currentPath*(min(1,node42path90) - 1))) & (success'=min(1, node42path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path91 * min(1,node42path91) - currentNode*(min(1, node42path91) - 1))) &  (currentPath'=(91 * min(1, node42path91) - currentPath*(min(1,node42path91) - 1))) & (success'=min(1, node42path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path92 * min(1,node42path92) - currentNode*(min(1, node42path92) - 1))) &  (currentPath'=(92 * min(1, node42path92) - currentPath*(min(1,node42path92) - 1))) & (success'=min(1, node42path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path93 * min(1,node42path93) - currentNode*(min(1, node42path93) - 1))) &  (currentPath'=(93 * min(1, node42path93) - currentPath*(min(1,node42path93) - 1))) & (success'=min(1, node42path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path94 * min(1,node42path94) - currentNode*(min(1, node42path94) - 1))) &  (currentPath'=(94 * min(1, node42path94) - currentPath*(min(1,node42path94) - 1))) & (success'=min(1, node42path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path95 * min(1,node42path95) - currentNode*(min(1, node42path95) - 1))) &  (currentPath'=(95 * min(1, node42path95) - currentPath*(min(1,node42path95) - 1))) & (success'=min(1, node42path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path96 * min(1,node42path96) - currentNode*(min(1, node42path96) - 1))) &  (currentPath'=(96 * min(1, node42path96) - currentPath*(min(1,node42path96) - 1))) & (success'=min(1, node42path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path97 * min(1,node42path97) - currentNode*(min(1, node42path97) - 1))) &  (currentPath'=(97 * min(1, node42path97) - currentPath*(min(1,node42path97) - 1))) & (success'=min(1, node42path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path98 * min(1,node42path98) - currentNode*(min(1, node42path98) - 1))) &  (currentPath'=(98 * min(1, node42path98) - currentPath*(min(1,node42path98) - 1))) & (success'=min(1, node42path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path99 * min(1,node42path99) - currentNode*(min(1, node42path99) - 1))) &  (currentPath'=(99 * min(1, node42path99) - currentPath*(min(1,node42path99) - 1))) & (success'=min(1, node42path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node42path100 * min(1,node42path100) - currentNode*(min(1, node42path100) - 1))) &  (currentPath'=(100 * min(1, node42path100) - currentPath*(min(1,node42path100) - 1))) & (success'=min(1, node42path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 43) ->
 numPathsInv: (currentNode'=(node43path1 * min(1,node43path1) - currentNode*(min(1, node43path1) - 1))) &  (currentPath'=(1 * min(1, node43path1) - currentPath*(min(1,node43path1) - 1))) & (success'=min(1, node43path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path2 * min(1,node43path2) - currentNode*(min(1, node43path2) - 1))) &  (currentPath'=(2 * min(1, node43path2) - currentPath*(min(1,node43path2) - 1))) & (success'=min(1, node43path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path3 * min(1,node43path3) - currentNode*(min(1, node43path3) - 1))) &  (currentPath'=(3 * min(1, node43path3) - currentPath*(min(1,node43path3) - 1))) & (success'=min(1, node43path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path4 * min(1,node43path4) - currentNode*(min(1, node43path4) - 1))) &  (currentPath'=(4 * min(1, node43path4) - currentPath*(min(1,node43path4) - 1))) & (success'=min(1, node43path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path5 * min(1,node43path5) - currentNode*(min(1, node43path5) - 1))) &  (currentPath'=(5 * min(1, node43path5) - currentPath*(min(1,node43path5) - 1))) & (success'=min(1, node43path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path6 * min(1,node43path6) - currentNode*(min(1, node43path6) - 1))) &  (currentPath'=(6 * min(1, node43path6) - currentPath*(min(1,node43path6) - 1))) & (success'=min(1, node43path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path7 * min(1,node43path7) - currentNode*(min(1, node43path7) - 1))) &  (currentPath'=(7 * min(1, node43path7) - currentPath*(min(1,node43path7) - 1))) & (success'=min(1, node43path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path8 * min(1,node43path8) - currentNode*(min(1, node43path8) - 1))) &  (currentPath'=(8 * min(1, node43path8) - currentPath*(min(1,node43path8) - 1))) & (success'=min(1, node43path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path9 * min(1,node43path9) - currentNode*(min(1, node43path9) - 1))) &  (currentPath'=(9 * min(1, node43path9) - currentPath*(min(1,node43path9) - 1))) & (success'=min(1, node43path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path10 * min(1,node43path10) - currentNode*(min(1, node43path10) - 1))) &  (currentPath'=(10 * min(1, node43path10) - currentPath*(min(1,node43path10) - 1))) & (success'=min(1, node43path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path11 * min(1,node43path11) - currentNode*(min(1, node43path11) - 1))) &  (currentPath'=(11 * min(1, node43path11) - currentPath*(min(1,node43path11) - 1))) & (success'=min(1, node43path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path12 * min(1,node43path12) - currentNode*(min(1, node43path12) - 1))) &  (currentPath'=(12 * min(1, node43path12) - currentPath*(min(1,node43path12) - 1))) & (success'=min(1, node43path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path13 * min(1,node43path13) - currentNode*(min(1, node43path13) - 1))) &  (currentPath'=(13 * min(1, node43path13) - currentPath*(min(1,node43path13) - 1))) & (success'=min(1, node43path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path14 * min(1,node43path14) - currentNode*(min(1, node43path14) - 1))) &  (currentPath'=(14 * min(1, node43path14) - currentPath*(min(1,node43path14) - 1))) & (success'=min(1, node43path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path15 * min(1,node43path15) - currentNode*(min(1, node43path15) - 1))) &  (currentPath'=(15 * min(1, node43path15) - currentPath*(min(1,node43path15) - 1))) & (success'=min(1, node43path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path16 * min(1,node43path16) - currentNode*(min(1, node43path16) - 1))) &  (currentPath'=(16 * min(1, node43path16) - currentPath*(min(1,node43path16) - 1))) & (success'=min(1, node43path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path17 * min(1,node43path17) - currentNode*(min(1, node43path17) - 1))) &  (currentPath'=(17 * min(1, node43path17) - currentPath*(min(1,node43path17) - 1))) & (success'=min(1, node43path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path18 * min(1,node43path18) - currentNode*(min(1, node43path18) - 1))) &  (currentPath'=(18 * min(1, node43path18) - currentPath*(min(1,node43path18) - 1))) & (success'=min(1, node43path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path19 * min(1,node43path19) - currentNode*(min(1, node43path19) - 1))) &  (currentPath'=(19 * min(1, node43path19) - currentPath*(min(1,node43path19) - 1))) & (success'=min(1, node43path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path20 * min(1,node43path20) - currentNode*(min(1, node43path20) - 1))) &  (currentPath'=(20 * min(1, node43path20) - currentPath*(min(1,node43path20) - 1))) & (success'=min(1, node43path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path21 * min(1,node43path21) - currentNode*(min(1, node43path21) - 1))) &  (currentPath'=(21 * min(1, node43path21) - currentPath*(min(1,node43path21) - 1))) & (success'=min(1, node43path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path22 * min(1,node43path22) - currentNode*(min(1, node43path22) - 1))) &  (currentPath'=(22 * min(1, node43path22) - currentPath*(min(1,node43path22) - 1))) & (success'=min(1, node43path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path23 * min(1,node43path23) - currentNode*(min(1, node43path23) - 1))) &  (currentPath'=(23 * min(1, node43path23) - currentPath*(min(1,node43path23) - 1))) & (success'=min(1, node43path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path24 * min(1,node43path24) - currentNode*(min(1, node43path24) - 1))) &  (currentPath'=(24 * min(1, node43path24) - currentPath*(min(1,node43path24) - 1))) & (success'=min(1, node43path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path25 * min(1,node43path25) - currentNode*(min(1, node43path25) - 1))) &  (currentPath'=(25 * min(1, node43path25) - currentPath*(min(1,node43path25) - 1))) & (success'=min(1, node43path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path26 * min(1,node43path26) - currentNode*(min(1, node43path26) - 1))) &  (currentPath'=(26 * min(1, node43path26) - currentPath*(min(1,node43path26) - 1))) & (success'=min(1, node43path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path27 * min(1,node43path27) - currentNode*(min(1, node43path27) - 1))) &  (currentPath'=(27 * min(1, node43path27) - currentPath*(min(1,node43path27) - 1))) & (success'=min(1, node43path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path28 * min(1,node43path28) - currentNode*(min(1, node43path28) - 1))) &  (currentPath'=(28 * min(1, node43path28) - currentPath*(min(1,node43path28) - 1))) & (success'=min(1, node43path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path29 * min(1,node43path29) - currentNode*(min(1, node43path29) - 1))) &  (currentPath'=(29 * min(1, node43path29) - currentPath*(min(1,node43path29) - 1))) & (success'=min(1, node43path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path30 * min(1,node43path30) - currentNode*(min(1, node43path30) - 1))) &  (currentPath'=(30 * min(1, node43path30) - currentPath*(min(1,node43path30) - 1))) & (success'=min(1, node43path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path31 * min(1,node43path31) - currentNode*(min(1, node43path31) - 1))) &  (currentPath'=(31 * min(1, node43path31) - currentPath*(min(1,node43path31) - 1))) & (success'=min(1, node43path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path32 * min(1,node43path32) - currentNode*(min(1, node43path32) - 1))) &  (currentPath'=(32 * min(1, node43path32) - currentPath*(min(1,node43path32) - 1))) & (success'=min(1, node43path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path33 * min(1,node43path33) - currentNode*(min(1, node43path33) - 1))) &  (currentPath'=(33 * min(1, node43path33) - currentPath*(min(1,node43path33) - 1))) & (success'=min(1, node43path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path34 * min(1,node43path34) - currentNode*(min(1, node43path34) - 1))) &  (currentPath'=(34 * min(1, node43path34) - currentPath*(min(1,node43path34) - 1))) & (success'=min(1, node43path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path35 * min(1,node43path35) - currentNode*(min(1, node43path35) - 1))) &  (currentPath'=(35 * min(1, node43path35) - currentPath*(min(1,node43path35) - 1))) & (success'=min(1, node43path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path36 * min(1,node43path36) - currentNode*(min(1, node43path36) - 1))) &  (currentPath'=(36 * min(1, node43path36) - currentPath*(min(1,node43path36) - 1))) & (success'=min(1, node43path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path37 * min(1,node43path37) - currentNode*(min(1, node43path37) - 1))) &  (currentPath'=(37 * min(1, node43path37) - currentPath*(min(1,node43path37) - 1))) & (success'=min(1, node43path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path38 * min(1,node43path38) - currentNode*(min(1, node43path38) - 1))) &  (currentPath'=(38 * min(1, node43path38) - currentPath*(min(1,node43path38) - 1))) & (success'=min(1, node43path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path39 * min(1,node43path39) - currentNode*(min(1, node43path39) - 1))) &  (currentPath'=(39 * min(1, node43path39) - currentPath*(min(1,node43path39) - 1))) & (success'=min(1, node43path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path40 * min(1,node43path40) - currentNode*(min(1, node43path40) - 1))) &  (currentPath'=(40 * min(1, node43path40) - currentPath*(min(1,node43path40) - 1))) & (success'=min(1, node43path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path41 * min(1,node43path41) - currentNode*(min(1, node43path41) - 1))) &  (currentPath'=(41 * min(1, node43path41) - currentPath*(min(1,node43path41) - 1))) & (success'=min(1, node43path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path42 * min(1,node43path42) - currentNode*(min(1, node43path42) - 1))) &  (currentPath'=(42 * min(1, node43path42) - currentPath*(min(1,node43path42) - 1))) & (success'=min(1, node43path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path43 * min(1,node43path43) - currentNode*(min(1, node43path43) - 1))) &  (currentPath'=(43 * min(1, node43path43) - currentPath*(min(1,node43path43) - 1))) & (success'=min(1, node43path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path44 * min(1,node43path44) - currentNode*(min(1, node43path44) - 1))) &  (currentPath'=(44 * min(1, node43path44) - currentPath*(min(1,node43path44) - 1))) & (success'=min(1, node43path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path45 * min(1,node43path45) - currentNode*(min(1, node43path45) - 1))) &  (currentPath'=(45 * min(1, node43path45) - currentPath*(min(1,node43path45) - 1))) & (success'=min(1, node43path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path46 * min(1,node43path46) - currentNode*(min(1, node43path46) - 1))) &  (currentPath'=(46 * min(1, node43path46) - currentPath*(min(1,node43path46) - 1))) & (success'=min(1, node43path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path47 * min(1,node43path47) - currentNode*(min(1, node43path47) - 1))) &  (currentPath'=(47 * min(1, node43path47) - currentPath*(min(1,node43path47) - 1))) & (success'=min(1, node43path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path48 * min(1,node43path48) - currentNode*(min(1, node43path48) - 1))) &  (currentPath'=(48 * min(1, node43path48) - currentPath*(min(1,node43path48) - 1))) & (success'=min(1, node43path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path49 * min(1,node43path49) - currentNode*(min(1, node43path49) - 1))) &  (currentPath'=(49 * min(1, node43path49) - currentPath*(min(1,node43path49) - 1))) & (success'=min(1, node43path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path50 * min(1,node43path50) - currentNode*(min(1, node43path50) - 1))) &  (currentPath'=(50 * min(1, node43path50) - currentPath*(min(1,node43path50) - 1))) & (success'=min(1, node43path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path51 * min(1,node43path51) - currentNode*(min(1, node43path51) - 1))) &  (currentPath'=(51 * min(1, node43path51) - currentPath*(min(1,node43path51) - 1))) & (success'=min(1, node43path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path52 * min(1,node43path52) - currentNode*(min(1, node43path52) - 1))) &  (currentPath'=(52 * min(1, node43path52) - currentPath*(min(1,node43path52) - 1))) & (success'=min(1, node43path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path53 * min(1,node43path53) - currentNode*(min(1, node43path53) - 1))) &  (currentPath'=(53 * min(1, node43path53) - currentPath*(min(1,node43path53) - 1))) & (success'=min(1, node43path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path54 * min(1,node43path54) - currentNode*(min(1, node43path54) - 1))) &  (currentPath'=(54 * min(1, node43path54) - currentPath*(min(1,node43path54) - 1))) & (success'=min(1, node43path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path55 * min(1,node43path55) - currentNode*(min(1, node43path55) - 1))) &  (currentPath'=(55 * min(1, node43path55) - currentPath*(min(1,node43path55) - 1))) & (success'=min(1, node43path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path56 * min(1,node43path56) - currentNode*(min(1, node43path56) - 1))) &  (currentPath'=(56 * min(1, node43path56) - currentPath*(min(1,node43path56) - 1))) & (success'=min(1, node43path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path57 * min(1,node43path57) - currentNode*(min(1, node43path57) - 1))) &  (currentPath'=(57 * min(1, node43path57) - currentPath*(min(1,node43path57) - 1))) & (success'=min(1, node43path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path58 * min(1,node43path58) - currentNode*(min(1, node43path58) - 1))) &  (currentPath'=(58 * min(1, node43path58) - currentPath*(min(1,node43path58) - 1))) & (success'=min(1, node43path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path59 * min(1,node43path59) - currentNode*(min(1, node43path59) - 1))) &  (currentPath'=(59 * min(1, node43path59) - currentPath*(min(1,node43path59) - 1))) & (success'=min(1, node43path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path60 * min(1,node43path60) - currentNode*(min(1, node43path60) - 1))) &  (currentPath'=(60 * min(1, node43path60) - currentPath*(min(1,node43path60) - 1))) & (success'=min(1, node43path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path61 * min(1,node43path61) - currentNode*(min(1, node43path61) - 1))) &  (currentPath'=(61 * min(1, node43path61) - currentPath*(min(1,node43path61) - 1))) & (success'=min(1, node43path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path62 * min(1,node43path62) - currentNode*(min(1, node43path62) - 1))) &  (currentPath'=(62 * min(1, node43path62) - currentPath*(min(1,node43path62) - 1))) & (success'=min(1, node43path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path63 * min(1,node43path63) - currentNode*(min(1, node43path63) - 1))) &  (currentPath'=(63 * min(1, node43path63) - currentPath*(min(1,node43path63) - 1))) & (success'=min(1, node43path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path64 * min(1,node43path64) - currentNode*(min(1, node43path64) - 1))) &  (currentPath'=(64 * min(1, node43path64) - currentPath*(min(1,node43path64) - 1))) & (success'=min(1, node43path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path65 * min(1,node43path65) - currentNode*(min(1, node43path65) - 1))) &  (currentPath'=(65 * min(1, node43path65) - currentPath*(min(1,node43path65) - 1))) & (success'=min(1, node43path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path66 * min(1,node43path66) - currentNode*(min(1, node43path66) - 1))) &  (currentPath'=(66 * min(1, node43path66) - currentPath*(min(1,node43path66) - 1))) & (success'=min(1, node43path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path67 * min(1,node43path67) - currentNode*(min(1, node43path67) - 1))) &  (currentPath'=(67 * min(1, node43path67) - currentPath*(min(1,node43path67) - 1))) & (success'=min(1, node43path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path68 * min(1,node43path68) - currentNode*(min(1, node43path68) - 1))) &  (currentPath'=(68 * min(1, node43path68) - currentPath*(min(1,node43path68) - 1))) & (success'=min(1, node43path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path69 * min(1,node43path69) - currentNode*(min(1, node43path69) - 1))) &  (currentPath'=(69 * min(1, node43path69) - currentPath*(min(1,node43path69) - 1))) & (success'=min(1, node43path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path70 * min(1,node43path70) - currentNode*(min(1, node43path70) - 1))) &  (currentPath'=(70 * min(1, node43path70) - currentPath*(min(1,node43path70) - 1))) & (success'=min(1, node43path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path71 * min(1,node43path71) - currentNode*(min(1, node43path71) - 1))) &  (currentPath'=(71 * min(1, node43path71) - currentPath*(min(1,node43path71) - 1))) & (success'=min(1, node43path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path72 * min(1,node43path72) - currentNode*(min(1, node43path72) - 1))) &  (currentPath'=(72 * min(1, node43path72) - currentPath*(min(1,node43path72) - 1))) & (success'=min(1, node43path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path73 * min(1,node43path73) - currentNode*(min(1, node43path73) - 1))) &  (currentPath'=(73 * min(1, node43path73) - currentPath*(min(1,node43path73) - 1))) & (success'=min(1, node43path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path74 * min(1,node43path74) - currentNode*(min(1, node43path74) - 1))) &  (currentPath'=(74 * min(1, node43path74) - currentPath*(min(1,node43path74) - 1))) & (success'=min(1, node43path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path75 * min(1,node43path75) - currentNode*(min(1, node43path75) - 1))) &  (currentPath'=(75 * min(1, node43path75) - currentPath*(min(1,node43path75) - 1))) & (success'=min(1, node43path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path76 * min(1,node43path76) - currentNode*(min(1, node43path76) - 1))) &  (currentPath'=(76 * min(1, node43path76) - currentPath*(min(1,node43path76) - 1))) & (success'=min(1, node43path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path77 * min(1,node43path77) - currentNode*(min(1, node43path77) - 1))) &  (currentPath'=(77 * min(1, node43path77) - currentPath*(min(1,node43path77) - 1))) & (success'=min(1, node43path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path78 * min(1,node43path78) - currentNode*(min(1, node43path78) - 1))) &  (currentPath'=(78 * min(1, node43path78) - currentPath*(min(1,node43path78) - 1))) & (success'=min(1, node43path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path79 * min(1,node43path79) - currentNode*(min(1, node43path79) - 1))) &  (currentPath'=(79 * min(1, node43path79) - currentPath*(min(1,node43path79) - 1))) & (success'=min(1, node43path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path80 * min(1,node43path80) - currentNode*(min(1, node43path80) - 1))) &  (currentPath'=(80 * min(1, node43path80) - currentPath*(min(1,node43path80) - 1))) & (success'=min(1, node43path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path81 * min(1,node43path81) - currentNode*(min(1, node43path81) - 1))) &  (currentPath'=(81 * min(1, node43path81) - currentPath*(min(1,node43path81) - 1))) & (success'=min(1, node43path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path82 * min(1,node43path82) - currentNode*(min(1, node43path82) - 1))) &  (currentPath'=(82 * min(1, node43path82) - currentPath*(min(1,node43path82) - 1))) & (success'=min(1, node43path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path83 * min(1,node43path83) - currentNode*(min(1, node43path83) - 1))) &  (currentPath'=(83 * min(1, node43path83) - currentPath*(min(1,node43path83) - 1))) & (success'=min(1, node43path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path84 * min(1,node43path84) - currentNode*(min(1, node43path84) - 1))) &  (currentPath'=(84 * min(1, node43path84) - currentPath*(min(1,node43path84) - 1))) & (success'=min(1, node43path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path85 * min(1,node43path85) - currentNode*(min(1, node43path85) - 1))) &  (currentPath'=(85 * min(1, node43path85) - currentPath*(min(1,node43path85) - 1))) & (success'=min(1, node43path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path86 * min(1,node43path86) - currentNode*(min(1, node43path86) - 1))) &  (currentPath'=(86 * min(1, node43path86) - currentPath*(min(1,node43path86) - 1))) & (success'=min(1, node43path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path87 * min(1,node43path87) - currentNode*(min(1, node43path87) - 1))) &  (currentPath'=(87 * min(1, node43path87) - currentPath*(min(1,node43path87) - 1))) & (success'=min(1, node43path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path88 * min(1,node43path88) - currentNode*(min(1, node43path88) - 1))) &  (currentPath'=(88 * min(1, node43path88) - currentPath*(min(1,node43path88) - 1))) & (success'=min(1, node43path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path89 * min(1,node43path89) - currentNode*(min(1, node43path89) - 1))) &  (currentPath'=(89 * min(1, node43path89) - currentPath*(min(1,node43path89) - 1))) & (success'=min(1, node43path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path90 * min(1,node43path90) - currentNode*(min(1, node43path90) - 1))) &  (currentPath'=(90 * min(1, node43path90) - currentPath*(min(1,node43path90) - 1))) & (success'=min(1, node43path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path91 * min(1,node43path91) - currentNode*(min(1, node43path91) - 1))) &  (currentPath'=(91 * min(1, node43path91) - currentPath*(min(1,node43path91) - 1))) & (success'=min(1, node43path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path92 * min(1,node43path92) - currentNode*(min(1, node43path92) - 1))) &  (currentPath'=(92 * min(1, node43path92) - currentPath*(min(1,node43path92) - 1))) & (success'=min(1, node43path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path93 * min(1,node43path93) - currentNode*(min(1, node43path93) - 1))) &  (currentPath'=(93 * min(1, node43path93) - currentPath*(min(1,node43path93) - 1))) & (success'=min(1, node43path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path94 * min(1,node43path94) - currentNode*(min(1, node43path94) - 1))) &  (currentPath'=(94 * min(1, node43path94) - currentPath*(min(1,node43path94) - 1))) & (success'=min(1, node43path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path95 * min(1,node43path95) - currentNode*(min(1, node43path95) - 1))) &  (currentPath'=(95 * min(1, node43path95) - currentPath*(min(1,node43path95) - 1))) & (success'=min(1, node43path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path96 * min(1,node43path96) - currentNode*(min(1, node43path96) - 1))) &  (currentPath'=(96 * min(1, node43path96) - currentPath*(min(1,node43path96) - 1))) & (success'=min(1, node43path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path97 * min(1,node43path97) - currentNode*(min(1, node43path97) - 1))) &  (currentPath'=(97 * min(1, node43path97) - currentPath*(min(1,node43path97) - 1))) & (success'=min(1, node43path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path98 * min(1,node43path98) - currentNode*(min(1, node43path98) - 1))) &  (currentPath'=(98 * min(1, node43path98) - currentPath*(min(1,node43path98) - 1))) & (success'=min(1, node43path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path99 * min(1,node43path99) - currentNode*(min(1, node43path99) - 1))) &  (currentPath'=(99 * min(1, node43path99) - currentPath*(min(1,node43path99) - 1))) & (success'=min(1, node43path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node43path100 * min(1,node43path100) - currentNode*(min(1, node43path100) - 1))) &  (currentPath'=(100 * min(1, node43path100) - currentPath*(min(1,node43path100) - 1))) & (success'=min(1, node43path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 44) ->
 numPathsInv: (currentNode'=(node44path1 * min(1,node44path1) - currentNode*(min(1, node44path1) - 1))) &  (currentPath'=(1 * min(1, node44path1) - currentPath*(min(1,node44path1) - 1))) & (success'=min(1, node44path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path2 * min(1,node44path2) - currentNode*(min(1, node44path2) - 1))) &  (currentPath'=(2 * min(1, node44path2) - currentPath*(min(1,node44path2) - 1))) & (success'=min(1, node44path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path3 * min(1,node44path3) - currentNode*(min(1, node44path3) - 1))) &  (currentPath'=(3 * min(1, node44path3) - currentPath*(min(1,node44path3) - 1))) & (success'=min(1, node44path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path4 * min(1,node44path4) - currentNode*(min(1, node44path4) - 1))) &  (currentPath'=(4 * min(1, node44path4) - currentPath*(min(1,node44path4) - 1))) & (success'=min(1, node44path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path5 * min(1,node44path5) - currentNode*(min(1, node44path5) - 1))) &  (currentPath'=(5 * min(1, node44path5) - currentPath*(min(1,node44path5) - 1))) & (success'=min(1, node44path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path6 * min(1,node44path6) - currentNode*(min(1, node44path6) - 1))) &  (currentPath'=(6 * min(1, node44path6) - currentPath*(min(1,node44path6) - 1))) & (success'=min(1, node44path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path7 * min(1,node44path7) - currentNode*(min(1, node44path7) - 1))) &  (currentPath'=(7 * min(1, node44path7) - currentPath*(min(1,node44path7) - 1))) & (success'=min(1, node44path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path8 * min(1,node44path8) - currentNode*(min(1, node44path8) - 1))) &  (currentPath'=(8 * min(1, node44path8) - currentPath*(min(1,node44path8) - 1))) & (success'=min(1, node44path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path9 * min(1,node44path9) - currentNode*(min(1, node44path9) - 1))) &  (currentPath'=(9 * min(1, node44path9) - currentPath*(min(1,node44path9) - 1))) & (success'=min(1, node44path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path10 * min(1,node44path10) - currentNode*(min(1, node44path10) - 1))) &  (currentPath'=(10 * min(1, node44path10) - currentPath*(min(1,node44path10) - 1))) & (success'=min(1, node44path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path11 * min(1,node44path11) - currentNode*(min(1, node44path11) - 1))) &  (currentPath'=(11 * min(1, node44path11) - currentPath*(min(1,node44path11) - 1))) & (success'=min(1, node44path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path12 * min(1,node44path12) - currentNode*(min(1, node44path12) - 1))) &  (currentPath'=(12 * min(1, node44path12) - currentPath*(min(1,node44path12) - 1))) & (success'=min(1, node44path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path13 * min(1,node44path13) - currentNode*(min(1, node44path13) - 1))) &  (currentPath'=(13 * min(1, node44path13) - currentPath*(min(1,node44path13) - 1))) & (success'=min(1, node44path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path14 * min(1,node44path14) - currentNode*(min(1, node44path14) - 1))) &  (currentPath'=(14 * min(1, node44path14) - currentPath*(min(1,node44path14) - 1))) & (success'=min(1, node44path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path15 * min(1,node44path15) - currentNode*(min(1, node44path15) - 1))) &  (currentPath'=(15 * min(1, node44path15) - currentPath*(min(1,node44path15) - 1))) & (success'=min(1, node44path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path16 * min(1,node44path16) - currentNode*(min(1, node44path16) - 1))) &  (currentPath'=(16 * min(1, node44path16) - currentPath*(min(1,node44path16) - 1))) & (success'=min(1, node44path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path17 * min(1,node44path17) - currentNode*(min(1, node44path17) - 1))) &  (currentPath'=(17 * min(1, node44path17) - currentPath*(min(1,node44path17) - 1))) & (success'=min(1, node44path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path18 * min(1,node44path18) - currentNode*(min(1, node44path18) - 1))) &  (currentPath'=(18 * min(1, node44path18) - currentPath*(min(1,node44path18) - 1))) & (success'=min(1, node44path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path19 * min(1,node44path19) - currentNode*(min(1, node44path19) - 1))) &  (currentPath'=(19 * min(1, node44path19) - currentPath*(min(1,node44path19) - 1))) & (success'=min(1, node44path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path20 * min(1,node44path20) - currentNode*(min(1, node44path20) - 1))) &  (currentPath'=(20 * min(1, node44path20) - currentPath*(min(1,node44path20) - 1))) & (success'=min(1, node44path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path21 * min(1,node44path21) - currentNode*(min(1, node44path21) - 1))) &  (currentPath'=(21 * min(1, node44path21) - currentPath*(min(1,node44path21) - 1))) & (success'=min(1, node44path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path22 * min(1,node44path22) - currentNode*(min(1, node44path22) - 1))) &  (currentPath'=(22 * min(1, node44path22) - currentPath*(min(1,node44path22) - 1))) & (success'=min(1, node44path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path23 * min(1,node44path23) - currentNode*(min(1, node44path23) - 1))) &  (currentPath'=(23 * min(1, node44path23) - currentPath*(min(1,node44path23) - 1))) & (success'=min(1, node44path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path24 * min(1,node44path24) - currentNode*(min(1, node44path24) - 1))) &  (currentPath'=(24 * min(1, node44path24) - currentPath*(min(1,node44path24) - 1))) & (success'=min(1, node44path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path25 * min(1,node44path25) - currentNode*(min(1, node44path25) - 1))) &  (currentPath'=(25 * min(1, node44path25) - currentPath*(min(1,node44path25) - 1))) & (success'=min(1, node44path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path26 * min(1,node44path26) - currentNode*(min(1, node44path26) - 1))) &  (currentPath'=(26 * min(1, node44path26) - currentPath*(min(1,node44path26) - 1))) & (success'=min(1, node44path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path27 * min(1,node44path27) - currentNode*(min(1, node44path27) - 1))) &  (currentPath'=(27 * min(1, node44path27) - currentPath*(min(1,node44path27) - 1))) & (success'=min(1, node44path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path28 * min(1,node44path28) - currentNode*(min(1, node44path28) - 1))) &  (currentPath'=(28 * min(1, node44path28) - currentPath*(min(1,node44path28) - 1))) & (success'=min(1, node44path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path29 * min(1,node44path29) - currentNode*(min(1, node44path29) - 1))) &  (currentPath'=(29 * min(1, node44path29) - currentPath*(min(1,node44path29) - 1))) & (success'=min(1, node44path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path30 * min(1,node44path30) - currentNode*(min(1, node44path30) - 1))) &  (currentPath'=(30 * min(1, node44path30) - currentPath*(min(1,node44path30) - 1))) & (success'=min(1, node44path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path31 * min(1,node44path31) - currentNode*(min(1, node44path31) - 1))) &  (currentPath'=(31 * min(1, node44path31) - currentPath*(min(1,node44path31) - 1))) & (success'=min(1, node44path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path32 * min(1,node44path32) - currentNode*(min(1, node44path32) - 1))) &  (currentPath'=(32 * min(1, node44path32) - currentPath*(min(1,node44path32) - 1))) & (success'=min(1, node44path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path33 * min(1,node44path33) - currentNode*(min(1, node44path33) - 1))) &  (currentPath'=(33 * min(1, node44path33) - currentPath*(min(1,node44path33) - 1))) & (success'=min(1, node44path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path34 * min(1,node44path34) - currentNode*(min(1, node44path34) - 1))) &  (currentPath'=(34 * min(1, node44path34) - currentPath*(min(1,node44path34) - 1))) & (success'=min(1, node44path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path35 * min(1,node44path35) - currentNode*(min(1, node44path35) - 1))) &  (currentPath'=(35 * min(1, node44path35) - currentPath*(min(1,node44path35) - 1))) & (success'=min(1, node44path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path36 * min(1,node44path36) - currentNode*(min(1, node44path36) - 1))) &  (currentPath'=(36 * min(1, node44path36) - currentPath*(min(1,node44path36) - 1))) & (success'=min(1, node44path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path37 * min(1,node44path37) - currentNode*(min(1, node44path37) - 1))) &  (currentPath'=(37 * min(1, node44path37) - currentPath*(min(1,node44path37) - 1))) & (success'=min(1, node44path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path38 * min(1,node44path38) - currentNode*(min(1, node44path38) - 1))) &  (currentPath'=(38 * min(1, node44path38) - currentPath*(min(1,node44path38) - 1))) & (success'=min(1, node44path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path39 * min(1,node44path39) - currentNode*(min(1, node44path39) - 1))) &  (currentPath'=(39 * min(1, node44path39) - currentPath*(min(1,node44path39) - 1))) & (success'=min(1, node44path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path40 * min(1,node44path40) - currentNode*(min(1, node44path40) - 1))) &  (currentPath'=(40 * min(1, node44path40) - currentPath*(min(1,node44path40) - 1))) & (success'=min(1, node44path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path41 * min(1,node44path41) - currentNode*(min(1, node44path41) - 1))) &  (currentPath'=(41 * min(1, node44path41) - currentPath*(min(1,node44path41) - 1))) & (success'=min(1, node44path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path42 * min(1,node44path42) - currentNode*(min(1, node44path42) - 1))) &  (currentPath'=(42 * min(1, node44path42) - currentPath*(min(1,node44path42) - 1))) & (success'=min(1, node44path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path43 * min(1,node44path43) - currentNode*(min(1, node44path43) - 1))) &  (currentPath'=(43 * min(1, node44path43) - currentPath*(min(1,node44path43) - 1))) & (success'=min(1, node44path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path44 * min(1,node44path44) - currentNode*(min(1, node44path44) - 1))) &  (currentPath'=(44 * min(1, node44path44) - currentPath*(min(1,node44path44) - 1))) & (success'=min(1, node44path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path45 * min(1,node44path45) - currentNode*(min(1, node44path45) - 1))) &  (currentPath'=(45 * min(1, node44path45) - currentPath*(min(1,node44path45) - 1))) & (success'=min(1, node44path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path46 * min(1,node44path46) - currentNode*(min(1, node44path46) - 1))) &  (currentPath'=(46 * min(1, node44path46) - currentPath*(min(1,node44path46) - 1))) & (success'=min(1, node44path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path47 * min(1,node44path47) - currentNode*(min(1, node44path47) - 1))) &  (currentPath'=(47 * min(1, node44path47) - currentPath*(min(1,node44path47) - 1))) & (success'=min(1, node44path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path48 * min(1,node44path48) - currentNode*(min(1, node44path48) - 1))) &  (currentPath'=(48 * min(1, node44path48) - currentPath*(min(1,node44path48) - 1))) & (success'=min(1, node44path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path49 * min(1,node44path49) - currentNode*(min(1, node44path49) - 1))) &  (currentPath'=(49 * min(1, node44path49) - currentPath*(min(1,node44path49) - 1))) & (success'=min(1, node44path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path50 * min(1,node44path50) - currentNode*(min(1, node44path50) - 1))) &  (currentPath'=(50 * min(1, node44path50) - currentPath*(min(1,node44path50) - 1))) & (success'=min(1, node44path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path51 * min(1,node44path51) - currentNode*(min(1, node44path51) - 1))) &  (currentPath'=(51 * min(1, node44path51) - currentPath*(min(1,node44path51) - 1))) & (success'=min(1, node44path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path52 * min(1,node44path52) - currentNode*(min(1, node44path52) - 1))) &  (currentPath'=(52 * min(1, node44path52) - currentPath*(min(1,node44path52) - 1))) & (success'=min(1, node44path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path53 * min(1,node44path53) - currentNode*(min(1, node44path53) - 1))) &  (currentPath'=(53 * min(1, node44path53) - currentPath*(min(1,node44path53) - 1))) & (success'=min(1, node44path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path54 * min(1,node44path54) - currentNode*(min(1, node44path54) - 1))) &  (currentPath'=(54 * min(1, node44path54) - currentPath*(min(1,node44path54) - 1))) & (success'=min(1, node44path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path55 * min(1,node44path55) - currentNode*(min(1, node44path55) - 1))) &  (currentPath'=(55 * min(1, node44path55) - currentPath*(min(1,node44path55) - 1))) & (success'=min(1, node44path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path56 * min(1,node44path56) - currentNode*(min(1, node44path56) - 1))) &  (currentPath'=(56 * min(1, node44path56) - currentPath*(min(1,node44path56) - 1))) & (success'=min(1, node44path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path57 * min(1,node44path57) - currentNode*(min(1, node44path57) - 1))) &  (currentPath'=(57 * min(1, node44path57) - currentPath*(min(1,node44path57) - 1))) & (success'=min(1, node44path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path58 * min(1,node44path58) - currentNode*(min(1, node44path58) - 1))) &  (currentPath'=(58 * min(1, node44path58) - currentPath*(min(1,node44path58) - 1))) & (success'=min(1, node44path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path59 * min(1,node44path59) - currentNode*(min(1, node44path59) - 1))) &  (currentPath'=(59 * min(1, node44path59) - currentPath*(min(1,node44path59) - 1))) & (success'=min(1, node44path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path60 * min(1,node44path60) - currentNode*(min(1, node44path60) - 1))) &  (currentPath'=(60 * min(1, node44path60) - currentPath*(min(1,node44path60) - 1))) & (success'=min(1, node44path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path61 * min(1,node44path61) - currentNode*(min(1, node44path61) - 1))) &  (currentPath'=(61 * min(1, node44path61) - currentPath*(min(1,node44path61) - 1))) & (success'=min(1, node44path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path62 * min(1,node44path62) - currentNode*(min(1, node44path62) - 1))) &  (currentPath'=(62 * min(1, node44path62) - currentPath*(min(1,node44path62) - 1))) & (success'=min(1, node44path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path63 * min(1,node44path63) - currentNode*(min(1, node44path63) - 1))) &  (currentPath'=(63 * min(1, node44path63) - currentPath*(min(1,node44path63) - 1))) & (success'=min(1, node44path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path64 * min(1,node44path64) - currentNode*(min(1, node44path64) - 1))) &  (currentPath'=(64 * min(1, node44path64) - currentPath*(min(1,node44path64) - 1))) & (success'=min(1, node44path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path65 * min(1,node44path65) - currentNode*(min(1, node44path65) - 1))) &  (currentPath'=(65 * min(1, node44path65) - currentPath*(min(1,node44path65) - 1))) & (success'=min(1, node44path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path66 * min(1,node44path66) - currentNode*(min(1, node44path66) - 1))) &  (currentPath'=(66 * min(1, node44path66) - currentPath*(min(1,node44path66) - 1))) & (success'=min(1, node44path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path67 * min(1,node44path67) - currentNode*(min(1, node44path67) - 1))) &  (currentPath'=(67 * min(1, node44path67) - currentPath*(min(1,node44path67) - 1))) & (success'=min(1, node44path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path68 * min(1,node44path68) - currentNode*(min(1, node44path68) - 1))) &  (currentPath'=(68 * min(1, node44path68) - currentPath*(min(1,node44path68) - 1))) & (success'=min(1, node44path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path69 * min(1,node44path69) - currentNode*(min(1, node44path69) - 1))) &  (currentPath'=(69 * min(1, node44path69) - currentPath*(min(1,node44path69) - 1))) & (success'=min(1, node44path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path70 * min(1,node44path70) - currentNode*(min(1, node44path70) - 1))) &  (currentPath'=(70 * min(1, node44path70) - currentPath*(min(1,node44path70) - 1))) & (success'=min(1, node44path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path71 * min(1,node44path71) - currentNode*(min(1, node44path71) - 1))) &  (currentPath'=(71 * min(1, node44path71) - currentPath*(min(1,node44path71) - 1))) & (success'=min(1, node44path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path72 * min(1,node44path72) - currentNode*(min(1, node44path72) - 1))) &  (currentPath'=(72 * min(1, node44path72) - currentPath*(min(1,node44path72) - 1))) & (success'=min(1, node44path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path73 * min(1,node44path73) - currentNode*(min(1, node44path73) - 1))) &  (currentPath'=(73 * min(1, node44path73) - currentPath*(min(1,node44path73) - 1))) & (success'=min(1, node44path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path74 * min(1,node44path74) - currentNode*(min(1, node44path74) - 1))) &  (currentPath'=(74 * min(1, node44path74) - currentPath*(min(1,node44path74) - 1))) & (success'=min(1, node44path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path75 * min(1,node44path75) - currentNode*(min(1, node44path75) - 1))) &  (currentPath'=(75 * min(1, node44path75) - currentPath*(min(1,node44path75) - 1))) & (success'=min(1, node44path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path76 * min(1,node44path76) - currentNode*(min(1, node44path76) - 1))) &  (currentPath'=(76 * min(1, node44path76) - currentPath*(min(1,node44path76) - 1))) & (success'=min(1, node44path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path77 * min(1,node44path77) - currentNode*(min(1, node44path77) - 1))) &  (currentPath'=(77 * min(1, node44path77) - currentPath*(min(1,node44path77) - 1))) & (success'=min(1, node44path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path78 * min(1,node44path78) - currentNode*(min(1, node44path78) - 1))) &  (currentPath'=(78 * min(1, node44path78) - currentPath*(min(1,node44path78) - 1))) & (success'=min(1, node44path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path79 * min(1,node44path79) - currentNode*(min(1, node44path79) - 1))) &  (currentPath'=(79 * min(1, node44path79) - currentPath*(min(1,node44path79) - 1))) & (success'=min(1, node44path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path80 * min(1,node44path80) - currentNode*(min(1, node44path80) - 1))) &  (currentPath'=(80 * min(1, node44path80) - currentPath*(min(1,node44path80) - 1))) & (success'=min(1, node44path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path81 * min(1,node44path81) - currentNode*(min(1, node44path81) - 1))) &  (currentPath'=(81 * min(1, node44path81) - currentPath*(min(1,node44path81) - 1))) & (success'=min(1, node44path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path82 * min(1,node44path82) - currentNode*(min(1, node44path82) - 1))) &  (currentPath'=(82 * min(1, node44path82) - currentPath*(min(1,node44path82) - 1))) & (success'=min(1, node44path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path83 * min(1,node44path83) - currentNode*(min(1, node44path83) - 1))) &  (currentPath'=(83 * min(1, node44path83) - currentPath*(min(1,node44path83) - 1))) & (success'=min(1, node44path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path84 * min(1,node44path84) - currentNode*(min(1, node44path84) - 1))) &  (currentPath'=(84 * min(1, node44path84) - currentPath*(min(1,node44path84) - 1))) & (success'=min(1, node44path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path85 * min(1,node44path85) - currentNode*(min(1, node44path85) - 1))) &  (currentPath'=(85 * min(1, node44path85) - currentPath*(min(1,node44path85) - 1))) & (success'=min(1, node44path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path86 * min(1,node44path86) - currentNode*(min(1, node44path86) - 1))) &  (currentPath'=(86 * min(1, node44path86) - currentPath*(min(1,node44path86) - 1))) & (success'=min(1, node44path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path87 * min(1,node44path87) - currentNode*(min(1, node44path87) - 1))) &  (currentPath'=(87 * min(1, node44path87) - currentPath*(min(1,node44path87) - 1))) & (success'=min(1, node44path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path88 * min(1,node44path88) - currentNode*(min(1, node44path88) - 1))) &  (currentPath'=(88 * min(1, node44path88) - currentPath*(min(1,node44path88) - 1))) & (success'=min(1, node44path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path89 * min(1,node44path89) - currentNode*(min(1, node44path89) - 1))) &  (currentPath'=(89 * min(1, node44path89) - currentPath*(min(1,node44path89) - 1))) & (success'=min(1, node44path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path90 * min(1,node44path90) - currentNode*(min(1, node44path90) - 1))) &  (currentPath'=(90 * min(1, node44path90) - currentPath*(min(1,node44path90) - 1))) & (success'=min(1, node44path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path91 * min(1,node44path91) - currentNode*(min(1, node44path91) - 1))) &  (currentPath'=(91 * min(1, node44path91) - currentPath*(min(1,node44path91) - 1))) & (success'=min(1, node44path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path92 * min(1,node44path92) - currentNode*(min(1, node44path92) - 1))) &  (currentPath'=(92 * min(1, node44path92) - currentPath*(min(1,node44path92) - 1))) & (success'=min(1, node44path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path93 * min(1,node44path93) - currentNode*(min(1, node44path93) - 1))) &  (currentPath'=(93 * min(1, node44path93) - currentPath*(min(1,node44path93) - 1))) & (success'=min(1, node44path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path94 * min(1,node44path94) - currentNode*(min(1, node44path94) - 1))) &  (currentPath'=(94 * min(1, node44path94) - currentPath*(min(1,node44path94) - 1))) & (success'=min(1, node44path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path95 * min(1,node44path95) - currentNode*(min(1, node44path95) - 1))) &  (currentPath'=(95 * min(1, node44path95) - currentPath*(min(1,node44path95) - 1))) & (success'=min(1, node44path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path96 * min(1,node44path96) - currentNode*(min(1, node44path96) - 1))) &  (currentPath'=(96 * min(1, node44path96) - currentPath*(min(1,node44path96) - 1))) & (success'=min(1, node44path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path97 * min(1,node44path97) - currentNode*(min(1, node44path97) - 1))) &  (currentPath'=(97 * min(1, node44path97) - currentPath*(min(1,node44path97) - 1))) & (success'=min(1, node44path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path98 * min(1,node44path98) - currentNode*(min(1, node44path98) - 1))) &  (currentPath'=(98 * min(1, node44path98) - currentPath*(min(1,node44path98) - 1))) & (success'=min(1, node44path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path99 * min(1,node44path99) - currentNode*(min(1, node44path99) - 1))) &  (currentPath'=(99 * min(1, node44path99) - currentPath*(min(1,node44path99) - 1))) & (success'=min(1, node44path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node44path100 * min(1,node44path100) - currentNode*(min(1, node44path100) - 1))) &  (currentPath'=(100 * min(1, node44path100) - currentPath*(min(1,node44path100) - 1))) & (success'=min(1, node44path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 45) ->
 numPathsInv: (currentNode'=(node45path1 * min(1,node45path1) - currentNode*(min(1, node45path1) - 1))) &  (currentPath'=(1 * min(1, node45path1) - currentPath*(min(1,node45path1) - 1))) & (success'=min(1, node45path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path2 * min(1,node45path2) - currentNode*(min(1, node45path2) - 1))) &  (currentPath'=(2 * min(1, node45path2) - currentPath*(min(1,node45path2) - 1))) & (success'=min(1, node45path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path3 * min(1,node45path3) - currentNode*(min(1, node45path3) - 1))) &  (currentPath'=(3 * min(1, node45path3) - currentPath*(min(1,node45path3) - 1))) & (success'=min(1, node45path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path4 * min(1,node45path4) - currentNode*(min(1, node45path4) - 1))) &  (currentPath'=(4 * min(1, node45path4) - currentPath*(min(1,node45path4) - 1))) & (success'=min(1, node45path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path5 * min(1,node45path5) - currentNode*(min(1, node45path5) - 1))) &  (currentPath'=(5 * min(1, node45path5) - currentPath*(min(1,node45path5) - 1))) & (success'=min(1, node45path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path6 * min(1,node45path6) - currentNode*(min(1, node45path6) - 1))) &  (currentPath'=(6 * min(1, node45path6) - currentPath*(min(1,node45path6) - 1))) & (success'=min(1, node45path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path7 * min(1,node45path7) - currentNode*(min(1, node45path7) - 1))) &  (currentPath'=(7 * min(1, node45path7) - currentPath*(min(1,node45path7) - 1))) & (success'=min(1, node45path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path8 * min(1,node45path8) - currentNode*(min(1, node45path8) - 1))) &  (currentPath'=(8 * min(1, node45path8) - currentPath*(min(1,node45path8) - 1))) & (success'=min(1, node45path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path9 * min(1,node45path9) - currentNode*(min(1, node45path9) - 1))) &  (currentPath'=(9 * min(1, node45path9) - currentPath*(min(1,node45path9) - 1))) & (success'=min(1, node45path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path10 * min(1,node45path10) - currentNode*(min(1, node45path10) - 1))) &  (currentPath'=(10 * min(1, node45path10) - currentPath*(min(1,node45path10) - 1))) & (success'=min(1, node45path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path11 * min(1,node45path11) - currentNode*(min(1, node45path11) - 1))) &  (currentPath'=(11 * min(1, node45path11) - currentPath*(min(1,node45path11) - 1))) & (success'=min(1, node45path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path12 * min(1,node45path12) - currentNode*(min(1, node45path12) - 1))) &  (currentPath'=(12 * min(1, node45path12) - currentPath*(min(1,node45path12) - 1))) & (success'=min(1, node45path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path13 * min(1,node45path13) - currentNode*(min(1, node45path13) - 1))) &  (currentPath'=(13 * min(1, node45path13) - currentPath*(min(1,node45path13) - 1))) & (success'=min(1, node45path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path14 * min(1,node45path14) - currentNode*(min(1, node45path14) - 1))) &  (currentPath'=(14 * min(1, node45path14) - currentPath*(min(1,node45path14) - 1))) & (success'=min(1, node45path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path15 * min(1,node45path15) - currentNode*(min(1, node45path15) - 1))) &  (currentPath'=(15 * min(1, node45path15) - currentPath*(min(1,node45path15) - 1))) & (success'=min(1, node45path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path16 * min(1,node45path16) - currentNode*(min(1, node45path16) - 1))) &  (currentPath'=(16 * min(1, node45path16) - currentPath*(min(1,node45path16) - 1))) & (success'=min(1, node45path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path17 * min(1,node45path17) - currentNode*(min(1, node45path17) - 1))) &  (currentPath'=(17 * min(1, node45path17) - currentPath*(min(1,node45path17) - 1))) & (success'=min(1, node45path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path18 * min(1,node45path18) - currentNode*(min(1, node45path18) - 1))) &  (currentPath'=(18 * min(1, node45path18) - currentPath*(min(1,node45path18) - 1))) & (success'=min(1, node45path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path19 * min(1,node45path19) - currentNode*(min(1, node45path19) - 1))) &  (currentPath'=(19 * min(1, node45path19) - currentPath*(min(1,node45path19) - 1))) & (success'=min(1, node45path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path20 * min(1,node45path20) - currentNode*(min(1, node45path20) - 1))) &  (currentPath'=(20 * min(1, node45path20) - currentPath*(min(1,node45path20) - 1))) & (success'=min(1, node45path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path21 * min(1,node45path21) - currentNode*(min(1, node45path21) - 1))) &  (currentPath'=(21 * min(1, node45path21) - currentPath*(min(1,node45path21) - 1))) & (success'=min(1, node45path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path22 * min(1,node45path22) - currentNode*(min(1, node45path22) - 1))) &  (currentPath'=(22 * min(1, node45path22) - currentPath*(min(1,node45path22) - 1))) & (success'=min(1, node45path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path23 * min(1,node45path23) - currentNode*(min(1, node45path23) - 1))) &  (currentPath'=(23 * min(1, node45path23) - currentPath*(min(1,node45path23) - 1))) & (success'=min(1, node45path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path24 * min(1,node45path24) - currentNode*(min(1, node45path24) - 1))) &  (currentPath'=(24 * min(1, node45path24) - currentPath*(min(1,node45path24) - 1))) & (success'=min(1, node45path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path25 * min(1,node45path25) - currentNode*(min(1, node45path25) - 1))) &  (currentPath'=(25 * min(1, node45path25) - currentPath*(min(1,node45path25) - 1))) & (success'=min(1, node45path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path26 * min(1,node45path26) - currentNode*(min(1, node45path26) - 1))) &  (currentPath'=(26 * min(1, node45path26) - currentPath*(min(1,node45path26) - 1))) & (success'=min(1, node45path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path27 * min(1,node45path27) - currentNode*(min(1, node45path27) - 1))) &  (currentPath'=(27 * min(1, node45path27) - currentPath*(min(1,node45path27) - 1))) & (success'=min(1, node45path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path28 * min(1,node45path28) - currentNode*(min(1, node45path28) - 1))) &  (currentPath'=(28 * min(1, node45path28) - currentPath*(min(1,node45path28) - 1))) & (success'=min(1, node45path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path29 * min(1,node45path29) - currentNode*(min(1, node45path29) - 1))) &  (currentPath'=(29 * min(1, node45path29) - currentPath*(min(1,node45path29) - 1))) & (success'=min(1, node45path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path30 * min(1,node45path30) - currentNode*(min(1, node45path30) - 1))) &  (currentPath'=(30 * min(1, node45path30) - currentPath*(min(1,node45path30) - 1))) & (success'=min(1, node45path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path31 * min(1,node45path31) - currentNode*(min(1, node45path31) - 1))) &  (currentPath'=(31 * min(1, node45path31) - currentPath*(min(1,node45path31) - 1))) & (success'=min(1, node45path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path32 * min(1,node45path32) - currentNode*(min(1, node45path32) - 1))) &  (currentPath'=(32 * min(1, node45path32) - currentPath*(min(1,node45path32) - 1))) & (success'=min(1, node45path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path33 * min(1,node45path33) - currentNode*(min(1, node45path33) - 1))) &  (currentPath'=(33 * min(1, node45path33) - currentPath*(min(1,node45path33) - 1))) & (success'=min(1, node45path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path34 * min(1,node45path34) - currentNode*(min(1, node45path34) - 1))) &  (currentPath'=(34 * min(1, node45path34) - currentPath*(min(1,node45path34) - 1))) & (success'=min(1, node45path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path35 * min(1,node45path35) - currentNode*(min(1, node45path35) - 1))) &  (currentPath'=(35 * min(1, node45path35) - currentPath*(min(1,node45path35) - 1))) & (success'=min(1, node45path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path36 * min(1,node45path36) - currentNode*(min(1, node45path36) - 1))) &  (currentPath'=(36 * min(1, node45path36) - currentPath*(min(1,node45path36) - 1))) & (success'=min(1, node45path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path37 * min(1,node45path37) - currentNode*(min(1, node45path37) - 1))) &  (currentPath'=(37 * min(1, node45path37) - currentPath*(min(1,node45path37) - 1))) & (success'=min(1, node45path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path38 * min(1,node45path38) - currentNode*(min(1, node45path38) - 1))) &  (currentPath'=(38 * min(1, node45path38) - currentPath*(min(1,node45path38) - 1))) & (success'=min(1, node45path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path39 * min(1,node45path39) - currentNode*(min(1, node45path39) - 1))) &  (currentPath'=(39 * min(1, node45path39) - currentPath*(min(1,node45path39) - 1))) & (success'=min(1, node45path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path40 * min(1,node45path40) - currentNode*(min(1, node45path40) - 1))) &  (currentPath'=(40 * min(1, node45path40) - currentPath*(min(1,node45path40) - 1))) & (success'=min(1, node45path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path41 * min(1,node45path41) - currentNode*(min(1, node45path41) - 1))) &  (currentPath'=(41 * min(1, node45path41) - currentPath*(min(1,node45path41) - 1))) & (success'=min(1, node45path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path42 * min(1,node45path42) - currentNode*(min(1, node45path42) - 1))) &  (currentPath'=(42 * min(1, node45path42) - currentPath*(min(1,node45path42) - 1))) & (success'=min(1, node45path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path43 * min(1,node45path43) - currentNode*(min(1, node45path43) - 1))) &  (currentPath'=(43 * min(1, node45path43) - currentPath*(min(1,node45path43) - 1))) & (success'=min(1, node45path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path44 * min(1,node45path44) - currentNode*(min(1, node45path44) - 1))) &  (currentPath'=(44 * min(1, node45path44) - currentPath*(min(1,node45path44) - 1))) & (success'=min(1, node45path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path45 * min(1,node45path45) - currentNode*(min(1, node45path45) - 1))) &  (currentPath'=(45 * min(1, node45path45) - currentPath*(min(1,node45path45) - 1))) & (success'=min(1, node45path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path46 * min(1,node45path46) - currentNode*(min(1, node45path46) - 1))) &  (currentPath'=(46 * min(1, node45path46) - currentPath*(min(1,node45path46) - 1))) & (success'=min(1, node45path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path47 * min(1,node45path47) - currentNode*(min(1, node45path47) - 1))) &  (currentPath'=(47 * min(1, node45path47) - currentPath*(min(1,node45path47) - 1))) & (success'=min(1, node45path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path48 * min(1,node45path48) - currentNode*(min(1, node45path48) - 1))) &  (currentPath'=(48 * min(1, node45path48) - currentPath*(min(1,node45path48) - 1))) & (success'=min(1, node45path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path49 * min(1,node45path49) - currentNode*(min(1, node45path49) - 1))) &  (currentPath'=(49 * min(1, node45path49) - currentPath*(min(1,node45path49) - 1))) & (success'=min(1, node45path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path50 * min(1,node45path50) - currentNode*(min(1, node45path50) - 1))) &  (currentPath'=(50 * min(1, node45path50) - currentPath*(min(1,node45path50) - 1))) & (success'=min(1, node45path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path51 * min(1,node45path51) - currentNode*(min(1, node45path51) - 1))) &  (currentPath'=(51 * min(1, node45path51) - currentPath*(min(1,node45path51) - 1))) & (success'=min(1, node45path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path52 * min(1,node45path52) - currentNode*(min(1, node45path52) - 1))) &  (currentPath'=(52 * min(1, node45path52) - currentPath*(min(1,node45path52) - 1))) & (success'=min(1, node45path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path53 * min(1,node45path53) - currentNode*(min(1, node45path53) - 1))) &  (currentPath'=(53 * min(1, node45path53) - currentPath*(min(1,node45path53) - 1))) & (success'=min(1, node45path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path54 * min(1,node45path54) - currentNode*(min(1, node45path54) - 1))) &  (currentPath'=(54 * min(1, node45path54) - currentPath*(min(1,node45path54) - 1))) & (success'=min(1, node45path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path55 * min(1,node45path55) - currentNode*(min(1, node45path55) - 1))) &  (currentPath'=(55 * min(1, node45path55) - currentPath*(min(1,node45path55) - 1))) & (success'=min(1, node45path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path56 * min(1,node45path56) - currentNode*(min(1, node45path56) - 1))) &  (currentPath'=(56 * min(1, node45path56) - currentPath*(min(1,node45path56) - 1))) & (success'=min(1, node45path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path57 * min(1,node45path57) - currentNode*(min(1, node45path57) - 1))) &  (currentPath'=(57 * min(1, node45path57) - currentPath*(min(1,node45path57) - 1))) & (success'=min(1, node45path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path58 * min(1,node45path58) - currentNode*(min(1, node45path58) - 1))) &  (currentPath'=(58 * min(1, node45path58) - currentPath*(min(1,node45path58) - 1))) & (success'=min(1, node45path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path59 * min(1,node45path59) - currentNode*(min(1, node45path59) - 1))) &  (currentPath'=(59 * min(1, node45path59) - currentPath*(min(1,node45path59) - 1))) & (success'=min(1, node45path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path60 * min(1,node45path60) - currentNode*(min(1, node45path60) - 1))) &  (currentPath'=(60 * min(1, node45path60) - currentPath*(min(1,node45path60) - 1))) & (success'=min(1, node45path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path61 * min(1,node45path61) - currentNode*(min(1, node45path61) - 1))) &  (currentPath'=(61 * min(1, node45path61) - currentPath*(min(1,node45path61) - 1))) & (success'=min(1, node45path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path62 * min(1,node45path62) - currentNode*(min(1, node45path62) - 1))) &  (currentPath'=(62 * min(1, node45path62) - currentPath*(min(1,node45path62) - 1))) & (success'=min(1, node45path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path63 * min(1,node45path63) - currentNode*(min(1, node45path63) - 1))) &  (currentPath'=(63 * min(1, node45path63) - currentPath*(min(1,node45path63) - 1))) & (success'=min(1, node45path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path64 * min(1,node45path64) - currentNode*(min(1, node45path64) - 1))) &  (currentPath'=(64 * min(1, node45path64) - currentPath*(min(1,node45path64) - 1))) & (success'=min(1, node45path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path65 * min(1,node45path65) - currentNode*(min(1, node45path65) - 1))) &  (currentPath'=(65 * min(1, node45path65) - currentPath*(min(1,node45path65) - 1))) & (success'=min(1, node45path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path66 * min(1,node45path66) - currentNode*(min(1, node45path66) - 1))) &  (currentPath'=(66 * min(1, node45path66) - currentPath*(min(1,node45path66) - 1))) & (success'=min(1, node45path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path67 * min(1,node45path67) - currentNode*(min(1, node45path67) - 1))) &  (currentPath'=(67 * min(1, node45path67) - currentPath*(min(1,node45path67) - 1))) & (success'=min(1, node45path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path68 * min(1,node45path68) - currentNode*(min(1, node45path68) - 1))) &  (currentPath'=(68 * min(1, node45path68) - currentPath*(min(1,node45path68) - 1))) & (success'=min(1, node45path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path69 * min(1,node45path69) - currentNode*(min(1, node45path69) - 1))) &  (currentPath'=(69 * min(1, node45path69) - currentPath*(min(1,node45path69) - 1))) & (success'=min(1, node45path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path70 * min(1,node45path70) - currentNode*(min(1, node45path70) - 1))) &  (currentPath'=(70 * min(1, node45path70) - currentPath*(min(1,node45path70) - 1))) & (success'=min(1, node45path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path71 * min(1,node45path71) - currentNode*(min(1, node45path71) - 1))) &  (currentPath'=(71 * min(1, node45path71) - currentPath*(min(1,node45path71) - 1))) & (success'=min(1, node45path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path72 * min(1,node45path72) - currentNode*(min(1, node45path72) - 1))) &  (currentPath'=(72 * min(1, node45path72) - currentPath*(min(1,node45path72) - 1))) & (success'=min(1, node45path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path73 * min(1,node45path73) - currentNode*(min(1, node45path73) - 1))) &  (currentPath'=(73 * min(1, node45path73) - currentPath*(min(1,node45path73) - 1))) & (success'=min(1, node45path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path74 * min(1,node45path74) - currentNode*(min(1, node45path74) - 1))) &  (currentPath'=(74 * min(1, node45path74) - currentPath*(min(1,node45path74) - 1))) & (success'=min(1, node45path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path75 * min(1,node45path75) - currentNode*(min(1, node45path75) - 1))) &  (currentPath'=(75 * min(1, node45path75) - currentPath*(min(1,node45path75) - 1))) & (success'=min(1, node45path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path76 * min(1,node45path76) - currentNode*(min(1, node45path76) - 1))) &  (currentPath'=(76 * min(1, node45path76) - currentPath*(min(1,node45path76) - 1))) & (success'=min(1, node45path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path77 * min(1,node45path77) - currentNode*(min(1, node45path77) - 1))) &  (currentPath'=(77 * min(1, node45path77) - currentPath*(min(1,node45path77) - 1))) & (success'=min(1, node45path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path78 * min(1,node45path78) - currentNode*(min(1, node45path78) - 1))) &  (currentPath'=(78 * min(1, node45path78) - currentPath*(min(1,node45path78) - 1))) & (success'=min(1, node45path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path79 * min(1,node45path79) - currentNode*(min(1, node45path79) - 1))) &  (currentPath'=(79 * min(1, node45path79) - currentPath*(min(1,node45path79) - 1))) & (success'=min(1, node45path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path80 * min(1,node45path80) - currentNode*(min(1, node45path80) - 1))) &  (currentPath'=(80 * min(1, node45path80) - currentPath*(min(1,node45path80) - 1))) & (success'=min(1, node45path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path81 * min(1,node45path81) - currentNode*(min(1, node45path81) - 1))) &  (currentPath'=(81 * min(1, node45path81) - currentPath*(min(1,node45path81) - 1))) & (success'=min(1, node45path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path82 * min(1,node45path82) - currentNode*(min(1, node45path82) - 1))) &  (currentPath'=(82 * min(1, node45path82) - currentPath*(min(1,node45path82) - 1))) & (success'=min(1, node45path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path83 * min(1,node45path83) - currentNode*(min(1, node45path83) - 1))) &  (currentPath'=(83 * min(1, node45path83) - currentPath*(min(1,node45path83) - 1))) & (success'=min(1, node45path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path84 * min(1,node45path84) - currentNode*(min(1, node45path84) - 1))) &  (currentPath'=(84 * min(1, node45path84) - currentPath*(min(1,node45path84) - 1))) & (success'=min(1, node45path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path85 * min(1,node45path85) - currentNode*(min(1, node45path85) - 1))) &  (currentPath'=(85 * min(1, node45path85) - currentPath*(min(1,node45path85) - 1))) & (success'=min(1, node45path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path86 * min(1,node45path86) - currentNode*(min(1, node45path86) - 1))) &  (currentPath'=(86 * min(1, node45path86) - currentPath*(min(1,node45path86) - 1))) & (success'=min(1, node45path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path87 * min(1,node45path87) - currentNode*(min(1, node45path87) - 1))) &  (currentPath'=(87 * min(1, node45path87) - currentPath*(min(1,node45path87) - 1))) & (success'=min(1, node45path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path88 * min(1,node45path88) - currentNode*(min(1, node45path88) - 1))) &  (currentPath'=(88 * min(1, node45path88) - currentPath*(min(1,node45path88) - 1))) & (success'=min(1, node45path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path89 * min(1,node45path89) - currentNode*(min(1, node45path89) - 1))) &  (currentPath'=(89 * min(1, node45path89) - currentPath*(min(1,node45path89) - 1))) & (success'=min(1, node45path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path90 * min(1,node45path90) - currentNode*(min(1, node45path90) - 1))) &  (currentPath'=(90 * min(1, node45path90) - currentPath*(min(1,node45path90) - 1))) & (success'=min(1, node45path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path91 * min(1,node45path91) - currentNode*(min(1, node45path91) - 1))) &  (currentPath'=(91 * min(1, node45path91) - currentPath*(min(1,node45path91) - 1))) & (success'=min(1, node45path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path92 * min(1,node45path92) - currentNode*(min(1, node45path92) - 1))) &  (currentPath'=(92 * min(1, node45path92) - currentPath*(min(1,node45path92) - 1))) & (success'=min(1, node45path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path93 * min(1,node45path93) - currentNode*(min(1, node45path93) - 1))) &  (currentPath'=(93 * min(1, node45path93) - currentPath*(min(1,node45path93) - 1))) & (success'=min(1, node45path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path94 * min(1,node45path94) - currentNode*(min(1, node45path94) - 1))) &  (currentPath'=(94 * min(1, node45path94) - currentPath*(min(1,node45path94) - 1))) & (success'=min(1, node45path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path95 * min(1,node45path95) - currentNode*(min(1, node45path95) - 1))) &  (currentPath'=(95 * min(1, node45path95) - currentPath*(min(1,node45path95) - 1))) & (success'=min(1, node45path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path96 * min(1,node45path96) - currentNode*(min(1, node45path96) - 1))) &  (currentPath'=(96 * min(1, node45path96) - currentPath*(min(1,node45path96) - 1))) & (success'=min(1, node45path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path97 * min(1,node45path97) - currentNode*(min(1, node45path97) - 1))) &  (currentPath'=(97 * min(1, node45path97) - currentPath*(min(1,node45path97) - 1))) & (success'=min(1, node45path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path98 * min(1,node45path98) - currentNode*(min(1, node45path98) - 1))) &  (currentPath'=(98 * min(1, node45path98) - currentPath*(min(1,node45path98) - 1))) & (success'=min(1, node45path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path99 * min(1,node45path99) - currentNode*(min(1, node45path99) - 1))) &  (currentPath'=(99 * min(1, node45path99) - currentPath*(min(1,node45path99) - 1))) & (success'=min(1, node45path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node45path100 * min(1,node45path100) - currentNode*(min(1, node45path100) - 1))) &  (currentPath'=(100 * min(1, node45path100) - currentPath*(min(1,node45path100) - 1))) & (success'=min(1, node45path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 46) ->
 numPathsInv: (currentNode'=(node46path1 * min(1,node46path1) - currentNode*(min(1, node46path1) - 1))) &  (currentPath'=(1 * min(1, node46path1) - currentPath*(min(1,node46path1) - 1))) & (success'=min(1, node46path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path2 * min(1,node46path2) - currentNode*(min(1, node46path2) - 1))) &  (currentPath'=(2 * min(1, node46path2) - currentPath*(min(1,node46path2) - 1))) & (success'=min(1, node46path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path3 * min(1,node46path3) - currentNode*(min(1, node46path3) - 1))) &  (currentPath'=(3 * min(1, node46path3) - currentPath*(min(1,node46path3) - 1))) & (success'=min(1, node46path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path4 * min(1,node46path4) - currentNode*(min(1, node46path4) - 1))) &  (currentPath'=(4 * min(1, node46path4) - currentPath*(min(1,node46path4) - 1))) & (success'=min(1, node46path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path5 * min(1,node46path5) - currentNode*(min(1, node46path5) - 1))) &  (currentPath'=(5 * min(1, node46path5) - currentPath*(min(1,node46path5) - 1))) & (success'=min(1, node46path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path6 * min(1,node46path6) - currentNode*(min(1, node46path6) - 1))) &  (currentPath'=(6 * min(1, node46path6) - currentPath*(min(1,node46path6) - 1))) & (success'=min(1, node46path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path7 * min(1,node46path7) - currentNode*(min(1, node46path7) - 1))) &  (currentPath'=(7 * min(1, node46path7) - currentPath*(min(1,node46path7) - 1))) & (success'=min(1, node46path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path8 * min(1,node46path8) - currentNode*(min(1, node46path8) - 1))) &  (currentPath'=(8 * min(1, node46path8) - currentPath*(min(1,node46path8) - 1))) & (success'=min(1, node46path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path9 * min(1,node46path9) - currentNode*(min(1, node46path9) - 1))) &  (currentPath'=(9 * min(1, node46path9) - currentPath*(min(1,node46path9) - 1))) & (success'=min(1, node46path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path10 * min(1,node46path10) - currentNode*(min(1, node46path10) - 1))) &  (currentPath'=(10 * min(1, node46path10) - currentPath*(min(1,node46path10) - 1))) & (success'=min(1, node46path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path11 * min(1,node46path11) - currentNode*(min(1, node46path11) - 1))) &  (currentPath'=(11 * min(1, node46path11) - currentPath*(min(1,node46path11) - 1))) & (success'=min(1, node46path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path12 * min(1,node46path12) - currentNode*(min(1, node46path12) - 1))) &  (currentPath'=(12 * min(1, node46path12) - currentPath*(min(1,node46path12) - 1))) & (success'=min(1, node46path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path13 * min(1,node46path13) - currentNode*(min(1, node46path13) - 1))) &  (currentPath'=(13 * min(1, node46path13) - currentPath*(min(1,node46path13) - 1))) & (success'=min(1, node46path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path14 * min(1,node46path14) - currentNode*(min(1, node46path14) - 1))) &  (currentPath'=(14 * min(1, node46path14) - currentPath*(min(1,node46path14) - 1))) & (success'=min(1, node46path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path15 * min(1,node46path15) - currentNode*(min(1, node46path15) - 1))) &  (currentPath'=(15 * min(1, node46path15) - currentPath*(min(1,node46path15) - 1))) & (success'=min(1, node46path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path16 * min(1,node46path16) - currentNode*(min(1, node46path16) - 1))) &  (currentPath'=(16 * min(1, node46path16) - currentPath*(min(1,node46path16) - 1))) & (success'=min(1, node46path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path17 * min(1,node46path17) - currentNode*(min(1, node46path17) - 1))) &  (currentPath'=(17 * min(1, node46path17) - currentPath*(min(1,node46path17) - 1))) & (success'=min(1, node46path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path18 * min(1,node46path18) - currentNode*(min(1, node46path18) - 1))) &  (currentPath'=(18 * min(1, node46path18) - currentPath*(min(1,node46path18) - 1))) & (success'=min(1, node46path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path19 * min(1,node46path19) - currentNode*(min(1, node46path19) - 1))) &  (currentPath'=(19 * min(1, node46path19) - currentPath*(min(1,node46path19) - 1))) & (success'=min(1, node46path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path20 * min(1,node46path20) - currentNode*(min(1, node46path20) - 1))) &  (currentPath'=(20 * min(1, node46path20) - currentPath*(min(1,node46path20) - 1))) & (success'=min(1, node46path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path21 * min(1,node46path21) - currentNode*(min(1, node46path21) - 1))) &  (currentPath'=(21 * min(1, node46path21) - currentPath*(min(1,node46path21) - 1))) & (success'=min(1, node46path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path22 * min(1,node46path22) - currentNode*(min(1, node46path22) - 1))) &  (currentPath'=(22 * min(1, node46path22) - currentPath*(min(1,node46path22) - 1))) & (success'=min(1, node46path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path23 * min(1,node46path23) - currentNode*(min(1, node46path23) - 1))) &  (currentPath'=(23 * min(1, node46path23) - currentPath*(min(1,node46path23) - 1))) & (success'=min(1, node46path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path24 * min(1,node46path24) - currentNode*(min(1, node46path24) - 1))) &  (currentPath'=(24 * min(1, node46path24) - currentPath*(min(1,node46path24) - 1))) & (success'=min(1, node46path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path25 * min(1,node46path25) - currentNode*(min(1, node46path25) - 1))) &  (currentPath'=(25 * min(1, node46path25) - currentPath*(min(1,node46path25) - 1))) & (success'=min(1, node46path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path26 * min(1,node46path26) - currentNode*(min(1, node46path26) - 1))) &  (currentPath'=(26 * min(1, node46path26) - currentPath*(min(1,node46path26) - 1))) & (success'=min(1, node46path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path27 * min(1,node46path27) - currentNode*(min(1, node46path27) - 1))) &  (currentPath'=(27 * min(1, node46path27) - currentPath*(min(1,node46path27) - 1))) & (success'=min(1, node46path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path28 * min(1,node46path28) - currentNode*(min(1, node46path28) - 1))) &  (currentPath'=(28 * min(1, node46path28) - currentPath*(min(1,node46path28) - 1))) & (success'=min(1, node46path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path29 * min(1,node46path29) - currentNode*(min(1, node46path29) - 1))) &  (currentPath'=(29 * min(1, node46path29) - currentPath*(min(1,node46path29) - 1))) & (success'=min(1, node46path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path30 * min(1,node46path30) - currentNode*(min(1, node46path30) - 1))) &  (currentPath'=(30 * min(1, node46path30) - currentPath*(min(1,node46path30) - 1))) & (success'=min(1, node46path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path31 * min(1,node46path31) - currentNode*(min(1, node46path31) - 1))) &  (currentPath'=(31 * min(1, node46path31) - currentPath*(min(1,node46path31) - 1))) & (success'=min(1, node46path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path32 * min(1,node46path32) - currentNode*(min(1, node46path32) - 1))) &  (currentPath'=(32 * min(1, node46path32) - currentPath*(min(1,node46path32) - 1))) & (success'=min(1, node46path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path33 * min(1,node46path33) - currentNode*(min(1, node46path33) - 1))) &  (currentPath'=(33 * min(1, node46path33) - currentPath*(min(1,node46path33) - 1))) & (success'=min(1, node46path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path34 * min(1,node46path34) - currentNode*(min(1, node46path34) - 1))) &  (currentPath'=(34 * min(1, node46path34) - currentPath*(min(1,node46path34) - 1))) & (success'=min(1, node46path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path35 * min(1,node46path35) - currentNode*(min(1, node46path35) - 1))) &  (currentPath'=(35 * min(1, node46path35) - currentPath*(min(1,node46path35) - 1))) & (success'=min(1, node46path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path36 * min(1,node46path36) - currentNode*(min(1, node46path36) - 1))) &  (currentPath'=(36 * min(1, node46path36) - currentPath*(min(1,node46path36) - 1))) & (success'=min(1, node46path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path37 * min(1,node46path37) - currentNode*(min(1, node46path37) - 1))) &  (currentPath'=(37 * min(1, node46path37) - currentPath*(min(1,node46path37) - 1))) & (success'=min(1, node46path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path38 * min(1,node46path38) - currentNode*(min(1, node46path38) - 1))) &  (currentPath'=(38 * min(1, node46path38) - currentPath*(min(1,node46path38) - 1))) & (success'=min(1, node46path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path39 * min(1,node46path39) - currentNode*(min(1, node46path39) - 1))) &  (currentPath'=(39 * min(1, node46path39) - currentPath*(min(1,node46path39) - 1))) & (success'=min(1, node46path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path40 * min(1,node46path40) - currentNode*(min(1, node46path40) - 1))) &  (currentPath'=(40 * min(1, node46path40) - currentPath*(min(1,node46path40) - 1))) & (success'=min(1, node46path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path41 * min(1,node46path41) - currentNode*(min(1, node46path41) - 1))) &  (currentPath'=(41 * min(1, node46path41) - currentPath*(min(1,node46path41) - 1))) & (success'=min(1, node46path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path42 * min(1,node46path42) - currentNode*(min(1, node46path42) - 1))) &  (currentPath'=(42 * min(1, node46path42) - currentPath*(min(1,node46path42) - 1))) & (success'=min(1, node46path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path43 * min(1,node46path43) - currentNode*(min(1, node46path43) - 1))) &  (currentPath'=(43 * min(1, node46path43) - currentPath*(min(1,node46path43) - 1))) & (success'=min(1, node46path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path44 * min(1,node46path44) - currentNode*(min(1, node46path44) - 1))) &  (currentPath'=(44 * min(1, node46path44) - currentPath*(min(1,node46path44) - 1))) & (success'=min(1, node46path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path45 * min(1,node46path45) - currentNode*(min(1, node46path45) - 1))) &  (currentPath'=(45 * min(1, node46path45) - currentPath*(min(1,node46path45) - 1))) & (success'=min(1, node46path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path46 * min(1,node46path46) - currentNode*(min(1, node46path46) - 1))) &  (currentPath'=(46 * min(1, node46path46) - currentPath*(min(1,node46path46) - 1))) & (success'=min(1, node46path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path47 * min(1,node46path47) - currentNode*(min(1, node46path47) - 1))) &  (currentPath'=(47 * min(1, node46path47) - currentPath*(min(1,node46path47) - 1))) & (success'=min(1, node46path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path48 * min(1,node46path48) - currentNode*(min(1, node46path48) - 1))) &  (currentPath'=(48 * min(1, node46path48) - currentPath*(min(1,node46path48) - 1))) & (success'=min(1, node46path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path49 * min(1,node46path49) - currentNode*(min(1, node46path49) - 1))) &  (currentPath'=(49 * min(1, node46path49) - currentPath*(min(1,node46path49) - 1))) & (success'=min(1, node46path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path50 * min(1,node46path50) - currentNode*(min(1, node46path50) - 1))) &  (currentPath'=(50 * min(1, node46path50) - currentPath*(min(1,node46path50) - 1))) & (success'=min(1, node46path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path51 * min(1,node46path51) - currentNode*(min(1, node46path51) - 1))) &  (currentPath'=(51 * min(1, node46path51) - currentPath*(min(1,node46path51) - 1))) & (success'=min(1, node46path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path52 * min(1,node46path52) - currentNode*(min(1, node46path52) - 1))) &  (currentPath'=(52 * min(1, node46path52) - currentPath*(min(1,node46path52) - 1))) & (success'=min(1, node46path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path53 * min(1,node46path53) - currentNode*(min(1, node46path53) - 1))) &  (currentPath'=(53 * min(1, node46path53) - currentPath*(min(1,node46path53) - 1))) & (success'=min(1, node46path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path54 * min(1,node46path54) - currentNode*(min(1, node46path54) - 1))) &  (currentPath'=(54 * min(1, node46path54) - currentPath*(min(1,node46path54) - 1))) & (success'=min(1, node46path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path55 * min(1,node46path55) - currentNode*(min(1, node46path55) - 1))) &  (currentPath'=(55 * min(1, node46path55) - currentPath*(min(1,node46path55) - 1))) & (success'=min(1, node46path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path56 * min(1,node46path56) - currentNode*(min(1, node46path56) - 1))) &  (currentPath'=(56 * min(1, node46path56) - currentPath*(min(1,node46path56) - 1))) & (success'=min(1, node46path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path57 * min(1,node46path57) - currentNode*(min(1, node46path57) - 1))) &  (currentPath'=(57 * min(1, node46path57) - currentPath*(min(1,node46path57) - 1))) & (success'=min(1, node46path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path58 * min(1,node46path58) - currentNode*(min(1, node46path58) - 1))) &  (currentPath'=(58 * min(1, node46path58) - currentPath*(min(1,node46path58) - 1))) & (success'=min(1, node46path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path59 * min(1,node46path59) - currentNode*(min(1, node46path59) - 1))) &  (currentPath'=(59 * min(1, node46path59) - currentPath*(min(1,node46path59) - 1))) & (success'=min(1, node46path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path60 * min(1,node46path60) - currentNode*(min(1, node46path60) - 1))) &  (currentPath'=(60 * min(1, node46path60) - currentPath*(min(1,node46path60) - 1))) & (success'=min(1, node46path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path61 * min(1,node46path61) - currentNode*(min(1, node46path61) - 1))) &  (currentPath'=(61 * min(1, node46path61) - currentPath*(min(1,node46path61) - 1))) & (success'=min(1, node46path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path62 * min(1,node46path62) - currentNode*(min(1, node46path62) - 1))) &  (currentPath'=(62 * min(1, node46path62) - currentPath*(min(1,node46path62) - 1))) & (success'=min(1, node46path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path63 * min(1,node46path63) - currentNode*(min(1, node46path63) - 1))) &  (currentPath'=(63 * min(1, node46path63) - currentPath*(min(1,node46path63) - 1))) & (success'=min(1, node46path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path64 * min(1,node46path64) - currentNode*(min(1, node46path64) - 1))) &  (currentPath'=(64 * min(1, node46path64) - currentPath*(min(1,node46path64) - 1))) & (success'=min(1, node46path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path65 * min(1,node46path65) - currentNode*(min(1, node46path65) - 1))) &  (currentPath'=(65 * min(1, node46path65) - currentPath*(min(1,node46path65) - 1))) & (success'=min(1, node46path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path66 * min(1,node46path66) - currentNode*(min(1, node46path66) - 1))) &  (currentPath'=(66 * min(1, node46path66) - currentPath*(min(1,node46path66) - 1))) & (success'=min(1, node46path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path67 * min(1,node46path67) - currentNode*(min(1, node46path67) - 1))) &  (currentPath'=(67 * min(1, node46path67) - currentPath*(min(1,node46path67) - 1))) & (success'=min(1, node46path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path68 * min(1,node46path68) - currentNode*(min(1, node46path68) - 1))) &  (currentPath'=(68 * min(1, node46path68) - currentPath*(min(1,node46path68) - 1))) & (success'=min(1, node46path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path69 * min(1,node46path69) - currentNode*(min(1, node46path69) - 1))) &  (currentPath'=(69 * min(1, node46path69) - currentPath*(min(1,node46path69) - 1))) & (success'=min(1, node46path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path70 * min(1,node46path70) - currentNode*(min(1, node46path70) - 1))) &  (currentPath'=(70 * min(1, node46path70) - currentPath*(min(1,node46path70) - 1))) & (success'=min(1, node46path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path71 * min(1,node46path71) - currentNode*(min(1, node46path71) - 1))) &  (currentPath'=(71 * min(1, node46path71) - currentPath*(min(1,node46path71) - 1))) & (success'=min(1, node46path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path72 * min(1,node46path72) - currentNode*(min(1, node46path72) - 1))) &  (currentPath'=(72 * min(1, node46path72) - currentPath*(min(1,node46path72) - 1))) & (success'=min(1, node46path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path73 * min(1,node46path73) - currentNode*(min(1, node46path73) - 1))) &  (currentPath'=(73 * min(1, node46path73) - currentPath*(min(1,node46path73) - 1))) & (success'=min(1, node46path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path74 * min(1,node46path74) - currentNode*(min(1, node46path74) - 1))) &  (currentPath'=(74 * min(1, node46path74) - currentPath*(min(1,node46path74) - 1))) & (success'=min(1, node46path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path75 * min(1,node46path75) - currentNode*(min(1, node46path75) - 1))) &  (currentPath'=(75 * min(1, node46path75) - currentPath*(min(1,node46path75) - 1))) & (success'=min(1, node46path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path76 * min(1,node46path76) - currentNode*(min(1, node46path76) - 1))) &  (currentPath'=(76 * min(1, node46path76) - currentPath*(min(1,node46path76) - 1))) & (success'=min(1, node46path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path77 * min(1,node46path77) - currentNode*(min(1, node46path77) - 1))) &  (currentPath'=(77 * min(1, node46path77) - currentPath*(min(1,node46path77) - 1))) & (success'=min(1, node46path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path78 * min(1,node46path78) - currentNode*(min(1, node46path78) - 1))) &  (currentPath'=(78 * min(1, node46path78) - currentPath*(min(1,node46path78) - 1))) & (success'=min(1, node46path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path79 * min(1,node46path79) - currentNode*(min(1, node46path79) - 1))) &  (currentPath'=(79 * min(1, node46path79) - currentPath*(min(1,node46path79) - 1))) & (success'=min(1, node46path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path80 * min(1,node46path80) - currentNode*(min(1, node46path80) - 1))) &  (currentPath'=(80 * min(1, node46path80) - currentPath*(min(1,node46path80) - 1))) & (success'=min(1, node46path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path81 * min(1,node46path81) - currentNode*(min(1, node46path81) - 1))) &  (currentPath'=(81 * min(1, node46path81) - currentPath*(min(1,node46path81) - 1))) & (success'=min(1, node46path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path82 * min(1,node46path82) - currentNode*(min(1, node46path82) - 1))) &  (currentPath'=(82 * min(1, node46path82) - currentPath*(min(1,node46path82) - 1))) & (success'=min(1, node46path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path83 * min(1,node46path83) - currentNode*(min(1, node46path83) - 1))) &  (currentPath'=(83 * min(1, node46path83) - currentPath*(min(1,node46path83) - 1))) & (success'=min(1, node46path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path84 * min(1,node46path84) - currentNode*(min(1, node46path84) - 1))) &  (currentPath'=(84 * min(1, node46path84) - currentPath*(min(1,node46path84) - 1))) & (success'=min(1, node46path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path85 * min(1,node46path85) - currentNode*(min(1, node46path85) - 1))) &  (currentPath'=(85 * min(1, node46path85) - currentPath*(min(1,node46path85) - 1))) & (success'=min(1, node46path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path86 * min(1,node46path86) - currentNode*(min(1, node46path86) - 1))) &  (currentPath'=(86 * min(1, node46path86) - currentPath*(min(1,node46path86) - 1))) & (success'=min(1, node46path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path87 * min(1,node46path87) - currentNode*(min(1, node46path87) - 1))) &  (currentPath'=(87 * min(1, node46path87) - currentPath*(min(1,node46path87) - 1))) & (success'=min(1, node46path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path88 * min(1,node46path88) - currentNode*(min(1, node46path88) - 1))) &  (currentPath'=(88 * min(1, node46path88) - currentPath*(min(1,node46path88) - 1))) & (success'=min(1, node46path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path89 * min(1,node46path89) - currentNode*(min(1, node46path89) - 1))) &  (currentPath'=(89 * min(1, node46path89) - currentPath*(min(1,node46path89) - 1))) & (success'=min(1, node46path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path90 * min(1,node46path90) - currentNode*(min(1, node46path90) - 1))) &  (currentPath'=(90 * min(1, node46path90) - currentPath*(min(1,node46path90) - 1))) & (success'=min(1, node46path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path91 * min(1,node46path91) - currentNode*(min(1, node46path91) - 1))) &  (currentPath'=(91 * min(1, node46path91) - currentPath*(min(1,node46path91) - 1))) & (success'=min(1, node46path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path92 * min(1,node46path92) - currentNode*(min(1, node46path92) - 1))) &  (currentPath'=(92 * min(1, node46path92) - currentPath*(min(1,node46path92) - 1))) & (success'=min(1, node46path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path93 * min(1,node46path93) - currentNode*(min(1, node46path93) - 1))) &  (currentPath'=(93 * min(1, node46path93) - currentPath*(min(1,node46path93) - 1))) & (success'=min(1, node46path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path94 * min(1,node46path94) - currentNode*(min(1, node46path94) - 1))) &  (currentPath'=(94 * min(1, node46path94) - currentPath*(min(1,node46path94) - 1))) & (success'=min(1, node46path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path95 * min(1,node46path95) - currentNode*(min(1, node46path95) - 1))) &  (currentPath'=(95 * min(1, node46path95) - currentPath*(min(1,node46path95) - 1))) & (success'=min(1, node46path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path96 * min(1,node46path96) - currentNode*(min(1, node46path96) - 1))) &  (currentPath'=(96 * min(1, node46path96) - currentPath*(min(1,node46path96) - 1))) & (success'=min(1, node46path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path97 * min(1,node46path97) - currentNode*(min(1, node46path97) - 1))) &  (currentPath'=(97 * min(1, node46path97) - currentPath*(min(1,node46path97) - 1))) & (success'=min(1, node46path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path98 * min(1,node46path98) - currentNode*(min(1, node46path98) - 1))) &  (currentPath'=(98 * min(1, node46path98) - currentPath*(min(1,node46path98) - 1))) & (success'=min(1, node46path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path99 * min(1,node46path99) - currentNode*(min(1, node46path99) - 1))) &  (currentPath'=(99 * min(1, node46path99) - currentPath*(min(1,node46path99) - 1))) & (success'=min(1, node46path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node46path100 * min(1,node46path100) - currentNode*(min(1, node46path100) - 1))) &  (currentPath'=(100 * min(1, node46path100) - currentPath*(min(1,node46path100) - 1))) & (success'=min(1, node46path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 47) ->
 numPathsInv: (currentNode'=(node47path1 * min(1,node47path1) - currentNode*(min(1, node47path1) - 1))) &  (currentPath'=(1 * min(1, node47path1) - currentPath*(min(1,node47path1) - 1))) & (success'=min(1, node47path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path2 * min(1,node47path2) - currentNode*(min(1, node47path2) - 1))) &  (currentPath'=(2 * min(1, node47path2) - currentPath*(min(1,node47path2) - 1))) & (success'=min(1, node47path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path3 * min(1,node47path3) - currentNode*(min(1, node47path3) - 1))) &  (currentPath'=(3 * min(1, node47path3) - currentPath*(min(1,node47path3) - 1))) & (success'=min(1, node47path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path4 * min(1,node47path4) - currentNode*(min(1, node47path4) - 1))) &  (currentPath'=(4 * min(1, node47path4) - currentPath*(min(1,node47path4) - 1))) & (success'=min(1, node47path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path5 * min(1,node47path5) - currentNode*(min(1, node47path5) - 1))) &  (currentPath'=(5 * min(1, node47path5) - currentPath*(min(1,node47path5) - 1))) & (success'=min(1, node47path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path6 * min(1,node47path6) - currentNode*(min(1, node47path6) - 1))) &  (currentPath'=(6 * min(1, node47path6) - currentPath*(min(1,node47path6) - 1))) & (success'=min(1, node47path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path7 * min(1,node47path7) - currentNode*(min(1, node47path7) - 1))) &  (currentPath'=(7 * min(1, node47path7) - currentPath*(min(1,node47path7) - 1))) & (success'=min(1, node47path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path8 * min(1,node47path8) - currentNode*(min(1, node47path8) - 1))) &  (currentPath'=(8 * min(1, node47path8) - currentPath*(min(1,node47path8) - 1))) & (success'=min(1, node47path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path9 * min(1,node47path9) - currentNode*(min(1, node47path9) - 1))) &  (currentPath'=(9 * min(1, node47path9) - currentPath*(min(1,node47path9) - 1))) & (success'=min(1, node47path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path10 * min(1,node47path10) - currentNode*(min(1, node47path10) - 1))) &  (currentPath'=(10 * min(1, node47path10) - currentPath*(min(1,node47path10) - 1))) & (success'=min(1, node47path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path11 * min(1,node47path11) - currentNode*(min(1, node47path11) - 1))) &  (currentPath'=(11 * min(1, node47path11) - currentPath*(min(1,node47path11) - 1))) & (success'=min(1, node47path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path12 * min(1,node47path12) - currentNode*(min(1, node47path12) - 1))) &  (currentPath'=(12 * min(1, node47path12) - currentPath*(min(1,node47path12) - 1))) & (success'=min(1, node47path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path13 * min(1,node47path13) - currentNode*(min(1, node47path13) - 1))) &  (currentPath'=(13 * min(1, node47path13) - currentPath*(min(1,node47path13) - 1))) & (success'=min(1, node47path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path14 * min(1,node47path14) - currentNode*(min(1, node47path14) - 1))) &  (currentPath'=(14 * min(1, node47path14) - currentPath*(min(1,node47path14) - 1))) & (success'=min(1, node47path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path15 * min(1,node47path15) - currentNode*(min(1, node47path15) - 1))) &  (currentPath'=(15 * min(1, node47path15) - currentPath*(min(1,node47path15) - 1))) & (success'=min(1, node47path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path16 * min(1,node47path16) - currentNode*(min(1, node47path16) - 1))) &  (currentPath'=(16 * min(1, node47path16) - currentPath*(min(1,node47path16) - 1))) & (success'=min(1, node47path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path17 * min(1,node47path17) - currentNode*(min(1, node47path17) - 1))) &  (currentPath'=(17 * min(1, node47path17) - currentPath*(min(1,node47path17) - 1))) & (success'=min(1, node47path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path18 * min(1,node47path18) - currentNode*(min(1, node47path18) - 1))) &  (currentPath'=(18 * min(1, node47path18) - currentPath*(min(1,node47path18) - 1))) & (success'=min(1, node47path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path19 * min(1,node47path19) - currentNode*(min(1, node47path19) - 1))) &  (currentPath'=(19 * min(1, node47path19) - currentPath*(min(1,node47path19) - 1))) & (success'=min(1, node47path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path20 * min(1,node47path20) - currentNode*(min(1, node47path20) - 1))) &  (currentPath'=(20 * min(1, node47path20) - currentPath*(min(1,node47path20) - 1))) & (success'=min(1, node47path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path21 * min(1,node47path21) - currentNode*(min(1, node47path21) - 1))) &  (currentPath'=(21 * min(1, node47path21) - currentPath*(min(1,node47path21) - 1))) & (success'=min(1, node47path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path22 * min(1,node47path22) - currentNode*(min(1, node47path22) - 1))) &  (currentPath'=(22 * min(1, node47path22) - currentPath*(min(1,node47path22) - 1))) & (success'=min(1, node47path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path23 * min(1,node47path23) - currentNode*(min(1, node47path23) - 1))) &  (currentPath'=(23 * min(1, node47path23) - currentPath*(min(1,node47path23) - 1))) & (success'=min(1, node47path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path24 * min(1,node47path24) - currentNode*(min(1, node47path24) - 1))) &  (currentPath'=(24 * min(1, node47path24) - currentPath*(min(1,node47path24) - 1))) & (success'=min(1, node47path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path25 * min(1,node47path25) - currentNode*(min(1, node47path25) - 1))) &  (currentPath'=(25 * min(1, node47path25) - currentPath*(min(1,node47path25) - 1))) & (success'=min(1, node47path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path26 * min(1,node47path26) - currentNode*(min(1, node47path26) - 1))) &  (currentPath'=(26 * min(1, node47path26) - currentPath*(min(1,node47path26) - 1))) & (success'=min(1, node47path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path27 * min(1,node47path27) - currentNode*(min(1, node47path27) - 1))) &  (currentPath'=(27 * min(1, node47path27) - currentPath*(min(1,node47path27) - 1))) & (success'=min(1, node47path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path28 * min(1,node47path28) - currentNode*(min(1, node47path28) - 1))) &  (currentPath'=(28 * min(1, node47path28) - currentPath*(min(1,node47path28) - 1))) & (success'=min(1, node47path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path29 * min(1,node47path29) - currentNode*(min(1, node47path29) - 1))) &  (currentPath'=(29 * min(1, node47path29) - currentPath*(min(1,node47path29) - 1))) & (success'=min(1, node47path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path30 * min(1,node47path30) - currentNode*(min(1, node47path30) - 1))) &  (currentPath'=(30 * min(1, node47path30) - currentPath*(min(1,node47path30) - 1))) & (success'=min(1, node47path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path31 * min(1,node47path31) - currentNode*(min(1, node47path31) - 1))) &  (currentPath'=(31 * min(1, node47path31) - currentPath*(min(1,node47path31) - 1))) & (success'=min(1, node47path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path32 * min(1,node47path32) - currentNode*(min(1, node47path32) - 1))) &  (currentPath'=(32 * min(1, node47path32) - currentPath*(min(1,node47path32) - 1))) & (success'=min(1, node47path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path33 * min(1,node47path33) - currentNode*(min(1, node47path33) - 1))) &  (currentPath'=(33 * min(1, node47path33) - currentPath*(min(1,node47path33) - 1))) & (success'=min(1, node47path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path34 * min(1,node47path34) - currentNode*(min(1, node47path34) - 1))) &  (currentPath'=(34 * min(1, node47path34) - currentPath*(min(1,node47path34) - 1))) & (success'=min(1, node47path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path35 * min(1,node47path35) - currentNode*(min(1, node47path35) - 1))) &  (currentPath'=(35 * min(1, node47path35) - currentPath*(min(1,node47path35) - 1))) & (success'=min(1, node47path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path36 * min(1,node47path36) - currentNode*(min(1, node47path36) - 1))) &  (currentPath'=(36 * min(1, node47path36) - currentPath*(min(1,node47path36) - 1))) & (success'=min(1, node47path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path37 * min(1,node47path37) - currentNode*(min(1, node47path37) - 1))) &  (currentPath'=(37 * min(1, node47path37) - currentPath*(min(1,node47path37) - 1))) & (success'=min(1, node47path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path38 * min(1,node47path38) - currentNode*(min(1, node47path38) - 1))) &  (currentPath'=(38 * min(1, node47path38) - currentPath*(min(1,node47path38) - 1))) & (success'=min(1, node47path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path39 * min(1,node47path39) - currentNode*(min(1, node47path39) - 1))) &  (currentPath'=(39 * min(1, node47path39) - currentPath*(min(1,node47path39) - 1))) & (success'=min(1, node47path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path40 * min(1,node47path40) - currentNode*(min(1, node47path40) - 1))) &  (currentPath'=(40 * min(1, node47path40) - currentPath*(min(1,node47path40) - 1))) & (success'=min(1, node47path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path41 * min(1,node47path41) - currentNode*(min(1, node47path41) - 1))) &  (currentPath'=(41 * min(1, node47path41) - currentPath*(min(1,node47path41) - 1))) & (success'=min(1, node47path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path42 * min(1,node47path42) - currentNode*(min(1, node47path42) - 1))) &  (currentPath'=(42 * min(1, node47path42) - currentPath*(min(1,node47path42) - 1))) & (success'=min(1, node47path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path43 * min(1,node47path43) - currentNode*(min(1, node47path43) - 1))) &  (currentPath'=(43 * min(1, node47path43) - currentPath*(min(1,node47path43) - 1))) & (success'=min(1, node47path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path44 * min(1,node47path44) - currentNode*(min(1, node47path44) - 1))) &  (currentPath'=(44 * min(1, node47path44) - currentPath*(min(1,node47path44) - 1))) & (success'=min(1, node47path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path45 * min(1,node47path45) - currentNode*(min(1, node47path45) - 1))) &  (currentPath'=(45 * min(1, node47path45) - currentPath*(min(1,node47path45) - 1))) & (success'=min(1, node47path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path46 * min(1,node47path46) - currentNode*(min(1, node47path46) - 1))) &  (currentPath'=(46 * min(1, node47path46) - currentPath*(min(1,node47path46) - 1))) & (success'=min(1, node47path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path47 * min(1,node47path47) - currentNode*(min(1, node47path47) - 1))) &  (currentPath'=(47 * min(1, node47path47) - currentPath*(min(1,node47path47) - 1))) & (success'=min(1, node47path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path48 * min(1,node47path48) - currentNode*(min(1, node47path48) - 1))) &  (currentPath'=(48 * min(1, node47path48) - currentPath*(min(1,node47path48) - 1))) & (success'=min(1, node47path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path49 * min(1,node47path49) - currentNode*(min(1, node47path49) - 1))) &  (currentPath'=(49 * min(1, node47path49) - currentPath*(min(1,node47path49) - 1))) & (success'=min(1, node47path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path50 * min(1,node47path50) - currentNode*(min(1, node47path50) - 1))) &  (currentPath'=(50 * min(1, node47path50) - currentPath*(min(1,node47path50) - 1))) & (success'=min(1, node47path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path51 * min(1,node47path51) - currentNode*(min(1, node47path51) - 1))) &  (currentPath'=(51 * min(1, node47path51) - currentPath*(min(1,node47path51) - 1))) & (success'=min(1, node47path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path52 * min(1,node47path52) - currentNode*(min(1, node47path52) - 1))) &  (currentPath'=(52 * min(1, node47path52) - currentPath*(min(1,node47path52) - 1))) & (success'=min(1, node47path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path53 * min(1,node47path53) - currentNode*(min(1, node47path53) - 1))) &  (currentPath'=(53 * min(1, node47path53) - currentPath*(min(1,node47path53) - 1))) & (success'=min(1, node47path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path54 * min(1,node47path54) - currentNode*(min(1, node47path54) - 1))) &  (currentPath'=(54 * min(1, node47path54) - currentPath*(min(1,node47path54) - 1))) & (success'=min(1, node47path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path55 * min(1,node47path55) - currentNode*(min(1, node47path55) - 1))) &  (currentPath'=(55 * min(1, node47path55) - currentPath*(min(1,node47path55) - 1))) & (success'=min(1, node47path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path56 * min(1,node47path56) - currentNode*(min(1, node47path56) - 1))) &  (currentPath'=(56 * min(1, node47path56) - currentPath*(min(1,node47path56) - 1))) & (success'=min(1, node47path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path57 * min(1,node47path57) - currentNode*(min(1, node47path57) - 1))) &  (currentPath'=(57 * min(1, node47path57) - currentPath*(min(1,node47path57) - 1))) & (success'=min(1, node47path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path58 * min(1,node47path58) - currentNode*(min(1, node47path58) - 1))) &  (currentPath'=(58 * min(1, node47path58) - currentPath*(min(1,node47path58) - 1))) & (success'=min(1, node47path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path59 * min(1,node47path59) - currentNode*(min(1, node47path59) - 1))) &  (currentPath'=(59 * min(1, node47path59) - currentPath*(min(1,node47path59) - 1))) & (success'=min(1, node47path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path60 * min(1,node47path60) - currentNode*(min(1, node47path60) - 1))) &  (currentPath'=(60 * min(1, node47path60) - currentPath*(min(1,node47path60) - 1))) & (success'=min(1, node47path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path61 * min(1,node47path61) - currentNode*(min(1, node47path61) - 1))) &  (currentPath'=(61 * min(1, node47path61) - currentPath*(min(1,node47path61) - 1))) & (success'=min(1, node47path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path62 * min(1,node47path62) - currentNode*(min(1, node47path62) - 1))) &  (currentPath'=(62 * min(1, node47path62) - currentPath*(min(1,node47path62) - 1))) & (success'=min(1, node47path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path63 * min(1,node47path63) - currentNode*(min(1, node47path63) - 1))) &  (currentPath'=(63 * min(1, node47path63) - currentPath*(min(1,node47path63) - 1))) & (success'=min(1, node47path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path64 * min(1,node47path64) - currentNode*(min(1, node47path64) - 1))) &  (currentPath'=(64 * min(1, node47path64) - currentPath*(min(1,node47path64) - 1))) & (success'=min(1, node47path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path65 * min(1,node47path65) - currentNode*(min(1, node47path65) - 1))) &  (currentPath'=(65 * min(1, node47path65) - currentPath*(min(1,node47path65) - 1))) & (success'=min(1, node47path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path66 * min(1,node47path66) - currentNode*(min(1, node47path66) - 1))) &  (currentPath'=(66 * min(1, node47path66) - currentPath*(min(1,node47path66) - 1))) & (success'=min(1, node47path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path67 * min(1,node47path67) - currentNode*(min(1, node47path67) - 1))) &  (currentPath'=(67 * min(1, node47path67) - currentPath*(min(1,node47path67) - 1))) & (success'=min(1, node47path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path68 * min(1,node47path68) - currentNode*(min(1, node47path68) - 1))) &  (currentPath'=(68 * min(1, node47path68) - currentPath*(min(1,node47path68) - 1))) & (success'=min(1, node47path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path69 * min(1,node47path69) - currentNode*(min(1, node47path69) - 1))) &  (currentPath'=(69 * min(1, node47path69) - currentPath*(min(1,node47path69) - 1))) & (success'=min(1, node47path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path70 * min(1,node47path70) - currentNode*(min(1, node47path70) - 1))) &  (currentPath'=(70 * min(1, node47path70) - currentPath*(min(1,node47path70) - 1))) & (success'=min(1, node47path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path71 * min(1,node47path71) - currentNode*(min(1, node47path71) - 1))) &  (currentPath'=(71 * min(1, node47path71) - currentPath*(min(1,node47path71) - 1))) & (success'=min(1, node47path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path72 * min(1,node47path72) - currentNode*(min(1, node47path72) - 1))) &  (currentPath'=(72 * min(1, node47path72) - currentPath*(min(1,node47path72) - 1))) & (success'=min(1, node47path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path73 * min(1,node47path73) - currentNode*(min(1, node47path73) - 1))) &  (currentPath'=(73 * min(1, node47path73) - currentPath*(min(1,node47path73) - 1))) & (success'=min(1, node47path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path74 * min(1,node47path74) - currentNode*(min(1, node47path74) - 1))) &  (currentPath'=(74 * min(1, node47path74) - currentPath*(min(1,node47path74) - 1))) & (success'=min(1, node47path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path75 * min(1,node47path75) - currentNode*(min(1, node47path75) - 1))) &  (currentPath'=(75 * min(1, node47path75) - currentPath*(min(1,node47path75) - 1))) & (success'=min(1, node47path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path76 * min(1,node47path76) - currentNode*(min(1, node47path76) - 1))) &  (currentPath'=(76 * min(1, node47path76) - currentPath*(min(1,node47path76) - 1))) & (success'=min(1, node47path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path77 * min(1,node47path77) - currentNode*(min(1, node47path77) - 1))) &  (currentPath'=(77 * min(1, node47path77) - currentPath*(min(1,node47path77) - 1))) & (success'=min(1, node47path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path78 * min(1,node47path78) - currentNode*(min(1, node47path78) - 1))) &  (currentPath'=(78 * min(1, node47path78) - currentPath*(min(1,node47path78) - 1))) & (success'=min(1, node47path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path79 * min(1,node47path79) - currentNode*(min(1, node47path79) - 1))) &  (currentPath'=(79 * min(1, node47path79) - currentPath*(min(1,node47path79) - 1))) & (success'=min(1, node47path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path80 * min(1,node47path80) - currentNode*(min(1, node47path80) - 1))) &  (currentPath'=(80 * min(1, node47path80) - currentPath*(min(1,node47path80) - 1))) & (success'=min(1, node47path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path81 * min(1,node47path81) - currentNode*(min(1, node47path81) - 1))) &  (currentPath'=(81 * min(1, node47path81) - currentPath*(min(1,node47path81) - 1))) & (success'=min(1, node47path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path82 * min(1,node47path82) - currentNode*(min(1, node47path82) - 1))) &  (currentPath'=(82 * min(1, node47path82) - currentPath*(min(1,node47path82) - 1))) & (success'=min(1, node47path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path83 * min(1,node47path83) - currentNode*(min(1, node47path83) - 1))) &  (currentPath'=(83 * min(1, node47path83) - currentPath*(min(1,node47path83) - 1))) & (success'=min(1, node47path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path84 * min(1,node47path84) - currentNode*(min(1, node47path84) - 1))) &  (currentPath'=(84 * min(1, node47path84) - currentPath*(min(1,node47path84) - 1))) & (success'=min(1, node47path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path85 * min(1,node47path85) - currentNode*(min(1, node47path85) - 1))) &  (currentPath'=(85 * min(1, node47path85) - currentPath*(min(1,node47path85) - 1))) & (success'=min(1, node47path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path86 * min(1,node47path86) - currentNode*(min(1, node47path86) - 1))) &  (currentPath'=(86 * min(1, node47path86) - currentPath*(min(1,node47path86) - 1))) & (success'=min(1, node47path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path87 * min(1,node47path87) - currentNode*(min(1, node47path87) - 1))) &  (currentPath'=(87 * min(1, node47path87) - currentPath*(min(1,node47path87) - 1))) & (success'=min(1, node47path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path88 * min(1,node47path88) - currentNode*(min(1, node47path88) - 1))) &  (currentPath'=(88 * min(1, node47path88) - currentPath*(min(1,node47path88) - 1))) & (success'=min(1, node47path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path89 * min(1,node47path89) - currentNode*(min(1, node47path89) - 1))) &  (currentPath'=(89 * min(1, node47path89) - currentPath*(min(1,node47path89) - 1))) & (success'=min(1, node47path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path90 * min(1,node47path90) - currentNode*(min(1, node47path90) - 1))) &  (currentPath'=(90 * min(1, node47path90) - currentPath*(min(1,node47path90) - 1))) & (success'=min(1, node47path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path91 * min(1,node47path91) - currentNode*(min(1, node47path91) - 1))) &  (currentPath'=(91 * min(1, node47path91) - currentPath*(min(1,node47path91) - 1))) & (success'=min(1, node47path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path92 * min(1,node47path92) - currentNode*(min(1, node47path92) - 1))) &  (currentPath'=(92 * min(1, node47path92) - currentPath*(min(1,node47path92) - 1))) & (success'=min(1, node47path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path93 * min(1,node47path93) - currentNode*(min(1, node47path93) - 1))) &  (currentPath'=(93 * min(1, node47path93) - currentPath*(min(1,node47path93) - 1))) & (success'=min(1, node47path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path94 * min(1,node47path94) - currentNode*(min(1, node47path94) - 1))) &  (currentPath'=(94 * min(1, node47path94) - currentPath*(min(1,node47path94) - 1))) & (success'=min(1, node47path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path95 * min(1,node47path95) - currentNode*(min(1, node47path95) - 1))) &  (currentPath'=(95 * min(1, node47path95) - currentPath*(min(1,node47path95) - 1))) & (success'=min(1, node47path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path96 * min(1,node47path96) - currentNode*(min(1, node47path96) - 1))) &  (currentPath'=(96 * min(1, node47path96) - currentPath*(min(1,node47path96) - 1))) & (success'=min(1, node47path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path97 * min(1,node47path97) - currentNode*(min(1, node47path97) - 1))) &  (currentPath'=(97 * min(1, node47path97) - currentPath*(min(1,node47path97) - 1))) & (success'=min(1, node47path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path98 * min(1,node47path98) - currentNode*(min(1, node47path98) - 1))) &  (currentPath'=(98 * min(1, node47path98) - currentPath*(min(1,node47path98) - 1))) & (success'=min(1, node47path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path99 * min(1,node47path99) - currentNode*(min(1, node47path99) - 1))) &  (currentPath'=(99 * min(1, node47path99) - currentPath*(min(1,node47path99) - 1))) & (success'=min(1, node47path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node47path100 * min(1,node47path100) - currentNode*(min(1, node47path100) - 1))) &  (currentPath'=(100 * min(1, node47path100) - currentPath*(min(1,node47path100) - 1))) & (success'=min(1, node47path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 48) ->
 numPathsInv: (currentNode'=(node48path1 * min(1,node48path1) - currentNode*(min(1, node48path1) - 1))) &  (currentPath'=(1 * min(1, node48path1) - currentPath*(min(1,node48path1) - 1))) & (success'=min(1, node48path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path2 * min(1,node48path2) - currentNode*(min(1, node48path2) - 1))) &  (currentPath'=(2 * min(1, node48path2) - currentPath*(min(1,node48path2) - 1))) & (success'=min(1, node48path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path3 * min(1,node48path3) - currentNode*(min(1, node48path3) - 1))) &  (currentPath'=(3 * min(1, node48path3) - currentPath*(min(1,node48path3) - 1))) & (success'=min(1, node48path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path4 * min(1,node48path4) - currentNode*(min(1, node48path4) - 1))) &  (currentPath'=(4 * min(1, node48path4) - currentPath*(min(1,node48path4) - 1))) & (success'=min(1, node48path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path5 * min(1,node48path5) - currentNode*(min(1, node48path5) - 1))) &  (currentPath'=(5 * min(1, node48path5) - currentPath*(min(1,node48path5) - 1))) & (success'=min(1, node48path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path6 * min(1,node48path6) - currentNode*(min(1, node48path6) - 1))) &  (currentPath'=(6 * min(1, node48path6) - currentPath*(min(1,node48path6) - 1))) & (success'=min(1, node48path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path7 * min(1,node48path7) - currentNode*(min(1, node48path7) - 1))) &  (currentPath'=(7 * min(1, node48path7) - currentPath*(min(1,node48path7) - 1))) & (success'=min(1, node48path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path8 * min(1,node48path8) - currentNode*(min(1, node48path8) - 1))) &  (currentPath'=(8 * min(1, node48path8) - currentPath*(min(1,node48path8) - 1))) & (success'=min(1, node48path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path9 * min(1,node48path9) - currentNode*(min(1, node48path9) - 1))) &  (currentPath'=(9 * min(1, node48path9) - currentPath*(min(1,node48path9) - 1))) & (success'=min(1, node48path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path10 * min(1,node48path10) - currentNode*(min(1, node48path10) - 1))) &  (currentPath'=(10 * min(1, node48path10) - currentPath*(min(1,node48path10) - 1))) & (success'=min(1, node48path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path11 * min(1,node48path11) - currentNode*(min(1, node48path11) - 1))) &  (currentPath'=(11 * min(1, node48path11) - currentPath*(min(1,node48path11) - 1))) & (success'=min(1, node48path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path12 * min(1,node48path12) - currentNode*(min(1, node48path12) - 1))) &  (currentPath'=(12 * min(1, node48path12) - currentPath*(min(1,node48path12) - 1))) & (success'=min(1, node48path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path13 * min(1,node48path13) - currentNode*(min(1, node48path13) - 1))) &  (currentPath'=(13 * min(1, node48path13) - currentPath*(min(1,node48path13) - 1))) & (success'=min(1, node48path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path14 * min(1,node48path14) - currentNode*(min(1, node48path14) - 1))) &  (currentPath'=(14 * min(1, node48path14) - currentPath*(min(1,node48path14) - 1))) & (success'=min(1, node48path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path15 * min(1,node48path15) - currentNode*(min(1, node48path15) - 1))) &  (currentPath'=(15 * min(1, node48path15) - currentPath*(min(1,node48path15) - 1))) & (success'=min(1, node48path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path16 * min(1,node48path16) - currentNode*(min(1, node48path16) - 1))) &  (currentPath'=(16 * min(1, node48path16) - currentPath*(min(1,node48path16) - 1))) & (success'=min(1, node48path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path17 * min(1,node48path17) - currentNode*(min(1, node48path17) - 1))) &  (currentPath'=(17 * min(1, node48path17) - currentPath*(min(1,node48path17) - 1))) & (success'=min(1, node48path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path18 * min(1,node48path18) - currentNode*(min(1, node48path18) - 1))) &  (currentPath'=(18 * min(1, node48path18) - currentPath*(min(1,node48path18) - 1))) & (success'=min(1, node48path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path19 * min(1,node48path19) - currentNode*(min(1, node48path19) - 1))) &  (currentPath'=(19 * min(1, node48path19) - currentPath*(min(1,node48path19) - 1))) & (success'=min(1, node48path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path20 * min(1,node48path20) - currentNode*(min(1, node48path20) - 1))) &  (currentPath'=(20 * min(1, node48path20) - currentPath*(min(1,node48path20) - 1))) & (success'=min(1, node48path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path21 * min(1,node48path21) - currentNode*(min(1, node48path21) - 1))) &  (currentPath'=(21 * min(1, node48path21) - currentPath*(min(1,node48path21) - 1))) & (success'=min(1, node48path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path22 * min(1,node48path22) - currentNode*(min(1, node48path22) - 1))) &  (currentPath'=(22 * min(1, node48path22) - currentPath*(min(1,node48path22) - 1))) & (success'=min(1, node48path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path23 * min(1,node48path23) - currentNode*(min(1, node48path23) - 1))) &  (currentPath'=(23 * min(1, node48path23) - currentPath*(min(1,node48path23) - 1))) & (success'=min(1, node48path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path24 * min(1,node48path24) - currentNode*(min(1, node48path24) - 1))) &  (currentPath'=(24 * min(1, node48path24) - currentPath*(min(1,node48path24) - 1))) & (success'=min(1, node48path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path25 * min(1,node48path25) - currentNode*(min(1, node48path25) - 1))) &  (currentPath'=(25 * min(1, node48path25) - currentPath*(min(1,node48path25) - 1))) & (success'=min(1, node48path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path26 * min(1,node48path26) - currentNode*(min(1, node48path26) - 1))) &  (currentPath'=(26 * min(1, node48path26) - currentPath*(min(1,node48path26) - 1))) & (success'=min(1, node48path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path27 * min(1,node48path27) - currentNode*(min(1, node48path27) - 1))) &  (currentPath'=(27 * min(1, node48path27) - currentPath*(min(1,node48path27) - 1))) & (success'=min(1, node48path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path28 * min(1,node48path28) - currentNode*(min(1, node48path28) - 1))) &  (currentPath'=(28 * min(1, node48path28) - currentPath*(min(1,node48path28) - 1))) & (success'=min(1, node48path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path29 * min(1,node48path29) - currentNode*(min(1, node48path29) - 1))) &  (currentPath'=(29 * min(1, node48path29) - currentPath*(min(1,node48path29) - 1))) & (success'=min(1, node48path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path30 * min(1,node48path30) - currentNode*(min(1, node48path30) - 1))) &  (currentPath'=(30 * min(1, node48path30) - currentPath*(min(1,node48path30) - 1))) & (success'=min(1, node48path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path31 * min(1,node48path31) - currentNode*(min(1, node48path31) - 1))) &  (currentPath'=(31 * min(1, node48path31) - currentPath*(min(1,node48path31) - 1))) & (success'=min(1, node48path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path32 * min(1,node48path32) - currentNode*(min(1, node48path32) - 1))) &  (currentPath'=(32 * min(1, node48path32) - currentPath*(min(1,node48path32) - 1))) & (success'=min(1, node48path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path33 * min(1,node48path33) - currentNode*(min(1, node48path33) - 1))) &  (currentPath'=(33 * min(1, node48path33) - currentPath*(min(1,node48path33) - 1))) & (success'=min(1, node48path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path34 * min(1,node48path34) - currentNode*(min(1, node48path34) - 1))) &  (currentPath'=(34 * min(1, node48path34) - currentPath*(min(1,node48path34) - 1))) & (success'=min(1, node48path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path35 * min(1,node48path35) - currentNode*(min(1, node48path35) - 1))) &  (currentPath'=(35 * min(1, node48path35) - currentPath*(min(1,node48path35) - 1))) & (success'=min(1, node48path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path36 * min(1,node48path36) - currentNode*(min(1, node48path36) - 1))) &  (currentPath'=(36 * min(1, node48path36) - currentPath*(min(1,node48path36) - 1))) & (success'=min(1, node48path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path37 * min(1,node48path37) - currentNode*(min(1, node48path37) - 1))) &  (currentPath'=(37 * min(1, node48path37) - currentPath*(min(1,node48path37) - 1))) & (success'=min(1, node48path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path38 * min(1,node48path38) - currentNode*(min(1, node48path38) - 1))) &  (currentPath'=(38 * min(1, node48path38) - currentPath*(min(1,node48path38) - 1))) & (success'=min(1, node48path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path39 * min(1,node48path39) - currentNode*(min(1, node48path39) - 1))) &  (currentPath'=(39 * min(1, node48path39) - currentPath*(min(1,node48path39) - 1))) & (success'=min(1, node48path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path40 * min(1,node48path40) - currentNode*(min(1, node48path40) - 1))) &  (currentPath'=(40 * min(1, node48path40) - currentPath*(min(1,node48path40) - 1))) & (success'=min(1, node48path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path41 * min(1,node48path41) - currentNode*(min(1, node48path41) - 1))) &  (currentPath'=(41 * min(1, node48path41) - currentPath*(min(1,node48path41) - 1))) & (success'=min(1, node48path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path42 * min(1,node48path42) - currentNode*(min(1, node48path42) - 1))) &  (currentPath'=(42 * min(1, node48path42) - currentPath*(min(1,node48path42) - 1))) & (success'=min(1, node48path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path43 * min(1,node48path43) - currentNode*(min(1, node48path43) - 1))) &  (currentPath'=(43 * min(1, node48path43) - currentPath*(min(1,node48path43) - 1))) & (success'=min(1, node48path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path44 * min(1,node48path44) - currentNode*(min(1, node48path44) - 1))) &  (currentPath'=(44 * min(1, node48path44) - currentPath*(min(1,node48path44) - 1))) & (success'=min(1, node48path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path45 * min(1,node48path45) - currentNode*(min(1, node48path45) - 1))) &  (currentPath'=(45 * min(1, node48path45) - currentPath*(min(1,node48path45) - 1))) & (success'=min(1, node48path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path46 * min(1,node48path46) - currentNode*(min(1, node48path46) - 1))) &  (currentPath'=(46 * min(1, node48path46) - currentPath*(min(1,node48path46) - 1))) & (success'=min(1, node48path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path47 * min(1,node48path47) - currentNode*(min(1, node48path47) - 1))) &  (currentPath'=(47 * min(1, node48path47) - currentPath*(min(1,node48path47) - 1))) & (success'=min(1, node48path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path48 * min(1,node48path48) - currentNode*(min(1, node48path48) - 1))) &  (currentPath'=(48 * min(1, node48path48) - currentPath*(min(1,node48path48) - 1))) & (success'=min(1, node48path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path49 * min(1,node48path49) - currentNode*(min(1, node48path49) - 1))) &  (currentPath'=(49 * min(1, node48path49) - currentPath*(min(1,node48path49) - 1))) & (success'=min(1, node48path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path50 * min(1,node48path50) - currentNode*(min(1, node48path50) - 1))) &  (currentPath'=(50 * min(1, node48path50) - currentPath*(min(1,node48path50) - 1))) & (success'=min(1, node48path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path51 * min(1,node48path51) - currentNode*(min(1, node48path51) - 1))) &  (currentPath'=(51 * min(1, node48path51) - currentPath*(min(1,node48path51) - 1))) & (success'=min(1, node48path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path52 * min(1,node48path52) - currentNode*(min(1, node48path52) - 1))) &  (currentPath'=(52 * min(1, node48path52) - currentPath*(min(1,node48path52) - 1))) & (success'=min(1, node48path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path53 * min(1,node48path53) - currentNode*(min(1, node48path53) - 1))) &  (currentPath'=(53 * min(1, node48path53) - currentPath*(min(1,node48path53) - 1))) & (success'=min(1, node48path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path54 * min(1,node48path54) - currentNode*(min(1, node48path54) - 1))) &  (currentPath'=(54 * min(1, node48path54) - currentPath*(min(1,node48path54) - 1))) & (success'=min(1, node48path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path55 * min(1,node48path55) - currentNode*(min(1, node48path55) - 1))) &  (currentPath'=(55 * min(1, node48path55) - currentPath*(min(1,node48path55) - 1))) & (success'=min(1, node48path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path56 * min(1,node48path56) - currentNode*(min(1, node48path56) - 1))) &  (currentPath'=(56 * min(1, node48path56) - currentPath*(min(1,node48path56) - 1))) & (success'=min(1, node48path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path57 * min(1,node48path57) - currentNode*(min(1, node48path57) - 1))) &  (currentPath'=(57 * min(1, node48path57) - currentPath*(min(1,node48path57) - 1))) & (success'=min(1, node48path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path58 * min(1,node48path58) - currentNode*(min(1, node48path58) - 1))) &  (currentPath'=(58 * min(1, node48path58) - currentPath*(min(1,node48path58) - 1))) & (success'=min(1, node48path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path59 * min(1,node48path59) - currentNode*(min(1, node48path59) - 1))) &  (currentPath'=(59 * min(1, node48path59) - currentPath*(min(1,node48path59) - 1))) & (success'=min(1, node48path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path60 * min(1,node48path60) - currentNode*(min(1, node48path60) - 1))) &  (currentPath'=(60 * min(1, node48path60) - currentPath*(min(1,node48path60) - 1))) & (success'=min(1, node48path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path61 * min(1,node48path61) - currentNode*(min(1, node48path61) - 1))) &  (currentPath'=(61 * min(1, node48path61) - currentPath*(min(1,node48path61) - 1))) & (success'=min(1, node48path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path62 * min(1,node48path62) - currentNode*(min(1, node48path62) - 1))) &  (currentPath'=(62 * min(1, node48path62) - currentPath*(min(1,node48path62) - 1))) & (success'=min(1, node48path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path63 * min(1,node48path63) - currentNode*(min(1, node48path63) - 1))) &  (currentPath'=(63 * min(1, node48path63) - currentPath*(min(1,node48path63) - 1))) & (success'=min(1, node48path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path64 * min(1,node48path64) - currentNode*(min(1, node48path64) - 1))) &  (currentPath'=(64 * min(1, node48path64) - currentPath*(min(1,node48path64) - 1))) & (success'=min(1, node48path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path65 * min(1,node48path65) - currentNode*(min(1, node48path65) - 1))) &  (currentPath'=(65 * min(1, node48path65) - currentPath*(min(1,node48path65) - 1))) & (success'=min(1, node48path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path66 * min(1,node48path66) - currentNode*(min(1, node48path66) - 1))) &  (currentPath'=(66 * min(1, node48path66) - currentPath*(min(1,node48path66) - 1))) & (success'=min(1, node48path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path67 * min(1,node48path67) - currentNode*(min(1, node48path67) - 1))) &  (currentPath'=(67 * min(1, node48path67) - currentPath*(min(1,node48path67) - 1))) & (success'=min(1, node48path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path68 * min(1,node48path68) - currentNode*(min(1, node48path68) - 1))) &  (currentPath'=(68 * min(1, node48path68) - currentPath*(min(1,node48path68) - 1))) & (success'=min(1, node48path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path69 * min(1,node48path69) - currentNode*(min(1, node48path69) - 1))) &  (currentPath'=(69 * min(1, node48path69) - currentPath*(min(1,node48path69) - 1))) & (success'=min(1, node48path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path70 * min(1,node48path70) - currentNode*(min(1, node48path70) - 1))) &  (currentPath'=(70 * min(1, node48path70) - currentPath*(min(1,node48path70) - 1))) & (success'=min(1, node48path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path71 * min(1,node48path71) - currentNode*(min(1, node48path71) - 1))) &  (currentPath'=(71 * min(1, node48path71) - currentPath*(min(1,node48path71) - 1))) & (success'=min(1, node48path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path72 * min(1,node48path72) - currentNode*(min(1, node48path72) - 1))) &  (currentPath'=(72 * min(1, node48path72) - currentPath*(min(1,node48path72) - 1))) & (success'=min(1, node48path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path73 * min(1,node48path73) - currentNode*(min(1, node48path73) - 1))) &  (currentPath'=(73 * min(1, node48path73) - currentPath*(min(1,node48path73) - 1))) & (success'=min(1, node48path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path74 * min(1,node48path74) - currentNode*(min(1, node48path74) - 1))) &  (currentPath'=(74 * min(1, node48path74) - currentPath*(min(1,node48path74) - 1))) & (success'=min(1, node48path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path75 * min(1,node48path75) - currentNode*(min(1, node48path75) - 1))) &  (currentPath'=(75 * min(1, node48path75) - currentPath*(min(1,node48path75) - 1))) & (success'=min(1, node48path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path76 * min(1,node48path76) - currentNode*(min(1, node48path76) - 1))) &  (currentPath'=(76 * min(1, node48path76) - currentPath*(min(1,node48path76) - 1))) & (success'=min(1, node48path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path77 * min(1,node48path77) - currentNode*(min(1, node48path77) - 1))) &  (currentPath'=(77 * min(1, node48path77) - currentPath*(min(1,node48path77) - 1))) & (success'=min(1, node48path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path78 * min(1,node48path78) - currentNode*(min(1, node48path78) - 1))) &  (currentPath'=(78 * min(1, node48path78) - currentPath*(min(1,node48path78) - 1))) & (success'=min(1, node48path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path79 * min(1,node48path79) - currentNode*(min(1, node48path79) - 1))) &  (currentPath'=(79 * min(1, node48path79) - currentPath*(min(1,node48path79) - 1))) & (success'=min(1, node48path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path80 * min(1,node48path80) - currentNode*(min(1, node48path80) - 1))) &  (currentPath'=(80 * min(1, node48path80) - currentPath*(min(1,node48path80) - 1))) & (success'=min(1, node48path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path81 * min(1,node48path81) - currentNode*(min(1, node48path81) - 1))) &  (currentPath'=(81 * min(1, node48path81) - currentPath*(min(1,node48path81) - 1))) & (success'=min(1, node48path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path82 * min(1,node48path82) - currentNode*(min(1, node48path82) - 1))) &  (currentPath'=(82 * min(1, node48path82) - currentPath*(min(1,node48path82) - 1))) & (success'=min(1, node48path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path83 * min(1,node48path83) - currentNode*(min(1, node48path83) - 1))) &  (currentPath'=(83 * min(1, node48path83) - currentPath*(min(1,node48path83) - 1))) & (success'=min(1, node48path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path84 * min(1,node48path84) - currentNode*(min(1, node48path84) - 1))) &  (currentPath'=(84 * min(1, node48path84) - currentPath*(min(1,node48path84) - 1))) & (success'=min(1, node48path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path85 * min(1,node48path85) - currentNode*(min(1, node48path85) - 1))) &  (currentPath'=(85 * min(1, node48path85) - currentPath*(min(1,node48path85) - 1))) & (success'=min(1, node48path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path86 * min(1,node48path86) - currentNode*(min(1, node48path86) - 1))) &  (currentPath'=(86 * min(1, node48path86) - currentPath*(min(1,node48path86) - 1))) & (success'=min(1, node48path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path87 * min(1,node48path87) - currentNode*(min(1, node48path87) - 1))) &  (currentPath'=(87 * min(1, node48path87) - currentPath*(min(1,node48path87) - 1))) & (success'=min(1, node48path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path88 * min(1,node48path88) - currentNode*(min(1, node48path88) - 1))) &  (currentPath'=(88 * min(1, node48path88) - currentPath*(min(1,node48path88) - 1))) & (success'=min(1, node48path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path89 * min(1,node48path89) - currentNode*(min(1, node48path89) - 1))) &  (currentPath'=(89 * min(1, node48path89) - currentPath*(min(1,node48path89) - 1))) & (success'=min(1, node48path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path90 * min(1,node48path90) - currentNode*(min(1, node48path90) - 1))) &  (currentPath'=(90 * min(1, node48path90) - currentPath*(min(1,node48path90) - 1))) & (success'=min(1, node48path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path91 * min(1,node48path91) - currentNode*(min(1, node48path91) - 1))) &  (currentPath'=(91 * min(1, node48path91) - currentPath*(min(1,node48path91) - 1))) & (success'=min(1, node48path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path92 * min(1,node48path92) - currentNode*(min(1, node48path92) - 1))) &  (currentPath'=(92 * min(1, node48path92) - currentPath*(min(1,node48path92) - 1))) & (success'=min(1, node48path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path93 * min(1,node48path93) - currentNode*(min(1, node48path93) - 1))) &  (currentPath'=(93 * min(1, node48path93) - currentPath*(min(1,node48path93) - 1))) & (success'=min(1, node48path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path94 * min(1,node48path94) - currentNode*(min(1, node48path94) - 1))) &  (currentPath'=(94 * min(1, node48path94) - currentPath*(min(1,node48path94) - 1))) & (success'=min(1, node48path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path95 * min(1,node48path95) - currentNode*(min(1, node48path95) - 1))) &  (currentPath'=(95 * min(1, node48path95) - currentPath*(min(1,node48path95) - 1))) & (success'=min(1, node48path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path96 * min(1,node48path96) - currentNode*(min(1, node48path96) - 1))) &  (currentPath'=(96 * min(1, node48path96) - currentPath*(min(1,node48path96) - 1))) & (success'=min(1, node48path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path97 * min(1,node48path97) - currentNode*(min(1, node48path97) - 1))) &  (currentPath'=(97 * min(1, node48path97) - currentPath*(min(1,node48path97) - 1))) & (success'=min(1, node48path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path98 * min(1,node48path98) - currentNode*(min(1, node48path98) - 1))) &  (currentPath'=(98 * min(1, node48path98) - currentPath*(min(1,node48path98) - 1))) & (success'=min(1, node48path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path99 * min(1,node48path99) - currentNode*(min(1, node48path99) - 1))) &  (currentPath'=(99 * min(1, node48path99) - currentPath*(min(1,node48path99) - 1))) & (success'=min(1, node48path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node48path100 * min(1,node48path100) - currentNode*(min(1, node48path100) - 1))) &  (currentPath'=(100 * min(1, node48path100) - currentPath*(min(1,node48path100) - 1))) & (success'=min(1, node48path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 49) ->
 numPathsInv: (currentNode'=(node49path1 * min(1,node49path1) - currentNode*(min(1, node49path1) - 1))) &  (currentPath'=(1 * min(1, node49path1) - currentPath*(min(1,node49path1) - 1))) & (success'=min(1, node49path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path2 * min(1,node49path2) - currentNode*(min(1, node49path2) - 1))) &  (currentPath'=(2 * min(1, node49path2) - currentPath*(min(1,node49path2) - 1))) & (success'=min(1, node49path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path3 * min(1,node49path3) - currentNode*(min(1, node49path3) - 1))) &  (currentPath'=(3 * min(1, node49path3) - currentPath*(min(1,node49path3) - 1))) & (success'=min(1, node49path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path4 * min(1,node49path4) - currentNode*(min(1, node49path4) - 1))) &  (currentPath'=(4 * min(1, node49path4) - currentPath*(min(1,node49path4) - 1))) & (success'=min(1, node49path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path5 * min(1,node49path5) - currentNode*(min(1, node49path5) - 1))) &  (currentPath'=(5 * min(1, node49path5) - currentPath*(min(1,node49path5) - 1))) & (success'=min(1, node49path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path6 * min(1,node49path6) - currentNode*(min(1, node49path6) - 1))) &  (currentPath'=(6 * min(1, node49path6) - currentPath*(min(1,node49path6) - 1))) & (success'=min(1, node49path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path7 * min(1,node49path7) - currentNode*(min(1, node49path7) - 1))) &  (currentPath'=(7 * min(1, node49path7) - currentPath*(min(1,node49path7) - 1))) & (success'=min(1, node49path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path8 * min(1,node49path8) - currentNode*(min(1, node49path8) - 1))) &  (currentPath'=(8 * min(1, node49path8) - currentPath*(min(1,node49path8) - 1))) & (success'=min(1, node49path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path9 * min(1,node49path9) - currentNode*(min(1, node49path9) - 1))) &  (currentPath'=(9 * min(1, node49path9) - currentPath*(min(1,node49path9) - 1))) & (success'=min(1, node49path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path10 * min(1,node49path10) - currentNode*(min(1, node49path10) - 1))) &  (currentPath'=(10 * min(1, node49path10) - currentPath*(min(1,node49path10) - 1))) & (success'=min(1, node49path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path11 * min(1,node49path11) - currentNode*(min(1, node49path11) - 1))) &  (currentPath'=(11 * min(1, node49path11) - currentPath*(min(1,node49path11) - 1))) & (success'=min(1, node49path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path12 * min(1,node49path12) - currentNode*(min(1, node49path12) - 1))) &  (currentPath'=(12 * min(1, node49path12) - currentPath*(min(1,node49path12) - 1))) & (success'=min(1, node49path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path13 * min(1,node49path13) - currentNode*(min(1, node49path13) - 1))) &  (currentPath'=(13 * min(1, node49path13) - currentPath*(min(1,node49path13) - 1))) & (success'=min(1, node49path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path14 * min(1,node49path14) - currentNode*(min(1, node49path14) - 1))) &  (currentPath'=(14 * min(1, node49path14) - currentPath*(min(1,node49path14) - 1))) & (success'=min(1, node49path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path15 * min(1,node49path15) - currentNode*(min(1, node49path15) - 1))) &  (currentPath'=(15 * min(1, node49path15) - currentPath*(min(1,node49path15) - 1))) & (success'=min(1, node49path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path16 * min(1,node49path16) - currentNode*(min(1, node49path16) - 1))) &  (currentPath'=(16 * min(1, node49path16) - currentPath*(min(1,node49path16) - 1))) & (success'=min(1, node49path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path17 * min(1,node49path17) - currentNode*(min(1, node49path17) - 1))) &  (currentPath'=(17 * min(1, node49path17) - currentPath*(min(1,node49path17) - 1))) & (success'=min(1, node49path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path18 * min(1,node49path18) - currentNode*(min(1, node49path18) - 1))) &  (currentPath'=(18 * min(1, node49path18) - currentPath*(min(1,node49path18) - 1))) & (success'=min(1, node49path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path19 * min(1,node49path19) - currentNode*(min(1, node49path19) - 1))) &  (currentPath'=(19 * min(1, node49path19) - currentPath*(min(1,node49path19) - 1))) & (success'=min(1, node49path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path20 * min(1,node49path20) - currentNode*(min(1, node49path20) - 1))) &  (currentPath'=(20 * min(1, node49path20) - currentPath*(min(1,node49path20) - 1))) & (success'=min(1, node49path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path21 * min(1,node49path21) - currentNode*(min(1, node49path21) - 1))) &  (currentPath'=(21 * min(1, node49path21) - currentPath*(min(1,node49path21) - 1))) & (success'=min(1, node49path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path22 * min(1,node49path22) - currentNode*(min(1, node49path22) - 1))) &  (currentPath'=(22 * min(1, node49path22) - currentPath*(min(1,node49path22) - 1))) & (success'=min(1, node49path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path23 * min(1,node49path23) - currentNode*(min(1, node49path23) - 1))) &  (currentPath'=(23 * min(1, node49path23) - currentPath*(min(1,node49path23) - 1))) & (success'=min(1, node49path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path24 * min(1,node49path24) - currentNode*(min(1, node49path24) - 1))) &  (currentPath'=(24 * min(1, node49path24) - currentPath*(min(1,node49path24) - 1))) & (success'=min(1, node49path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path25 * min(1,node49path25) - currentNode*(min(1, node49path25) - 1))) &  (currentPath'=(25 * min(1, node49path25) - currentPath*(min(1,node49path25) - 1))) & (success'=min(1, node49path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path26 * min(1,node49path26) - currentNode*(min(1, node49path26) - 1))) &  (currentPath'=(26 * min(1, node49path26) - currentPath*(min(1,node49path26) - 1))) & (success'=min(1, node49path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path27 * min(1,node49path27) - currentNode*(min(1, node49path27) - 1))) &  (currentPath'=(27 * min(1, node49path27) - currentPath*(min(1,node49path27) - 1))) & (success'=min(1, node49path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path28 * min(1,node49path28) - currentNode*(min(1, node49path28) - 1))) &  (currentPath'=(28 * min(1, node49path28) - currentPath*(min(1,node49path28) - 1))) & (success'=min(1, node49path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path29 * min(1,node49path29) - currentNode*(min(1, node49path29) - 1))) &  (currentPath'=(29 * min(1, node49path29) - currentPath*(min(1,node49path29) - 1))) & (success'=min(1, node49path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path30 * min(1,node49path30) - currentNode*(min(1, node49path30) - 1))) &  (currentPath'=(30 * min(1, node49path30) - currentPath*(min(1,node49path30) - 1))) & (success'=min(1, node49path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path31 * min(1,node49path31) - currentNode*(min(1, node49path31) - 1))) &  (currentPath'=(31 * min(1, node49path31) - currentPath*(min(1,node49path31) - 1))) & (success'=min(1, node49path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path32 * min(1,node49path32) - currentNode*(min(1, node49path32) - 1))) &  (currentPath'=(32 * min(1, node49path32) - currentPath*(min(1,node49path32) - 1))) & (success'=min(1, node49path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path33 * min(1,node49path33) - currentNode*(min(1, node49path33) - 1))) &  (currentPath'=(33 * min(1, node49path33) - currentPath*(min(1,node49path33) - 1))) & (success'=min(1, node49path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path34 * min(1,node49path34) - currentNode*(min(1, node49path34) - 1))) &  (currentPath'=(34 * min(1, node49path34) - currentPath*(min(1,node49path34) - 1))) & (success'=min(1, node49path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path35 * min(1,node49path35) - currentNode*(min(1, node49path35) - 1))) &  (currentPath'=(35 * min(1, node49path35) - currentPath*(min(1,node49path35) - 1))) & (success'=min(1, node49path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path36 * min(1,node49path36) - currentNode*(min(1, node49path36) - 1))) &  (currentPath'=(36 * min(1, node49path36) - currentPath*(min(1,node49path36) - 1))) & (success'=min(1, node49path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path37 * min(1,node49path37) - currentNode*(min(1, node49path37) - 1))) &  (currentPath'=(37 * min(1, node49path37) - currentPath*(min(1,node49path37) - 1))) & (success'=min(1, node49path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path38 * min(1,node49path38) - currentNode*(min(1, node49path38) - 1))) &  (currentPath'=(38 * min(1, node49path38) - currentPath*(min(1,node49path38) - 1))) & (success'=min(1, node49path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path39 * min(1,node49path39) - currentNode*(min(1, node49path39) - 1))) &  (currentPath'=(39 * min(1, node49path39) - currentPath*(min(1,node49path39) - 1))) & (success'=min(1, node49path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path40 * min(1,node49path40) - currentNode*(min(1, node49path40) - 1))) &  (currentPath'=(40 * min(1, node49path40) - currentPath*(min(1,node49path40) - 1))) & (success'=min(1, node49path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path41 * min(1,node49path41) - currentNode*(min(1, node49path41) - 1))) &  (currentPath'=(41 * min(1, node49path41) - currentPath*(min(1,node49path41) - 1))) & (success'=min(1, node49path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path42 * min(1,node49path42) - currentNode*(min(1, node49path42) - 1))) &  (currentPath'=(42 * min(1, node49path42) - currentPath*(min(1,node49path42) - 1))) & (success'=min(1, node49path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path43 * min(1,node49path43) - currentNode*(min(1, node49path43) - 1))) &  (currentPath'=(43 * min(1, node49path43) - currentPath*(min(1,node49path43) - 1))) & (success'=min(1, node49path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path44 * min(1,node49path44) - currentNode*(min(1, node49path44) - 1))) &  (currentPath'=(44 * min(1, node49path44) - currentPath*(min(1,node49path44) - 1))) & (success'=min(1, node49path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path45 * min(1,node49path45) - currentNode*(min(1, node49path45) - 1))) &  (currentPath'=(45 * min(1, node49path45) - currentPath*(min(1,node49path45) - 1))) & (success'=min(1, node49path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path46 * min(1,node49path46) - currentNode*(min(1, node49path46) - 1))) &  (currentPath'=(46 * min(1, node49path46) - currentPath*(min(1,node49path46) - 1))) & (success'=min(1, node49path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path47 * min(1,node49path47) - currentNode*(min(1, node49path47) - 1))) &  (currentPath'=(47 * min(1, node49path47) - currentPath*(min(1,node49path47) - 1))) & (success'=min(1, node49path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path48 * min(1,node49path48) - currentNode*(min(1, node49path48) - 1))) &  (currentPath'=(48 * min(1, node49path48) - currentPath*(min(1,node49path48) - 1))) & (success'=min(1, node49path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path49 * min(1,node49path49) - currentNode*(min(1, node49path49) - 1))) &  (currentPath'=(49 * min(1, node49path49) - currentPath*(min(1,node49path49) - 1))) & (success'=min(1, node49path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path50 * min(1,node49path50) - currentNode*(min(1, node49path50) - 1))) &  (currentPath'=(50 * min(1, node49path50) - currentPath*(min(1,node49path50) - 1))) & (success'=min(1, node49path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path51 * min(1,node49path51) - currentNode*(min(1, node49path51) - 1))) &  (currentPath'=(51 * min(1, node49path51) - currentPath*(min(1,node49path51) - 1))) & (success'=min(1, node49path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path52 * min(1,node49path52) - currentNode*(min(1, node49path52) - 1))) &  (currentPath'=(52 * min(1, node49path52) - currentPath*(min(1,node49path52) - 1))) & (success'=min(1, node49path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path53 * min(1,node49path53) - currentNode*(min(1, node49path53) - 1))) &  (currentPath'=(53 * min(1, node49path53) - currentPath*(min(1,node49path53) - 1))) & (success'=min(1, node49path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path54 * min(1,node49path54) - currentNode*(min(1, node49path54) - 1))) &  (currentPath'=(54 * min(1, node49path54) - currentPath*(min(1,node49path54) - 1))) & (success'=min(1, node49path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path55 * min(1,node49path55) - currentNode*(min(1, node49path55) - 1))) &  (currentPath'=(55 * min(1, node49path55) - currentPath*(min(1,node49path55) - 1))) & (success'=min(1, node49path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path56 * min(1,node49path56) - currentNode*(min(1, node49path56) - 1))) &  (currentPath'=(56 * min(1, node49path56) - currentPath*(min(1,node49path56) - 1))) & (success'=min(1, node49path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path57 * min(1,node49path57) - currentNode*(min(1, node49path57) - 1))) &  (currentPath'=(57 * min(1, node49path57) - currentPath*(min(1,node49path57) - 1))) & (success'=min(1, node49path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path58 * min(1,node49path58) - currentNode*(min(1, node49path58) - 1))) &  (currentPath'=(58 * min(1, node49path58) - currentPath*(min(1,node49path58) - 1))) & (success'=min(1, node49path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path59 * min(1,node49path59) - currentNode*(min(1, node49path59) - 1))) &  (currentPath'=(59 * min(1, node49path59) - currentPath*(min(1,node49path59) - 1))) & (success'=min(1, node49path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path60 * min(1,node49path60) - currentNode*(min(1, node49path60) - 1))) &  (currentPath'=(60 * min(1, node49path60) - currentPath*(min(1,node49path60) - 1))) & (success'=min(1, node49path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path61 * min(1,node49path61) - currentNode*(min(1, node49path61) - 1))) &  (currentPath'=(61 * min(1, node49path61) - currentPath*(min(1,node49path61) - 1))) & (success'=min(1, node49path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path62 * min(1,node49path62) - currentNode*(min(1, node49path62) - 1))) &  (currentPath'=(62 * min(1, node49path62) - currentPath*(min(1,node49path62) - 1))) & (success'=min(1, node49path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path63 * min(1,node49path63) - currentNode*(min(1, node49path63) - 1))) &  (currentPath'=(63 * min(1, node49path63) - currentPath*(min(1,node49path63) - 1))) & (success'=min(1, node49path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path64 * min(1,node49path64) - currentNode*(min(1, node49path64) - 1))) &  (currentPath'=(64 * min(1, node49path64) - currentPath*(min(1,node49path64) - 1))) & (success'=min(1, node49path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path65 * min(1,node49path65) - currentNode*(min(1, node49path65) - 1))) &  (currentPath'=(65 * min(1, node49path65) - currentPath*(min(1,node49path65) - 1))) & (success'=min(1, node49path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path66 * min(1,node49path66) - currentNode*(min(1, node49path66) - 1))) &  (currentPath'=(66 * min(1, node49path66) - currentPath*(min(1,node49path66) - 1))) & (success'=min(1, node49path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path67 * min(1,node49path67) - currentNode*(min(1, node49path67) - 1))) &  (currentPath'=(67 * min(1, node49path67) - currentPath*(min(1,node49path67) - 1))) & (success'=min(1, node49path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path68 * min(1,node49path68) - currentNode*(min(1, node49path68) - 1))) &  (currentPath'=(68 * min(1, node49path68) - currentPath*(min(1,node49path68) - 1))) & (success'=min(1, node49path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path69 * min(1,node49path69) - currentNode*(min(1, node49path69) - 1))) &  (currentPath'=(69 * min(1, node49path69) - currentPath*(min(1,node49path69) - 1))) & (success'=min(1, node49path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path70 * min(1,node49path70) - currentNode*(min(1, node49path70) - 1))) &  (currentPath'=(70 * min(1, node49path70) - currentPath*(min(1,node49path70) - 1))) & (success'=min(1, node49path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path71 * min(1,node49path71) - currentNode*(min(1, node49path71) - 1))) &  (currentPath'=(71 * min(1, node49path71) - currentPath*(min(1,node49path71) - 1))) & (success'=min(1, node49path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path72 * min(1,node49path72) - currentNode*(min(1, node49path72) - 1))) &  (currentPath'=(72 * min(1, node49path72) - currentPath*(min(1,node49path72) - 1))) & (success'=min(1, node49path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path73 * min(1,node49path73) - currentNode*(min(1, node49path73) - 1))) &  (currentPath'=(73 * min(1, node49path73) - currentPath*(min(1,node49path73) - 1))) & (success'=min(1, node49path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path74 * min(1,node49path74) - currentNode*(min(1, node49path74) - 1))) &  (currentPath'=(74 * min(1, node49path74) - currentPath*(min(1,node49path74) - 1))) & (success'=min(1, node49path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path75 * min(1,node49path75) - currentNode*(min(1, node49path75) - 1))) &  (currentPath'=(75 * min(1, node49path75) - currentPath*(min(1,node49path75) - 1))) & (success'=min(1, node49path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path76 * min(1,node49path76) - currentNode*(min(1, node49path76) - 1))) &  (currentPath'=(76 * min(1, node49path76) - currentPath*(min(1,node49path76) - 1))) & (success'=min(1, node49path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path77 * min(1,node49path77) - currentNode*(min(1, node49path77) - 1))) &  (currentPath'=(77 * min(1, node49path77) - currentPath*(min(1,node49path77) - 1))) & (success'=min(1, node49path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path78 * min(1,node49path78) - currentNode*(min(1, node49path78) - 1))) &  (currentPath'=(78 * min(1, node49path78) - currentPath*(min(1,node49path78) - 1))) & (success'=min(1, node49path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path79 * min(1,node49path79) - currentNode*(min(1, node49path79) - 1))) &  (currentPath'=(79 * min(1, node49path79) - currentPath*(min(1,node49path79) - 1))) & (success'=min(1, node49path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path80 * min(1,node49path80) - currentNode*(min(1, node49path80) - 1))) &  (currentPath'=(80 * min(1, node49path80) - currentPath*(min(1,node49path80) - 1))) & (success'=min(1, node49path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path81 * min(1,node49path81) - currentNode*(min(1, node49path81) - 1))) &  (currentPath'=(81 * min(1, node49path81) - currentPath*(min(1,node49path81) - 1))) & (success'=min(1, node49path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path82 * min(1,node49path82) - currentNode*(min(1, node49path82) - 1))) &  (currentPath'=(82 * min(1, node49path82) - currentPath*(min(1,node49path82) - 1))) & (success'=min(1, node49path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path83 * min(1,node49path83) - currentNode*(min(1, node49path83) - 1))) &  (currentPath'=(83 * min(1, node49path83) - currentPath*(min(1,node49path83) - 1))) & (success'=min(1, node49path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path84 * min(1,node49path84) - currentNode*(min(1, node49path84) - 1))) &  (currentPath'=(84 * min(1, node49path84) - currentPath*(min(1,node49path84) - 1))) & (success'=min(1, node49path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path85 * min(1,node49path85) - currentNode*(min(1, node49path85) - 1))) &  (currentPath'=(85 * min(1, node49path85) - currentPath*(min(1,node49path85) - 1))) & (success'=min(1, node49path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path86 * min(1,node49path86) - currentNode*(min(1, node49path86) - 1))) &  (currentPath'=(86 * min(1, node49path86) - currentPath*(min(1,node49path86) - 1))) & (success'=min(1, node49path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path87 * min(1,node49path87) - currentNode*(min(1, node49path87) - 1))) &  (currentPath'=(87 * min(1, node49path87) - currentPath*(min(1,node49path87) - 1))) & (success'=min(1, node49path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path88 * min(1,node49path88) - currentNode*(min(1, node49path88) - 1))) &  (currentPath'=(88 * min(1, node49path88) - currentPath*(min(1,node49path88) - 1))) & (success'=min(1, node49path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path89 * min(1,node49path89) - currentNode*(min(1, node49path89) - 1))) &  (currentPath'=(89 * min(1, node49path89) - currentPath*(min(1,node49path89) - 1))) & (success'=min(1, node49path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path90 * min(1,node49path90) - currentNode*(min(1, node49path90) - 1))) &  (currentPath'=(90 * min(1, node49path90) - currentPath*(min(1,node49path90) - 1))) & (success'=min(1, node49path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path91 * min(1,node49path91) - currentNode*(min(1, node49path91) - 1))) &  (currentPath'=(91 * min(1, node49path91) - currentPath*(min(1,node49path91) - 1))) & (success'=min(1, node49path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path92 * min(1,node49path92) - currentNode*(min(1, node49path92) - 1))) &  (currentPath'=(92 * min(1, node49path92) - currentPath*(min(1,node49path92) - 1))) & (success'=min(1, node49path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path93 * min(1,node49path93) - currentNode*(min(1, node49path93) - 1))) &  (currentPath'=(93 * min(1, node49path93) - currentPath*(min(1,node49path93) - 1))) & (success'=min(1, node49path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path94 * min(1,node49path94) - currentNode*(min(1, node49path94) - 1))) &  (currentPath'=(94 * min(1, node49path94) - currentPath*(min(1,node49path94) - 1))) & (success'=min(1, node49path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path95 * min(1,node49path95) - currentNode*(min(1, node49path95) - 1))) &  (currentPath'=(95 * min(1, node49path95) - currentPath*(min(1,node49path95) - 1))) & (success'=min(1, node49path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path96 * min(1,node49path96) - currentNode*(min(1, node49path96) - 1))) &  (currentPath'=(96 * min(1, node49path96) - currentPath*(min(1,node49path96) - 1))) & (success'=min(1, node49path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path97 * min(1,node49path97) - currentNode*(min(1, node49path97) - 1))) &  (currentPath'=(97 * min(1, node49path97) - currentPath*(min(1,node49path97) - 1))) & (success'=min(1, node49path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path98 * min(1,node49path98) - currentNode*(min(1, node49path98) - 1))) &  (currentPath'=(98 * min(1, node49path98) - currentPath*(min(1,node49path98) - 1))) & (success'=min(1, node49path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path99 * min(1,node49path99) - currentNode*(min(1, node49path99) - 1))) &  (currentPath'=(99 * min(1, node49path99) - currentPath*(min(1,node49path99) - 1))) & (success'=min(1, node49path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node49path100 * min(1,node49path100) - currentNode*(min(1, node49path100) - 1))) &  (currentPath'=(100 * min(1, node49path100) - currentPath*(min(1,node49path100) - 1))) & (success'=min(1, node49path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 50) ->
 numPathsInv: (currentNode'=(node50path1 * min(1,node50path1) - currentNode*(min(1, node50path1) - 1))) &  (currentPath'=(1 * min(1, node50path1) - currentPath*(min(1,node50path1) - 1))) & (success'=min(1, node50path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path2 * min(1,node50path2) - currentNode*(min(1, node50path2) - 1))) &  (currentPath'=(2 * min(1, node50path2) - currentPath*(min(1,node50path2) - 1))) & (success'=min(1, node50path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path3 * min(1,node50path3) - currentNode*(min(1, node50path3) - 1))) &  (currentPath'=(3 * min(1, node50path3) - currentPath*(min(1,node50path3) - 1))) & (success'=min(1, node50path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path4 * min(1,node50path4) - currentNode*(min(1, node50path4) - 1))) &  (currentPath'=(4 * min(1, node50path4) - currentPath*(min(1,node50path4) - 1))) & (success'=min(1, node50path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path5 * min(1,node50path5) - currentNode*(min(1, node50path5) - 1))) &  (currentPath'=(5 * min(1, node50path5) - currentPath*(min(1,node50path5) - 1))) & (success'=min(1, node50path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path6 * min(1,node50path6) - currentNode*(min(1, node50path6) - 1))) &  (currentPath'=(6 * min(1, node50path6) - currentPath*(min(1,node50path6) - 1))) & (success'=min(1, node50path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path7 * min(1,node50path7) - currentNode*(min(1, node50path7) - 1))) &  (currentPath'=(7 * min(1, node50path7) - currentPath*(min(1,node50path7) - 1))) & (success'=min(1, node50path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path8 * min(1,node50path8) - currentNode*(min(1, node50path8) - 1))) &  (currentPath'=(8 * min(1, node50path8) - currentPath*(min(1,node50path8) - 1))) & (success'=min(1, node50path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path9 * min(1,node50path9) - currentNode*(min(1, node50path9) - 1))) &  (currentPath'=(9 * min(1, node50path9) - currentPath*(min(1,node50path9) - 1))) & (success'=min(1, node50path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path10 * min(1,node50path10) - currentNode*(min(1, node50path10) - 1))) &  (currentPath'=(10 * min(1, node50path10) - currentPath*(min(1,node50path10) - 1))) & (success'=min(1, node50path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path11 * min(1,node50path11) - currentNode*(min(1, node50path11) - 1))) &  (currentPath'=(11 * min(1, node50path11) - currentPath*(min(1,node50path11) - 1))) & (success'=min(1, node50path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path12 * min(1,node50path12) - currentNode*(min(1, node50path12) - 1))) &  (currentPath'=(12 * min(1, node50path12) - currentPath*(min(1,node50path12) - 1))) & (success'=min(1, node50path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path13 * min(1,node50path13) - currentNode*(min(1, node50path13) - 1))) &  (currentPath'=(13 * min(1, node50path13) - currentPath*(min(1,node50path13) - 1))) & (success'=min(1, node50path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path14 * min(1,node50path14) - currentNode*(min(1, node50path14) - 1))) &  (currentPath'=(14 * min(1, node50path14) - currentPath*(min(1,node50path14) - 1))) & (success'=min(1, node50path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path15 * min(1,node50path15) - currentNode*(min(1, node50path15) - 1))) &  (currentPath'=(15 * min(1, node50path15) - currentPath*(min(1,node50path15) - 1))) & (success'=min(1, node50path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path16 * min(1,node50path16) - currentNode*(min(1, node50path16) - 1))) &  (currentPath'=(16 * min(1, node50path16) - currentPath*(min(1,node50path16) - 1))) & (success'=min(1, node50path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path17 * min(1,node50path17) - currentNode*(min(1, node50path17) - 1))) &  (currentPath'=(17 * min(1, node50path17) - currentPath*(min(1,node50path17) - 1))) & (success'=min(1, node50path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path18 * min(1,node50path18) - currentNode*(min(1, node50path18) - 1))) &  (currentPath'=(18 * min(1, node50path18) - currentPath*(min(1,node50path18) - 1))) & (success'=min(1, node50path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path19 * min(1,node50path19) - currentNode*(min(1, node50path19) - 1))) &  (currentPath'=(19 * min(1, node50path19) - currentPath*(min(1,node50path19) - 1))) & (success'=min(1, node50path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path20 * min(1,node50path20) - currentNode*(min(1, node50path20) - 1))) &  (currentPath'=(20 * min(1, node50path20) - currentPath*(min(1,node50path20) - 1))) & (success'=min(1, node50path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path21 * min(1,node50path21) - currentNode*(min(1, node50path21) - 1))) &  (currentPath'=(21 * min(1, node50path21) - currentPath*(min(1,node50path21) - 1))) & (success'=min(1, node50path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path22 * min(1,node50path22) - currentNode*(min(1, node50path22) - 1))) &  (currentPath'=(22 * min(1, node50path22) - currentPath*(min(1,node50path22) - 1))) & (success'=min(1, node50path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path23 * min(1,node50path23) - currentNode*(min(1, node50path23) - 1))) &  (currentPath'=(23 * min(1, node50path23) - currentPath*(min(1,node50path23) - 1))) & (success'=min(1, node50path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path24 * min(1,node50path24) - currentNode*(min(1, node50path24) - 1))) &  (currentPath'=(24 * min(1, node50path24) - currentPath*(min(1,node50path24) - 1))) & (success'=min(1, node50path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path25 * min(1,node50path25) - currentNode*(min(1, node50path25) - 1))) &  (currentPath'=(25 * min(1, node50path25) - currentPath*(min(1,node50path25) - 1))) & (success'=min(1, node50path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path26 * min(1,node50path26) - currentNode*(min(1, node50path26) - 1))) &  (currentPath'=(26 * min(1, node50path26) - currentPath*(min(1,node50path26) - 1))) & (success'=min(1, node50path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path27 * min(1,node50path27) - currentNode*(min(1, node50path27) - 1))) &  (currentPath'=(27 * min(1, node50path27) - currentPath*(min(1,node50path27) - 1))) & (success'=min(1, node50path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path28 * min(1,node50path28) - currentNode*(min(1, node50path28) - 1))) &  (currentPath'=(28 * min(1, node50path28) - currentPath*(min(1,node50path28) - 1))) & (success'=min(1, node50path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path29 * min(1,node50path29) - currentNode*(min(1, node50path29) - 1))) &  (currentPath'=(29 * min(1, node50path29) - currentPath*(min(1,node50path29) - 1))) & (success'=min(1, node50path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path30 * min(1,node50path30) - currentNode*(min(1, node50path30) - 1))) &  (currentPath'=(30 * min(1, node50path30) - currentPath*(min(1,node50path30) - 1))) & (success'=min(1, node50path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path31 * min(1,node50path31) - currentNode*(min(1, node50path31) - 1))) &  (currentPath'=(31 * min(1, node50path31) - currentPath*(min(1,node50path31) - 1))) & (success'=min(1, node50path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path32 * min(1,node50path32) - currentNode*(min(1, node50path32) - 1))) &  (currentPath'=(32 * min(1, node50path32) - currentPath*(min(1,node50path32) - 1))) & (success'=min(1, node50path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path33 * min(1,node50path33) - currentNode*(min(1, node50path33) - 1))) &  (currentPath'=(33 * min(1, node50path33) - currentPath*(min(1,node50path33) - 1))) & (success'=min(1, node50path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path34 * min(1,node50path34) - currentNode*(min(1, node50path34) - 1))) &  (currentPath'=(34 * min(1, node50path34) - currentPath*(min(1,node50path34) - 1))) & (success'=min(1, node50path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path35 * min(1,node50path35) - currentNode*(min(1, node50path35) - 1))) &  (currentPath'=(35 * min(1, node50path35) - currentPath*(min(1,node50path35) - 1))) & (success'=min(1, node50path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path36 * min(1,node50path36) - currentNode*(min(1, node50path36) - 1))) &  (currentPath'=(36 * min(1, node50path36) - currentPath*(min(1,node50path36) - 1))) & (success'=min(1, node50path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path37 * min(1,node50path37) - currentNode*(min(1, node50path37) - 1))) &  (currentPath'=(37 * min(1, node50path37) - currentPath*(min(1,node50path37) - 1))) & (success'=min(1, node50path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path38 * min(1,node50path38) - currentNode*(min(1, node50path38) - 1))) &  (currentPath'=(38 * min(1, node50path38) - currentPath*(min(1,node50path38) - 1))) & (success'=min(1, node50path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path39 * min(1,node50path39) - currentNode*(min(1, node50path39) - 1))) &  (currentPath'=(39 * min(1, node50path39) - currentPath*(min(1,node50path39) - 1))) & (success'=min(1, node50path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path40 * min(1,node50path40) - currentNode*(min(1, node50path40) - 1))) &  (currentPath'=(40 * min(1, node50path40) - currentPath*(min(1,node50path40) - 1))) & (success'=min(1, node50path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path41 * min(1,node50path41) - currentNode*(min(1, node50path41) - 1))) &  (currentPath'=(41 * min(1, node50path41) - currentPath*(min(1,node50path41) - 1))) & (success'=min(1, node50path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path42 * min(1,node50path42) - currentNode*(min(1, node50path42) - 1))) &  (currentPath'=(42 * min(1, node50path42) - currentPath*(min(1,node50path42) - 1))) & (success'=min(1, node50path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path43 * min(1,node50path43) - currentNode*(min(1, node50path43) - 1))) &  (currentPath'=(43 * min(1, node50path43) - currentPath*(min(1,node50path43) - 1))) & (success'=min(1, node50path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path44 * min(1,node50path44) - currentNode*(min(1, node50path44) - 1))) &  (currentPath'=(44 * min(1, node50path44) - currentPath*(min(1,node50path44) - 1))) & (success'=min(1, node50path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path45 * min(1,node50path45) - currentNode*(min(1, node50path45) - 1))) &  (currentPath'=(45 * min(1, node50path45) - currentPath*(min(1,node50path45) - 1))) & (success'=min(1, node50path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path46 * min(1,node50path46) - currentNode*(min(1, node50path46) - 1))) &  (currentPath'=(46 * min(1, node50path46) - currentPath*(min(1,node50path46) - 1))) & (success'=min(1, node50path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path47 * min(1,node50path47) - currentNode*(min(1, node50path47) - 1))) &  (currentPath'=(47 * min(1, node50path47) - currentPath*(min(1,node50path47) - 1))) & (success'=min(1, node50path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path48 * min(1,node50path48) - currentNode*(min(1, node50path48) - 1))) &  (currentPath'=(48 * min(1, node50path48) - currentPath*(min(1,node50path48) - 1))) & (success'=min(1, node50path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path49 * min(1,node50path49) - currentNode*(min(1, node50path49) - 1))) &  (currentPath'=(49 * min(1, node50path49) - currentPath*(min(1,node50path49) - 1))) & (success'=min(1, node50path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path50 * min(1,node50path50) - currentNode*(min(1, node50path50) - 1))) &  (currentPath'=(50 * min(1, node50path50) - currentPath*(min(1,node50path50) - 1))) & (success'=min(1, node50path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path51 * min(1,node50path51) - currentNode*(min(1, node50path51) - 1))) &  (currentPath'=(51 * min(1, node50path51) - currentPath*(min(1,node50path51) - 1))) & (success'=min(1, node50path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path52 * min(1,node50path52) - currentNode*(min(1, node50path52) - 1))) &  (currentPath'=(52 * min(1, node50path52) - currentPath*(min(1,node50path52) - 1))) & (success'=min(1, node50path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path53 * min(1,node50path53) - currentNode*(min(1, node50path53) - 1))) &  (currentPath'=(53 * min(1, node50path53) - currentPath*(min(1,node50path53) - 1))) & (success'=min(1, node50path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path54 * min(1,node50path54) - currentNode*(min(1, node50path54) - 1))) &  (currentPath'=(54 * min(1, node50path54) - currentPath*(min(1,node50path54) - 1))) & (success'=min(1, node50path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path55 * min(1,node50path55) - currentNode*(min(1, node50path55) - 1))) &  (currentPath'=(55 * min(1, node50path55) - currentPath*(min(1,node50path55) - 1))) & (success'=min(1, node50path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path56 * min(1,node50path56) - currentNode*(min(1, node50path56) - 1))) &  (currentPath'=(56 * min(1, node50path56) - currentPath*(min(1,node50path56) - 1))) & (success'=min(1, node50path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path57 * min(1,node50path57) - currentNode*(min(1, node50path57) - 1))) &  (currentPath'=(57 * min(1, node50path57) - currentPath*(min(1,node50path57) - 1))) & (success'=min(1, node50path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path58 * min(1,node50path58) - currentNode*(min(1, node50path58) - 1))) &  (currentPath'=(58 * min(1, node50path58) - currentPath*(min(1,node50path58) - 1))) & (success'=min(1, node50path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path59 * min(1,node50path59) - currentNode*(min(1, node50path59) - 1))) &  (currentPath'=(59 * min(1, node50path59) - currentPath*(min(1,node50path59) - 1))) & (success'=min(1, node50path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path60 * min(1,node50path60) - currentNode*(min(1, node50path60) - 1))) &  (currentPath'=(60 * min(1, node50path60) - currentPath*(min(1,node50path60) - 1))) & (success'=min(1, node50path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path61 * min(1,node50path61) - currentNode*(min(1, node50path61) - 1))) &  (currentPath'=(61 * min(1, node50path61) - currentPath*(min(1,node50path61) - 1))) & (success'=min(1, node50path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path62 * min(1,node50path62) - currentNode*(min(1, node50path62) - 1))) &  (currentPath'=(62 * min(1, node50path62) - currentPath*(min(1,node50path62) - 1))) & (success'=min(1, node50path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path63 * min(1,node50path63) - currentNode*(min(1, node50path63) - 1))) &  (currentPath'=(63 * min(1, node50path63) - currentPath*(min(1,node50path63) - 1))) & (success'=min(1, node50path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path64 * min(1,node50path64) - currentNode*(min(1, node50path64) - 1))) &  (currentPath'=(64 * min(1, node50path64) - currentPath*(min(1,node50path64) - 1))) & (success'=min(1, node50path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path65 * min(1,node50path65) - currentNode*(min(1, node50path65) - 1))) &  (currentPath'=(65 * min(1, node50path65) - currentPath*(min(1,node50path65) - 1))) & (success'=min(1, node50path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path66 * min(1,node50path66) - currentNode*(min(1, node50path66) - 1))) &  (currentPath'=(66 * min(1, node50path66) - currentPath*(min(1,node50path66) - 1))) & (success'=min(1, node50path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path67 * min(1,node50path67) - currentNode*(min(1, node50path67) - 1))) &  (currentPath'=(67 * min(1, node50path67) - currentPath*(min(1,node50path67) - 1))) & (success'=min(1, node50path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path68 * min(1,node50path68) - currentNode*(min(1, node50path68) - 1))) &  (currentPath'=(68 * min(1, node50path68) - currentPath*(min(1,node50path68) - 1))) & (success'=min(1, node50path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path69 * min(1,node50path69) - currentNode*(min(1, node50path69) - 1))) &  (currentPath'=(69 * min(1, node50path69) - currentPath*(min(1,node50path69) - 1))) & (success'=min(1, node50path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path70 * min(1,node50path70) - currentNode*(min(1, node50path70) - 1))) &  (currentPath'=(70 * min(1, node50path70) - currentPath*(min(1,node50path70) - 1))) & (success'=min(1, node50path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path71 * min(1,node50path71) - currentNode*(min(1, node50path71) - 1))) &  (currentPath'=(71 * min(1, node50path71) - currentPath*(min(1,node50path71) - 1))) & (success'=min(1, node50path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path72 * min(1,node50path72) - currentNode*(min(1, node50path72) - 1))) &  (currentPath'=(72 * min(1, node50path72) - currentPath*(min(1,node50path72) - 1))) & (success'=min(1, node50path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path73 * min(1,node50path73) - currentNode*(min(1, node50path73) - 1))) &  (currentPath'=(73 * min(1, node50path73) - currentPath*(min(1,node50path73) - 1))) & (success'=min(1, node50path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path74 * min(1,node50path74) - currentNode*(min(1, node50path74) - 1))) &  (currentPath'=(74 * min(1, node50path74) - currentPath*(min(1,node50path74) - 1))) & (success'=min(1, node50path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path75 * min(1,node50path75) - currentNode*(min(1, node50path75) - 1))) &  (currentPath'=(75 * min(1, node50path75) - currentPath*(min(1,node50path75) - 1))) & (success'=min(1, node50path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path76 * min(1,node50path76) - currentNode*(min(1, node50path76) - 1))) &  (currentPath'=(76 * min(1, node50path76) - currentPath*(min(1,node50path76) - 1))) & (success'=min(1, node50path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path77 * min(1,node50path77) - currentNode*(min(1, node50path77) - 1))) &  (currentPath'=(77 * min(1, node50path77) - currentPath*(min(1,node50path77) - 1))) & (success'=min(1, node50path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path78 * min(1,node50path78) - currentNode*(min(1, node50path78) - 1))) &  (currentPath'=(78 * min(1, node50path78) - currentPath*(min(1,node50path78) - 1))) & (success'=min(1, node50path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path79 * min(1,node50path79) - currentNode*(min(1, node50path79) - 1))) &  (currentPath'=(79 * min(1, node50path79) - currentPath*(min(1,node50path79) - 1))) & (success'=min(1, node50path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path80 * min(1,node50path80) - currentNode*(min(1, node50path80) - 1))) &  (currentPath'=(80 * min(1, node50path80) - currentPath*(min(1,node50path80) - 1))) & (success'=min(1, node50path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path81 * min(1,node50path81) - currentNode*(min(1, node50path81) - 1))) &  (currentPath'=(81 * min(1, node50path81) - currentPath*(min(1,node50path81) - 1))) & (success'=min(1, node50path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path82 * min(1,node50path82) - currentNode*(min(1, node50path82) - 1))) &  (currentPath'=(82 * min(1, node50path82) - currentPath*(min(1,node50path82) - 1))) & (success'=min(1, node50path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path83 * min(1,node50path83) - currentNode*(min(1, node50path83) - 1))) &  (currentPath'=(83 * min(1, node50path83) - currentPath*(min(1,node50path83) - 1))) & (success'=min(1, node50path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path84 * min(1,node50path84) - currentNode*(min(1, node50path84) - 1))) &  (currentPath'=(84 * min(1, node50path84) - currentPath*(min(1,node50path84) - 1))) & (success'=min(1, node50path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path85 * min(1,node50path85) - currentNode*(min(1, node50path85) - 1))) &  (currentPath'=(85 * min(1, node50path85) - currentPath*(min(1,node50path85) - 1))) & (success'=min(1, node50path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path86 * min(1,node50path86) - currentNode*(min(1, node50path86) - 1))) &  (currentPath'=(86 * min(1, node50path86) - currentPath*(min(1,node50path86) - 1))) & (success'=min(1, node50path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path87 * min(1,node50path87) - currentNode*(min(1, node50path87) - 1))) &  (currentPath'=(87 * min(1, node50path87) - currentPath*(min(1,node50path87) - 1))) & (success'=min(1, node50path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path88 * min(1,node50path88) - currentNode*(min(1, node50path88) - 1))) &  (currentPath'=(88 * min(1, node50path88) - currentPath*(min(1,node50path88) - 1))) & (success'=min(1, node50path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path89 * min(1,node50path89) - currentNode*(min(1, node50path89) - 1))) &  (currentPath'=(89 * min(1, node50path89) - currentPath*(min(1,node50path89) - 1))) & (success'=min(1, node50path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path90 * min(1,node50path90) - currentNode*(min(1, node50path90) - 1))) &  (currentPath'=(90 * min(1, node50path90) - currentPath*(min(1,node50path90) - 1))) & (success'=min(1, node50path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path91 * min(1,node50path91) - currentNode*(min(1, node50path91) - 1))) &  (currentPath'=(91 * min(1, node50path91) - currentPath*(min(1,node50path91) - 1))) & (success'=min(1, node50path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path92 * min(1,node50path92) - currentNode*(min(1, node50path92) - 1))) &  (currentPath'=(92 * min(1, node50path92) - currentPath*(min(1,node50path92) - 1))) & (success'=min(1, node50path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path93 * min(1,node50path93) - currentNode*(min(1, node50path93) - 1))) &  (currentPath'=(93 * min(1, node50path93) - currentPath*(min(1,node50path93) - 1))) & (success'=min(1, node50path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path94 * min(1,node50path94) - currentNode*(min(1, node50path94) - 1))) &  (currentPath'=(94 * min(1, node50path94) - currentPath*(min(1,node50path94) - 1))) & (success'=min(1, node50path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path95 * min(1,node50path95) - currentNode*(min(1, node50path95) - 1))) &  (currentPath'=(95 * min(1, node50path95) - currentPath*(min(1,node50path95) - 1))) & (success'=min(1, node50path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path96 * min(1,node50path96) - currentNode*(min(1, node50path96) - 1))) &  (currentPath'=(96 * min(1, node50path96) - currentPath*(min(1,node50path96) - 1))) & (success'=min(1, node50path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path97 * min(1,node50path97) - currentNode*(min(1, node50path97) - 1))) &  (currentPath'=(97 * min(1, node50path97) - currentPath*(min(1,node50path97) - 1))) & (success'=min(1, node50path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path98 * min(1,node50path98) - currentNode*(min(1, node50path98) - 1))) &  (currentPath'=(98 * min(1, node50path98) - currentPath*(min(1,node50path98) - 1))) & (success'=min(1, node50path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path99 * min(1,node50path99) - currentNode*(min(1, node50path99) - 1))) &  (currentPath'=(99 * min(1, node50path99) - currentPath*(min(1,node50path99) - 1))) & (success'=min(1, node50path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node50path100 * min(1,node50path100) - currentNode*(min(1, node50path100) - 1))) &  (currentPath'=(100 * min(1, node50path100) - currentPath*(min(1,node50path100) - 1))) & (success'=min(1, node50path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 51) ->
 numPathsInv: (currentNode'=(node51path1 * min(1,node51path1) - currentNode*(min(1, node51path1) - 1))) &  (currentPath'=(1 * min(1, node51path1) - currentPath*(min(1,node51path1) - 1))) & (success'=min(1, node51path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path2 * min(1,node51path2) - currentNode*(min(1, node51path2) - 1))) &  (currentPath'=(2 * min(1, node51path2) - currentPath*(min(1,node51path2) - 1))) & (success'=min(1, node51path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path3 * min(1,node51path3) - currentNode*(min(1, node51path3) - 1))) &  (currentPath'=(3 * min(1, node51path3) - currentPath*(min(1,node51path3) - 1))) & (success'=min(1, node51path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path4 * min(1,node51path4) - currentNode*(min(1, node51path4) - 1))) &  (currentPath'=(4 * min(1, node51path4) - currentPath*(min(1,node51path4) - 1))) & (success'=min(1, node51path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path5 * min(1,node51path5) - currentNode*(min(1, node51path5) - 1))) &  (currentPath'=(5 * min(1, node51path5) - currentPath*(min(1,node51path5) - 1))) & (success'=min(1, node51path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path6 * min(1,node51path6) - currentNode*(min(1, node51path6) - 1))) &  (currentPath'=(6 * min(1, node51path6) - currentPath*(min(1,node51path6) - 1))) & (success'=min(1, node51path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path7 * min(1,node51path7) - currentNode*(min(1, node51path7) - 1))) &  (currentPath'=(7 * min(1, node51path7) - currentPath*(min(1,node51path7) - 1))) & (success'=min(1, node51path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path8 * min(1,node51path8) - currentNode*(min(1, node51path8) - 1))) &  (currentPath'=(8 * min(1, node51path8) - currentPath*(min(1,node51path8) - 1))) & (success'=min(1, node51path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path9 * min(1,node51path9) - currentNode*(min(1, node51path9) - 1))) &  (currentPath'=(9 * min(1, node51path9) - currentPath*(min(1,node51path9) - 1))) & (success'=min(1, node51path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path10 * min(1,node51path10) - currentNode*(min(1, node51path10) - 1))) &  (currentPath'=(10 * min(1, node51path10) - currentPath*(min(1,node51path10) - 1))) & (success'=min(1, node51path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path11 * min(1,node51path11) - currentNode*(min(1, node51path11) - 1))) &  (currentPath'=(11 * min(1, node51path11) - currentPath*(min(1,node51path11) - 1))) & (success'=min(1, node51path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path12 * min(1,node51path12) - currentNode*(min(1, node51path12) - 1))) &  (currentPath'=(12 * min(1, node51path12) - currentPath*(min(1,node51path12) - 1))) & (success'=min(1, node51path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path13 * min(1,node51path13) - currentNode*(min(1, node51path13) - 1))) &  (currentPath'=(13 * min(1, node51path13) - currentPath*(min(1,node51path13) - 1))) & (success'=min(1, node51path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path14 * min(1,node51path14) - currentNode*(min(1, node51path14) - 1))) &  (currentPath'=(14 * min(1, node51path14) - currentPath*(min(1,node51path14) - 1))) & (success'=min(1, node51path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path15 * min(1,node51path15) - currentNode*(min(1, node51path15) - 1))) &  (currentPath'=(15 * min(1, node51path15) - currentPath*(min(1,node51path15) - 1))) & (success'=min(1, node51path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path16 * min(1,node51path16) - currentNode*(min(1, node51path16) - 1))) &  (currentPath'=(16 * min(1, node51path16) - currentPath*(min(1,node51path16) - 1))) & (success'=min(1, node51path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path17 * min(1,node51path17) - currentNode*(min(1, node51path17) - 1))) &  (currentPath'=(17 * min(1, node51path17) - currentPath*(min(1,node51path17) - 1))) & (success'=min(1, node51path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path18 * min(1,node51path18) - currentNode*(min(1, node51path18) - 1))) &  (currentPath'=(18 * min(1, node51path18) - currentPath*(min(1,node51path18) - 1))) & (success'=min(1, node51path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path19 * min(1,node51path19) - currentNode*(min(1, node51path19) - 1))) &  (currentPath'=(19 * min(1, node51path19) - currentPath*(min(1,node51path19) - 1))) & (success'=min(1, node51path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path20 * min(1,node51path20) - currentNode*(min(1, node51path20) - 1))) &  (currentPath'=(20 * min(1, node51path20) - currentPath*(min(1,node51path20) - 1))) & (success'=min(1, node51path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path21 * min(1,node51path21) - currentNode*(min(1, node51path21) - 1))) &  (currentPath'=(21 * min(1, node51path21) - currentPath*(min(1,node51path21) - 1))) & (success'=min(1, node51path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path22 * min(1,node51path22) - currentNode*(min(1, node51path22) - 1))) &  (currentPath'=(22 * min(1, node51path22) - currentPath*(min(1,node51path22) - 1))) & (success'=min(1, node51path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path23 * min(1,node51path23) - currentNode*(min(1, node51path23) - 1))) &  (currentPath'=(23 * min(1, node51path23) - currentPath*(min(1,node51path23) - 1))) & (success'=min(1, node51path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path24 * min(1,node51path24) - currentNode*(min(1, node51path24) - 1))) &  (currentPath'=(24 * min(1, node51path24) - currentPath*(min(1,node51path24) - 1))) & (success'=min(1, node51path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path25 * min(1,node51path25) - currentNode*(min(1, node51path25) - 1))) &  (currentPath'=(25 * min(1, node51path25) - currentPath*(min(1,node51path25) - 1))) & (success'=min(1, node51path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path26 * min(1,node51path26) - currentNode*(min(1, node51path26) - 1))) &  (currentPath'=(26 * min(1, node51path26) - currentPath*(min(1,node51path26) - 1))) & (success'=min(1, node51path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path27 * min(1,node51path27) - currentNode*(min(1, node51path27) - 1))) &  (currentPath'=(27 * min(1, node51path27) - currentPath*(min(1,node51path27) - 1))) & (success'=min(1, node51path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path28 * min(1,node51path28) - currentNode*(min(1, node51path28) - 1))) &  (currentPath'=(28 * min(1, node51path28) - currentPath*(min(1,node51path28) - 1))) & (success'=min(1, node51path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path29 * min(1,node51path29) - currentNode*(min(1, node51path29) - 1))) &  (currentPath'=(29 * min(1, node51path29) - currentPath*(min(1,node51path29) - 1))) & (success'=min(1, node51path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path30 * min(1,node51path30) - currentNode*(min(1, node51path30) - 1))) &  (currentPath'=(30 * min(1, node51path30) - currentPath*(min(1,node51path30) - 1))) & (success'=min(1, node51path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path31 * min(1,node51path31) - currentNode*(min(1, node51path31) - 1))) &  (currentPath'=(31 * min(1, node51path31) - currentPath*(min(1,node51path31) - 1))) & (success'=min(1, node51path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path32 * min(1,node51path32) - currentNode*(min(1, node51path32) - 1))) &  (currentPath'=(32 * min(1, node51path32) - currentPath*(min(1,node51path32) - 1))) & (success'=min(1, node51path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path33 * min(1,node51path33) - currentNode*(min(1, node51path33) - 1))) &  (currentPath'=(33 * min(1, node51path33) - currentPath*(min(1,node51path33) - 1))) & (success'=min(1, node51path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path34 * min(1,node51path34) - currentNode*(min(1, node51path34) - 1))) &  (currentPath'=(34 * min(1, node51path34) - currentPath*(min(1,node51path34) - 1))) & (success'=min(1, node51path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path35 * min(1,node51path35) - currentNode*(min(1, node51path35) - 1))) &  (currentPath'=(35 * min(1, node51path35) - currentPath*(min(1,node51path35) - 1))) & (success'=min(1, node51path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path36 * min(1,node51path36) - currentNode*(min(1, node51path36) - 1))) &  (currentPath'=(36 * min(1, node51path36) - currentPath*(min(1,node51path36) - 1))) & (success'=min(1, node51path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path37 * min(1,node51path37) - currentNode*(min(1, node51path37) - 1))) &  (currentPath'=(37 * min(1, node51path37) - currentPath*(min(1,node51path37) - 1))) & (success'=min(1, node51path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path38 * min(1,node51path38) - currentNode*(min(1, node51path38) - 1))) &  (currentPath'=(38 * min(1, node51path38) - currentPath*(min(1,node51path38) - 1))) & (success'=min(1, node51path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path39 * min(1,node51path39) - currentNode*(min(1, node51path39) - 1))) &  (currentPath'=(39 * min(1, node51path39) - currentPath*(min(1,node51path39) - 1))) & (success'=min(1, node51path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path40 * min(1,node51path40) - currentNode*(min(1, node51path40) - 1))) &  (currentPath'=(40 * min(1, node51path40) - currentPath*(min(1,node51path40) - 1))) & (success'=min(1, node51path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path41 * min(1,node51path41) - currentNode*(min(1, node51path41) - 1))) &  (currentPath'=(41 * min(1, node51path41) - currentPath*(min(1,node51path41) - 1))) & (success'=min(1, node51path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path42 * min(1,node51path42) - currentNode*(min(1, node51path42) - 1))) &  (currentPath'=(42 * min(1, node51path42) - currentPath*(min(1,node51path42) - 1))) & (success'=min(1, node51path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path43 * min(1,node51path43) - currentNode*(min(1, node51path43) - 1))) &  (currentPath'=(43 * min(1, node51path43) - currentPath*(min(1,node51path43) - 1))) & (success'=min(1, node51path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path44 * min(1,node51path44) - currentNode*(min(1, node51path44) - 1))) &  (currentPath'=(44 * min(1, node51path44) - currentPath*(min(1,node51path44) - 1))) & (success'=min(1, node51path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path45 * min(1,node51path45) - currentNode*(min(1, node51path45) - 1))) &  (currentPath'=(45 * min(1, node51path45) - currentPath*(min(1,node51path45) - 1))) & (success'=min(1, node51path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path46 * min(1,node51path46) - currentNode*(min(1, node51path46) - 1))) &  (currentPath'=(46 * min(1, node51path46) - currentPath*(min(1,node51path46) - 1))) & (success'=min(1, node51path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path47 * min(1,node51path47) - currentNode*(min(1, node51path47) - 1))) &  (currentPath'=(47 * min(1, node51path47) - currentPath*(min(1,node51path47) - 1))) & (success'=min(1, node51path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path48 * min(1,node51path48) - currentNode*(min(1, node51path48) - 1))) &  (currentPath'=(48 * min(1, node51path48) - currentPath*(min(1,node51path48) - 1))) & (success'=min(1, node51path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path49 * min(1,node51path49) - currentNode*(min(1, node51path49) - 1))) &  (currentPath'=(49 * min(1, node51path49) - currentPath*(min(1,node51path49) - 1))) & (success'=min(1, node51path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path50 * min(1,node51path50) - currentNode*(min(1, node51path50) - 1))) &  (currentPath'=(50 * min(1, node51path50) - currentPath*(min(1,node51path50) - 1))) & (success'=min(1, node51path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path51 * min(1,node51path51) - currentNode*(min(1, node51path51) - 1))) &  (currentPath'=(51 * min(1, node51path51) - currentPath*(min(1,node51path51) - 1))) & (success'=min(1, node51path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path52 * min(1,node51path52) - currentNode*(min(1, node51path52) - 1))) &  (currentPath'=(52 * min(1, node51path52) - currentPath*(min(1,node51path52) - 1))) & (success'=min(1, node51path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path53 * min(1,node51path53) - currentNode*(min(1, node51path53) - 1))) &  (currentPath'=(53 * min(1, node51path53) - currentPath*(min(1,node51path53) - 1))) & (success'=min(1, node51path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path54 * min(1,node51path54) - currentNode*(min(1, node51path54) - 1))) &  (currentPath'=(54 * min(1, node51path54) - currentPath*(min(1,node51path54) - 1))) & (success'=min(1, node51path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path55 * min(1,node51path55) - currentNode*(min(1, node51path55) - 1))) &  (currentPath'=(55 * min(1, node51path55) - currentPath*(min(1,node51path55) - 1))) & (success'=min(1, node51path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path56 * min(1,node51path56) - currentNode*(min(1, node51path56) - 1))) &  (currentPath'=(56 * min(1, node51path56) - currentPath*(min(1,node51path56) - 1))) & (success'=min(1, node51path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path57 * min(1,node51path57) - currentNode*(min(1, node51path57) - 1))) &  (currentPath'=(57 * min(1, node51path57) - currentPath*(min(1,node51path57) - 1))) & (success'=min(1, node51path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path58 * min(1,node51path58) - currentNode*(min(1, node51path58) - 1))) &  (currentPath'=(58 * min(1, node51path58) - currentPath*(min(1,node51path58) - 1))) & (success'=min(1, node51path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path59 * min(1,node51path59) - currentNode*(min(1, node51path59) - 1))) &  (currentPath'=(59 * min(1, node51path59) - currentPath*(min(1,node51path59) - 1))) & (success'=min(1, node51path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path60 * min(1,node51path60) - currentNode*(min(1, node51path60) - 1))) &  (currentPath'=(60 * min(1, node51path60) - currentPath*(min(1,node51path60) - 1))) & (success'=min(1, node51path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path61 * min(1,node51path61) - currentNode*(min(1, node51path61) - 1))) &  (currentPath'=(61 * min(1, node51path61) - currentPath*(min(1,node51path61) - 1))) & (success'=min(1, node51path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path62 * min(1,node51path62) - currentNode*(min(1, node51path62) - 1))) &  (currentPath'=(62 * min(1, node51path62) - currentPath*(min(1,node51path62) - 1))) & (success'=min(1, node51path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path63 * min(1,node51path63) - currentNode*(min(1, node51path63) - 1))) &  (currentPath'=(63 * min(1, node51path63) - currentPath*(min(1,node51path63) - 1))) & (success'=min(1, node51path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path64 * min(1,node51path64) - currentNode*(min(1, node51path64) - 1))) &  (currentPath'=(64 * min(1, node51path64) - currentPath*(min(1,node51path64) - 1))) & (success'=min(1, node51path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path65 * min(1,node51path65) - currentNode*(min(1, node51path65) - 1))) &  (currentPath'=(65 * min(1, node51path65) - currentPath*(min(1,node51path65) - 1))) & (success'=min(1, node51path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path66 * min(1,node51path66) - currentNode*(min(1, node51path66) - 1))) &  (currentPath'=(66 * min(1, node51path66) - currentPath*(min(1,node51path66) - 1))) & (success'=min(1, node51path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path67 * min(1,node51path67) - currentNode*(min(1, node51path67) - 1))) &  (currentPath'=(67 * min(1, node51path67) - currentPath*(min(1,node51path67) - 1))) & (success'=min(1, node51path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path68 * min(1,node51path68) - currentNode*(min(1, node51path68) - 1))) &  (currentPath'=(68 * min(1, node51path68) - currentPath*(min(1,node51path68) - 1))) & (success'=min(1, node51path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path69 * min(1,node51path69) - currentNode*(min(1, node51path69) - 1))) &  (currentPath'=(69 * min(1, node51path69) - currentPath*(min(1,node51path69) - 1))) & (success'=min(1, node51path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path70 * min(1,node51path70) - currentNode*(min(1, node51path70) - 1))) &  (currentPath'=(70 * min(1, node51path70) - currentPath*(min(1,node51path70) - 1))) & (success'=min(1, node51path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path71 * min(1,node51path71) - currentNode*(min(1, node51path71) - 1))) &  (currentPath'=(71 * min(1, node51path71) - currentPath*(min(1,node51path71) - 1))) & (success'=min(1, node51path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path72 * min(1,node51path72) - currentNode*(min(1, node51path72) - 1))) &  (currentPath'=(72 * min(1, node51path72) - currentPath*(min(1,node51path72) - 1))) & (success'=min(1, node51path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path73 * min(1,node51path73) - currentNode*(min(1, node51path73) - 1))) &  (currentPath'=(73 * min(1, node51path73) - currentPath*(min(1,node51path73) - 1))) & (success'=min(1, node51path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path74 * min(1,node51path74) - currentNode*(min(1, node51path74) - 1))) &  (currentPath'=(74 * min(1, node51path74) - currentPath*(min(1,node51path74) - 1))) & (success'=min(1, node51path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path75 * min(1,node51path75) - currentNode*(min(1, node51path75) - 1))) &  (currentPath'=(75 * min(1, node51path75) - currentPath*(min(1,node51path75) - 1))) & (success'=min(1, node51path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path76 * min(1,node51path76) - currentNode*(min(1, node51path76) - 1))) &  (currentPath'=(76 * min(1, node51path76) - currentPath*(min(1,node51path76) - 1))) & (success'=min(1, node51path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path77 * min(1,node51path77) - currentNode*(min(1, node51path77) - 1))) &  (currentPath'=(77 * min(1, node51path77) - currentPath*(min(1,node51path77) - 1))) & (success'=min(1, node51path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path78 * min(1,node51path78) - currentNode*(min(1, node51path78) - 1))) &  (currentPath'=(78 * min(1, node51path78) - currentPath*(min(1,node51path78) - 1))) & (success'=min(1, node51path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path79 * min(1,node51path79) - currentNode*(min(1, node51path79) - 1))) &  (currentPath'=(79 * min(1, node51path79) - currentPath*(min(1,node51path79) - 1))) & (success'=min(1, node51path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path80 * min(1,node51path80) - currentNode*(min(1, node51path80) - 1))) &  (currentPath'=(80 * min(1, node51path80) - currentPath*(min(1,node51path80) - 1))) & (success'=min(1, node51path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path81 * min(1,node51path81) - currentNode*(min(1, node51path81) - 1))) &  (currentPath'=(81 * min(1, node51path81) - currentPath*(min(1,node51path81) - 1))) & (success'=min(1, node51path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path82 * min(1,node51path82) - currentNode*(min(1, node51path82) - 1))) &  (currentPath'=(82 * min(1, node51path82) - currentPath*(min(1,node51path82) - 1))) & (success'=min(1, node51path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path83 * min(1,node51path83) - currentNode*(min(1, node51path83) - 1))) &  (currentPath'=(83 * min(1, node51path83) - currentPath*(min(1,node51path83) - 1))) & (success'=min(1, node51path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path84 * min(1,node51path84) - currentNode*(min(1, node51path84) - 1))) &  (currentPath'=(84 * min(1, node51path84) - currentPath*(min(1,node51path84) - 1))) & (success'=min(1, node51path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path85 * min(1,node51path85) - currentNode*(min(1, node51path85) - 1))) &  (currentPath'=(85 * min(1, node51path85) - currentPath*(min(1,node51path85) - 1))) & (success'=min(1, node51path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path86 * min(1,node51path86) - currentNode*(min(1, node51path86) - 1))) &  (currentPath'=(86 * min(1, node51path86) - currentPath*(min(1,node51path86) - 1))) & (success'=min(1, node51path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path87 * min(1,node51path87) - currentNode*(min(1, node51path87) - 1))) &  (currentPath'=(87 * min(1, node51path87) - currentPath*(min(1,node51path87) - 1))) & (success'=min(1, node51path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path88 * min(1,node51path88) - currentNode*(min(1, node51path88) - 1))) &  (currentPath'=(88 * min(1, node51path88) - currentPath*(min(1,node51path88) - 1))) & (success'=min(1, node51path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path89 * min(1,node51path89) - currentNode*(min(1, node51path89) - 1))) &  (currentPath'=(89 * min(1, node51path89) - currentPath*(min(1,node51path89) - 1))) & (success'=min(1, node51path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path90 * min(1,node51path90) - currentNode*(min(1, node51path90) - 1))) &  (currentPath'=(90 * min(1, node51path90) - currentPath*(min(1,node51path90) - 1))) & (success'=min(1, node51path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path91 * min(1,node51path91) - currentNode*(min(1, node51path91) - 1))) &  (currentPath'=(91 * min(1, node51path91) - currentPath*(min(1,node51path91) - 1))) & (success'=min(1, node51path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path92 * min(1,node51path92) - currentNode*(min(1, node51path92) - 1))) &  (currentPath'=(92 * min(1, node51path92) - currentPath*(min(1,node51path92) - 1))) & (success'=min(1, node51path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path93 * min(1,node51path93) - currentNode*(min(1, node51path93) - 1))) &  (currentPath'=(93 * min(1, node51path93) - currentPath*(min(1,node51path93) - 1))) & (success'=min(1, node51path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path94 * min(1,node51path94) - currentNode*(min(1, node51path94) - 1))) &  (currentPath'=(94 * min(1, node51path94) - currentPath*(min(1,node51path94) - 1))) & (success'=min(1, node51path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path95 * min(1,node51path95) - currentNode*(min(1, node51path95) - 1))) &  (currentPath'=(95 * min(1, node51path95) - currentPath*(min(1,node51path95) - 1))) & (success'=min(1, node51path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path96 * min(1,node51path96) - currentNode*(min(1, node51path96) - 1))) &  (currentPath'=(96 * min(1, node51path96) - currentPath*(min(1,node51path96) - 1))) & (success'=min(1, node51path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path97 * min(1,node51path97) - currentNode*(min(1, node51path97) - 1))) &  (currentPath'=(97 * min(1, node51path97) - currentPath*(min(1,node51path97) - 1))) & (success'=min(1, node51path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path98 * min(1,node51path98) - currentNode*(min(1, node51path98) - 1))) &  (currentPath'=(98 * min(1, node51path98) - currentPath*(min(1,node51path98) - 1))) & (success'=min(1, node51path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path99 * min(1,node51path99) - currentNode*(min(1, node51path99) - 1))) &  (currentPath'=(99 * min(1, node51path99) - currentPath*(min(1,node51path99) - 1))) & (success'=min(1, node51path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node51path100 * min(1,node51path100) - currentNode*(min(1, node51path100) - 1))) &  (currentPath'=(100 * min(1, node51path100) - currentPath*(min(1,node51path100) - 1))) & (success'=min(1, node51path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 52) ->
 numPathsInv: (currentNode'=(node52path1 * min(1,node52path1) - currentNode*(min(1, node52path1) - 1))) &  (currentPath'=(1 * min(1, node52path1) - currentPath*(min(1,node52path1) - 1))) & (success'=min(1, node52path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path2 * min(1,node52path2) - currentNode*(min(1, node52path2) - 1))) &  (currentPath'=(2 * min(1, node52path2) - currentPath*(min(1,node52path2) - 1))) & (success'=min(1, node52path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path3 * min(1,node52path3) - currentNode*(min(1, node52path3) - 1))) &  (currentPath'=(3 * min(1, node52path3) - currentPath*(min(1,node52path3) - 1))) & (success'=min(1, node52path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path4 * min(1,node52path4) - currentNode*(min(1, node52path4) - 1))) &  (currentPath'=(4 * min(1, node52path4) - currentPath*(min(1,node52path4) - 1))) & (success'=min(1, node52path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path5 * min(1,node52path5) - currentNode*(min(1, node52path5) - 1))) &  (currentPath'=(5 * min(1, node52path5) - currentPath*(min(1,node52path5) - 1))) & (success'=min(1, node52path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path6 * min(1,node52path6) - currentNode*(min(1, node52path6) - 1))) &  (currentPath'=(6 * min(1, node52path6) - currentPath*(min(1,node52path6) - 1))) & (success'=min(1, node52path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path7 * min(1,node52path7) - currentNode*(min(1, node52path7) - 1))) &  (currentPath'=(7 * min(1, node52path7) - currentPath*(min(1,node52path7) - 1))) & (success'=min(1, node52path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path8 * min(1,node52path8) - currentNode*(min(1, node52path8) - 1))) &  (currentPath'=(8 * min(1, node52path8) - currentPath*(min(1,node52path8) - 1))) & (success'=min(1, node52path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path9 * min(1,node52path9) - currentNode*(min(1, node52path9) - 1))) &  (currentPath'=(9 * min(1, node52path9) - currentPath*(min(1,node52path9) - 1))) & (success'=min(1, node52path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path10 * min(1,node52path10) - currentNode*(min(1, node52path10) - 1))) &  (currentPath'=(10 * min(1, node52path10) - currentPath*(min(1,node52path10) - 1))) & (success'=min(1, node52path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path11 * min(1,node52path11) - currentNode*(min(1, node52path11) - 1))) &  (currentPath'=(11 * min(1, node52path11) - currentPath*(min(1,node52path11) - 1))) & (success'=min(1, node52path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path12 * min(1,node52path12) - currentNode*(min(1, node52path12) - 1))) &  (currentPath'=(12 * min(1, node52path12) - currentPath*(min(1,node52path12) - 1))) & (success'=min(1, node52path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path13 * min(1,node52path13) - currentNode*(min(1, node52path13) - 1))) &  (currentPath'=(13 * min(1, node52path13) - currentPath*(min(1,node52path13) - 1))) & (success'=min(1, node52path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path14 * min(1,node52path14) - currentNode*(min(1, node52path14) - 1))) &  (currentPath'=(14 * min(1, node52path14) - currentPath*(min(1,node52path14) - 1))) & (success'=min(1, node52path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path15 * min(1,node52path15) - currentNode*(min(1, node52path15) - 1))) &  (currentPath'=(15 * min(1, node52path15) - currentPath*(min(1,node52path15) - 1))) & (success'=min(1, node52path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path16 * min(1,node52path16) - currentNode*(min(1, node52path16) - 1))) &  (currentPath'=(16 * min(1, node52path16) - currentPath*(min(1,node52path16) - 1))) & (success'=min(1, node52path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path17 * min(1,node52path17) - currentNode*(min(1, node52path17) - 1))) &  (currentPath'=(17 * min(1, node52path17) - currentPath*(min(1,node52path17) - 1))) & (success'=min(1, node52path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path18 * min(1,node52path18) - currentNode*(min(1, node52path18) - 1))) &  (currentPath'=(18 * min(1, node52path18) - currentPath*(min(1,node52path18) - 1))) & (success'=min(1, node52path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path19 * min(1,node52path19) - currentNode*(min(1, node52path19) - 1))) &  (currentPath'=(19 * min(1, node52path19) - currentPath*(min(1,node52path19) - 1))) & (success'=min(1, node52path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path20 * min(1,node52path20) - currentNode*(min(1, node52path20) - 1))) &  (currentPath'=(20 * min(1, node52path20) - currentPath*(min(1,node52path20) - 1))) & (success'=min(1, node52path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path21 * min(1,node52path21) - currentNode*(min(1, node52path21) - 1))) &  (currentPath'=(21 * min(1, node52path21) - currentPath*(min(1,node52path21) - 1))) & (success'=min(1, node52path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path22 * min(1,node52path22) - currentNode*(min(1, node52path22) - 1))) &  (currentPath'=(22 * min(1, node52path22) - currentPath*(min(1,node52path22) - 1))) & (success'=min(1, node52path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path23 * min(1,node52path23) - currentNode*(min(1, node52path23) - 1))) &  (currentPath'=(23 * min(1, node52path23) - currentPath*(min(1,node52path23) - 1))) & (success'=min(1, node52path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path24 * min(1,node52path24) - currentNode*(min(1, node52path24) - 1))) &  (currentPath'=(24 * min(1, node52path24) - currentPath*(min(1,node52path24) - 1))) & (success'=min(1, node52path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path25 * min(1,node52path25) - currentNode*(min(1, node52path25) - 1))) &  (currentPath'=(25 * min(1, node52path25) - currentPath*(min(1,node52path25) - 1))) & (success'=min(1, node52path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path26 * min(1,node52path26) - currentNode*(min(1, node52path26) - 1))) &  (currentPath'=(26 * min(1, node52path26) - currentPath*(min(1,node52path26) - 1))) & (success'=min(1, node52path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path27 * min(1,node52path27) - currentNode*(min(1, node52path27) - 1))) &  (currentPath'=(27 * min(1, node52path27) - currentPath*(min(1,node52path27) - 1))) & (success'=min(1, node52path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path28 * min(1,node52path28) - currentNode*(min(1, node52path28) - 1))) &  (currentPath'=(28 * min(1, node52path28) - currentPath*(min(1,node52path28) - 1))) & (success'=min(1, node52path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path29 * min(1,node52path29) - currentNode*(min(1, node52path29) - 1))) &  (currentPath'=(29 * min(1, node52path29) - currentPath*(min(1,node52path29) - 1))) & (success'=min(1, node52path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path30 * min(1,node52path30) - currentNode*(min(1, node52path30) - 1))) &  (currentPath'=(30 * min(1, node52path30) - currentPath*(min(1,node52path30) - 1))) & (success'=min(1, node52path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path31 * min(1,node52path31) - currentNode*(min(1, node52path31) - 1))) &  (currentPath'=(31 * min(1, node52path31) - currentPath*(min(1,node52path31) - 1))) & (success'=min(1, node52path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path32 * min(1,node52path32) - currentNode*(min(1, node52path32) - 1))) &  (currentPath'=(32 * min(1, node52path32) - currentPath*(min(1,node52path32) - 1))) & (success'=min(1, node52path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path33 * min(1,node52path33) - currentNode*(min(1, node52path33) - 1))) &  (currentPath'=(33 * min(1, node52path33) - currentPath*(min(1,node52path33) - 1))) & (success'=min(1, node52path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path34 * min(1,node52path34) - currentNode*(min(1, node52path34) - 1))) &  (currentPath'=(34 * min(1, node52path34) - currentPath*(min(1,node52path34) - 1))) & (success'=min(1, node52path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path35 * min(1,node52path35) - currentNode*(min(1, node52path35) - 1))) &  (currentPath'=(35 * min(1, node52path35) - currentPath*(min(1,node52path35) - 1))) & (success'=min(1, node52path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path36 * min(1,node52path36) - currentNode*(min(1, node52path36) - 1))) &  (currentPath'=(36 * min(1, node52path36) - currentPath*(min(1,node52path36) - 1))) & (success'=min(1, node52path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path37 * min(1,node52path37) - currentNode*(min(1, node52path37) - 1))) &  (currentPath'=(37 * min(1, node52path37) - currentPath*(min(1,node52path37) - 1))) & (success'=min(1, node52path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path38 * min(1,node52path38) - currentNode*(min(1, node52path38) - 1))) &  (currentPath'=(38 * min(1, node52path38) - currentPath*(min(1,node52path38) - 1))) & (success'=min(1, node52path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path39 * min(1,node52path39) - currentNode*(min(1, node52path39) - 1))) &  (currentPath'=(39 * min(1, node52path39) - currentPath*(min(1,node52path39) - 1))) & (success'=min(1, node52path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path40 * min(1,node52path40) - currentNode*(min(1, node52path40) - 1))) &  (currentPath'=(40 * min(1, node52path40) - currentPath*(min(1,node52path40) - 1))) & (success'=min(1, node52path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path41 * min(1,node52path41) - currentNode*(min(1, node52path41) - 1))) &  (currentPath'=(41 * min(1, node52path41) - currentPath*(min(1,node52path41) - 1))) & (success'=min(1, node52path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path42 * min(1,node52path42) - currentNode*(min(1, node52path42) - 1))) &  (currentPath'=(42 * min(1, node52path42) - currentPath*(min(1,node52path42) - 1))) & (success'=min(1, node52path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path43 * min(1,node52path43) - currentNode*(min(1, node52path43) - 1))) &  (currentPath'=(43 * min(1, node52path43) - currentPath*(min(1,node52path43) - 1))) & (success'=min(1, node52path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path44 * min(1,node52path44) - currentNode*(min(1, node52path44) - 1))) &  (currentPath'=(44 * min(1, node52path44) - currentPath*(min(1,node52path44) - 1))) & (success'=min(1, node52path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path45 * min(1,node52path45) - currentNode*(min(1, node52path45) - 1))) &  (currentPath'=(45 * min(1, node52path45) - currentPath*(min(1,node52path45) - 1))) & (success'=min(1, node52path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path46 * min(1,node52path46) - currentNode*(min(1, node52path46) - 1))) &  (currentPath'=(46 * min(1, node52path46) - currentPath*(min(1,node52path46) - 1))) & (success'=min(1, node52path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path47 * min(1,node52path47) - currentNode*(min(1, node52path47) - 1))) &  (currentPath'=(47 * min(1, node52path47) - currentPath*(min(1,node52path47) - 1))) & (success'=min(1, node52path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path48 * min(1,node52path48) - currentNode*(min(1, node52path48) - 1))) &  (currentPath'=(48 * min(1, node52path48) - currentPath*(min(1,node52path48) - 1))) & (success'=min(1, node52path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path49 * min(1,node52path49) - currentNode*(min(1, node52path49) - 1))) &  (currentPath'=(49 * min(1, node52path49) - currentPath*(min(1,node52path49) - 1))) & (success'=min(1, node52path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path50 * min(1,node52path50) - currentNode*(min(1, node52path50) - 1))) &  (currentPath'=(50 * min(1, node52path50) - currentPath*(min(1,node52path50) - 1))) & (success'=min(1, node52path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path51 * min(1,node52path51) - currentNode*(min(1, node52path51) - 1))) &  (currentPath'=(51 * min(1, node52path51) - currentPath*(min(1,node52path51) - 1))) & (success'=min(1, node52path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path52 * min(1,node52path52) - currentNode*(min(1, node52path52) - 1))) &  (currentPath'=(52 * min(1, node52path52) - currentPath*(min(1,node52path52) - 1))) & (success'=min(1, node52path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path53 * min(1,node52path53) - currentNode*(min(1, node52path53) - 1))) &  (currentPath'=(53 * min(1, node52path53) - currentPath*(min(1,node52path53) - 1))) & (success'=min(1, node52path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path54 * min(1,node52path54) - currentNode*(min(1, node52path54) - 1))) &  (currentPath'=(54 * min(1, node52path54) - currentPath*(min(1,node52path54) - 1))) & (success'=min(1, node52path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path55 * min(1,node52path55) - currentNode*(min(1, node52path55) - 1))) &  (currentPath'=(55 * min(1, node52path55) - currentPath*(min(1,node52path55) - 1))) & (success'=min(1, node52path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path56 * min(1,node52path56) - currentNode*(min(1, node52path56) - 1))) &  (currentPath'=(56 * min(1, node52path56) - currentPath*(min(1,node52path56) - 1))) & (success'=min(1, node52path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path57 * min(1,node52path57) - currentNode*(min(1, node52path57) - 1))) &  (currentPath'=(57 * min(1, node52path57) - currentPath*(min(1,node52path57) - 1))) & (success'=min(1, node52path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path58 * min(1,node52path58) - currentNode*(min(1, node52path58) - 1))) &  (currentPath'=(58 * min(1, node52path58) - currentPath*(min(1,node52path58) - 1))) & (success'=min(1, node52path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path59 * min(1,node52path59) - currentNode*(min(1, node52path59) - 1))) &  (currentPath'=(59 * min(1, node52path59) - currentPath*(min(1,node52path59) - 1))) & (success'=min(1, node52path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path60 * min(1,node52path60) - currentNode*(min(1, node52path60) - 1))) &  (currentPath'=(60 * min(1, node52path60) - currentPath*(min(1,node52path60) - 1))) & (success'=min(1, node52path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path61 * min(1,node52path61) - currentNode*(min(1, node52path61) - 1))) &  (currentPath'=(61 * min(1, node52path61) - currentPath*(min(1,node52path61) - 1))) & (success'=min(1, node52path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path62 * min(1,node52path62) - currentNode*(min(1, node52path62) - 1))) &  (currentPath'=(62 * min(1, node52path62) - currentPath*(min(1,node52path62) - 1))) & (success'=min(1, node52path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path63 * min(1,node52path63) - currentNode*(min(1, node52path63) - 1))) &  (currentPath'=(63 * min(1, node52path63) - currentPath*(min(1,node52path63) - 1))) & (success'=min(1, node52path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path64 * min(1,node52path64) - currentNode*(min(1, node52path64) - 1))) &  (currentPath'=(64 * min(1, node52path64) - currentPath*(min(1,node52path64) - 1))) & (success'=min(1, node52path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path65 * min(1,node52path65) - currentNode*(min(1, node52path65) - 1))) &  (currentPath'=(65 * min(1, node52path65) - currentPath*(min(1,node52path65) - 1))) & (success'=min(1, node52path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path66 * min(1,node52path66) - currentNode*(min(1, node52path66) - 1))) &  (currentPath'=(66 * min(1, node52path66) - currentPath*(min(1,node52path66) - 1))) & (success'=min(1, node52path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path67 * min(1,node52path67) - currentNode*(min(1, node52path67) - 1))) &  (currentPath'=(67 * min(1, node52path67) - currentPath*(min(1,node52path67) - 1))) & (success'=min(1, node52path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path68 * min(1,node52path68) - currentNode*(min(1, node52path68) - 1))) &  (currentPath'=(68 * min(1, node52path68) - currentPath*(min(1,node52path68) - 1))) & (success'=min(1, node52path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path69 * min(1,node52path69) - currentNode*(min(1, node52path69) - 1))) &  (currentPath'=(69 * min(1, node52path69) - currentPath*(min(1,node52path69) - 1))) & (success'=min(1, node52path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path70 * min(1,node52path70) - currentNode*(min(1, node52path70) - 1))) &  (currentPath'=(70 * min(1, node52path70) - currentPath*(min(1,node52path70) - 1))) & (success'=min(1, node52path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path71 * min(1,node52path71) - currentNode*(min(1, node52path71) - 1))) &  (currentPath'=(71 * min(1, node52path71) - currentPath*(min(1,node52path71) - 1))) & (success'=min(1, node52path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path72 * min(1,node52path72) - currentNode*(min(1, node52path72) - 1))) &  (currentPath'=(72 * min(1, node52path72) - currentPath*(min(1,node52path72) - 1))) & (success'=min(1, node52path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path73 * min(1,node52path73) - currentNode*(min(1, node52path73) - 1))) &  (currentPath'=(73 * min(1, node52path73) - currentPath*(min(1,node52path73) - 1))) & (success'=min(1, node52path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path74 * min(1,node52path74) - currentNode*(min(1, node52path74) - 1))) &  (currentPath'=(74 * min(1, node52path74) - currentPath*(min(1,node52path74) - 1))) & (success'=min(1, node52path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path75 * min(1,node52path75) - currentNode*(min(1, node52path75) - 1))) &  (currentPath'=(75 * min(1, node52path75) - currentPath*(min(1,node52path75) - 1))) & (success'=min(1, node52path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path76 * min(1,node52path76) - currentNode*(min(1, node52path76) - 1))) &  (currentPath'=(76 * min(1, node52path76) - currentPath*(min(1,node52path76) - 1))) & (success'=min(1, node52path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path77 * min(1,node52path77) - currentNode*(min(1, node52path77) - 1))) &  (currentPath'=(77 * min(1, node52path77) - currentPath*(min(1,node52path77) - 1))) & (success'=min(1, node52path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path78 * min(1,node52path78) - currentNode*(min(1, node52path78) - 1))) &  (currentPath'=(78 * min(1, node52path78) - currentPath*(min(1,node52path78) - 1))) & (success'=min(1, node52path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path79 * min(1,node52path79) - currentNode*(min(1, node52path79) - 1))) &  (currentPath'=(79 * min(1, node52path79) - currentPath*(min(1,node52path79) - 1))) & (success'=min(1, node52path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path80 * min(1,node52path80) - currentNode*(min(1, node52path80) - 1))) &  (currentPath'=(80 * min(1, node52path80) - currentPath*(min(1,node52path80) - 1))) & (success'=min(1, node52path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path81 * min(1,node52path81) - currentNode*(min(1, node52path81) - 1))) &  (currentPath'=(81 * min(1, node52path81) - currentPath*(min(1,node52path81) - 1))) & (success'=min(1, node52path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path82 * min(1,node52path82) - currentNode*(min(1, node52path82) - 1))) &  (currentPath'=(82 * min(1, node52path82) - currentPath*(min(1,node52path82) - 1))) & (success'=min(1, node52path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path83 * min(1,node52path83) - currentNode*(min(1, node52path83) - 1))) &  (currentPath'=(83 * min(1, node52path83) - currentPath*(min(1,node52path83) - 1))) & (success'=min(1, node52path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path84 * min(1,node52path84) - currentNode*(min(1, node52path84) - 1))) &  (currentPath'=(84 * min(1, node52path84) - currentPath*(min(1,node52path84) - 1))) & (success'=min(1, node52path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path85 * min(1,node52path85) - currentNode*(min(1, node52path85) - 1))) &  (currentPath'=(85 * min(1, node52path85) - currentPath*(min(1,node52path85) - 1))) & (success'=min(1, node52path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path86 * min(1,node52path86) - currentNode*(min(1, node52path86) - 1))) &  (currentPath'=(86 * min(1, node52path86) - currentPath*(min(1,node52path86) - 1))) & (success'=min(1, node52path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path87 * min(1,node52path87) - currentNode*(min(1, node52path87) - 1))) &  (currentPath'=(87 * min(1, node52path87) - currentPath*(min(1,node52path87) - 1))) & (success'=min(1, node52path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path88 * min(1,node52path88) - currentNode*(min(1, node52path88) - 1))) &  (currentPath'=(88 * min(1, node52path88) - currentPath*(min(1,node52path88) - 1))) & (success'=min(1, node52path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path89 * min(1,node52path89) - currentNode*(min(1, node52path89) - 1))) &  (currentPath'=(89 * min(1, node52path89) - currentPath*(min(1,node52path89) - 1))) & (success'=min(1, node52path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path90 * min(1,node52path90) - currentNode*(min(1, node52path90) - 1))) &  (currentPath'=(90 * min(1, node52path90) - currentPath*(min(1,node52path90) - 1))) & (success'=min(1, node52path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path91 * min(1,node52path91) - currentNode*(min(1, node52path91) - 1))) &  (currentPath'=(91 * min(1, node52path91) - currentPath*(min(1,node52path91) - 1))) & (success'=min(1, node52path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path92 * min(1,node52path92) - currentNode*(min(1, node52path92) - 1))) &  (currentPath'=(92 * min(1, node52path92) - currentPath*(min(1,node52path92) - 1))) & (success'=min(1, node52path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path93 * min(1,node52path93) - currentNode*(min(1, node52path93) - 1))) &  (currentPath'=(93 * min(1, node52path93) - currentPath*(min(1,node52path93) - 1))) & (success'=min(1, node52path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path94 * min(1,node52path94) - currentNode*(min(1, node52path94) - 1))) &  (currentPath'=(94 * min(1, node52path94) - currentPath*(min(1,node52path94) - 1))) & (success'=min(1, node52path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path95 * min(1,node52path95) - currentNode*(min(1, node52path95) - 1))) &  (currentPath'=(95 * min(1, node52path95) - currentPath*(min(1,node52path95) - 1))) & (success'=min(1, node52path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path96 * min(1,node52path96) - currentNode*(min(1, node52path96) - 1))) &  (currentPath'=(96 * min(1, node52path96) - currentPath*(min(1,node52path96) - 1))) & (success'=min(1, node52path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path97 * min(1,node52path97) - currentNode*(min(1, node52path97) - 1))) &  (currentPath'=(97 * min(1, node52path97) - currentPath*(min(1,node52path97) - 1))) & (success'=min(1, node52path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path98 * min(1,node52path98) - currentNode*(min(1, node52path98) - 1))) &  (currentPath'=(98 * min(1, node52path98) - currentPath*(min(1,node52path98) - 1))) & (success'=min(1, node52path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path99 * min(1,node52path99) - currentNode*(min(1, node52path99) - 1))) &  (currentPath'=(99 * min(1, node52path99) - currentPath*(min(1,node52path99) - 1))) & (success'=min(1, node52path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node52path100 * min(1,node52path100) - currentNode*(min(1, node52path100) - 1))) &  (currentPath'=(100 * min(1, node52path100) - currentPath*(min(1,node52path100) - 1))) & (success'=min(1, node52path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 53) ->
 numPathsInv: (currentNode'=(node53path1 * min(1,node53path1) - currentNode*(min(1, node53path1) - 1))) &  (currentPath'=(1 * min(1, node53path1) - currentPath*(min(1,node53path1) - 1))) & (success'=min(1, node53path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path2 * min(1,node53path2) - currentNode*(min(1, node53path2) - 1))) &  (currentPath'=(2 * min(1, node53path2) - currentPath*(min(1,node53path2) - 1))) & (success'=min(1, node53path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path3 * min(1,node53path3) - currentNode*(min(1, node53path3) - 1))) &  (currentPath'=(3 * min(1, node53path3) - currentPath*(min(1,node53path3) - 1))) & (success'=min(1, node53path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path4 * min(1,node53path4) - currentNode*(min(1, node53path4) - 1))) &  (currentPath'=(4 * min(1, node53path4) - currentPath*(min(1,node53path4) - 1))) & (success'=min(1, node53path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path5 * min(1,node53path5) - currentNode*(min(1, node53path5) - 1))) &  (currentPath'=(5 * min(1, node53path5) - currentPath*(min(1,node53path5) - 1))) & (success'=min(1, node53path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path6 * min(1,node53path6) - currentNode*(min(1, node53path6) - 1))) &  (currentPath'=(6 * min(1, node53path6) - currentPath*(min(1,node53path6) - 1))) & (success'=min(1, node53path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path7 * min(1,node53path7) - currentNode*(min(1, node53path7) - 1))) &  (currentPath'=(7 * min(1, node53path7) - currentPath*(min(1,node53path7) - 1))) & (success'=min(1, node53path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path8 * min(1,node53path8) - currentNode*(min(1, node53path8) - 1))) &  (currentPath'=(8 * min(1, node53path8) - currentPath*(min(1,node53path8) - 1))) & (success'=min(1, node53path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path9 * min(1,node53path9) - currentNode*(min(1, node53path9) - 1))) &  (currentPath'=(9 * min(1, node53path9) - currentPath*(min(1,node53path9) - 1))) & (success'=min(1, node53path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path10 * min(1,node53path10) - currentNode*(min(1, node53path10) - 1))) &  (currentPath'=(10 * min(1, node53path10) - currentPath*(min(1,node53path10) - 1))) & (success'=min(1, node53path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path11 * min(1,node53path11) - currentNode*(min(1, node53path11) - 1))) &  (currentPath'=(11 * min(1, node53path11) - currentPath*(min(1,node53path11) - 1))) & (success'=min(1, node53path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path12 * min(1,node53path12) - currentNode*(min(1, node53path12) - 1))) &  (currentPath'=(12 * min(1, node53path12) - currentPath*(min(1,node53path12) - 1))) & (success'=min(1, node53path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path13 * min(1,node53path13) - currentNode*(min(1, node53path13) - 1))) &  (currentPath'=(13 * min(1, node53path13) - currentPath*(min(1,node53path13) - 1))) & (success'=min(1, node53path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path14 * min(1,node53path14) - currentNode*(min(1, node53path14) - 1))) &  (currentPath'=(14 * min(1, node53path14) - currentPath*(min(1,node53path14) - 1))) & (success'=min(1, node53path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path15 * min(1,node53path15) - currentNode*(min(1, node53path15) - 1))) &  (currentPath'=(15 * min(1, node53path15) - currentPath*(min(1,node53path15) - 1))) & (success'=min(1, node53path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path16 * min(1,node53path16) - currentNode*(min(1, node53path16) - 1))) &  (currentPath'=(16 * min(1, node53path16) - currentPath*(min(1,node53path16) - 1))) & (success'=min(1, node53path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path17 * min(1,node53path17) - currentNode*(min(1, node53path17) - 1))) &  (currentPath'=(17 * min(1, node53path17) - currentPath*(min(1,node53path17) - 1))) & (success'=min(1, node53path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path18 * min(1,node53path18) - currentNode*(min(1, node53path18) - 1))) &  (currentPath'=(18 * min(1, node53path18) - currentPath*(min(1,node53path18) - 1))) & (success'=min(1, node53path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path19 * min(1,node53path19) - currentNode*(min(1, node53path19) - 1))) &  (currentPath'=(19 * min(1, node53path19) - currentPath*(min(1,node53path19) - 1))) & (success'=min(1, node53path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path20 * min(1,node53path20) - currentNode*(min(1, node53path20) - 1))) &  (currentPath'=(20 * min(1, node53path20) - currentPath*(min(1,node53path20) - 1))) & (success'=min(1, node53path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path21 * min(1,node53path21) - currentNode*(min(1, node53path21) - 1))) &  (currentPath'=(21 * min(1, node53path21) - currentPath*(min(1,node53path21) - 1))) & (success'=min(1, node53path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path22 * min(1,node53path22) - currentNode*(min(1, node53path22) - 1))) &  (currentPath'=(22 * min(1, node53path22) - currentPath*(min(1,node53path22) - 1))) & (success'=min(1, node53path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path23 * min(1,node53path23) - currentNode*(min(1, node53path23) - 1))) &  (currentPath'=(23 * min(1, node53path23) - currentPath*(min(1,node53path23) - 1))) & (success'=min(1, node53path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path24 * min(1,node53path24) - currentNode*(min(1, node53path24) - 1))) &  (currentPath'=(24 * min(1, node53path24) - currentPath*(min(1,node53path24) - 1))) & (success'=min(1, node53path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path25 * min(1,node53path25) - currentNode*(min(1, node53path25) - 1))) &  (currentPath'=(25 * min(1, node53path25) - currentPath*(min(1,node53path25) - 1))) & (success'=min(1, node53path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path26 * min(1,node53path26) - currentNode*(min(1, node53path26) - 1))) &  (currentPath'=(26 * min(1, node53path26) - currentPath*(min(1,node53path26) - 1))) & (success'=min(1, node53path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path27 * min(1,node53path27) - currentNode*(min(1, node53path27) - 1))) &  (currentPath'=(27 * min(1, node53path27) - currentPath*(min(1,node53path27) - 1))) & (success'=min(1, node53path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path28 * min(1,node53path28) - currentNode*(min(1, node53path28) - 1))) &  (currentPath'=(28 * min(1, node53path28) - currentPath*(min(1,node53path28) - 1))) & (success'=min(1, node53path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path29 * min(1,node53path29) - currentNode*(min(1, node53path29) - 1))) &  (currentPath'=(29 * min(1, node53path29) - currentPath*(min(1,node53path29) - 1))) & (success'=min(1, node53path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path30 * min(1,node53path30) - currentNode*(min(1, node53path30) - 1))) &  (currentPath'=(30 * min(1, node53path30) - currentPath*(min(1,node53path30) - 1))) & (success'=min(1, node53path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path31 * min(1,node53path31) - currentNode*(min(1, node53path31) - 1))) &  (currentPath'=(31 * min(1, node53path31) - currentPath*(min(1,node53path31) - 1))) & (success'=min(1, node53path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path32 * min(1,node53path32) - currentNode*(min(1, node53path32) - 1))) &  (currentPath'=(32 * min(1, node53path32) - currentPath*(min(1,node53path32) - 1))) & (success'=min(1, node53path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path33 * min(1,node53path33) - currentNode*(min(1, node53path33) - 1))) &  (currentPath'=(33 * min(1, node53path33) - currentPath*(min(1,node53path33) - 1))) & (success'=min(1, node53path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path34 * min(1,node53path34) - currentNode*(min(1, node53path34) - 1))) &  (currentPath'=(34 * min(1, node53path34) - currentPath*(min(1,node53path34) - 1))) & (success'=min(1, node53path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path35 * min(1,node53path35) - currentNode*(min(1, node53path35) - 1))) &  (currentPath'=(35 * min(1, node53path35) - currentPath*(min(1,node53path35) - 1))) & (success'=min(1, node53path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path36 * min(1,node53path36) - currentNode*(min(1, node53path36) - 1))) &  (currentPath'=(36 * min(1, node53path36) - currentPath*(min(1,node53path36) - 1))) & (success'=min(1, node53path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path37 * min(1,node53path37) - currentNode*(min(1, node53path37) - 1))) &  (currentPath'=(37 * min(1, node53path37) - currentPath*(min(1,node53path37) - 1))) & (success'=min(1, node53path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path38 * min(1,node53path38) - currentNode*(min(1, node53path38) - 1))) &  (currentPath'=(38 * min(1, node53path38) - currentPath*(min(1,node53path38) - 1))) & (success'=min(1, node53path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path39 * min(1,node53path39) - currentNode*(min(1, node53path39) - 1))) &  (currentPath'=(39 * min(1, node53path39) - currentPath*(min(1,node53path39) - 1))) & (success'=min(1, node53path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path40 * min(1,node53path40) - currentNode*(min(1, node53path40) - 1))) &  (currentPath'=(40 * min(1, node53path40) - currentPath*(min(1,node53path40) - 1))) & (success'=min(1, node53path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path41 * min(1,node53path41) - currentNode*(min(1, node53path41) - 1))) &  (currentPath'=(41 * min(1, node53path41) - currentPath*(min(1,node53path41) - 1))) & (success'=min(1, node53path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path42 * min(1,node53path42) - currentNode*(min(1, node53path42) - 1))) &  (currentPath'=(42 * min(1, node53path42) - currentPath*(min(1,node53path42) - 1))) & (success'=min(1, node53path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path43 * min(1,node53path43) - currentNode*(min(1, node53path43) - 1))) &  (currentPath'=(43 * min(1, node53path43) - currentPath*(min(1,node53path43) - 1))) & (success'=min(1, node53path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path44 * min(1,node53path44) - currentNode*(min(1, node53path44) - 1))) &  (currentPath'=(44 * min(1, node53path44) - currentPath*(min(1,node53path44) - 1))) & (success'=min(1, node53path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path45 * min(1,node53path45) - currentNode*(min(1, node53path45) - 1))) &  (currentPath'=(45 * min(1, node53path45) - currentPath*(min(1,node53path45) - 1))) & (success'=min(1, node53path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path46 * min(1,node53path46) - currentNode*(min(1, node53path46) - 1))) &  (currentPath'=(46 * min(1, node53path46) - currentPath*(min(1,node53path46) - 1))) & (success'=min(1, node53path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path47 * min(1,node53path47) - currentNode*(min(1, node53path47) - 1))) &  (currentPath'=(47 * min(1, node53path47) - currentPath*(min(1,node53path47) - 1))) & (success'=min(1, node53path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path48 * min(1,node53path48) - currentNode*(min(1, node53path48) - 1))) &  (currentPath'=(48 * min(1, node53path48) - currentPath*(min(1,node53path48) - 1))) & (success'=min(1, node53path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path49 * min(1,node53path49) - currentNode*(min(1, node53path49) - 1))) &  (currentPath'=(49 * min(1, node53path49) - currentPath*(min(1,node53path49) - 1))) & (success'=min(1, node53path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path50 * min(1,node53path50) - currentNode*(min(1, node53path50) - 1))) &  (currentPath'=(50 * min(1, node53path50) - currentPath*(min(1,node53path50) - 1))) & (success'=min(1, node53path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path51 * min(1,node53path51) - currentNode*(min(1, node53path51) - 1))) &  (currentPath'=(51 * min(1, node53path51) - currentPath*(min(1,node53path51) - 1))) & (success'=min(1, node53path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path52 * min(1,node53path52) - currentNode*(min(1, node53path52) - 1))) &  (currentPath'=(52 * min(1, node53path52) - currentPath*(min(1,node53path52) - 1))) & (success'=min(1, node53path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path53 * min(1,node53path53) - currentNode*(min(1, node53path53) - 1))) &  (currentPath'=(53 * min(1, node53path53) - currentPath*(min(1,node53path53) - 1))) & (success'=min(1, node53path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path54 * min(1,node53path54) - currentNode*(min(1, node53path54) - 1))) &  (currentPath'=(54 * min(1, node53path54) - currentPath*(min(1,node53path54) - 1))) & (success'=min(1, node53path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path55 * min(1,node53path55) - currentNode*(min(1, node53path55) - 1))) &  (currentPath'=(55 * min(1, node53path55) - currentPath*(min(1,node53path55) - 1))) & (success'=min(1, node53path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path56 * min(1,node53path56) - currentNode*(min(1, node53path56) - 1))) &  (currentPath'=(56 * min(1, node53path56) - currentPath*(min(1,node53path56) - 1))) & (success'=min(1, node53path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path57 * min(1,node53path57) - currentNode*(min(1, node53path57) - 1))) &  (currentPath'=(57 * min(1, node53path57) - currentPath*(min(1,node53path57) - 1))) & (success'=min(1, node53path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path58 * min(1,node53path58) - currentNode*(min(1, node53path58) - 1))) &  (currentPath'=(58 * min(1, node53path58) - currentPath*(min(1,node53path58) - 1))) & (success'=min(1, node53path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path59 * min(1,node53path59) - currentNode*(min(1, node53path59) - 1))) &  (currentPath'=(59 * min(1, node53path59) - currentPath*(min(1,node53path59) - 1))) & (success'=min(1, node53path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path60 * min(1,node53path60) - currentNode*(min(1, node53path60) - 1))) &  (currentPath'=(60 * min(1, node53path60) - currentPath*(min(1,node53path60) - 1))) & (success'=min(1, node53path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path61 * min(1,node53path61) - currentNode*(min(1, node53path61) - 1))) &  (currentPath'=(61 * min(1, node53path61) - currentPath*(min(1,node53path61) - 1))) & (success'=min(1, node53path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path62 * min(1,node53path62) - currentNode*(min(1, node53path62) - 1))) &  (currentPath'=(62 * min(1, node53path62) - currentPath*(min(1,node53path62) - 1))) & (success'=min(1, node53path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path63 * min(1,node53path63) - currentNode*(min(1, node53path63) - 1))) &  (currentPath'=(63 * min(1, node53path63) - currentPath*(min(1,node53path63) - 1))) & (success'=min(1, node53path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path64 * min(1,node53path64) - currentNode*(min(1, node53path64) - 1))) &  (currentPath'=(64 * min(1, node53path64) - currentPath*(min(1,node53path64) - 1))) & (success'=min(1, node53path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path65 * min(1,node53path65) - currentNode*(min(1, node53path65) - 1))) &  (currentPath'=(65 * min(1, node53path65) - currentPath*(min(1,node53path65) - 1))) & (success'=min(1, node53path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path66 * min(1,node53path66) - currentNode*(min(1, node53path66) - 1))) &  (currentPath'=(66 * min(1, node53path66) - currentPath*(min(1,node53path66) - 1))) & (success'=min(1, node53path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path67 * min(1,node53path67) - currentNode*(min(1, node53path67) - 1))) &  (currentPath'=(67 * min(1, node53path67) - currentPath*(min(1,node53path67) - 1))) & (success'=min(1, node53path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path68 * min(1,node53path68) - currentNode*(min(1, node53path68) - 1))) &  (currentPath'=(68 * min(1, node53path68) - currentPath*(min(1,node53path68) - 1))) & (success'=min(1, node53path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path69 * min(1,node53path69) - currentNode*(min(1, node53path69) - 1))) &  (currentPath'=(69 * min(1, node53path69) - currentPath*(min(1,node53path69) - 1))) & (success'=min(1, node53path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path70 * min(1,node53path70) - currentNode*(min(1, node53path70) - 1))) &  (currentPath'=(70 * min(1, node53path70) - currentPath*(min(1,node53path70) - 1))) & (success'=min(1, node53path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path71 * min(1,node53path71) - currentNode*(min(1, node53path71) - 1))) &  (currentPath'=(71 * min(1, node53path71) - currentPath*(min(1,node53path71) - 1))) & (success'=min(1, node53path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path72 * min(1,node53path72) - currentNode*(min(1, node53path72) - 1))) &  (currentPath'=(72 * min(1, node53path72) - currentPath*(min(1,node53path72) - 1))) & (success'=min(1, node53path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path73 * min(1,node53path73) - currentNode*(min(1, node53path73) - 1))) &  (currentPath'=(73 * min(1, node53path73) - currentPath*(min(1,node53path73) - 1))) & (success'=min(1, node53path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path74 * min(1,node53path74) - currentNode*(min(1, node53path74) - 1))) &  (currentPath'=(74 * min(1, node53path74) - currentPath*(min(1,node53path74) - 1))) & (success'=min(1, node53path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path75 * min(1,node53path75) - currentNode*(min(1, node53path75) - 1))) &  (currentPath'=(75 * min(1, node53path75) - currentPath*(min(1,node53path75) - 1))) & (success'=min(1, node53path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path76 * min(1,node53path76) - currentNode*(min(1, node53path76) - 1))) &  (currentPath'=(76 * min(1, node53path76) - currentPath*(min(1,node53path76) - 1))) & (success'=min(1, node53path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path77 * min(1,node53path77) - currentNode*(min(1, node53path77) - 1))) &  (currentPath'=(77 * min(1, node53path77) - currentPath*(min(1,node53path77) - 1))) & (success'=min(1, node53path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path78 * min(1,node53path78) - currentNode*(min(1, node53path78) - 1))) &  (currentPath'=(78 * min(1, node53path78) - currentPath*(min(1,node53path78) - 1))) & (success'=min(1, node53path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path79 * min(1,node53path79) - currentNode*(min(1, node53path79) - 1))) &  (currentPath'=(79 * min(1, node53path79) - currentPath*(min(1,node53path79) - 1))) & (success'=min(1, node53path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path80 * min(1,node53path80) - currentNode*(min(1, node53path80) - 1))) &  (currentPath'=(80 * min(1, node53path80) - currentPath*(min(1,node53path80) - 1))) & (success'=min(1, node53path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path81 * min(1,node53path81) - currentNode*(min(1, node53path81) - 1))) &  (currentPath'=(81 * min(1, node53path81) - currentPath*(min(1,node53path81) - 1))) & (success'=min(1, node53path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path82 * min(1,node53path82) - currentNode*(min(1, node53path82) - 1))) &  (currentPath'=(82 * min(1, node53path82) - currentPath*(min(1,node53path82) - 1))) & (success'=min(1, node53path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path83 * min(1,node53path83) - currentNode*(min(1, node53path83) - 1))) &  (currentPath'=(83 * min(1, node53path83) - currentPath*(min(1,node53path83) - 1))) & (success'=min(1, node53path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path84 * min(1,node53path84) - currentNode*(min(1, node53path84) - 1))) &  (currentPath'=(84 * min(1, node53path84) - currentPath*(min(1,node53path84) - 1))) & (success'=min(1, node53path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path85 * min(1,node53path85) - currentNode*(min(1, node53path85) - 1))) &  (currentPath'=(85 * min(1, node53path85) - currentPath*(min(1,node53path85) - 1))) & (success'=min(1, node53path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path86 * min(1,node53path86) - currentNode*(min(1, node53path86) - 1))) &  (currentPath'=(86 * min(1, node53path86) - currentPath*(min(1,node53path86) - 1))) & (success'=min(1, node53path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path87 * min(1,node53path87) - currentNode*(min(1, node53path87) - 1))) &  (currentPath'=(87 * min(1, node53path87) - currentPath*(min(1,node53path87) - 1))) & (success'=min(1, node53path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path88 * min(1,node53path88) - currentNode*(min(1, node53path88) - 1))) &  (currentPath'=(88 * min(1, node53path88) - currentPath*(min(1,node53path88) - 1))) & (success'=min(1, node53path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path89 * min(1,node53path89) - currentNode*(min(1, node53path89) - 1))) &  (currentPath'=(89 * min(1, node53path89) - currentPath*(min(1,node53path89) - 1))) & (success'=min(1, node53path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path90 * min(1,node53path90) - currentNode*(min(1, node53path90) - 1))) &  (currentPath'=(90 * min(1, node53path90) - currentPath*(min(1,node53path90) - 1))) & (success'=min(1, node53path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path91 * min(1,node53path91) - currentNode*(min(1, node53path91) - 1))) &  (currentPath'=(91 * min(1, node53path91) - currentPath*(min(1,node53path91) - 1))) & (success'=min(1, node53path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path92 * min(1,node53path92) - currentNode*(min(1, node53path92) - 1))) &  (currentPath'=(92 * min(1, node53path92) - currentPath*(min(1,node53path92) - 1))) & (success'=min(1, node53path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path93 * min(1,node53path93) - currentNode*(min(1, node53path93) - 1))) &  (currentPath'=(93 * min(1, node53path93) - currentPath*(min(1,node53path93) - 1))) & (success'=min(1, node53path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path94 * min(1,node53path94) - currentNode*(min(1, node53path94) - 1))) &  (currentPath'=(94 * min(1, node53path94) - currentPath*(min(1,node53path94) - 1))) & (success'=min(1, node53path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path95 * min(1,node53path95) - currentNode*(min(1, node53path95) - 1))) &  (currentPath'=(95 * min(1, node53path95) - currentPath*(min(1,node53path95) - 1))) & (success'=min(1, node53path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path96 * min(1,node53path96) - currentNode*(min(1, node53path96) - 1))) &  (currentPath'=(96 * min(1, node53path96) - currentPath*(min(1,node53path96) - 1))) & (success'=min(1, node53path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path97 * min(1,node53path97) - currentNode*(min(1, node53path97) - 1))) &  (currentPath'=(97 * min(1, node53path97) - currentPath*(min(1,node53path97) - 1))) & (success'=min(1, node53path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path98 * min(1,node53path98) - currentNode*(min(1, node53path98) - 1))) &  (currentPath'=(98 * min(1, node53path98) - currentPath*(min(1,node53path98) - 1))) & (success'=min(1, node53path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path99 * min(1,node53path99) - currentNode*(min(1, node53path99) - 1))) &  (currentPath'=(99 * min(1, node53path99) - currentPath*(min(1,node53path99) - 1))) & (success'=min(1, node53path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node53path100 * min(1,node53path100) - currentNode*(min(1, node53path100) - 1))) &  (currentPath'=(100 * min(1, node53path100) - currentPath*(min(1,node53path100) - 1))) & (success'=min(1, node53path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 54) ->
 numPathsInv: (currentNode'=(node54path1 * min(1,node54path1) - currentNode*(min(1, node54path1) - 1))) &  (currentPath'=(1 * min(1, node54path1) - currentPath*(min(1,node54path1) - 1))) & (success'=min(1, node54path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path2 * min(1,node54path2) - currentNode*(min(1, node54path2) - 1))) &  (currentPath'=(2 * min(1, node54path2) - currentPath*(min(1,node54path2) - 1))) & (success'=min(1, node54path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path3 * min(1,node54path3) - currentNode*(min(1, node54path3) - 1))) &  (currentPath'=(3 * min(1, node54path3) - currentPath*(min(1,node54path3) - 1))) & (success'=min(1, node54path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path4 * min(1,node54path4) - currentNode*(min(1, node54path4) - 1))) &  (currentPath'=(4 * min(1, node54path4) - currentPath*(min(1,node54path4) - 1))) & (success'=min(1, node54path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path5 * min(1,node54path5) - currentNode*(min(1, node54path5) - 1))) &  (currentPath'=(5 * min(1, node54path5) - currentPath*(min(1,node54path5) - 1))) & (success'=min(1, node54path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path6 * min(1,node54path6) - currentNode*(min(1, node54path6) - 1))) &  (currentPath'=(6 * min(1, node54path6) - currentPath*(min(1,node54path6) - 1))) & (success'=min(1, node54path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path7 * min(1,node54path7) - currentNode*(min(1, node54path7) - 1))) &  (currentPath'=(7 * min(1, node54path7) - currentPath*(min(1,node54path7) - 1))) & (success'=min(1, node54path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path8 * min(1,node54path8) - currentNode*(min(1, node54path8) - 1))) &  (currentPath'=(8 * min(1, node54path8) - currentPath*(min(1,node54path8) - 1))) & (success'=min(1, node54path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path9 * min(1,node54path9) - currentNode*(min(1, node54path9) - 1))) &  (currentPath'=(9 * min(1, node54path9) - currentPath*(min(1,node54path9) - 1))) & (success'=min(1, node54path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path10 * min(1,node54path10) - currentNode*(min(1, node54path10) - 1))) &  (currentPath'=(10 * min(1, node54path10) - currentPath*(min(1,node54path10) - 1))) & (success'=min(1, node54path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path11 * min(1,node54path11) - currentNode*(min(1, node54path11) - 1))) &  (currentPath'=(11 * min(1, node54path11) - currentPath*(min(1,node54path11) - 1))) & (success'=min(1, node54path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path12 * min(1,node54path12) - currentNode*(min(1, node54path12) - 1))) &  (currentPath'=(12 * min(1, node54path12) - currentPath*(min(1,node54path12) - 1))) & (success'=min(1, node54path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path13 * min(1,node54path13) - currentNode*(min(1, node54path13) - 1))) &  (currentPath'=(13 * min(1, node54path13) - currentPath*(min(1,node54path13) - 1))) & (success'=min(1, node54path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path14 * min(1,node54path14) - currentNode*(min(1, node54path14) - 1))) &  (currentPath'=(14 * min(1, node54path14) - currentPath*(min(1,node54path14) - 1))) & (success'=min(1, node54path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path15 * min(1,node54path15) - currentNode*(min(1, node54path15) - 1))) &  (currentPath'=(15 * min(1, node54path15) - currentPath*(min(1,node54path15) - 1))) & (success'=min(1, node54path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path16 * min(1,node54path16) - currentNode*(min(1, node54path16) - 1))) &  (currentPath'=(16 * min(1, node54path16) - currentPath*(min(1,node54path16) - 1))) & (success'=min(1, node54path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path17 * min(1,node54path17) - currentNode*(min(1, node54path17) - 1))) &  (currentPath'=(17 * min(1, node54path17) - currentPath*(min(1,node54path17) - 1))) & (success'=min(1, node54path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path18 * min(1,node54path18) - currentNode*(min(1, node54path18) - 1))) &  (currentPath'=(18 * min(1, node54path18) - currentPath*(min(1,node54path18) - 1))) & (success'=min(1, node54path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path19 * min(1,node54path19) - currentNode*(min(1, node54path19) - 1))) &  (currentPath'=(19 * min(1, node54path19) - currentPath*(min(1,node54path19) - 1))) & (success'=min(1, node54path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path20 * min(1,node54path20) - currentNode*(min(1, node54path20) - 1))) &  (currentPath'=(20 * min(1, node54path20) - currentPath*(min(1,node54path20) - 1))) & (success'=min(1, node54path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path21 * min(1,node54path21) - currentNode*(min(1, node54path21) - 1))) &  (currentPath'=(21 * min(1, node54path21) - currentPath*(min(1,node54path21) - 1))) & (success'=min(1, node54path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path22 * min(1,node54path22) - currentNode*(min(1, node54path22) - 1))) &  (currentPath'=(22 * min(1, node54path22) - currentPath*(min(1,node54path22) - 1))) & (success'=min(1, node54path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path23 * min(1,node54path23) - currentNode*(min(1, node54path23) - 1))) &  (currentPath'=(23 * min(1, node54path23) - currentPath*(min(1,node54path23) - 1))) & (success'=min(1, node54path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path24 * min(1,node54path24) - currentNode*(min(1, node54path24) - 1))) &  (currentPath'=(24 * min(1, node54path24) - currentPath*(min(1,node54path24) - 1))) & (success'=min(1, node54path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path25 * min(1,node54path25) - currentNode*(min(1, node54path25) - 1))) &  (currentPath'=(25 * min(1, node54path25) - currentPath*(min(1,node54path25) - 1))) & (success'=min(1, node54path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path26 * min(1,node54path26) - currentNode*(min(1, node54path26) - 1))) &  (currentPath'=(26 * min(1, node54path26) - currentPath*(min(1,node54path26) - 1))) & (success'=min(1, node54path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path27 * min(1,node54path27) - currentNode*(min(1, node54path27) - 1))) &  (currentPath'=(27 * min(1, node54path27) - currentPath*(min(1,node54path27) - 1))) & (success'=min(1, node54path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path28 * min(1,node54path28) - currentNode*(min(1, node54path28) - 1))) &  (currentPath'=(28 * min(1, node54path28) - currentPath*(min(1,node54path28) - 1))) & (success'=min(1, node54path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path29 * min(1,node54path29) - currentNode*(min(1, node54path29) - 1))) &  (currentPath'=(29 * min(1, node54path29) - currentPath*(min(1,node54path29) - 1))) & (success'=min(1, node54path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path30 * min(1,node54path30) - currentNode*(min(1, node54path30) - 1))) &  (currentPath'=(30 * min(1, node54path30) - currentPath*(min(1,node54path30) - 1))) & (success'=min(1, node54path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path31 * min(1,node54path31) - currentNode*(min(1, node54path31) - 1))) &  (currentPath'=(31 * min(1, node54path31) - currentPath*(min(1,node54path31) - 1))) & (success'=min(1, node54path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path32 * min(1,node54path32) - currentNode*(min(1, node54path32) - 1))) &  (currentPath'=(32 * min(1, node54path32) - currentPath*(min(1,node54path32) - 1))) & (success'=min(1, node54path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path33 * min(1,node54path33) - currentNode*(min(1, node54path33) - 1))) &  (currentPath'=(33 * min(1, node54path33) - currentPath*(min(1,node54path33) - 1))) & (success'=min(1, node54path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path34 * min(1,node54path34) - currentNode*(min(1, node54path34) - 1))) &  (currentPath'=(34 * min(1, node54path34) - currentPath*(min(1,node54path34) - 1))) & (success'=min(1, node54path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path35 * min(1,node54path35) - currentNode*(min(1, node54path35) - 1))) &  (currentPath'=(35 * min(1, node54path35) - currentPath*(min(1,node54path35) - 1))) & (success'=min(1, node54path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path36 * min(1,node54path36) - currentNode*(min(1, node54path36) - 1))) &  (currentPath'=(36 * min(1, node54path36) - currentPath*(min(1,node54path36) - 1))) & (success'=min(1, node54path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path37 * min(1,node54path37) - currentNode*(min(1, node54path37) - 1))) &  (currentPath'=(37 * min(1, node54path37) - currentPath*(min(1,node54path37) - 1))) & (success'=min(1, node54path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path38 * min(1,node54path38) - currentNode*(min(1, node54path38) - 1))) &  (currentPath'=(38 * min(1, node54path38) - currentPath*(min(1,node54path38) - 1))) & (success'=min(1, node54path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path39 * min(1,node54path39) - currentNode*(min(1, node54path39) - 1))) &  (currentPath'=(39 * min(1, node54path39) - currentPath*(min(1,node54path39) - 1))) & (success'=min(1, node54path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path40 * min(1,node54path40) - currentNode*(min(1, node54path40) - 1))) &  (currentPath'=(40 * min(1, node54path40) - currentPath*(min(1,node54path40) - 1))) & (success'=min(1, node54path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path41 * min(1,node54path41) - currentNode*(min(1, node54path41) - 1))) &  (currentPath'=(41 * min(1, node54path41) - currentPath*(min(1,node54path41) - 1))) & (success'=min(1, node54path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path42 * min(1,node54path42) - currentNode*(min(1, node54path42) - 1))) &  (currentPath'=(42 * min(1, node54path42) - currentPath*(min(1,node54path42) - 1))) & (success'=min(1, node54path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path43 * min(1,node54path43) - currentNode*(min(1, node54path43) - 1))) &  (currentPath'=(43 * min(1, node54path43) - currentPath*(min(1,node54path43) - 1))) & (success'=min(1, node54path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path44 * min(1,node54path44) - currentNode*(min(1, node54path44) - 1))) &  (currentPath'=(44 * min(1, node54path44) - currentPath*(min(1,node54path44) - 1))) & (success'=min(1, node54path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path45 * min(1,node54path45) - currentNode*(min(1, node54path45) - 1))) &  (currentPath'=(45 * min(1, node54path45) - currentPath*(min(1,node54path45) - 1))) & (success'=min(1, node54path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path46 * min(1,node54path46) - currentNode*(min(1, node54path46) - 1))) &  (currentPath'=(46 * min(1, node54path46) - currentPath*(min(1,node54path46) - 1))) & (success'=min(1, node54path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path47 * min(1,node54path47) - currentNode*(min(1, node54path47) - 1))) &  (currentPath'=(47 * min(1, node54path47) - currentPath*(min(1,node54path47) - 1))) & (success'=min(1, node54path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path48 * min(1,node54path48) - currentNode*(min(1, node54path48) - 1))) &  (currentPath'=(48 * min(1, node54path48) - currentPath*(min(1,node54path48) - 1))) & (success'=min(1, node54path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path49 * min(1,node54path49) - currentNode*(min(1, node54path49) - 1))) &  (currentPath'=(49 * min(1, node54path49) - currentPath*(min(1,node54path49) - 1))) & (success'=min(1, node54path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path50 * min(1,node54path50) - currentNode*(min(1, node54path50) - 1))) &  (currentPath'=(50 * min(1, node54path50) - currentPath*(min(1,node54path50) - 1))) & (success'=min(1, node54path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path51 * min(1,node54path51) - currentNode*(min(1, node54path51) - 1))) &  (currentPath'=(51 * min(1, node54path51) - currentPath*(min(1,node54path51) - 1))) & (success'=min(1, node54path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path52 * min(1,node54path52) - currentNode*(min(1, node54path52) - 1))) &  (currentPath'=(52 * min(1, node54path52) - currentPath*(min(1,node54path52) - 1))) & (success'=min(1, node54path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path53 * min(1,node54path53) - currentNode*(min(1, node54path53) - 1))) &  (currentPath'=(53 * min(1, node54path53) - currentPath*(min(1,node54path53) - 1))) & (success'=min(1, node54path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path54 * min(1,node54path54) - currentNode*(min(1, node54path54) - 1))) &  (currentPath'=(54 * min(1, node54path54) - currentPath*(min(1,node54path54) - 1))) & (success'=min(1, node54path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path55 * min(1,node54path55) - currentNode*(min(1, node54path55) - 1))) &  (currentPath'=(55 * min(1, node54path55) - currentPath*(min(1,node54path55) - 1))) & (success'=min(1, node54path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path56 * min(1,node54path56) - currentNode*(min(1, node54path56) - 1))) &  (currentPath'=(56 * min(1, node54path56) - currentPath*(min(1,node54path56) - 1))) & (success'=min(1, node54path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path57 * min(1,node54path57) - currentNode*(min(1, node54path57) - 1))) &  (currentPath'=(57 * min(1, node54path57) - currentPath*(min(1,node54path57) - 1))) & (success'=min(1, node54path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path58 * min(1,node54path58) - currentNode*(min(1, node54path58) - 1))) &  (currentPath'=(58 * min(1, node54path58) - currentPath*(min(1,node54path58) - 1))) & (success'=min(1, node54path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path59 * min(1,node54path59) - currentNode*(min(1, node54path59) - 1))) &  (currentPath'=(59 * min(1, node54path59) - currentPath*(min(1,node54path59) - 1))) & (success'=min(1, node54path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path60 * min(1,node54path60) - currentNode*(min(1, node54path60) - 1))) &  (currentPath'=(60 * min(1, node54path60) - currentPath*(min(1,node54path60) - 1))) & (success'=min(1, node54path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path61 * min(1,node54path61) - currentNode*(min(1, node54path61) - 1))) &  (currentPath'=(61 * min(1, node54path61) - currentPath*(min(1,node54path61) - 1))) & (success'=min(1, node54path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path62 * min(1,node54path62) - currentNode*(min(1, node54path62) - 1))) &  (currentPath'=(62 * min(1, node54path62) - currentPath*(min(1,node54path62) - 1))) & (success'=min(1, node54path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path63 * min(1,node54path63) - currentNode*(min(1, node54path63) - 1))) &  (currentPath'=(63 * min(1, node54path63) - currentPath*(min(1,node54path63) - 1))) & (success'=min(1, node54path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path64 * min(1,node54path64) - currentNode*(min(1, node54path64) - 1))) &  (currentPath'=(64 * min(1, node54path64) - currentPath*(min(1,node54path64) - 1))) & (success'=min(1, node54path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path65 * min(1,node54path65) - currentNode*(min(1, node54path65) - 1))) &  (currentPath'=(65 * min(1, node54path65) - currentPath*(min(1,node54path65) - 1))) & (success'=min(1, node54path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path66 * min(1,node54path66) - currentNode*(min(1, node54path66) - 1))) &  (currentPath'=(66 * min(1, node54path66) - currentPath*(min(1,node54path66) - 1))) & (success'=min(1, node54path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path67 * min(1,node54path67) - currentNode*(min(1, node54path67) - 1))) &  (currentPath'=(67 * min(1, node54path67) - currentPath*(min(1,node54path67) - 1))) & (success'=min(1, node54path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path68 * min(1,node54path68) - currentNode*(min(1, node54path68) - 1))) &  (currentPath'=(68 * min(1, node54path68) - currentPath*(min(1,node54path68) - 1))) & (success'=min(1, node54path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path69 * min(1,node54path69) - currentNode*(min(1, node54path69) - 1))) &  (currentPath'=(69 * min(1, node54path69) - currentPath*(min(1,node54path69) - 1))) & (success'=min(1, node54path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path70 * min(1,node54path70) - currentNode*(min(1, node54path70) - 1))) &  (currentPath'=(70 * min(1, node54path70) - currentPath*(min(1,node54path70) - 1))) & (success'=min(1, node54path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path71 * min(1,node54path71) - currentNode*(min(1, node54path71) - 1))) &  (currentPath'=(71 * min(1, node54path71) - currentPath*(min(1,node54path71) - 1))) & (success'=min(1, node54path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path72 * min(1,node54path72) - currentNode*(min(1, node54path72) - 1))) &  (currentPath'=(72 * min(1, node54path72) - currentPath*(min(1,node54path72) - 1))) & (success'=min(1, node54path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path73 * min(1,node54path73) - currentNode*(min(1, node54path73) - 1))) &  (currentPath'=(73 * min(1, node54path73) - currentPath*(min(1,node54path73) - 1))) & (success'=min(1, node54path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path74 * min(1,node54path74) - currentNode*(min(1, node54path74) - 1))) &  (currentPath'=(74 * min(1, node54path74) - currentPath*(min(1,node54path74) - 1))) & (success'=min(1, node54path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path75 * min(1,node54path75) - currentNode*(min(1, node54path75) - 1))) &  (currentPath'=(75 * min(1, node54path75) - currentPath*(min(1,node54path75) - 1))) & (success'=min(1, node54path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path76 * min(1,node54path76) - currentNode*(min(1, node54path76) - 1))) &  (currentPath'=(76 * min(1, node54path76) - currentPath*(min(1,node54path76) - 1))) & (success'=min(1, node54path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path77 * min(1,node54path77) - currentNode*(min(1, node54path77) - 1))) &  (currentPath'=(77 * min(1, node54path77) - currentPath*(min(1,node54path77) - 1))) & (success'=min(1, node54path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path78 * min(1,node54path78) - currentNode*(min(1, node54path78) - 1))) &  (currentPath'=(78 * min(1, node54path78) - currentPath*(min(1,node54path78) - 1))) & (success'=min(1, node54path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path79 * min(1,node54path79) - currentNode*(min(1, node54path79) - 1))) &  (currentPath'=(79 * min(1, node54path79) - currentPath*(min(1,node54path79) - 1))) & (success'=min(1, node54path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path80 * min(1,node54path80) - currentNode*(min(1, node54path80) - 1))) &  (currentPath'=(80 * min(1, node54path80) - currentPath*(min(1,node54path80) - 1))) & (success'=min(1, node54path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path81 * min(1,node54path81) - currentNode*(min(1, node54path81) - 1))) &  (currentPath'=(81 * min(1, node54path81) - currentPath*(min(1,node54path81) - 1))) & (success'=min(1, node54path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path82 * min(1,node54path82) - currentNode*(min(1, node54path82) - 1))) &  (currentPath'=(82 * min(1, node54path82) - currentPath*(min(1,node54path82) - 1))) & (success'=min(1, node54path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path83 * min(1,node54path83) - currentNode*(min(1, node54path83) - 1))) &  (currentPath'=(83 * min(1, node54path83) - currentPath*(min(1,node54path83) - 1))) & (success'=min(1, node54path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path84 * min(1,node54path84) - currentNode*(min(1, node54path84) - 1))) &  (currentPath'=(84 * min(1, node54path84) - currentPath*(min(1,node54path84) - 1))) & (success'=min(1, node54path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path85 * min(1,node54path85) - currentNode*(min(1, node54path85) - 1))) &  (currentPath'=(85 * min(1, node54path85) - currentPath*(min(1,node54path85) - 1))) & (success'=min(1, node54path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path86 * min(1,node54path86) - currentNode*(min(1, node54path86) - 1))) &  (currentPath'=(86 * min(1, node54path86) - currentPath*(min(1,node54path86) - 1))) & (success'=min(1, node54path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path87 * min(1,node54path87) - currentNode*(min(1, node54path87) - 1))) &  (currentPath'=(87 * min(1, node54path87) - currentPath*(min(1,node54path87) - 1))) & (success'=min(1, node54path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path88 * min(1,node54path88) - currentNode*(min(1, node54path88) - 1))) &  (currentPath'=(88 * min(1, node54path88) - currentPath*(min(1,node54path88) - 1))) & (success'=min(1, node54path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path89 * min(1,node54path89) - currentNode*(min(1, node54path89) - 1))) &  (currentPath'=(89 * min(1, node54path89) - currentPath*(min(1,node54path89) - 1))) & (success'=min(1, node54path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path90 * min(1,node54path90) - currentNode*(min(1, node54path90) - 1))) &  (currentPath'=(90 * min(1, node54path90) - currentPath*(min(1,node54path90) - 1))) & (success'=min(1, node54path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path91 * min(1,node54path91) - currentNode*(min(1, node54path91) - 1))) &  (currentPath'=(91 * min(1, node54path91) - currentPath*(min(1,node54path91) - 1))) & (success'=min(1, node54path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path92 * min(1,node54path92) - currentNode*(min(1, node54path92) - 1))) &  (currentPath'=(92 * min(1, node54path92) - currentPath*(min(1,node54path92) - 1))) & (success'=min(1, node54path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path93 * min(1,node54path93) - currentNode*(min(1, node54path93) - 1))) &  (currentPath'=(93 * min(1, node54path93) - currentPath*(min(1,node54path93) - 1))) & (success'=min(1, node54path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path94 * min(1,node54path94) - currentNode*(min(1, node54path94) - 1))) &  (currentPath'=(94 * min(1, node54path94) - currentPath*(min(1,node54path94) - 1))) & (success'=min(1, node54path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path95 * min(1,node54path95) - currentNode*(min(1, node54path95) - 1))) &  (currentPath'=(95 * min(1, node54path95) - currentPath*(min(1,node54path95) - 1))) & (success'=min(1, node54path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path96 * min(1,node54path96) - currentNode*(min(1, node54path96) - 1))) &  (currentPath'=(96 * min(1, node54path96) - currentPath*(min(1,node54path96) - 1))) & (success'=min(1, node54path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path97 * min(1,node54path97) - currentNode*(min(1, node54path97) - 1))) &  (currentPath'=(97 * min(1, node54path97) - currentPath*(min(1,node54path97) - 1))) & (success'=min(1, node54path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path98 * min(1,node54path98) - currentNode*(min(1, node54path98) - 1))) &  (currentPath'=(98 * min(1, node54path98) - currentPath*(min(1,node54path98) - 1))) & (success'=min(1, node54path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path99 * min(1,node54path99) - currentNode*(min(1, node54path99) - 1))) &  (currentPath'=(99 * min(1, node54path99) - currentPath*(min(1,node54path99) - 1))) & (success'=min(1, node54path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node54path100 * min(1,node54path100) - currentNode*(min(1, node54path100) - 1))) &  (currentPath'=(100 * min(1, node54path100) - currentPath*(min(1,node54path100) - 1))) & (success'=min(1, node54path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 55) ->
 numPathsInv: (currentNode'=(node55path1 * min(1,node55path1) - currentNode*(min(1, node55path1) - 1))) &  (currentPath'=(1 * min(1, node55path1) - currentPath*(min(1,node55path1) - 1))) & (success'=min(1, node55path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path2 * min(1,node55path2) - currentNode*(min(1, node55path2) - 1))) &  (currentPath'=(2 * min(1, node55path2) - currentPath*(min(1,node55path2) - 1))) & (success'=min(1, node55path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path3 * min(1,node55path3) - currentNode*(min(1, node55path3) - 1))) &  (currentPath'=(3 * min(1, node55path3) - currentPath*(min(1,node55path3) - 1))) & (success'=min(1, node55path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path4 * min(1,node55path4) - currentNode*(min(1, node55path4) - 1))) &  (currentPath'=(4 * min(1, node55path4) - currentPath*(min(1,node55path4) - 1))) & (success'=min(1, node55path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path5 * min(1,node55path5) - currentNode*(min(1, node55path5) - 1))) &  (currentPath'=(5 * min(1, node55path5) - currentPath*(min(1,node55path5) - 1))) & (success'=min(1, node55path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path6 * min(1,node55path6) - currentNode*(min(1, node55path6) - 1))) &  (currentPath'=(6 * min(1, node55path6) - currentPath*(min(1,node55path6) - 1))) & (success'=min(1, node55path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path7 * min(1,node55path7) - currentNode*(min(1, node55path7) - 1))) &  (currentPath'=(7 * min(1, node55path7) - currentPath*(min(1,node55path7) - 1))) & (success'=min(1, node55path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path8 * min(1,node55path8) - currentNode*(min(1, node55path8) - 1))) &  (currentPath'=(8 * min(1, node55path8) - currentPath*(min(1,node55path8) - 1))) & (success'=min(1, node55path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path9 * min(1,node55path9) - currentNode*(min(1, node55path9) - 1))) &  (currentPath'=(9 * min(1, node55path9) - currentPath*(min(1,node55path9) - 1))) & (success'=min(1, node55path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path10 * min(1,node55path10) - currentNode*(min(1, node55path10) - 1))) &  (currentPath'=(10 * min(1, node55path10) - currentPath*(min(1,node55path10) - 1))) & (success'=min(1, node55path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path11 * min(1,node55path11) - currentNode*(min(1, node55path11) - 1))) &  (currentPath'=(11 * min(1, node55path11) - currentPath*(min(1,node55path11) - 1))) & (success'=min(1, node55path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path12 * min(1,node55path12) - currentNode*(min(1, node55path12) - 1))) &  (currentPath'=(12 * min(1, node55path12) - currentPath*(min(1,node55path12) - 1))) & (success'=min(1, node55path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path13 * min(1,node55path13) - currentNode*(min(1, node55path13) - 1))) &  (currentPath'=(13 * min(1, node55path13) - currentPath*(min(1,node55path13) - 1))) & (success'=min(1, node55path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path14 * min(1,node55path14) - currentNode*(min(1, node55path14) - 1))) &  (currentPath'=(14 * min(1, node55path14) - currentPath*(min(1,node55path14) - 1))) & (success'=min(1, node55path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path15 * min(1,node55path15) - currentNode*(min(1, node55path15) - 1))) &  (currentPath'=(15 * min(1, node55path15) - currentPath*(min(1,node55path15) - 1))) & (success'=min(1, node55path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path16 * min(1,node55path16) - currentNode*(min(1, node55path16) - 1))) &  (currentPath'=(16 * min(1, node55path16) - currentPath*(min(1,node55path16) - 1))) & (success'=min(1, node55path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path17 * min(1,node55path17) - currentNode*(min(1, node55path17) - 1))) &  (currentPath'=(17 * min(1, node55path17) - currentPath*(min(1,node55path17) - 1))) & (success'=min(1, node55path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path18 * min(1,node55path18) - currentNode*(min(1, node55path18) - 1))) &  (currentPath'=(18 * min(1, node55path18) - currentPath*(min(1,node55path18) - 1))) & (success'=min(1, node55path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path19 * min(1,node55path19) - currentNode*(min(1, node55path19) - 1))) &  (currentPath'=(19 * min(1, node55path19) - currentPath*(min(1,node55path19) - 1))) & (success'=min(1, node55path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path20 * min(1,node55path20) - currentNode*(min(1, node55path20) - 1))) &  (currentPath'=(20 * min(1, node55path20) - currentPath*(min(1,node55path20) - 1))) & (success'=min(1, node55path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path21 * min(1,node55path21) - currentNode*(min(1, node55path21) - 1))) &  (currentPath'=(21 * min(1, node55path21) - currentPath*(min(1,node55path21) - 1))) & (success'=min(1, node55path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path22 * min(1,node55path22) - currentNode*(min(1, node55path22) - 1))) &  (currentPath'=(22 * min(1, node55path22) - currentPath*(min(1,node55path22) - 1))) & (success'=min(1, node55path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path23 * min(1,node55path23) - currentNode*(min(1, node55path23) - 1))) &  (currentPath'=(23 * min(1, node55path23) - currentPath*(min(1,node55path23) - 1))) & (success'=min(1, node55path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path24 * min(1,node55path24) - currentNode*(min(1, node55path24) - 1))) &  (currentPath'=(24 * min(1, node55path24) - currentPath*(min(1,node55path24) - 1))) & (success'=min(1, node55path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path25 * min(1,node55path25) - currentNode*(min(1, node55path25) - 1))) &  (currentPath'=(25 * min(1, node55path25) - currentPath*(min(1,node55path25) - 1))) & (success'=min(1, node55path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path26 * min(1,node55path26) - currentNode*(min(1, node55path26) - 1))) &  (currentPath'=(26 * min(1, node55path26) - currentPath*(min(1,node55path26) - 1))) & (success'=min(1, node55path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path27 * min(1,node55path27) - currentNode*(min(1, node55path27) - 1))) &  (currentPath'=(27 * min(1, node55path27) - currentPath*(min(1,node55path27) - 1))) & (success'=min(1, node55path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path28 * min(1,node55path28) - currentNode*(min(1, node55path28) - 1))) &  (currentPath'=(28 * min(1, node55path28) - currentPath*(min(1,node55path28) - 1))) & (success'=min(1, node55path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path29 * min(1,node55path29) - currentNode*(min(1, node55path29) - 1))) &  (currentPath'=(29 * min(1, node55path29) - currentPath*(min(1,node55path29) - 1))) & (success'=min(1, node55path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path30 * min(1,node55path30) - currentNode*(min(1, node55path30) - 1))) &  (currentPath'=(30 * min(1, node55path30) - currentPath*(min(1,node55path30) - 1))) & (success'=min(1, node55path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path31 * min(1,node55path31) - currentNode*(min(1, node55path31) - 1))) &  (currentPath'=(31 * min(1, node55path31) - currentPath*(min(1,node55path31) - 1))) & (success'=min(1, node55path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path32 * min(1,node55path32) - currentNode*(min(1, node55path32) - 1))) &  (currentPath'=(32 * min(1, node55path32) - currentPath*(min(1,node55path32) - 1))) & (success'=min(1, node55path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path33 * min(1,node55path33) - currentNode*(min(1, node55path33) - 1))) &  (currentPath'=(33 * min(1, node55path33) - currentPath*(min(1,node55path33) - 1))) & (success'=min(1, node55path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path34 * min(1,node55path34) - currentNode*(min(1, node55path34) - 1))) &  (currentPath'=(34 * min(1, node55path34) - currentPath*(min(1,node55path34) - 1))) & (success'=min(1, node55path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path35 * min(1,node55path35) - currentNode*(min(1, node55path35) - 1))) &  (currentPath'=(35 * min(1, node55path35) - currentPath*(min(1,node55path35) - 1))) & (success'=min(1, node55path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path36 * min(1,node55path36) - currentNode*(min(1, node55path36) - 1))) &  (currentPath'=(36 * min(1, node55path36) - currentPath*(min(1,node55path36) - 1))) & (success'=min(1, node55path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path37 * min(1,node55path37) - currentNode*(min(1, node55path37) - 1))) &  (currentPath'=(37 * min(1, node55path37) - currentPath*(min(1,node55path37) - 1))) & (success'=min(1, node55path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path38 * min(1,node55path38) - currentNode*(min(1, node55path38) - 1))) &  (currentPath'=(38 * min(1, node55path38) - currentPath*(min(1,node55path38) - 1))) & (success'=min(1, node55path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path39 * min(1,node55path39) - currentNode*(min(1, node55path39) - 1))) &  (currentPath'=(39 * min(1, node55path39) - currentPath*(min(1,node55path39) - 1))) & (success'=min(1, node55path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path40 * min(1,node55path40) - currentNode*(min(1, node55path40) - 1))) &  (currentPath'=(40 * min(1, node55path40) - currentPath*(min(1,node55path40) - 1))) & (success'=min(1, node55path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path41 * min(1,node55path41) - currentNode*(min(1, node55path41) - 1))) &  (currentPath'=(41 * min(1, node55path41) - currentPath*(min(1,node55path41) - 1))) & (success'=min(1, node55path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path42 * min(1,node55path42) - currentNode*(min(1, node55path42) - 1))) &  (currentPath'=(42 * min(1, node55path42) - currentPath*(min(1,node55path42) - 1))) & (success'=min(1, node55path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path43 * min(1,node55path43) - currentNode*(min(1, node55path43) - 1))) &  (currentPath'=(43 * min(1, node55path43) - currentPath*(min(1,node55path43) - 1))) & (success'=min(1, node55path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path44 * min(1,node55path44) - currentNode*(min(1, node55path44) - 1))) &  (currentPath'=(44 * min(1, node55path44) - currentPath*(min(1,node55path44) - 1))) & (success'=min(1, node55path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path45 * min(1,node55path45) - currentNode*(min(1, node55path45) - 1))) &  (currentPath'=(45 * min(1, node55path45) - currentPath*(min(1,node55path45) - 1))) & (success'=min(1, node55path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path46 * min(1,node55path46) - currentNode*(min(1, node55path46) - 1))) &  (currentPath'=(46 * min(1, node55path46) - currentPath*(min(1,node55path46) - 1))) & (success'=min(1, node55path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path47 * min(1,node55path47) - currentNode*(min(1, node55path47) - 1))) &  (currentPath'=(47 * min(1, node55path47) - currentPath*(min(1,node55path47) - 1))) & (success'=min(1, node55path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path48 * min(1,node55path48) - currentNode*(min(1, node55path48) - 1))) &  (currentPath'=(48 * min(1, node55path48) - currentPath*(min(1,node55path48) - 1))) & (success'=min(1, node55path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path49 * min(1,node55path49) - currentNode*(min(1, node55path49) - 1))) &  (currentPath'=(49 * min(1, node55path49) - currentPath*(min(1,node55path49) - 1))) & (success'=min(1, node55path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path50 * min(1,node55path50) - currentNode*(min(1, node55path50) - 1))) &  (currentPath'=(50 * min(1, node55path50) - currentPath*(min(1,node55path50) - 1))) & (success'=min(1, node55path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path51 * min(1,node55path51) - currentNode*(min(1, node55path51) - 1))) &  (currentPath'=(51 * min(1, node55path51) - currentPath*(min(1,node55path51) - 1))) & (success'=min(1, node55path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path52 * min(1,node55path52) - currentNode*(min(1, node55path52) - 1))) &  (currentPath'=(52 * min(1, node55path52) - currentPath*(min(1,node55path52) - 1))) & (success'=min(1, node55path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path53 * min(1,node55path53) - currentNode*(min(1, node55path53) - 1))) &  (currentPath'=(53 * min(1, node55path53) - currentPath*(min(1,node55path53) - 1))) & (success'=min(1, node55path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path54 * min(1,node55path54) - currentNode*(min(1, node55path54) - 1))) &  (currentPath'=(54 * min(1, node55path54) - currentPath*(min(1,node55path54) - 1))) & (success'=min(1, node55path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path55 * min(1,node55path55) - currentNode*(min(1, node55path55) - 1))) &  (currentPath'=(55 * min(1, node55path55) - currentPath*(min(1,node55path55) - 1))) & (success'=min(1, node55path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path56 * min(1,node55path56) - currentNode*(min(1, node55path56) - 1))) &  (currentPath'=(56 * min(1, node55path56) - currentPath*(min(1,node55path56) - 1))) & (success'=min(1, node55path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path57 * min(1,node55path57) - currentNode*(min(1, node55path57) - 1))) &  (currentPath'=(57 * min(1, node55path57) - currentPath*(min(1,node55path57) - 1))) & (success'=min(1, node55path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path58 * min(1,node55path58) - currentNode*(min(1, node55path58) - 1))) &  (currentPath'=(58 * min(1, node55path58) - currentPath*(min(1,node55path58) - 1))) & (success'=min(1, node55path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path59 * min(1,node55path59) - currentNode*(min(1, node55path59) - 1))) &  (currentPath'=(59 * min(1, node55path59) - currentPath*(min(1,node55path59) - 1))) & (success'=min(1, node55path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path60 * min(1,node55path60) - currentNode*(min(1, node55path60) - 1))) &  (currentPath'=(60 * min(1, node55path60) - currentPath*(min(1,node55path60) - 1))) & (success'=min(1, node55path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path61 * min(1,node55path61) - currentNode*(min(1, node55path61) - 1))) &  (currentPath'=(61 * min(1, node55path61) - currentPath*(min(1,node55path61) - 1))) & (success'=min(1, node55path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path62 * min(1,node55path62) - currentNode*(min(1, node55path62) - 1))) &  (currentPath'=(62 * min(1, node55path62) - currentPath*(min(1,node55path62) - 1))) & (success'=min(1, node55path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path63 * min(1,node55path63) - currentNode*(min(1, node55path63) - 1))) &  (currentPath'=(63 * min(1, node55path63) - currentPath*(min(1,node55path63) - 1))) & (success'=min(1, node55path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path64 * min(1,node55path64) - currentNode*(min(1, node55path64) - 1))) &  (currentPath'=(64 * min(1, node55path64) - currentPath*(min(1,node55path64) - 1))) & (success'=min(1, node55path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path65 * min(1,node55path65) - currentNode*(min(1, node55path65) - 1))) &  (currentPath'=(65 * min(1, node55path65) - currentPath*(min(1,node55path65) - 1))) & (success'=min(1, node55path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path66 * min(1,node55path66) - currentNode*(min(1, node55path66) - 1))) &  (currentPath'=(66 * min(1, node55path66) - currentPath*(min(1,node55path66) - 1))) & (success'=min(1, node55path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path67 * min(1,node55path67) - currentNode*(min(1, node55path67) - 1))) &  (currentPath'=(67 * min(1, node55path67) - currentPath*(min(1,node55path67) - 1))) & (success'=min(1, node55path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path68 * min(1,node55path68) - currentNode*(min(1, node55path68) - 1))) &  (currentPath'=(68 * min(1, node55path68) - currentPath*(min(1,node55path68) - 1))) & (success'=min(1, node55path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path69 * min(1,node55path69) - currentNode*(min(1, node55path69) - 1))) &  (currentPath'=(69 * min(1, node55path69) - currentPath*(min(1,node55path69) - 1))) & (success'=min(1, node55path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path70 * min(1,node55path70) - currentNode*(min(1, node55path70) - 1))) &  (currentPath'=(70 * min(1, node55path70) - currentPath*(min(1,node55path70) - 1))) & (success'=min(1, node55path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path71 * min(1,node55path71) - currentNode*(min(1, node55path71) - 1))) &  (currentPath'=(71 * min(1, node55path71) - currentPath*(min(1,node55path71) - 1))) & (success'=min(1, node55path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path72 * min(1,node55path72) - currentNode*(min(1, node55path72) - 1))) &  (currentPath'=(72 * min(1, node55path72) - currentPath*(min(1,node55path72) - 1))) & (success'=min(1, node55path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path73 * min(1,node55path73) - currentNode*(min(1, node55path73) - 1))) &  (currentPath'=(73 * min(1, node55path73) - currentPath*(min(1,node55path73) - 1))) & (success'=min(1, node55path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path74 * min(1,node55path74) - currentNode*(min(1, node55path74) - 1))) &  (currentPath'=(74 * min(1, node55path74) - currentPath*(min(1,node55path74) - 1))) & (success'=min(1, node55path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path75 * min(1,node55path75) - currentNode*(min(1, node55path75) - 1))) &  (currentPath'=(75 * min(1, node55path75) - currentPath*(min(1,node55path75) - 1))) & (success'=min(1, node55path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path76 * min(1,node55path76) - currentNode*(min(1, node55path76) - 1))) &  (currentPath'=(76 * min(1, node55path76) - currentPath*(min(1,node55path76) - 1))) & (success'=min(1, node55path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path77 * min(1,node55path77) - currentNode*(min(1, node55path77) - 1))) &  (currentPath'=(77 * min(1, node55path77) - currentPath*(min(1,node55path77) - 1))) & (success'=min(1, node55path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path78 * min(1,node55path78) - currentNode*(min(1, node55path78) - 1))) &  (currentPath'=(78 * min(1, node55path78) - currentPath*(min(1,node55path78) - 1))) & (success'=min(1, node55path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path79 * min(1,node55path79) - currentNode*(min(1, node55path79) - 1))) &  (currentPath'=(79 * min(1, node55path79) - currentPath*(min(1,node55path79) - 1))) & (success'=min(1, node55path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path80 * min(1,node55path80) - currentNode*(min(1, node55path80) - 1))) &  (currentPath'=(80 * min(1, node55path80) - currentPath*(min(1,node55path80) - 1))) & (success'=min(1, node55path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path81 * min(1,node55path81) - currentNode*(min(1, node55path81) - 1))) &  (currentPath'=(81 * min(1, node55path81) - currentPath*(min(1,node55path81) - 1))) & (success'=min(1, node55path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path82 * min(1,node55path82) - currentNode*(min(1, node55path82) - 1))) &  (currentPath'=(82 * min(1, node55path82) - currentPath*(min(1,node55path82) - 1))) & (success'=min(1, node55path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path83 * min(1,node55path83) - currentNode*(min(1, node55path83) - 1))) &  (currentPath'=(83 * min(1, node55path83) - currentPath*(min(1,node55path83) - 1))) & (success'=min(1, node55path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path84 * min(1,node55path84) - currentNode*(min(1, node55path84) - 1))) &  (currentPath'=(84 * min(1, node55path84) - currentPath*(min(1,node55path84) - 1))) & (success'=min(1, node55path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path85 * min(1,node55path85) - currentNode*(min(1, node55path85) - 1))) &  (currentPath'=(85 * min(1, node55path85) - currentPath*(min(1,node55path85) - 1))) & (success'=min(1, node55path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path86 * min(1,node55path86) - currentNode*(min(1, node55path86) - 1))) &  (currentPath'=(86 * min(1, node55path86) - currentPath*(min(1,node55path86) - 1))) & (success'=min(1, node55path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path87 * min(1,node55path87) - currentNode*(min(1, node55path87) - 1))) &  (currentPath'=(87 * min(1, node55path87) - currentPath*(min(1,node55path87) - 1))) & (success'=min(1, node55path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path88 * min(1,node55path88) - currentNode*(min(1, node55path88) - 1))) &  (currentPath'=(88 * min(1, node55path88) - currentPath*(min(1,node55path88) - 1))) & (success'=min(1, node55path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path89 * min(1,node55path89) - currentNode*(min(1, node55path89) - 1))) &  (currentPath'=(89 * min(1, node55path89) - currentPath*(min(1,node55path89) - 1))) & (success'=min(1, node55path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path90 * min(1,node55path90) - currentNode*(min(1, node55path90) - 1))) &  (currentPath'=(90 * min(1, node55path90) - currentPath*(min(1,node55path90) - 1))) & (success'=min(1, node55path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path91 * min(1,node55path91) - currentNode*(min(1, node55path91) - 1))) &  (currentPath'=(91 * min(1, node55path91) - currentPath*(min(1,node55path91) - 1))) & (success'=min(1, node55path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path92 * min(1,node55path92) - currentNode*(min(1, node55path92) - 1))) &  (currentPath'=(92 * min(1, node55path92) - currentPath*(min(1,node55path92) - 1))) & (success'=min(1, node55path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path93 * min(1,node55path93) - currentNode*(min(1, node55path93) - 1))) &  (currentPath'=(93 * min(1, node55path93) - currentPath*(min(1,node55path93) - 1))) & (success'=min(1, node55path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path94 * min(1,node55path94) - currentNode*(min(1, node55path94) - 1))) &  (currentPath'=(94 * min(1, node55path94) - currentPath*(min(1,node55path94) - 1))) & (success'=min(1, node55path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path95 * min(1,node55path95) - currentNode*(min(1, node55path95) - 1))) &  (currentPath'=(95 * min(1, node55path95) - currentPath*(min(1,node55path95) - 1))) & (success'=min(1, node55path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path96 * min(1,node55path96) - currentNode*(min(1, node55path96) - 1))) &  (currentPath'=(96 * min(1, node55path96) - currentPath*(min(1,node55path96) - 1))) & (success'=min(1, node55path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path97 * min(1,node55path97) - currentNode*(min(1, node55path97) - 1))) &  (currentPath'=(97 * min(1, node55path97) - currentPath*(min(1,node55path97) - 1))) & (success'=min(1, node55path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path98 * min(1,node55path98) - currentNode*(min(1, node55path98) - 1))) &  (currentPath'=(98 * min(1, node55path98) - currentPath*(min(1,node55path98) - 1))) & (success'=min(1, node55path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path99 * min(1,node55path99) - currentNode*(min(1, node55path99) - 1))) &  (currentPath'=(99 * min(1, node55path99) - currentPath*(min(1,node55path99) - 1))) & (success'=min(1, node55path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node55path100 * min(1,node55path100) - currentNode*(min(1, node55path100) - 1))) &  (currentPath'=(100 * min(1, node55path100) - currentPath*(min(1,node55path100) - 1))) & (success'=min(1, node55path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 56) ->
 numPathsInv: (currentNode'=(node56path1 * min(1,node56path1) - currentNode*(min(1, node56path1) - 1))) &  (currentPath'=(1 * min(1, node56path1) - currentPath*(min(1,node56path1) - 1))) & (success'=min(1, node56path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path2 * min(1,node56path2) - currentNode*(min(1, node56path2) - 1))) &  (currentPath'=(2 * min(1, node56path2) - currentPath*(min(1,node56path2) - 1))) & (success'=min(1, node56path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path3 * min(1,node56path3) - currentNode*(min(1, node56path3) - 1))) &  (currentPath'=(3 * min(1, node56path3) - currentPath*(min(1,node56path3) - 1))) & (success'=min(1, node56path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path4 * min(1,node56path4) - currentNode*(min(1, node56path4) - 1))) &  (currentPath'=(4 * min(1, node56path4) - currentPath*(min(1,node56path4) - 1))) & (success'=min(1, node56path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path5 * min(1,node56path5) - currentNode*(min(1, node56path5) - 1))) &  (currentPath'=(5 * min(1, node56path5) - currentPath*(min(1,node56path5) - 1))) & (success'=min(1, node56path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path6 * min(1,node56path6) - currentNode*(min(1, node56path6) - 1))) &  (currentPath'=(6 * min(1, node56path6) - currentPath*(min(1,node56path6) - 1))) & (success'=min(1, node56path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path7 * min(1,node56path7) - currentNode*(min(1, node56path7) - 1))) &  (currentPath'=(7 * min(1, node56path7) - currentPath*(min(1,node56path7) - 1))) & (success'=min(1, node56path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path8 * min(1,node56path8) - currentNode*(min(1, node56path8) - 1))) &  (currentPath'=(8 * min(1, node56path8) - currentPath*(min(1,node56path8) - 1))) & (success'=min(1, node56path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path9 * min(1,node56path9) - currentNode*(min(1, node56path9) - 1))) &  (currentPath'=(9 * min(1, node56path9) - currentPath*(min(1,node56path9) - 1))) & (success'=min(1, node56path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path10 * min(1,node56path10) - currentNode*(min(1, node56path10) - 1))) &  (currentPath'=(10 * min(1, node56path10) - currentPath*(min(1,node56path10) - 1))) & (success'=min(1, node56path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path11 * min(1,node56path11) - currentNode*(min(1, node56path11) - 1))) &  (currentPath'=(11 * min(1, node56path11) - currentPath*(min(1,node56path11) - 1))) & (success'=min(1, node56path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path12 * min(1,node56path12) - currentNode*(min(1, node56path12) - 1))) &  (currentPath'=(12 * min(1, node56path12) - currentPath*(min(1,node56path12) - 1))) & (success'=min(1, node56path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path13 * min(1,node56path13) - currentNode*(min(1, node56path13) - 1))) &  (currentPath'=(13 * min(1, node56path13) - currentPath*(min(1,node56path13) - 1))) & (success'=min(1, node56path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path14 * min(1,node56path14) - currentNode*(min(1, node56path14) - 1))) &  (currentPath'=(14 * min(1, node56path14) - currentPath*(min(1,node56path14) - 1))) & (success'=min(1, node56path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path15 * min(1,node56path15) - currentNode*(min(1, node56path15) - 1))) &  (currentPath'=(15 * min(1, node56path15) - currentPath*(min(1,node56path15) - 1))) & (success'=min(1, node56path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path16 * min(1,node56path16) - currentNode*(min(1, node56path16) - 1))) &  (currentPath'=(16 * min(1, node56path16) - currentPath*(min(1,node56path16) - 1))) & (success'=min(1, node56path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path17 * min(1,node56path17) - currentNode*(min(1, node56path17) - 1))) &  (currentPath'=(17 * min(1, node56path17) - currentPath*(min(1,node56path17) - 1))) & (success'=min(1, node56path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path18 * min(1,node56path18) - currentNode*(min(1, node56path18) - 1))) &  (currentPath'=(18 * min(1, node56path18) - currentPath*(min(1,node56path18) - 1))) & (success'=min(1, node56path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path19 * min(1,node56path19) - currentNode*(min(1, node56path19) - 1))) &  (currentPath'=(19 * min(1, node56path19) - currentPath*(min(1,node56path19) - 1))) & (success'=min(1, node56path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path20 * min(1,node56path20) - currentNode*(min(1, node56path20) - 1))) &  (currentPath'=(20 * min(1, node56path20) - currentPath*(min(1,node56path20) - 1))) & (success'=min(1, node56path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path21 * min(1,node56path21) - currentNode*(min(1, node56path21) - 1))) &  (currentPath'=(21 * min(1, node56path21) - currentPath*(min(1,node56path21) - 1))) & (success'=min(1, node56path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path22 * min(1,node56path22) - currentNode*(min(1, node56path22) - 1))) &  (currentPath'=(22 * min(1, node56path22) - currentPath*(min(1,node56path22) - 1))) & (success'=min(1, node56path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path23 * min(1,node56path23) - currentNode*(min(1, node56path23) - 1))) &  (currentPath'=(23 * min(1, node56path23) - currentPath*(min(1,node56path23) - 1))) & (success'=min(1, node56path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path24 * min(1,node56path24) - currentNode*(min(1, node56path24) - 1))) &  (currentPath'=(24 * min(1, node56path24) - currentPath*(min(1,node56path24) - 1))) & (success'=min(1, node56path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path25 * min(1,node56path25) - currentNode*(min(1, node56path25) - 1))) &  (currentPath'=(25 * min(1, node56path25) - currentPath*(min(1,node56path25) - 1))) & (success'=min(1, node56path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path26 * min(1,node56path26) - currentNode*(min(1, node56path26) - 1))) &  (currentPath'=(26 * min(1, node56path26) - currentPath*(min(1,node56path26) - 1))) & (success'=min(1, node56path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path27 * min(1,node56path27) - currentNode*(min(1, node56path27) - 1))) &  (currentPath'=(27 * min(1, node56path27) - currentPath*(min(1,node56path27) - 1))) & (success'=min(1, node56path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path28 * min(1,node56path28) - currentNode*(min(1, node56path28) - 1))) &  (currentPath'=(28 * min(1, node56path28) - currentPath*(min(1,node56path28) - 1))) & (success'=min(1, node56path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path29 * min(1,node56path29) - currentNode*(min(1, node56path29) - 1))) &  (currentPath'=(29 * min(1, node56path29) - currentPath*(min(1,node56path29) - 1))) & (success'=min(1, node56path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path30 * min(1,node56path30) - currentNode*(min(1, node56path30) - 1))) &  (currentPath'=(30 * min(1, node56path30) - currentPath*(min(1,node56path30) - 1))) & (success'=min(1, node56path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path31 * min(1,node56path31) - currentNode*(min(1, node56path31) - 1))) &  (currentPath'=(31 * min(1, node56path31) - currentPath*(min(1,node56path31) - 1))) & (success'=min(1, node56path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path32 * min(1,node56path32) - currentNode*(min(1, node56path32) - 1))) &  (currentPath'=(32 * min(1, node56path32) - currentPath*(min(1,node56path32) - 1))) & (success'=min(1, node56path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path33 * min(1,node56path33) - currentNode*(min(1, node56path33) - 1))) &  (currentPath'=(33 * min(1, node56path33) - currentPath*(min(1,node56path33) - 1))) & (success'=min(1, node56path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path34 * min(1,node56path34) - currentNode*(min(1, node56path34) - 1))) &  (currentPath'=(34 * min(1, node56path34) - currentPath*(min(1,node56path34) - 1))) & (success'=min(1, node56path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path35 * min(1,node56path35) - currentNode*(min(1, node56path35) - 1))) &  (currentPath'=(35 * min(1, node56path35) - currentPath*(min(1,node56path35) - 1))) & (success'=min(1, node56path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path36 * min(1,node56path36) - currentNode*(min(1, node56path36) - 1))) &  (currentPath'=(36 * min(1, node56path36) - currentPath*(min(1,node56path36) - 1))) & (success'=min(1, node56path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path37 * min(1,node56path37) - currentNode*(min(1, node56path37) - 1))) &  (currentPath'=(37 * min(1, node56path37) - currentPath*(min(1,node56path37) - 1))) & (success'=min(1, node56path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path38 * min(1,node56path38) - currentNode*(min(1, node56path38) - 1))) &  (currentPath'=(38 * min(1, node56path38) - currentPath*(min(1,node56path38) - 1))) & (success'=min(1, node56path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path39 * min(1,node56path39) - currentNode*(min(1, node56path39) - 1))) &  (currentPath'=(39 * min(1, node56path39) - currentPath*(min(1,node56path39) - 1))) & (success'=min(1, node56path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path40 * min(1,node56path40) - currentNode*(min(1, node56path40) - 1))) &  (currentPath'=(40 * min(1, node56path40) - currentPath*(min(1,node56path40) - 1))) & (success'=min(1, node56path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path41 * min(1,node56path41) - currentNode*(min(1, node56path41) - 1))) &  (currentPath'=(41 * min(1, node56path41) - currentPath*(min(1,node56path41) - 1))) & (success'=min(1, node56path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path42 * min(1,node56path42) - currentNode*(min(1, node56path42) - 1))) &  (currentPath'=(42 * min(1, node56path42) - currentPath*(min(1,node56path42) - 1))) & (success'=min(1, node56path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path43 * min(1,node56path43) - currentNode*(min(1, node56path43) - 1))) &  (currentPath'=(43 * min(1, node56path43) - currentPath*(min(1,node56path43) - 1))) & (success'=min(1, node56path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path44 * min(1,node56path44) - currentNode*(min(1, node56path44) - 1))) &  (currentPath'=(44 * min(1, node56path44) - currentPath*(min(1,node56path44) - 1))) & (success'=min(1, node56path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path45 * min(1,node56path45) - currentNode*(min(1, node56path45) - 1))) &  (currentPath'=(45 * min(1, node56path45) - currentPath*(min(1,node56path45) - 1))) & (success'=min(1, node56path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path46 * min(1,node56path46) - currentNode*(min(1, node56path46) - 1))) &  (currentPath'=(46 * min(1, node56path46) - currentPath*(min(1,node56path46) - 1))) & (success'=min(1, node56path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path47 * min(1,node56path47) - currentNode*(min(1, node56path47) - 1))) &  (currentPath'=(47 * min(1, node56path47) - currentPath*(min(1,node56path47) - 1))) & (success'=min(1, node56path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path48 * min(1,node56path48) - currentNode*(min(1, node56path48) - 1))) &  (currentPath'=(48 * min(1, node56path48) - currentPath*(min(1,node56path48) - 1))) & (success'=min(1, node56path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path49 * min(1,node56path49) - currentNode*(min(1, node56path49) - 1))) &  (currentPath'=(49 * min(1, node56path49) - currentPath*(min(1,node56path49) - 1))) & (success'=min(1, node56path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path50 * min(1,node56path50) - currentNode*(min(1, node56path50) - 1))) &  (currentPath'=(50 * min(1, node56path50) - currentPath*(min(1,node56path50) - 1))) & (success'=min(1, node56path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path51 * min(1,node56path51) - currentNode*(min(1, node56path51) - 1))) &  (currentPath'=(51 * min(1, node56path51) - currentPath*(min(1,node56path51) - 1))) & (success'=min(1, node56path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path52 * min(1,node56path52) - currentNode*(min(1, node56path52) - 1))) &  (currentPath'=(52 * min(1, node56path52) - currentPath*(min(1,node56path52) - 1))) & (success'=min(1, node56path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path53 * min(1,node56path53) - currentNode*(min(1, node56path53) - 1))) &  (currentPath'=(53 * min(1, node56path53) - currentPath*(min(1,node56path53) - 1))) & (success'=min(1, node56path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path54 * min(1,node56path54) - currentNode*(min(1, node56path54) - 1))) &  (currentPath'=(54 * min(1, node56path54) - currentPath*(min(1,node56path54) - 1))) & (success'=min(1, node56path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path55 * min(1,node56path55) - currentNode*(min(1, node56path55) - 1))) &  (currentPath'=(55 * min(1, node56path55) - currentPath*(min(1,node56path55) - 1))) & (success'=min(1, node56path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path56 * min(1,node56path56) - currentNode*(min(1, node56path56) - 1))) &  (currentPath'=(56 * min(1, node56path56) - currentPath*(min(1,node56path56) - 1))) & (success'=min(1, node56path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path57 * min(1,node56path57) - currentNode*(min(1, node56path57) - 1))) &  (currentPath'=(57 * min(1, node56path57) - currentPath*(min(1,node56path57) - 1))) & (success'=min(1, node56path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path58 * min(1,node56path58) - currentNode*(min(1, node56path58) - 1))) &  (currentPath'=(58 * min(1, node56path58) - currentPath*(min(1,node56path58) - 1))) & (success'=min(1, node56path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path59 * min(1,node56path59) - currentNode*(min(1, node56path59) - 1))) &  (currentPath'=(59 * min(1, node56path59) - currentPath*(min(1,node56path59) - 1))) & (success'=min(1, node56path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path60 * min(1,node56path60) - currentNode*(min(1, node56path60) - 1))) &  (currentPath'=(60 * min(1, node56path60) - currentPath*(min(1,node56path60) - 1))) & (success'=min(1, node56path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path61 * min(1,node56path61) - currentNode*(min(1, node56path61) - 1))) &  (currentPath'=(61 * min(1, node56path61) - currentPath*(min(1,node56path61) - 1))) & (success'=min(1, node56path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path62 * min(1,node56path62) - currentNode*(min(1, node56path62) - 1))) &  (currentPath'=(62 * min(1, node56path62) - currentPath*(min(1,node56path62) - 1))) & (success'=min(1, node56path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path63 * min(1,node56path63) - currentNode*(min(1, node56path63) - 1))) &  (currentPath'=(63 * min(1, node56path63) - currentPath*(min(1,node56path63) - 1))) & (success'=min(1, node56path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path64 * min(1,node56path64) - currentNode*(min(1, node56path64) - 1))) &  (currentPath'=(64 * min(1, node56path64) - currentPath*(min(1,node56path64) - 1))) & (success'=min(1, node56path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path65 * min(1,node56path65) - currentNode*(min(1, node56path65) - 1))) &  (currentPath'=(65 * min(1, node56path65) - currentPath*(min(1,node56path65) - 1))) & (success'=min(1, node56path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path66 * min(1,node56path66) - currentNode*(min(1, node56path66) - 1))) &  (currentPath'=(66 * min(1, node56path66) - currentPath*(min(1,node56path66) - 1))) & (success'=min(1, node56path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path67 * min(1,node56path67) - currentNode*(min(1, node56path67) - 1))) &  (currentPath'=(67 * min(1, node56path67) - currentPath*(min(1,node56path67) - 1))) & (success'=min(1, node56path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path68 * min(1,node56path68) - currentNode*(min(1, node56path68) - 1))) &  (currentPath'=(68 * min(1, node56path68) - currentPath*(min(1,node56path68) - 1))) & (success'=min(1, node56path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path69 * min(1,node56path69) - currentNode*(min(1, node56path69) - 1))) &  (currentPath'=(69 * min(1, node56path69) - currentPath*(min(1,node56path69) - 1))) & (success'=min(1, node56path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path70 * min(1,node56path70) - currentNode*(min(1, node56path70) - 1))) &  (currentPath'=(70 * min(1, node56path70) - currentPath*(min(1,node56path70) - 1))) & (success'=min(1, node56path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path71 * min(1,node56path71) - currentNode*(min(1, node56path71) - 1))) &  (currentPath'=(71 * min(1, node56path71) - currentPath*(min(1,node56path71) - 1))) & (success'=min(1, node56path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path72 * min(1,node56path72) - currentNode*(min(1, node56path72) - 1))) &  (currentPath'=(72 * min(1, node56path72) - currentPath*(min(1,node56path72) - 1))) & (success'=min(1, node56path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path73 * min(1,node56path73) - currentNode*(min(1, node56path73) - 1))) &  (currentPath'=(73 * min(1, node56path73) - currentPath*(min(1,node56path73) - 1))) & (success'=min(1, node56path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path74 * min(1,node56path74) - currentNode*(min(1, node56path74) - 1))) &  (currentPath'=(74 * min(1, node56path74) - currentPath*(min(1,node56path74) - 1))) & (success'=min(1, node56path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path75 * min(1,node56path75) - currentNode*(min(1, node56path75) - 1))) &  (currentPath'=(75 * min(1, node56path75) - currentPath*(min(1,node56path75) - 1))) & (success'=min(1, node56path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path76 * min(1,node56path76) - currentNode*(min(1, node56path76) - 1))) &  (currentPath'=(76 * min(1, node56path76) - currentPath*(min(1,node56path76) - 1))) & (success'=min(1, node56path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path77 * min(1,node56path77) - currentNode*(min(1, node56path77) - 1))) &  (currentPath'=(77 * min(1, node56path77) - currentPath*(min(1,node56path77) - 1))) & (success'=min(1, node56path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path78 * min(1,node56path78) - currentNode*(min(1, node56path78) - 1))) &  (currentPath'=(78 * min(1, node56path78) - currentPath*(min(1,node56path78) - 1))) & (success'=min(1, node56path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path79 * min(1,node56path79) - currentNode*(min(1, node56path79) - 1))) &  (currentPath'=(79 * min(1, node56path79) - currentPath*(min(1,node56path79) - 1))) & (success'=min(1, node56path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path80 * min(1,node56path80) - currentNode*(min(1, node56path80) - 1))) &  (currentPath'=(80 * min(1, node56path80) - currentPath*(min(1,node56path80) - 1))) & (success'=min(1, node56path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path81 * min(1,node56path81) - currentNode*(min(1, node56path81) - 1))) &  (currentPath'=(81 * min(1, node56path81) - currentPath*(min(1,node56path81) - 1))) & (success'=min(1, node56path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path82 * min(1,node56path82) - currentNode*(min(1, node56path82) - 1))) &  (currentPath'=(82 * min(1, node56path82) - currentPath*(min(1,node56path82) - 1))) & (success'=min(1, node56path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path83 * min(1,node56path83) - currentNode*(min(1, node56path83) - 1))) &  (currentPath'=(83 * min(1, node56path83) - currentPath*(min(1,node56path83) - 1))) & (success'=min(1, node56path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path84 * min(1,node56path84) - currentNode*(min(1, node56path84) - 1))) &  (currentPath'=(84 * min(1, node56path84) - currentPath*(min(1,node56path84) - 1))) & (success'=min(1, node56path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path85 * min(1,node56path85) - currentNode*(min(1, node56path85) - 1))) &  (currentPath'=(85 * min(1, node56path85) - currentPath*(min(1,node56path85) - 1))) & (success'=min(1, node56path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path86 * min(1,node56path86) - currentNode*(min(1, node56path86) - 1))) &  (currentPath'=(86 * min(1, node56path86) - currentPath*(min(1,node56path86) - 1))) & (success'=min(1, node56path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path87 * min(1,node56path87) - currentNode*(min(1, node56path87) - 1))) &  (currentPath'=(87 * min(1, node56path87) - currentPath*(min(1,node56path87) - 1))) & (success'=min(1, node56path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path88 * min(1,node56path88) - currentNode*(min(1, node56path88) - 1))) &  (currentPath'=(88 * min(1, node56path88) - currentPath*(min(1,node56path88) - 1))) & (success'=min(1, node56path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path89 * min(1,node56path89) - currentNode*(min(1, node56path89) - 1))) &  (currentPath'=(89 * min(1, node56path89) - currentPath*(min(1,node56path89) - 1))) & (success'=min(1, node56path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path90 * min(1,node56path90) - currentNode*(min(1, node56path90) - 1))) &  (currentPath'=(90 * min(1, node56path90) - currentPath*(min(1,node56path90) - 1))) & (success'=min(1, node56path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path91 * min(1,node56path91) - currentNode*(min(1, node56path91) - 1))) &  (currentPath'=(91 * min(1, node56path91) - currentPath*(min(1,node56path91) - 1))) & (success'=min(1, node56path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path92 * min(1,node56path92) - currentNode*(min(1, node56path92) - 1))) &  (currentPath'=(92 * min(1, node56path92) - currentPath*(min(1,node56path92) - 1))) & (success'=min(1, node56path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path93 * min(1,node56path93) - currentNode*(min(1, node56path93) - 1))) &  (currentPath'=(93 * min(1, node56path93) - currentPath*(min(1,node56path93) - 1))) & (success'=min(1, node56path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path94 * min(1,node56path94) - currentNode*(min(1, node56path94) - 1))) &  (currentPath'=(94 * min(1, node56path94) - currentPath*(min(1,node56path94) - 1))) & (success'=min(1, node56path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path95 * min(1,node56path95) - currentNode*(min(1, node56path95) - 1))) &  (currentPath'=(95 * min(1, node56path95) - currentPath*(min(1,node56path95) - 1))) & (success'=min(1, node56path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path96 * min(1,node56path96) - currentNode*(min(1, node56path96) - 1))) &  (currentPath'=(96 * min(1, node56path96) - currentPath*(min(1,node56path96) - 1))) & (success'=min(1, node56path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path97 * min(1,node56path97) - currentNode*(min(1, node56path97) - 1))) &  (currentPath'=(97 * min(1, node56path97) - currentPath*(min(1,node56path97) - 1))) & (success'=min(1, node56path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path98 * min(1,node56path98) - currentNode*(min(1, node56path98) - 1))) &  (currentPath'=(98 * min(1, node56path98) - currentPath*(min(1,node56path98) - 1))) & (success'=min(1, node56path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path99 * min(1,node56path99) - currentNode*(min(1, node56path99) - 1))) &  (currentPath'=(99 * min(1, node56path99) - currentPath*(min(1,node56path99) - 1))) & (success'=min(1, node56path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node56path100 * min(1,node56path100) - currentNode*(min(1, node56path100) - 1))) &  (currentPath'=(100 * min(1, node56path100) - currentPath*(min(1,node56path100) - 1))) & (success'=min(1, node56path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 57) ->
 numPathsInv: (currentNode'=(node57path1 * min(1,node57path1) - currentNode*(min(1, node57path1) - 1))) &  (currentPath'=(1 * min(1, node57path1) - currentPath*(min(1,node57path1) - 1))) & (success'=min(1, node57path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path2 * min(1,node57path2) - currentNode*(min(1, node57path2) - 1))) &  (currentPath'=(2 * min(1, node57path2) - currentPath*(min(1,node57path2) - 1))) & (success'=min(1, node57path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path3 * min(1,node57path3) - currentNode*(min(1, node57path3) - 1))) &  (currentPath'=(3 * min(1, node57path3) - currentPath*(min(1,node57path3) - 1))) & (success'=min(1, node57path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path4 * min(1,node57path4) - currentNode*(min(1, node57path4) - 1))) &  (currentPath'=(4 * min(1, node57path4) - currentPath*(min(1,node57path4) - 1))) & (success'=min(1, node57path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path5 * min(1,node57path5) - currentNode*(min(1, node57path5) - 1))) &  (currentPath'=(5 * min(1, node57path5) - currentPath*(min(1,node57path5) - 1))) & (success'=min(1, node57path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path6 * min(1,node57path6) - currentNode*(min(1, node57path6) - 1))) &  (currentPath'=(6 * min(1, node57path6) - currentPath*(min(1,node57path6) - 1))) & (success'=min(1, node57path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path7 * min(1,node57path7) - currentNode*(min(1, node57path7) - 1))) &  (currentPath'=(7 * min(1, node57path7) - currentPath*(min(1,node57path7) - 1))) & (success'=min(1, node57path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path8 * min(1,node57path8) - currentNode*(min(1, node57path8) - 1))) &  (currentPath'=(8 * min(1, node57path8) - currentPath*(min(1,node57path8) - 1))) & (success'=min(1, node57path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path9 * min(1,node57path9) - currentNode*(min(1, node57path9) - 1))) &  (currentPath'=(9 * min(1, node57path9) - currentPath*(min(1,node57path9) - 1))) & (success'=min(1, node57path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path10 * min(1,node57path10) - currentNode*(min(1, node57path10) - 1))) &  (currentPath'=(10 * min(1, node57path10) - currentPath*(min(1,node57path10) - 1))) & (success'=min(1, node57path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path11 * min(1,node57path11) - currentNode*(min(1, node57path11) - 1))) &  (currentPath'=(11 * min(1, node57path11) - currentPath*(min(1,node57path11) - 1))) & (success'=min(1, node57path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path12 * min(1,node57path12) - currentNode*(min(1, node57path12) - 1))) &  (currentPath'=(12 * min(1, node57path12) - currentPath*(min(1,node57path12) - 1))) & (success'=min(1, node57path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path13 * min(1,node57path13) - currentNode*(min(1, node57path13) - 1))) &  (currentPath'=(13 * min(1, node57path13) - currentPath*(min(1,node57path13) - 1))) & (success'=min(1, node57path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path14 * min(1,node57path14) - currentNode*(min(1, node57path14) - 1))) &  (currentPath'=(14 * min(1, node57path14) - currentPath*(min(1,node57path14) - 1))) & (success'=min(1, node57path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path15 * min(1,node57path15) - currentNode*(min(1, node57path15) - 1))) &  (currentPath'=(15 * min(1, node57path15) - currentPath*(min(1,node57path15) - 1))) & (success'=min(1, node57path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path16 * min(1,node57path16) - currentNode*(min(1, node57path16) - 1))) &  (currentPath'=(16 * min(1, node57path16) - currentPath*(min(1,node57path16) - 1))) & (success'=min(1, node57path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path17 * min(1,node57path17) - currentNode*(min(1, node57path17) - 1))) &  (currentPath'=(17 * min(1, node57path17) - currentPath*(min(1,node57path17) - 1))) & (success'=min(1, node57path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path18 * min(1,node57path18) - currentNode*(min(1, node57path18) - 1))) &  (currentPath'=(18 * min(1, node57path18) - currentPath*(min(1,node57path18) - 1))) & (success'=min(1, node57path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path19 * min(1,node57path19) - currentNode*(min(1, node57path19) - 1))) &  (currentPath'=(19 * min(1, node57path19) - currentPath*(min(1,node57path19) - 1))) & (success'=min(1, node57path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path20 * min(1,node57path20) - currentNode*(min(1, node57path20) - 1))) &  (currentPath'=(20 * min(1, node57path20) - currentPath*(min(1,node57path20) - 1))) & (success'=min(1, node57path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path21 * min(1,node57path21) - currentNode*(min(1, node57path21) - 1))) &  (currentPath'=(21 * min(1, node57path21) - currentPath*(min(1,node57path21) - 1))) & (success'=min(1, node57path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path22 * min(1,node57path22) - currentNode*(min(1, node57path22) - 1))) &  (currentPath'=(22 * min(1, node57path22) - currentPath*(min(1,node57path22) - 1))) & (success'=min(1, node57path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path23 * min(1,node57path23) - currentNode*(min(1, node57path23) - 1))) &  (currentPath'=(23 * min(1, node57path23) - currentPath*(min(1,node57path23) - 1))) & (success'=min(1, node57path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path24 * min(1,node57path24) - currentNode*(min(1, node57path24) - 1))) &  (currentPath'=(24 * min(1, node57path24) - currentPath*(min(1,node57path24) - 1))) & (success'=min(1, node57path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path25 * min(1,node57path25) - currentNode*(min(1, node57path25) - 1))) &  (currentPath'=(25 * min(1, node57path25) - currentPath*(min(1,node57path25) - 1))) & (success'=min(1, node57path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path26 * min(1,node57path26) - currentNode*(min(1, node57path26) - 1))) &  (currentPath'=(26 * min(1, node57path26) - currentPath*(min(1,node57path26) - 1))) & (success'=min(1, node57path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path27 * min(1,node57path27) - currentNode*(min(1, node57path27) - 1))) &  (currentPath'=(27 * min(1, node57path27) - currentPath*(min(1,node57path27) - 1))) & (success'=min(1, node57path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path28 * min(1,node57path28) - currentNode*(min(1, node57path28) - 1))) &  (currentPath'=(28 * min(1, node57path28) - currentPath*(min(1,node57path28) - 1))) & (success'=min(1, node57path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path29 * min(1,node57path29) - currentNode*(min(1, node57path29) - 1))) &  (currentPath'=(29 * min(1, node57path29) - currentPath*(min(1,node57path29) - 1))) & (success'=min(1, node57path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path30 * min(1,node57path30) - currentNode*(min(1, node57path30) - 1))) &  (currentPath'=(30 * min(1, node57path30) - currentPath*(min(1,node57path30) - 1))) & (success'=min(1, node57path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path31 * min(1,node57path31) - currentNode*(min(1, node57path31) - 1))) &  (currentPath'=(31 * min(1, node57path31) - currentPath*(min(1,node57path31) - 1))) & (success'=min(1, node57path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path32 * min(1,node57path32) - currentNode*(min(1, node57path32) - 1))) &  (currentPath'=(32 * min(1, node57path32) - currentPath*(min(1,node57path32) - 1))) & (success'=min(1, node57path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path33 * min(1,node57path33) - currentNode*(min(1, node57path33) - 1))) &  (currentPath'=(33 * min(1, node57path33) - currentPath*(min(1,node57path33) - 1))) & (success'=min(1, node57path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path34 * min(1,node57path34) - currentNode*(min(1, node57path34) - 1))) &  (currentPath'=(34 * min(1, node57path34) - currentPath*(min(1,node57path34) - 1))) & (success'=min(1, node57path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path35 * min(1,node57path35) - currentNode*(min(1, node57path35) - 1))) &  (currentPath'=(35 * min(1, node57path35) - currentPath*(min(1,node57path35) - 1))) & (success'=min(1, node57path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path36 * min(1,node57path36) - currentNode*(min(1, node57path36) - 1))) &  (currentPath'=(36 * min(1, node57path36) - currentPath*(min(1,node57path36) - 1))) & (success'=min(1, node57path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path37 * min(1,node57path37) - currentNode*(min(1, node57path37) - 1))) &  (currentPath'=(37 * min(1, node57path37) - currentPath*(min(1,node57path37) - 1))) & (success'=min(1, node57path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path38 * min(1,node57path38) - currentNode*(min(1, node57path38) - 1))) &  (currentPath'=(38 * min(1, node57path38) - currentPath*(min(1,node57path38) - 1))) & (success'=min(1, node57path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path39 * min(1,node57path39) - currentNode*(min(1, node57path39) - 1))) &  (currentPath'=(39 * min(1, node57path39) - currentPath*(min(1,node57path39) - 1))) & (success'=min(1, node57path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path40 * min(1,node57path40) - currentNode*(min(1, node57path40) - 1))) &  (currentPath'=(40 * min(1, node57path40) - currentPath*(min(1,node57path40) - 1))) & (success'=min(1, node57path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path41 * min(1,node57path41) - currentNode*(min(1, node57path41) - 1))) &  (currentPath'=(41 * min(1, node57path41) - currentPath*(min(1,node57path41) - 1))) & (success'=min(1, node57path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path42 * min(1,node57path42) - currentNode*(min(1, node57path42) - 1))) &  (currentPath'=(42 * min(1, node57path42) - currentPath*(min(1,node57path42) - 1))) & (success'=min(1, node57path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path43 * min(1,node57path43) - currentNode*(min(1, node57path43) - 1))) &  (currentPath'=(43 * min(1, node57path43) - currentPath*(min(1,node57path43) - 1))) & (success'=min(1, node57path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path44 * min(1,node57path44) - currentNode*(min(1, node57path44) - 1))) &  (currentPath'=(44 * min(1, node57path44) - currentPath*(min(1,node57path44) - 1))) & (success'=min(1, node57path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path45 * min(1,node57path45) - currentNode*(min(1, node57path45) - 1))) &  (currentPath'=(45 * min(1, node57path45) - currentPath*(min(1,node57path45) - 1))) & (success'=min(1, node57path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path46 * min(1,node57path46) - currentNode*(min(1, node57path46) - 1))) &  (currentPath'=(46 * min(1, node57path46) - currentPath*(min(1,node57path46) - 1))) & (success'=min(1, node57path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path47 * min(1,node57path47) - currentNode*(min(1, node57path47) - 1))) &  (currentPath'=(47 * min(1, node57path47) - currentPath*(min(1,node57path47) - 1))) & (success'=min(1, node57path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path48 * min(1,node57path48) - currentNode*(min(1, node57path48) - 1))) &  (currentPath'=(48 * min(1, node57path48) - currentPath*(min(1,node57path48) - 1))) & (success'=min(1, node57path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path49 * min(1,node57path49) - currentNode*(min(1, node57path49) - 1))) &  (currentPath'=(49 * min(1, node57path49) - currentPath*(min(1,node57path49) - 1))) & (success'=min(1, node57path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path50 * min(1,node57path50) - currentNode*(min(1, node57path50) - 1))) &  (currentPath'=(50 * min(1, node57path50) - currentPath*(min(1,node57path50) - 1))) & (success'=min(1, node57path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path51 * min(1,node57path51) - currentNode*(min(1, node57path51) - 1))) &  (currentPath'=(51 * min(1, node57path51) - currentPath*(min(1,node57path51) - 1))) & (success'=min(1, node57path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path52 * min(1,node57path52) - currentNode*(min(1, node57path52) - 1))) &  (currentPath'=(52 * min(1, node57path52) - currentPath*(min(1,node57path52) - 1))) & (success'=min(1, node57path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path53 * min(1,node57path53) - currentNode*(min(1, node57path53) - 1))) &  (currentPath'=(53 * min(1, node57path53) - currentPath*(min(1,node57path53) - 1))) & (success'=min(1, node57path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path54 * min(1,node57path54) - currentNode*(min(1, node57path54) - 1))) &  (currentPath'=(54 * min(1, node57path54) - currentPath*(min(1,node57path54) - 1))) & (success'=min(1, node57path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path55 * min(1,node57path55) - currentNode*(min(1, node57path55) - 1))) &  (currentPath'=(55 * min(1, node57path55) - currentPath*(min(1,node57path55) - 1))) & (success'=min(1, node57path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path56 * min(1,node57path56) - currentNode*(min(1, node57path56) - 1))) &  (currentPath'=(56 * min(1, node57path56) - currentPath*(min(1,node57path56) - 1))) & (success'=min(1, node57path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path57 * min(1,node57path57) - currentNode*(min(1, node57path57) - 1))) &  (currentPath'=(57 * min(1, node57path57) - currentPath*(min(1,node57path57) - 1))) & (success'=min(1, node57path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path58 * min(1,node57path58) - currentNode*(min(1, node57path58) - 1))) &  (currentPath'=(58 * min(1, node57path58) - currentPath*(min(1,node57path58) - 1))) & (success'=min(1, node57path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path59 * min(1,node57path59) - currentNode*(min(1, node57path59) - 1))) &  (currentPath'=(59 * min(1, node57path59) - currentPath*(min(1,node57path59) - 1))) & (success'=min(1, node57path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path60 * min(1,node57path60) - currentNode*(min(1, node57path60) - 1))) &  (currentPath'=(60 * min(1, node57path60) - currentPath*(min(1,node57path60) - 1))) & (success'=min(1, node57path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path61 * min(1,node57path61) - currentNode*(min(1, node57path61) - 1))) &  (currentPath'=(61 * min(1, node57path61) - currentPath*(min(1,node57path61) - 1))) & (success'=min(1, node57path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path62 * min(1,node57path62) - currentNode*(min(1, node57path62) - 1))) &  (currentPath'=(62 * min(1, node57path62) - currentPath*(min(1,node57path62) - 1))) & (success'=min(1, node57path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path63 * min(1,node57path63) - currentNode*(min(1, node57path63) - 1))) &  (currentPath'=(63 * min(1, node57path63) - currentPath*(min(1,node57path63) - 1))) & (success'=min(1, node57path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path64 * min(1,node57path64) - currentNode*(min(1, node57path64) - 1))) &  (currentPath'=(64 * min(1, node57path64) - currentPath*(min(1,node57path64) - 1))) & (success'=min(1, node57path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path65 * min(1,node57path65) - currentNode*(min(1, node57path65) - 1))) &  (currentPath'=(65 * min(1, node57path65) - currentPath*(min(1,node57path65) - 1))) & (success'=min(1, node57path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path66 * min(1,node57path66) - currentNode*(min(1, node57path66) - 1))) &  (currentPath'=(66 * min(1, node57path66) - currentPath*(min(1,node57path66) - 1))) & (success'=min(1, node57path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path67 * min(1,node57path67) - currentNode*(min(1, node57path67) - 1))) &  (currentPath'=(67 * min(1, node57path67) - currentPath*(min(1,node57path67) - 1))) & (success'=min(1, node57path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path68 * min(1,node57path68) - currentNode*(min(1, node57path68) - 1))) &  (currentPath'=(68 * min(1, node57path68) - currentPath*(min(1,node57path68) - 1))) & (success'=min(1, node57path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path69 * min(1,node57path69) - currentNode*(min(1, node57path69) - 1))) &  (currentPath'=(69 * min(1, node57path69) - currentPath*(min(1,node57path69) - 1))) & (success'=min(1, node57path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path70 * min(1,node57path70) - currentNode*(min(1, node57path70) - 1))) &  (currentPath'=(70 * min(1, node57path70) - currentPath*(min(1,node57path70) - 1))) & (success'=min(1, node57path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path71 * min(1,node57path71) - currentNode*(min(1, node57path71) - 1))) &  (currentPath'=(71 * min(1, node57path71) - currentPath*(min(1,node57path71) - 1))) & (success'=min(1, node57path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path72 * min(1,node57path72) - currentNode*(min(1, node57path72) - 1))) &  (currentPath'=(72 * min(1, node57path72) - currentPath*(min(1,node57path72) - 1))) & (success'=min(1, node57path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path73 * min(1,node57path73) - currentNode*(min(1, node57path73) - 1))) &  (currentPath'=(73 * min(1, node57path73) - currentPath*(min(1,node57path73) - 1))) & (success'=min(1, node57path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path74 * min(1,node57path74) - currentNode*(min(1, node57path74) - 1))) &  (currentPath'=(74 * min(1, node57path74) - currentPath*(min(1,node57path74) - 1))) & (success'=min(1, node57path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path75 * min(1,node57path75) - currentNode*(min(1, node57path75) - 1))) &  (currentPath'=(75 * min(1, node57path75) - currentPath*(min(1,node57path75) - 1))) & (success'=min(1, node57path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path76 * min(1,node57path76) - currentNode*(min(1, node57path76) - 1))) &  (currentPath'=(76 * min(1, node57path76) - currentPath*(min(1,node57path76) - 1))) & (success'=min(1, node57path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path77 * min(1,node57path77) - currentNode*(min(1, node57path77) - 1))) &  (currentPath'=(77 * min(1, node57path77) - currentPath*(min(1,node57path77) - 1))) & (success'=min(1, node57path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path78 * min(1,node57path78) - currentNode*(min(1, node57path78) - 1))) &  (currentPath'=(78 * min(1, node57path78) - currentPath*(min(1,node57path78) - 1))) & (success'=min(1, node57path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path79 * min(1,node57path79) - currentNode*(min(1, node57path79) - 1))) &  (currentPath'=(79 * min(1, node57path79) - currentPath*(min(1,node57path79) - 1))) & (success'=min(1, node57path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path80 * min(1,node57path80) - currentNode*(min(1, node57path80) - 1))) &  (currentPath'=(80 * min(1, node57path80) - currentPath*(min(1,node57path80) - 1))) & (success'=min(1, node57path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path81 * min(1,node57path81) - currentNode*(min(1, node57path81) - 1))) &  (currentPath'=(81 * min(1, node57path81) - currentPath*(min(1,node57path81) - 1))) & (success'=min(1, node57path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path82 * min(1,node57path82) - currentNode*(min(1, node57path82) - 1))) &  (currentPath'=(82 * min(1, node57path82) - currentPath*(min(1,node57path82) - 1))) & (success'=min(1, node57path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path83 * min(1,node57path83) - currentNode*(min(1, node57path83) - 1))) &  (currentPath'=(83 * min(1, node57path83) - currentPath*(min(1,node57path83) - 1))) & (success'=min(1, node57path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path84 * min(1,node57path84) - currentNode*(min(1, node57path84) - 1))) &  (currentPath'=(84 * min(1, node57path84) - currentPath*(min(1,node57path84) - 1))) & (success'=min(1, node57path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path85 * min(1,node57path85) - currentNode*(min(1, node57path85) - 1))) &  (currentPath'=(85 * min(1, node57path85) - currentPath*(min(1,node57path85) - 1))) & (success'=min(1, node57path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path86 * min(1,node57path86) - currentNode*(min(1, node57path86) - 1))) &  (currentPath'=(86 * min(1, node57path86) - currentPath*(min(1,node57path86) - 1))) & (success'=min(1, node57path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path87 * min(1,node57path87) - currentNode*(min(1, node57path87) - 1))) &  (currentPath'=(87 * min(1, node57path87) - currentPath*(min(1,node57path87) - 1))) & (success'=min(1, node57path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path88 * min(1,node57path88) - currentNode*(min(1, node57path88) - 1))) &  (currentPath'=(88 * min(1, node57path88) - currentPath*(min(1,node57path88) - 1))) & (success'=min(1, node57path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path89 * min(1,node57path89) - currentNode*(min(1, node57path89) - 1))) &  (currentPath'=(89 * min(1, node57path89) - currentPath*(min(1,node57path89) - 1))) & (success'=min(1, node57path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path90 * min(1,node57path90) - currentNode*(min(1, node57path90) - 1))) &  (currentPath'=(90 * min(1, node57path90) - currentPath*(min(1,node57path90) - 1))) & (success'=min(1, node57path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path91 * min(1,node57path91) - currentNode*(min(1, node57path91) - 1))) &  (currentPath'=(91 * min(1, node57path91) - currentPath*(min(1,node57path91) - 1))) & (success'=min(1, node57path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path92 * min(1,node57path92) - currentNode*(min(1, node57path92) - 1))) &  (currentPath'=(92 * min(1, node57path92) - currentPath*(min(1,node57path92) - 1))) & (success'=min(1, node57path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path93 * min(1,node57path93) - currentNode*(min(1, node57path93) - 1))) &  (currentPath'=(93 * min(1, node57path93) - currentPath*(min(1,node57path93) - 1))) & (success'=min(1, node57path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path94 * min(1,node57path94) - currentNode*(min(1, node57path94) - 1))) &  (currentPath'=(94 * min(1, node57path94) - currentPath*(min(1,node57path94) - 1))) & (success'=min(1, node57path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path95 * min(1,node57path95) - currentNode*(min(1, node57path95) - 1))) &  (currentPath'=(95 * min(1, node57path95) - currentPath*(min(1,node57path95) - 1))) & (success'=min(1, node57path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path96 * min(1,node57path96) - currentNode*(min(1, node57path96) - 1))) &  (currentPath'=(96 * min(1, node57path96) - currentPath*(min(1,node57path96) - 1))) & (success'=min(1, node57path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path97 * min(1,node57path97) - currentNode*(min(1, node57path97) - 1))) &  (currentPath'=(97 * min(1, node57path97) - currentPath*(min(1,node57path97) - 1))) & (success'=min(1, node57path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path98 * min(1,node57path98) - currentNode*(min(1, node57path98) - 1))) &  (currentPath'=(98 * min(1, node57path98) - currentPath*(min(1,node57path98) - 1))) & (success'=min(1, node57path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path99 * min(1,node57path99) - currentNode*(min(1, node57path99) - 1))) &  (currentPath'=(99 * min(1, node57path99) - currentPath*(min(1,node57path99) - 1))) & (success'=min(1, node57path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node57path100 * min(1,node57path100) - currentNode*(min(1, node57path100) - 1))) &  (currentPath'=(100 * min(1, node57path100) - currentPath*(min(1,node57path100) - 1))) & (success'=min(1, node57path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 58) ->
 numPathsInv: (currentNode'=(node58path1 * min(1,node58path1) - currentNode*(min(1, node58path1) - 1))) &  (currentPath'=(1 * min(1, node58path1) - currentPath*(min(1,node58path1) - 1))) & (success'=min(1, node58path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path2 * min(1,node58path2) - currentNode*(min(1, node58path2) - 1))) &  (currentPath'=(2 * min(1, node58path2) - currentPath*(min(1,node58path2) - 1))) & (success'=min(1, node58path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path3 * min(1,node58path3) - currentNode*(min(1, node58path3) - 1))) &  (currentPath'=(3 * min(1, node58path3) - currentPath*(min(1,node58path3) - 1))) & (success'=min(1, node58path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path4 * min(1,node58path4) - currentNode*(min(1, node58path4) - 1))) &  (currentPath'=(4 * min(1, node58path4) - currentPath*(min(1,node58path4) - 1))) & (success'=min(1, node58path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path5 * min(1,node58path5) - currentNode*(min(1, node58path5) - 1))) &  (currentPath'=(5 * min(1, node58path5) - currentPath*(min(1,node58path5) - 1))) & (success'=min(1, node58path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path6 * min(1,node58path6) - currentNode*(min(1, node58path6) - 1))) &  (currentPath'=(6 * min(1, node58path6) - currentPath*(min(1,node58path6) - 1))) & (success'=min(1, node58path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path7 * min(1,node58path7) - currentNode*(min(1, node58path7) - 1))) &  (currentPath'=(7 * min(1, node58path7) - currentPath*(min(1,node58path7) - 1))) & (success'=min(1, node58path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path8 * min(1,node58path8) - currentNode*(min(1, node58path8) - 1))) &  (currentPath'=(8 * min(1, node58path8) - currentPath*(min(1,node58path8) - 1))) & (success'=min(1, node58path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path9 * min(1,node58path9) - currentNode*(min(1, node58path9) - 1))) &  (currentPath'=(9 * min(1, node58path9) - currentPath*(min(1,node58path9) - 1))) & (success'=min(1, node58path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path10 * min(1,node58path10) - currentNode*(min(1, node58path10) - 1))) &  (currentPath'=(10 * min(1, node58path10) - currentPath*(min(1,node58path10) - 1))) & (success'=min(1, node58path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path11 * min(1,node58path11) - currentNode*(min(1, node58path11) - 1))) &  (currentPath'=(11 * min(1, node58path11) - currentPath*(min(1,node58path11) - 1))) & (success'=min(1, node58path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path12 * min(1,node58path12) - currentNode*(min(1, node58path12) - 1))) &  (currentPath'=(12 * min(1, node58path12) - currentPath*(min(1,node58path12) - 1))) & (success'=min(1, node58path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path13 * min(1,node58path13) - currentNode*(min(1, node58path13) - 1))) &  (currentPath'=(13 * min(1, node58path13) - currentPath*(min(1,node58path13) - 1))) & (success'=min(1, node58path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path14 * min(1,node58path14) - currentNode*(min(1, node58path14) - 1))) &  (currentPath'=(14 * min(1, node58path14) - currentPath*(min(1,node58path14) - 1))) & (success'=min(1, node58path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path15 * min(1,node58path15) - currentNode*(min(1, node58path15) - 1))) &  (currentPath'=(15 * min(1, node58path15) - currentPath*(min(1,node58path15) - 1))) & (success'=min(1, node58path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path16 * min(1,node58path16) - currentNode*(min(1, node58path16) - 1))) &  (currentPath'=(16 * min(1, node58path16) - currentPath*(min(1,node58path16) - 1))) & (success'=min(1, node58path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path17 * min(1,node58path17) - currentNode*(min(1, node58path17) - 1))) &  (currentPath'=(17 * min(1, node58path17) - currentPath*(min(1,node58path17) - 1))) & (success'=min(1, node58path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path18 * min(1,node58path18) - currentNode*(min(1, node58path18) - 1))) &  (currentPath'=(18 * min(1, node58path18) - currentPath*(min(1,node58path18) - 1))) & (success'=min(1, node58path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path19 * min(1,node58path19) - currentNode*(min(1, node58path19) - 1))) &  (currentPath'=(19 * min(1, node58path19) - currentPath*(min(1,node58path19) - 1))) & (success'=min(1, node58path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path20 * min(1,node58path20) - currentNode*(min(1, node58path20) - 1))) &  (currentPath'=(20 * min(1, node58path20) - currentPath*(min(1,node58path20) - 1))) & (success'=min(1, node58path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path21 * min(1,node58path21) - currentNode*(min(1, node58path21) - 1))) &  (currentPath'=(21 * min(1, node58path21) - currentPath*(min(1,node58path21) - 1))) & (success'=min(1, node58path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path22 * min(1,node58path22) - currentNode*(min(1, node58path22) - 1))) &  (currentPath'=(22 * min(1, node58path22) - currentPath*(min(1,node58path22) - 1))) & (success'=min(1, node58path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path23 * min(1,node58path23) - currentNode*(min(1, node58path23) - 1))) &  (currentPath'=(23 * min(1, node58path23) - currentPath*(min(1,node58path23) - 1))) & (success'=min(1, node58path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path24 * min(1,node58path24) - currentNode*(min(1, node58path24) - 1))) &  (currentPath'=(24 * min(1, node58path24) - currentPath*(min(1,node58path24) - 1))) & (success'=min(1, node58path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path25 * min(1,node58path25) - currentNode*(min(1, node58path25) - 1))) &  (currentPath'=(25 * min(1, node58path25) - currentPath*(min(1,node58path25) - 1))) & (success'=min(1, node58path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path26 * min(1,node58path26) - currentNode*(min(1, node58path26) - 1))) &  (currentPath'=(26 * min(1, node58path26) - currentPath*(min(1,node58path26) - 1))) & (success'=min(1, node58path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path27 * min(1,node58path27) - currentNode*(min(1, node58path27) - 1))) &  (currentPath'=(27 * min(1, node58path27) - currentPath*(min(1,node58path27) - 1))) & (success'=min(1, node58path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path28 * min(1,node58path28) - currentNode*(min(1, node58path28) - 1))) &  (currentPath'=(28 * min(1, node58path28) - currentPath*(min(1,node58path28) - 1))) & (success'=min(1, node58path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path29 * min(1,node58path29) - currentNode*(min(1, node58path29) - 1))) &  (currentPath'=(29 * min(1, node58path29) - currentPath*(min(1,node58path29) - 1))) & (success'=min(1, node58path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path30 * min(1,node58path30) - currentNode*(min(1, node58path30) - 1))) &  (currentPath'=(30 * min(1, node58path30) - currentPath*(min(1,node58path30) - 1))) & (success'=min(1, node58path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path31 * min(1,node58path31) - currentNode*(min(1, node58path31) - 1))) &  (currentPath'=(31 * min(1, node58path31) - currentPath*(min(1,node58path31) - 1))) & (success'=min(1, node58path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path32 * min(1,node58path32) - currentNode*(min(1, node58path32) - 1))) &  (currentPath'=(32 * min(1, node58path32) - currentPath*(min(1,node58path32) - 1))) & (success'=min(1, node58path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path33 * min(1,node58path33) - currentNode*(min(1, node58path33) - 1))) &  (currentPath'=(33 * min(1, node58path33) - currentPath*(min(1,node58path33) - 1))) & (success'=min(1, node58path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path34 * min(1,node58path34) - currentNode*(min(1, node58path34) - 1))) &  (currentPath'=(34 * min(1, node58path34) - currentPath*(min(1,node58path34) - 1))) & (success'=min(1, node58path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path35 * min(1,node58path35) - currentNode*(min(1, node58path35) - 1))) &  (currentPath'=(35 * min(1, node58path35) - currentPath*(min(1,node58path35) - 1))) & (success'=min(1, node58path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path36 * min(1,node58path36) - currentNode*(min(1, node58path36) - 1))) &  (currentPath'=(36 * min(1, node58path36) - currentPath*(min(1,node58path36) - 1))) & (success'=min(1, node58path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path37 * min(1,node58path37) - currentNode*(min(1, node58path37) - 1))) &  (currentPath'=(37 * min(1, node58path37) - currentPath*(min(1,node58path37) - 1))) & (success'=min(1, node58path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path38 * min(1,node58path38) - currentNode*(min(1, node58path38) - 1))) &  (currentPath'=(38 * min(1, node58path38) - currentPath*(min(1,node58path38) - 1))) & (success'=min(1, node58path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path39 * min(1,node58path39) - currentNode*(min(1, node58path39) - 1))) &  (currentPath'=(39 * min(1, node58path39) - currentPath*(min(1,node58path39) - 1))) & (success'=min(1, node58path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path40 * min(1,node58path40) - currentNode*(min(1, node58path40) - 1))) &  (currentPath'=(40 * min(1, node58path40) - currentPath*(min(1,node58path40) - 1))) & (success'=min(1, node58path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path41 * min(1,node58path41) - currentNode*(min(1, node58path41) - 1))) &  (currentPath'=(41 * min(1, node58path41) - currentPath*(min(1,node58path41) - 1))) & (success'=min(1, node58path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path42 * min(1,node58path42) - currentNode*(min(1, node58path42) - 1))) &  (currentPath'=(42 * min(1, node58path42) - currentPath*(min(1,node58path42) - 1))) & (success'=min(1, node58path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path43 * min(1,node58path43) - currentNode*(min(1, node58path43) - 1))) &  (currentPath'=(43 * min(1, node58path43) - currentPath*(min(1,node58path43) - 1))) & (success'=min(1, node58path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path44 * min(1,node58path44) - currentNode*(min(1, node58path44) - 1))) &  (currentPath'=(44 * min(1, node58path44) - currentPath*(min(1,node58path44) - 1))) & (success'=min(1, node58path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path45 * min(1,node58path45) - currentNode*(min(1, node58path45) - 1))) &  (currentPath'=(45 * min(1, node58path45) - currentPath*(min(1,node58path45) - 1))) & (success'=min(1, node58path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path46 * min(1,node58path46) - currentNode*(min(1, node58path46) - 1))) &  (currentPath'=(46 * min(1, node58path46) - currentPath*(min(1,node58path46) - 1))) & (success'=min(1, node58path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path47 * min(1,node58path47) - currentNode*(min(1, node58path47) - 1))) &  (currentPath'=(47 * min(1, node58path47) - currentPath*(min(1,node58path47) - 1))) & (success'=min(1, node58path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path48 * min(1,node58path48) - currentNode*(min(1, node58path48) - 1))) &  (currentPath'=(48 * min(1, node58path48) - currentPath*(min(1,node58path48) - 1))) & (success'=min(1, node58path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path49 * min(1,node58path49) - currentNode*(min(1, node58path49) - 1))) &  (currentPath'=(49 * min(1, node58path49) - currentPath*(min(1,node58path49) - 1))) & (success'=min(1, node58path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path50 * min(1,node58path50) - currentNode*(min(1, node58path50) - 1))) &  (currentPath'=(50 * min(1, node58path50) - currentPath*(min(1,node58path50) - 1))) & (success'=min(1, node58path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path51 * min(1,node58path51) - currentNode*(min(1, node58path51) - 1))) &  (currentPath'=(51 * min(1, node58path51) - currentPath*(min(1,node58path51) - 1))) & (success'=min(1, node58path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path52 * min(1,node58path52) - currentNode*(min(1, node58path52) - 1))) &  (currentPath'=(52 * min(1, node58path52) - currentPath*(min(1,node58path52) - 1))) & (success'=min(1, node58path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path53 * min(1,node58path53) - currentNode*(min(1, node58path53) - 1))) &  (currentPath'=(53 * min(1, node58path53) - currentPath*(min(1,node58path53) - 1))) & (success'=min(1, node58path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path54 * min(1,node58path54) - currentNode*(min(1, node58path54) - 1))) &  (currentPath'=(54 * min(1, node58path54) - currentPath*(min(1,node58path54) - 1))) & (success'=min(1, node58path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path55 * min(1,node58path55) - currentNode*(min(1, node58path55) - 1))) &  (currentPath'=(55 * min(1, node58path55) - currentPath*(min(1,node58path55) - 1))) & (success'=min(1, node58path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path56 * min(1,node58path56) - currentNode*(min(1, node58path56) - 1))) &  (currentPath'=(56 * min(1, node58path56) - currentPath*(min(1,node58path56) - 1))) & (success'=min(1, node58path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path57 * min(1,node58path57) - currentNode*(min(1, node58path57) - 1))) &  (currentPath'=(57 * min(1, node58path57) - currentPath*(min(1,node58path57) - 1))) & (success'=min(1, node58path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path58 * min(1,node58path58) - currentNode*(min(1, node58path58) - 1))) &  (currentPath'=(58 * min(1, node58path58) - currentPath*(min(1,node58path58) - 1))) & (success'=min(1, node58path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path59 * min(1,node58path59) - currentNode*(min(1, node58path59) - 1))) &  (currentPath'=(59 * min(1, node58path59) - currentPath*(min(1,node58path59) - 1))) & (success'=min(1, node58path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path60 * min(1,node58path60) - currentNode*(min(1, node58path60) - 1))) &  (currentPath'=(60 * min(1, node58path60) - currentPath*(min(1,node58path60) - 1))) & (success'=min(1, node58path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path61 * min(1,node58path61) - currentNode*(min(1, node58path61) - 1))) &  (currentPath'=(61 * min(1, node58path61) - currentPath*(min(1,node58path61) - 1))) & (success'=min(1, node58path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path62 * min(1,node58path62) - currentNode*(min(1, node58path62) - 1))) &  (currentPath'=(62 * min(1, node58path62) - currentPath*(min(1,node58path62) - 1))) & (success'=min(1, node58path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path63 * min(1,node58path63) - currentNode*(min(1, node58path63) - 1))) &  (currentPath'=(63 * min(1, node58path63) - currentPath*(min(1,node58path63) - 1))) & (success'=min(1, node58path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path64 * min(1,node58path64) - currentNode*(min(1, node58path64) - 1))) &  (currentPath'=(64 * min(1, node58path64) - currentPath*(min(1,node58path64) - 1))) & (success'=min(1, node58path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path65 * min(1,node58path65) - currentNode*(min(1, node58path65) - 1))) &  (currentPath'=(65 * min(1, node58path65) - currentPath*(min(1,node58path65) - 1))) & (success'=min(1, node58path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path66 * min(1,node58path66) - currentNode*(min(1, node58path66) - 1))) &  (currentPath'=(66 * min(1, node58path66) - currentPath*(min(1,node58path66) - 1))) & (success'=min(1, node58path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path67 * min(1,node58path67) - currentNode*(min(1, node58path67) - 1))) &  (currentPath'=(67 * min(1, node58path67) - currentPath*(min(1,node58path67) - 1))) & (success'=min(1, node58path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path68 * min(1,node58path68) - currentNode*(min(1, node58path68) - 1))) &  (currentPath'=(68 * min(1, node58path68) - currentPath*(min(1,node58path68) - 1))) & (success'=min(1, node58path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path69 * min(1,node58path69) - currentNode*(min(1, node58path69) - 1))) &  (currentPath'=(69 * min(1, node58path69) - currentPath*(min(1,node58path69) - 1))) & (success'=min(1, node58path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path70 * min(1,node58path70) - currentNode*(min(1, node58path70) - 1))) &  (currentPath'=(70 * min(1, node58path70) - currentPath*(min(1,node58path70) - 1))) & (success'=min(1, node58path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path71 * min(1,node58path71) - currentNode*(min(1, node58path71) - 1))) &  (currentPath'=(71 * min(1, node58path71) - currentPath*(min(1,node58path71) - 1))) & (success'=min(1, node58path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path72 * min(1,node58path72) - currentNode*(min(1, node58path72) - 1))) &  (currentPath'=(72 * min(1, node58path72) - currentPath*(min(1,node58path72) - 1))) & (success'=min(1, node58path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path73 * min(1,node58path73) - currentNode*(min(1, node58path73) - 1))) &  (currentPath'=(73 * min(1, node58path73) - currentPath*(min(1,node58path73) - 1))) & (success'=min(1, node58path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path74 * min(1,node58path74) - currentNode*(min(1, node58path74) - 1))) &  (currentPath'=(74 * min(1, node58path74) - currentPath*(min(1,node58path74) - 1))) & (success'=min(1, node58path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path75 * min(1,node58path75) - currentNode*(min(1, node58path75) - 1))) &  (currentPath'=(75 * min(1, node58path75) - currentPath*(min(1,node58path75) - 1))) & (success'=min(1, node58path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path76 * min(1,node58path76) - currentNode*(min(1, node58path76) - 1))) &  (currentPath'=(76 * min(1, node58path76) - currentPath*(min(1,node58path76) - 1))) & (success'=min(1, node58path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path77 * min(1,node58path77) - currentNode*(min(1, node58path77) - 1))) &  (currentPath'=(77 * min(1, node58path77) - currentPath*(min(1,node58path77) - 1))) & (success'=min(1, node58path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path78 * min(1,node58path78) - currentNode*(min(1, node58path78) - 1))) &  (currentPath'=(78 * min(1, node58path78) - currentPath*(min(1,node58path78) - 1))) & (success'=min(1, node58path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path79 * min(1,node58path79) - currentNode*(min(1, node58path79) - 1))) &  (currentPath'=(79 * min(1, node58path79) - currentPath*(min(1,node58path79) - 1))) & (success'=min(1, node58path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path80 * min(1,node58path80) - currentNode*(min(1, node58path80) - 1))) &  (currentPath'=(80 * min(1, node58path80) - currentPath*(min(1,node58path80) - 1))) & (success'=min(1, node58path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path81 * min(1,node58path81) - currentNode*(min(1, node58path81) - 1))) &  (currentPath'=(81 * min(1, node58path81) - currentPath*(min(1,node58path81) - 1))) & (success'=min(1, node58path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path82 * min(1,node58path82) - currentNode*(min(1, node58path82) - 1))) &  (currentPath'=(82 * min(1, node58path82) - currentPath*(min(1,node58path82) - 1))) & (success'=min(1, node58path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path83 * min(1,node58path83) - currentNode*(min(1, node58path83) - 1))) &  (currentPath'=(83 * min(1, node58path83) - currentPath*(min(1,node58path83) - 1))) & (success'=min(1, node58path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path84 * min(1,node58path84) - currentNode*(min(1, node58path84) - 1))) &  (currentPath'=(84 * min(1, node58path84) - currentPath*(min(1,node58path84) - 1))) & (success'=min(1, node58path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path85 * min(1,node58path85) - currentNode*(min(1, node58path85) - 1))) &  (currentPath'=(85 * min(1, node58path85) - currentPath*(min(1,node58path85) - 1))) & (success'=min(1, node58path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path86 * min(1,node58path86) - currentNode*(min(1, node58path86) - 1))) &  (currentPath'=(86 * min(1, node58path86) - currentPath*(min(1,node58path86) - 1))) & (success'=min(1, node58path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path87 * min(1,node58path87) - currentNode*(min(1, node58path87) - 1))) &  (currentPath'=(87 * min(1, node58path87) - currentPath*(min(1,node58path87) - 1))) & (success'=min(1, node58path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path88 * min(1,node58path88) - currentNode*(min(1, node58path88) - 1))) &  (currentPath'=(88 * min(1, node58path88) - currentPath*(min(1,node58path88) - 1))) & (success'=min(1, node58path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path89 * min(1,node58path89) - currentNode*(min(1, node58path89) - 1))) &  (currentPath'=(89 * min(1, node58path89) - currentPath*(min(1,node58path89) - 1))) & (success'=min(1, node58path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path90 * min(1,node58path90) - currentNode*(min(1, node58path90) - 1))) &  (currentPath'=(90 * min(1, node58path90) - currentPath*(min(1,node58path90) - 1))) & (success'=min(1, node58path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path91 * min(1,node58path91) - currentNode*(min(1, node58path91) - 1))) &  (currentPath'=(91 * min(1, node58path91) - currentPath*(min(1,node58path91) - 1))) & (success'=min(1, node58path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path92 * min(1,node58path92) - currentNode*(min(1, node58path92) - 1))) &  (currentPath'=(92 * min(1, node58path92) - currentPath*(min(1,node58path92) - 1))) & (success'=min(1, node58path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path93 * min(1,node58path93) - currentNode*(min(1, node58path93) - 1))) &  (currentPath'=(93 * min(1, node58path93) - currentPath*(min(1,node58path93) - 1))) & (success'=min(1, node58path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path94 * min(1,node58path94) - currentNode*(min(1, node58path94) - 1))) &  (currentPath'=(94 * min(1, node58path94) - currentPath*(min(1,node58path94) - 1))) & (success'=min(1, node58path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path95 * min(1,node58path95) - currentNode*(min(1, node58path95) - 1))) &  (currentPath'=(95 * min(1, node58path95) - currentPath*(min(1,node58path95) - 1))) & (success'=min(1, node58path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path96 * min(1,node58path96) - currentNode*(min(1, node58path96) - 1))) &  (currentPath'=(96 * min(1, node58path96) - currentPath*(min(1,node58path96) - 1))) & (success'=min(1, node58path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path97 * min(1,node58path97) - currentNode*(min(1, node58path97) - 1))) &  (currentPath'=(97 * min(1, node58path97) - currentPath*(min(1,node58path97) - 1))) & (success'=min(1, node58path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path98 * min(1,node58path98) - currentNode*(min(1, node58path98) - 1))) &  (currentPath'=(98 * min(1, node58path98) - currentPath*(min(1,node58path98) - 1))) & (success'=min(1, node58path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path99 * min(1,node58path99) - currentNode*(min(1, node58path99) - 1))) &  (currentPath'=(99 * min(1, node58path99) - currentPath*(min(1,node58path99) - 1))) & (success'=min(1, node58path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node58path100 * min(1,node58path100) - currentNode*(min(1, node58path100) - 1))) &  (currentPath'=(100 * min(1, node58path100) - currentPath*(min(1,node58path100) - 1))) & (success'=min(1, node58path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 59) ->
 numPathsInv: (currentNode'=(node59path1 * min(1,node59path1) - currentNode*(min(1, node59path1) - 1))) &  (currentPath'=(1 * min(1, node59path1) - currentPath*(min(1,node59path1) - 1))) & (success'=min(1, node59path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path2 * min(1,node59path2) - currentNode*(min(1, node59path2) - 1))) &  (currentPath'=(2 * min(1, node59path2) - currentPath*(min(1,node59path2) - 1))) & (success'=min(1, node59path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path3 * min(1,node59path3) - currentNode*(min(1, node59path3) - 1))) &  (currentPath'=(3 * min(1, node59path3) - currentPath*(min(1,node59path3) - 1))) & (success'=min(1, node59path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path4 * min(1,node59path4) - currentNode*(min(1, node59path4) - 1))) &  (currentPath'=(4 * min(1, node59path4) - currentPath*(min(1,node59path4) - 1))) & (success'=min(1, node59path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path5 * min(1,node59path5) - currentNode*(min(1, node59path5) - 1))) &  (currentPath'=(5 * min(1, node59path5) - currentPath*(min(1,node59path5) - 1))) & (success'=min(1, node59path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path6 * min(1,node59path6) - currentNode*(min(1, node59path6) - 1))) &  (currentPath'=(6 * min(1, node59path6) - currentPath*(min(1,node59path6) - 1))) & (success'=min(1, node59path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path7 * min(1,node59path7) - currentNode*(min(1, node59path7) - 1))) &  (currentPath'=(7 * min(1, node59path7) - currentPath*(min(1,node59path7) - 1))) & (success'=min(1, node59path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path8 * min(1,node59path8) - currentNode*(min(1, node59path8) - 1))) &  (currentPath'=(8 * min(1, node59path8) - currentPath*(min(1,node59path8) - 1))) & (success'=min(1, node59path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path9 * min(1,node59path9) - currentNode*(min(1, node59path9) - 1))) &  (currentPath'=(9 * min(1, node59path9) - currentPath*(min(1,node59path9) - 1))) & (success'=min(1, node59path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path10 * min(1,node59path10) - currentNode*(min(1, node59path10) - 1))) &  (currentPath'=(10 * min(1, node59path10) - currentPath*(min(1,node59path10) - 1))) & (success'=min(1, node59path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path11 * min(1,node59path11) - currentNode*(min(1, node59path11) - 1))) &  (currentPath'=(11 * min(1, node59path11) - currentPath*(min(1,node59path11) - 1))) & (success'=min(1, node59path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path12 * min(1,node59path12) - currentNode*(min(1, node59path12) - 1))) &  (currentPath'=(12 * min(1, node59path12) - currentPath*(min(1,node59path12) - 1))) & (success'=min(1, node59path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path13 * min(1,node59path13) - currentNode*(min(1, node59path13) - 1))) &  (currentPath'=(13 * min(1, node59path13) - currentPath*(min(1,node59path13) - 1))) & (success'=min(1, node59path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path14 * min(1,node59path14) - currentNode*(min(1, node59path14) - 1))) &  (currentPath'=(14 * min(1, node59path14) - currentPath*(min(1,node59path14) - 1))) & (success'=min(1, node59path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path15 * min(1,node59path15) - currentNode*(min(1, node59path15) - 1))) &  (currentPath'=(15 * min(1, node59path15) - currentPath*(min(1,node59path15) - 1))) & (success'=min(1, node59path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path16 * min(1,node59path16) - currentNode*(min(1, node59path16) - 1))) &  (currentPath'=(16 * min(1, node59path16) - currentPath*(min(1,node59path16) - 1))) & (success'=min(1, node59path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path17 * min(1,node59path17) - currentNode*(min(1, node59path17) - 1))) &  (currentPath'=(17 * min(1, node59path17) - currentPath*(min(1,node59path17) - 1))) & (success'=min(1, node59path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path18 * min(1,node59path18) - currentNode*(min(1, node59path18) - 1))) &  (currentPath'=(18 * min(1, node59path18) - currentPath*(min(1,node59path18) - 1))) & (success'=min(1, node59path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path19 * min(1,node59path19) - currentNode*(min(1, node59path19) - 1))) &  (currentPath'=(19 * min(1, node59path19) - currentPath*(min(1,node59path19) - 1))) & (success'=min(1, node59path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path20 * min(1,node59path20) - currentNode*(min(1, node59path20) - 1))) &  (currentPath'=(20 * min(1, node59path20) - currentPath*(min(1,node59path20) - 1))) & (success'=min(1, node59path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path21 * min(1,node59path21) - currentNode*(min(1, node59path21) - 1))) &  (currentPath'=(21 * min(1, node59path21) - currentPath*(min(1,node59path21) - 1))) & (success'=min(1, node59path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path22 * min(1,node59path22) - currentNode*(min(1, node59path22) - 1))) &  (currentPath'=(22 * min(1, node59path22) - currentPath*(min(1,node59path22) - 1))) & (success'=min(1, node59path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path23 * min(1,node59path23) - currentNode*(min(1, node59path23) - 1))) &  (currentPath'=(23 * min(1, node59path23) - currentPath*(min(1,node59path23) - 1))) & (success'=min(1, node59path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path24 * min(1,node59path24) - currentNode*(min(1, node59path24) - 1))) &  (currentPath'=(24 * min(1, node59path24) - currentPath*(min(1,node59path24) - 1))) & (success'=min(1, node59path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path25 * min(1,node59path25) - currentNode*(min(1, node59path25) - 1))) &  (currentPath'=(25 * min(1, node59path25) - currentPath*(min(1,node59path25) - 1))) & (success'=min(1, node59path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path26 * min(1,node59path26) - currentNode*(min(1, node59path26) - 1))) &  (currentPath'=(26 * min(1, node59path26) - currentPath*(min(1,node59path26) - 1))) & (success'=min(1, node59path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path27 * min(1,node59path27) - currentNode*(min(1, node59path27) - 1))) &  (currentPath'=(27 * min(1, node59path27) - currentPath*(min(1,node59path27) - 1))) & (success'=min(1, node59path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path28 * min(1,node59path28) - currentNode*(min(1, node59path28) - 1))) &  (currentPath'=(28 * min(1, node59path28) - currentPath*(min(1,node59path28) - 1))) & (success'=min(1, node59path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path29 * min(1,node59path29) - currentNode*(min(1, node59path29) - 1))) &  (currentPath'=(29 * min(1, node59path29) - currentPath*(min(1,node59path29) - 1))) & (success'=min(1, node59path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path30 * min(1,node59path30) - currentNode*(min(1, node59path30) - 1))) &  (currentPath'=(30 * min(1, node59path30) - currentPath*(min(1,node59path30) - 1))) & (success'=min(1, node59path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path31 * min(1,node59path31) - currentNode*(min(1, node59path31) - 1))) &  (currentPath'=(31 * min(1, node59path31) - currentPath*(min(1,node59path31) - 1))) & (success'=min(1, node59path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path32 * min(1,node59path32) - currentNode*(min(1, node59path32) - 1))) &  (currentPath'=(32 * min(1, node59path32) - currentPath*(min(1,node59path32) - 1))) & (success'=min(1, node59path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path33 * min(1,node59path33) - currentNode*(min(1, node59path33) - 1))) &  (currentPath'=(33 * min(1, node59path33) - currentPath*(min(1,node59path33) - 1))) & (success'=min(1, node59path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path34 * min(1,node59path34) - currentNode*(min(1, node59path34) - 1))) &  (currentPath'=(34 * min(1, node59path34) - currentPath*(min(1,node59path34) - 1))) & (success'=min(1, node59path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path35 * min(1,node59path35) - currentNode*(min(1, node59path35) - 1))) &  (currentPath'=(35 * min(1, node59path35) - currentPath*(min(1,node59path35) - 1))) & (success'=min(1, node59path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path36 * min(1,node59path36) - currentNode*(min(1, node59path36) - 1))) &  (currentPath'=(36 * min(1, node59path36) - currentPath*(min(1,node59path36) - 1))) & (success'=min(1, node59path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path37 * min(1,node59path37) - currentNode*(min(1, node59path37) - 1))) &  (currentPath'=(37 * min(1, node59path37) - currentPath*(min(1,node59path37) - 1))) & (success'=min(1, node59path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path38 * min(1,node59path38) - currentNode*(min(1, node59path38) - 1))) &  (currentPath'=(38 * min(1, node59path38) - currentPath*(min(1,node59path38) - 1))) & (success'=min(1, node59path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path39 * min(1,node59path39) - currentNode*(min(1, node59path39) - 1))) &  (currentPath'=(39 * min(1, node59path39) - currentPath*(min(1,node59path39) - 1))) & (success'=min(1, node59path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path40 * min(1,node59path40) - currentNode*(min(1, node59path40) - 1))) &  (currentPath'=(40 * min(1, node59path40) - currentPath*(min(1,node59path40) - 1))) & (success'=min(1, node59path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path41 * min(1,node59path41) - currentNode*(min(1, node59path41) - 1))) &  (currentPath'=(41 * min(1, node59path41) - currentPath*(min(1,node59path41) - 1))) & (success'=min(1, node59path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path42 * min(1,node59path42) - currentNode*(min(1, node59path42) - 1))) &  (currentPath'=(42 * min(1, node59path42) - currentPath*(min(1,node59path42) - 1))) & (success'=min(1, node59path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path43 * min(1,node59path43) - currentNode*(min(1, node59path43) - 1))) &  (currentPath'=(43 * min(1, node59path43) - currentPath*(min(1,node59path43) - 1))) & (success'=min(1, node59path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path44 * min(1,node59path44) - currentNode*(min(1, node59path44) - 1))) &  (currentPath'=(44 * min(1, node59path44) - currentPath*(min(1,node59path44) - 1))) & (success'=min(1, node59path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path45 * min(1,node59path45) - currentNode*(min(1, node59path45) - 1))) &  (currentPath'=(45 * min(1, node59path45) - currentPath*(min(1,node59path45) - 1))) & (success'=min(1, node59path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path46 * min(1,node59path46) - currentNode*(min(1, node59path46) - 1))) &  (currentPath'=(46 * min(1, node59path46) - currentPath*(min(1,node59path46) - 1))) & (success'=min(1, node59path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path47 * min(1,node59path47) - currentNode*(min(1, node59path47) - 1))) &  (currentPath'=(47 * min(1, node59path47) - currentPath*(min(1,node59path47) - 1))) & (success'=min(1, node59path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path48 * min(1,node59path48) - currentNode*(min(1, node59path48) - 1))) &  (currentPath'=(48 * min(1, node59path48) - currentPath*(min(1,node59path48) - 1))) & (success'=min(1, node59path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path49 * min(1,node59path49) - currentNode*(min(1, node59path49) - 1))) &  (currentPath'=(49 * min(1, node59path49) - currentPath*(min(1,node59path49) - 1))) & (success'=min(1, node59path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path50 * min(1,node59path50) - currentNode*(min(1, node59path50) - 1))) &  (currentPath'=(50 * min(1, node59path50) - currentPath*(min(1,node59path50) - 1))) & (success'=min(1, node59path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path51 * min(1,node59path51) - currentNode*(min(1, node59path51) - 1))) &  (currentPath'=(51 * min(1, node59path51) - currentPath*(min(1,node59path51) - 1))) & (success'=min(1, node59path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path52 * min(1,node59path52) - currentNode*(min(1, node59path52) - 1))) &  (currentPath'=(52 * min(1, node59path52) - currentPath*(min(1,node59path52) - 1))) & (success'=min(1, node59path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path53 * min(1,node59path53) - currentNode*(min(1, node59path53) - 1))) &  (currentPath'=(53 * min(1, node59path53) - currentPath*(min(1,node59path53) - 1))) & (success'=min(1, node59path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path54 * min(1,node59path54) - currentNode*(min(1, node59path54) - 1))) &  (currentPath'=(54 * min(1, node59path54) - currentPath*(min(1,node59path54) - 1))) & (success'=min(1, node59path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path55 * min(1,node59path55) - currentNode*(min(1, node59path55) - 1))) &  (currentPath'=(55 * min(1, node59path55) - currentPath*(min(1,node59path55) - 1))) & (success'=min(1, node59path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path56 * min(1,node59path56) - currentNode*(min(1, node59path56) - 1))) &  (currentPath'=(56 * min(1, node59path56) - currentPath*(min(1,node59path56) - 1))) & (success'=min(1, node59path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path57 * min(1,node59path57) - currentNode*(min(1, node59path57) - 1))) &  (currentPath'=(57 * min(1, node59path57) - currentPath*(min(1,node59path57) - 1))) & (success'=min(1, node59path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path58 * min(1,node59path58) - currentNode*(min(1, node59path58) - 1))) &  (currentPath'=(58 * min(1, node59path58) - currentPath*(min(1,node59path58) - 1))) & (success'=min(1, node59path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path59 * min(1,node59path59) - currentNode*(min(1, node59path59) - 1))) &  (currentPath'=(59 * min(1, node59path59) - currentPath*(min(1,node59path59) - 1))) & (success'=min(1, node59path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path60 * min(1,node59path60) - currentNode*(min(1, node59path60) - 1))) &  (currentPath'=(60 * min(1, node59path60) - currentPath*(min(1,node59path60) - 1))) & (success'=min(1, node59path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path61 * min(1,node59path61) - currentNode*(min(1, node59path61) - 1))) &  (currentPath'=(61 * min(1, node59path61) - currentPath*(min(1,node59path61) - 1))) & (success'=min(1, node59path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path62 * min(1,node59path62) - currentNode*(min(1, node59path62) - 1))) &  (currentPath'=(62 * min(1, node59path62) - currentPath*(min(1,node59path62) - 1))) & (success'=min(1, node59path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path63 * min(1,node59path63) - currentNode*(min(1, node59path63) - 1))) &  (currentPath'=(63 * min(1, node59path63) - currentPath*(min(1,node59path63) - 1))) & (success'=min(1, node59path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path64 * min(1,node59path64) - currentNode*(min(1, node59path64) - 1))) &  (currentPath'=(64 * min(1, node59path64) - currentPath*(min(1,node59path64) - 1))) & (success'=min(1, node59path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path65 * min(1,node59path65) - currentNode*(min(1, node59path65) - 1))) &  (currentPath'=(65 * min(1, node59path65) - currentPath*(min(1,node59path65) - 1))) & (success'=min(1, node59path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path66 * min(1,node59path66) - currentNode*(min(1, node59path66) - 1))) &  (currentPath'=(66 * min(1, node59path66) - currentPath*(min(1,node59path66) - 1))) & (success'=min(1, node59path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path67 * min(1,node59path67) - currentNode*(min(1, node59path67) - 1))) &  (currentPath'=(67 * min(1, node59path67) - currentPath*(min(1,node59path67) - 1))) & (success'=min(1, node59path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path68 * min(1,node59path68) - currentNode*(min(1, node59path68) - 1))) &  (currentPath'=(68 * min(1, node59path68) - currentPath*(min(1,node59path68) - 1))) & (success'=min(1, node59path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path69 * min(1,node59path69) - currentNode*(min(1, node59path69) - 1))) &  (currentPath'=(69 * min(1, node59path69) - currentPath*(min(1,node59path69) - 1))) & (success'=min(1, node59path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path70 * min(1,node59path70) - currentNode*(min(1, node59path70) - 1))) &  (currentPath'=(70 * min(1, node59path70) - currentPath*(min(1,node59path70) - 1))) & (success'=min(1, node59path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path71 * min(1,node59path71) - currentNode*(min(1, node59path71) - 1))) &  (currentPath'=(71 * min(1, node59path71) - currentPath*(min(1,node59path71) - 1))) & (success'=min(1, node59path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path72 * min(1,node59path72) - currentNode*(min(1, node59path72) - 1))) &  (currentPath'=(72 * min(1, node59path72) - currentPath*(min(1,node59path72) - 1))) & (success'=min(1, node59path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path73 * min(1,node59path73) - currentNode*(min(1, node59path73) - 1))) &  (currentPath'=(73 * min(1, node59path73) - currentPath*(min(1,node59path73) - 1))) & (success'=min(1, node59path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path74 * min(1,node59path74) - currentNode*(min(1, node59path74) - 1))) &  (currentPath'=(74 * min(1, node59path74) - currentPath*(min(1,node59path74) - 1))) & (success'=min(1, node59path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path75 * min(1,node59path75) - currentNode*(min(1, node59path75) - 1))) &  (currentPath'=(75 * min(1, node59path75) - currentPath*(min(1,node59path75) - 1))) & (success'=min(1, node59path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path76 * min(1,node59path76) - currentNode*(min(1, node59path76) - 1))) &  (currentPath'=(76 * min(1, node59path76) - currentPath*(min(1,node59path76) - 1))) & (success'=min(1, node59path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path77 * min(1,node59path77) - currentNode*(min(1, node59path77) - 1))) &  (currentPath'=(77 * min(1, node59path77) - currentPath*(min(1,node59path77) - 1))) & (success'=min(1, node59path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path78 * min(1,node59path78) - currentNode*(min(1, node59path78) - 1))) &  (currentPath'=(78 * min(1, node59path78) - currentPath*(min(1,node59path78) - 1))) & (success'=min(1, node59path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path79 * min(1,node59path79) - currentNode*(min(1, node59path79) - 1))) &  (currentPath'=(79 * min(1, node59path79) - currentPath*(min(1,node59path79) - 1))) & (success'=min(1, node59path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path80 * min(1,node59path80) - currentNode*(min(1, node59path80) - 1))) &  (currentPath'=(80 * min(1, node59path80) - currentPath*(min(1,node59path80) - 1))) & (success'=min(1, node59path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path81 * min(1,node59path81) - currentNode*(min(1, node59path81) - 1))) &  (currentPath'=(81 * min(1, node59path81) - currentPath*(min(1,node59path81) - 1))) & (success'=min(1, node59path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path82 * min(1,node59path82) - currentNode*(min(1, node59path82) - 1))) &  (currentPath'=(82 * min(1, node59path82) - currentPath*(min(1,node59path82) - 1))) & (success'=min(1, node59path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path83 * min(1,node59path83) - currentNode*(min(1, node59path83) - 1))) &  (currentPath'=(83 * min(1, node59path83) - currentPath*(min(1,node59path83) - 1))) & (success'=min(1, node59path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path84 * min(1,node59path84) - currentNode*(min(1, node59path84) - 1))) &  (currentPath'=(84 * min(1, node59path84) - currentPath*(min(1,node59path84) - 1))) & (success'=min(1, node59path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path85 * min(1,node59path85) - currentNode*(min(1, node59path85) - 1))) &  (currentPath'=(85 * min(1, node59path85) - currentPath*(min(1,node59path85) - 1))) & (success'=min(1, node59path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path86 * min(1,node59path86) - currentNode*(min(1, node59path86) - 1))) &  (currentPath'=(86 * min(1, node59path86) - currentPath*(min(1,node59path86) - 1))) & (success'=min(1, node59path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path87 * min(1,node59path87) - currentNode*(min(1, node59path87) - 1))) &  (currentPath'=(87 * min(1, node59path87) - currentPath*(min(1,node59path87) - 1))) & (success'=min(1, node59path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path88 * min(1,node59path88) - currentNode*(min(1, node59path88) - 1))) &  (currentPath'=(88 * min(1, node59path88) - currentPath*(min(1,node59path88) - 1))) & (success'=min(1, node59path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path89 * min(1,node59path89) - currentNode*(min(1, node59path89) - 1))) &  (currentPath'=(89 * min(1, node59path89) - currentPath*(min(1,node59path89) - 1))) & (success'=min(1, node59path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path90 * min(1,node59path90) - currentNode*(min(1, node59path90) - 1))) &  (currentPath'=(90 * min(1, node59path90) - currentPath*(min(1,node59path90) - 1))) & (success'=min(1, node59path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path91 * min(1,node59path91) - currentNode*(min(1, node59path91) - 1))) &  (currentPath'=(91 * min(1, node59path91) - currentPath*(min(1,node59path91) - 1))) & (success'=min(1, node59path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path92 * min(1,node59path92) - currentNode*(min(1, node59path92) - 1))) &  (currentPath'=(92 * min(1, node59path92) - currentPath*(min(1,node59path92) - 1))) & (success'=min(1, node59path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path93 * min(1,node59path93) - currentNode*(min(1, node59path93) - 1))) &  (currentPath'=(93 * min(1, node59path93) - currentPath*(min(1,node59path93) - 1))) & (success'=min(1, node59path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path94 * min(1,node59path94) - currentNode*(min(1, node59path94) - 1))) &  (currentPath'=(94 * min(1, node59path94) - currentPath*(min(1,node59path94) - 1))) & (success'=min(1, node59path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path95 * min(1,node59path95) - currentNode*(min(1, node59path95) - 1))) &  (currentPath'=(95 * min(1, node59path95) - currentPath*(min(1,node59path95) - 1))) & (success'=min(1, node59path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path96 * min(1,node59path96) - currentNode*(min(1, node59path96) - 1))) &  (currentPath'=(96 * min(1, node59path96) - currentPath*(min(1,node59path96) - 1))) & (success'=min(1, node59path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path97 * min(1,node59path97) - currentNode*(min(1, node59path97) - 1))) &  (currentPath'=(97 * min(1, node59path97) - currentPath*(min(1,node59path97) - 1))) & (success'=min(1, node59path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path98 * min(1,node59path98) - currentNode*(min(1, node59path98) - 1))) &  (currentPath'=(98 * min(1, node59path98) - currentPath*(min(1,node59path98) - 1))) & (success'=min(1, node59path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path99 * min(1,node59path99) - currentNode*(min(1, node59path99) - 1))) &  (currentPath'=(99 * min(1, node59path99) - currentPath*(min(1,node59path99) - 1))) & (success'=min(1, node59path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node59path100 * min(1,node59path100) - currentNode*(min(1, node59path100) - 1))) &  (currentPath'=(100 * min(1, node59path100) - currentPath*(min(1,node59path100) - 1))) & (success'=min(1, node59path100)) & (checkNode'=true) & (good'=false);
[] good & (currentNode = 60) ->
 numPathsInv: (currentNode'=(node60path1 * min(1,node60path1) - currentNode*(min(1, node60path1) - 1))) &  (currentPath'=(1 * min(1, node60path1) - currentPath*(min(1,node60path1) - 1))) & (success'=min(1, node60path1)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path2 * min(1,node60path2) - currentNode*(min(1, node60path2) - 1))) &  (currentPath'=(2 * min(1, node60path2) - currentPath*(min(1,node60path2) - 1))) & (success'=min(1, node60path2)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path3 * min(1,node60path3) - currentNode*(min(1, node60path3) - 1))) &  (currentPath'=(3 * min(1, node60path3) - currentPath*(min(1,node60path3) - 1))) & (success'=min(1, node60path3)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path4 * min(1,node60path4) - currentNode*(min(1, node60path4) - 1))) &  (currentPath'=(4 * min(1, node60path4) - currentPath*(min(1,node60path4) - 1))) & (success'=min(1, node60path4)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path5 * min(1,node60path5) - currentNode*(min(1, node60path5) - 1))) &  (currentPath'=(5 * min(1, node60path5) - currentPath*(min(1,node60path5) - 1))) & (success'=min(1, node60path5)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path6 * min(1,node60path6) - currentNode*(min(1, node60path6) - 1))) &  (currentPath'=(6 * min(1, node60path6) - currentPath*(min(1,node60path6) - 1))) & (success'=min(1, node60path6)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path7 * min(1,node60path7) - currentNode*(min(1, node60path7) - 1))) &  (currentPath'=(7 * min(1, node60path7) - currentPath*(min(1,node60path7) - 1))) & (success'=min(1, node60path7)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path8 * min(1,node60path8) - currentNode*(min(1, node60path8) - 1))) &  (currentPath'=(8 * min(1, node60path8) - currentPath*(min(1,node60path8) - 1))) & (success'=min(1, node60path8)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path9 * min(1,node60path9) - currentNode*(min(1, node60path9) - 1))) &  (currentPath'=(9 * min(1, node60path9) - currentPath*(min(1,node60path9) - 1))) & (success'=min(1, node60path9)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path10 * min(1,node60path10) - currentNode*(min(1, node60path10) - 1))) &  (currentPath'=(10 * min(1, node60path10) - currentPath*(min(1,node60path10) - 1))) & (success'=min(1, node60path10)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path11 * min(1,node60path11) - currentNode*(min(1, node60path11) - 1))) &  (currentPath'=(11 * min(1, node60path11) - currentPath*(min(1,node60path11) - 1))) & (success'=min(1, node60path11)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path12 * min(1,node60path12) - currentNode*(min(1, node60path12) - 1))) &  (currentPath'=(12 * min(1, node60path12) - currentPath*(min(1,node60path12) - 1))) & (success'=min(1, node60path12)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path13 * min(1,node60path13) - currentNode*(min(1, node60path13) - 1))) &  (currentPath'=(13 * min(1, node60path13) - currentPath*(min(1,node60path13) - 1))) & (success'=min(1, node60path13)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path14 * min(1,node60path14) - currentNode*(min(1, node60path14) - 1))) &  (currentPath'=(14 * min(1, node60path14) - currentPath*(min(1,node60path14) - 1))) & (success'=min(1, node60path14)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path15 * min(1,node60path15) - currentNode*(min(1, node60path15) - 1))) &  (currentPath'=(15 * min(1, node60path15) - currentPath*(min(1,node60path15) - 1))) & (success'=min(1, node60path15)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path16 * min(1,node60path16) - currentNode*(min(1, node60path16) - 1))) &  (currentPath'=(16 * min(1, node60path16) - currentPath*(min(1,node60path16) - 1))) & (success'=min(1, node60path16)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path17 * min(1,node60path17) - currentNode*(min(1, node60path17) - 1))) &  (currentPath'=(17 * min(1, node60path17) - currentPath*(min(1,node60path17) - 1))) & (success'=min(1, node60path17)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path18 * min(1,node60path18) - currentNode*(min(1, node60path18) - 1))) &  (currentPath'=(18 * min(1, node60path18) - currentPath*(min(1,node60path18) - 1))) & (success'=min(1, node60path18)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path19 * min(1,node60path19) - currentNode*(min(1, node60path19) - 1))) &  (currentPath'=(19 * min(1, node60path19) - currentPath*(min(1,node60path19) - 1))) & (success'=min(1, node60path19)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path20 * min(1,node60path20) - currentNode*(min(1, node60path20) - 1))) &  (currentPath'=(20 * min(1, node60path20) - currentPath*(min(1,node60path20) - 1))) & (success'=min(1, node60path20)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path21 * min(1,node60path21) - currentNode*(min(1, node60path21) - 1))) &  (currentPath'=(21 * min(1, node60path21) - currentPath*(min(1,node60path21) - 1))) & (success'=min(1, node60path21)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path22 * min(1,node60path22) - currentNode*(min(1, node60path22) - 1))) &  (currentPath'=(22 * min(1, node60path22) - currentPath*(min(1,node60path22) - 1))) & (success'=min(1, node60path22)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path23 * min(1,node60path23) - currentNode*(min(1, node60path23) - 1))) &  (currentPath'=(23 * min(1, node60path23) - currentPath*(min(1,node60path23) - 1))) & (success'=min(1, node60path23)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path24 * min(1,node60path24) - currentNode*(min(1, node60path24) - 1))) &  (currentPath'=(24 * min(1, node60path24) - currentPath*(min(1,node60path24) - 1))) & (success'=min(1, node60path24)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path25 * min(1,node60path25) - currentNode*(min(1, node60path25) - 1))) &  (currentPath'=(25 * min(1, node60path25) - currentPath*(min(1,node60path25) - 1))) & (success'=min(1, node60path25)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path26 * min(1,node60path26) - currentNode*(min(1, node60path26) - 1))) &  (currentPath'=(26 * min(1, node60path26) - currentPath*(min(1,node60path26) - 1))) & (success'=min(1, node60path26)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path27 * min(1,node60path27) - currentNode*(min(1, node60path27) - 1))) &  (currentPath'=(27 * min(1, node60path27) - currentPath*(min(1,node60path27) - 1))) & (success'=min(1, node60path27)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path28 * min(1,node60path28) - currentNode*(min(1, node60path28) - 1))) &  (currentPath'=(28 * min(1, node60path28) - currentPath*(min(1,node60path28) - 1))) & (success'=min(1, node60path28)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path29 * min(1,node60path29) - currentNode*(min(1, node60path29) - 1))) &  (currentPath'=(29 * min(1, node60path29) - currentPath*(min(1,node60path29) - 1))) & (success'=min(1, node60path29)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path30 * min(1,node60path30) - currentNode*(min(1, node60path30) - 1))) &  (currentPath'=(30 * min(1, node60path30) - currentPath*(min(1,node60path30) - 1))) & (success'=min(1, node60path30)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path31 * min(1,node60path31) - currentNode*(min(1, node60path31) - 1))) &  (currentPath'=(31 * min(1, node60path31) - currentPath*(min(1,node60path31) - 1))) & (success'=min(1, node60path31)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path32 * min(1,node60path32) - currentNode*(min(1, node60path32) - 1))) &  (currentPath'=(32 * min(1, node60path32) - currentPath*(min(1,node60path32) - 1))) & (success'=min(1, node60path32)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path33 * min(1,node60path33) - currentNode*(min(1, node60path33) - 1))) &  (currentPath'=(33 * min(1, node60path33) - currentPath*(min(1,node60path33) - 1))) & (success'=min(1, node60path33)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path34 * min(1,node60path34) - currentNode*(min(1, node60path34) - 1))) &  (currentPath'=(34 * min(1, node60path34) - currentPath*(min(1,node60path34) - 1))) & (success'=min(1, node60path34)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path35 * min(1,node60path35) - currentNode*(min(1, node60path35) - 1))) &  (currentPath'=(35 * min(1, node60path35) - currentPath*(min(1,node60path35) - 1))) & (success'=min(1, node60path35)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path36 * min(1,node60path36) - currentNode*(min(1, node60path36) - 1))) &  (currentPath'=(36 * min(1, node60path36) - currentPath*(min(1,node60path36) - 1))) & (success'=min(1, node60path36)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path37 * min(1,node60path37) - currentNode*(min(1, node60path37) - 1))) &  (currentPath'=(37 * min(1, node60path37) - currentPath*(min(1,node60path37) - 1))) & (success'=min(1, node60path37)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path38 * min(1,node60path38) - currentNode*(min(1, node60path38) - 1))) &  (currentPath'=(38 * min(1, node60path38) - currentPath*(min(1,node60path38) - 1))) & (success'=min(1, node60path38)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path39 * min(1,node60path39) - currentNode*(min(1, node60path39) - 1))) &  (currentPath'=(39 * min(1, node60path39) - currentPath*(min(1,node60path39) - 1))) & (success'=min(1, node60path39)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path40 * min(1,node60path40) - currentNode*(min(1, node60path40) - 1))) &  (currentPath'=(40 * min(1, node60path40) - currentPath*(min(1,node60path40) - 1))) & (success'=min(1, node60path40)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path41 * min(1,node60path41) - currentNode*(min(1, node60path41) - 1))) &  (currentPath'=(41 * min(1, node60path41) - currentPath*(min(1,node60path41) - 1))) & (success'=min(1, node60path41)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path42 * min(1,node60path42) - currentNode*(min(1, node60path42) - 1))) &  (currentPath'=(42 * min(1, node60path42) - currentPath*(min(1,node60path42) - 1))) & (success'=min(1, node60path42)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path43 * min(1,node60path43) - currentNode*(min(1, node60path43) - 1))) &  (currentPath'=(43 * min(1, node60path43) - currentPath*(min(1,node60path43) - 1))) & (success'=min(1, node60path43)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path44 * min(1,node60path44) - currentNode*(min(1, node60path44) - 1))) &  (currentPath'=(44 * min(1, node60path44) - currentPath*(min(1,node60path44) - 1))) & (success'=min(1, node60path44)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path45 * min(1,node60path45) - currentNode*(min(1, node60path45) - 1))) &  (currentPath'=(45 * min(1, node60path45) - currentPath*(min(1,node60path45) - 1))) & (success'=min(1, node60path45)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path46 * min(1,node60path46) - currentNode*(min(1, node60path46) - 1))) &  (currentPath'=(46 * min(1, node60path46) - currentPath*(min(1,node60path46) - 1))) & (success'=min(1, node60path46)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path47 * min(1,node60path47) - currentNode*(min(1, node60path47) - 1))) &  (currentPath'=(47 * min(1, node60path47) - currentPath*(min(1,node60path47) - 1))) & (success'=min(1, node60path47)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path48 * min(1,node60path48) - currentNode*(min(1, node60path48) - 1))) &  (currentPath'=(48 * min(1, node60path48) - currentPath*(min(1,node60path48) - 1))) & (success'=min(1, node60path48)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path49 * min(1,node60path49) - currentNode*(min(1, node60path49) - 1))) &  (currentPath'=(49 * min(1, node60path49) - currentPath*(min(1,node60path49) - 1))) & (success'=min(1, node60path49)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path50 * min(1,node60path50) - currentNode*(min(1, node60path50) - 1))) &  (currentPath'=(50 * min(1, node60path50) - currentPath*(min(1,node60path50) - 1))) & (success'=min(1, node60path50)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path51 * min(1,node60path51) - currentNode*(min(1, node60path51) - 1))) &  (currentPath'=(51 * min(1, node60path51) - currentPath*(min(1,node60path51) - 1))) & (success'=min(1, node60path51)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path52 * min(1,node60path52) - currentNode*(min(1, node60path52) - 1))) &  (currentPath'=(52 * min(1, node60path52) - currentPath*(min(1,node60path52) - 1))) & (success'=min(1, node60path52)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path53 * min(1,node60path53) - currentNode*(min(1, node60path53) - 1))) &  (currentPath'=(53 * min(1, node60path53) - currentPath*(min(1,node60path53) - 1))) & (success'=min(1, node60path53)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path54 * min(1,node60path54) - currentNode*(min(1, node60path54) - 1))) &  (currentPath'=(54 * min(1, node60path54) - currentPath*(min(1,node60path54) - 1))) & (success'=min(1, node60path54)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path55 * min(1,node60path55) - currentNode*(min(1, node60path55) - 1))) &  (currentPath'=(55 * min(1, node60path55) - currentPath*(min(1,node60path55) - 1))) & (success'=min(1, node60path55)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path56 * min(1,node60path56) - currentNode*(min(1, node60path56) - 1))) &  (currentPath'=(56 * min(1, node60path56) - currentPath*(min(1,node60path56) - 1))) & (success'=min(1, node60path56)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path57 * min(1,node60path57) - currentNode*(min(1, node60path57) - 1))) &  (currentPath'=(57 * min(1, node60path57) - currentPath*(min(1,node60path57) - 1))) & (success'=min(1, node60path57)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path58 * min(1,node60path58) - currentNode*(min(1, node60path58) - 1))) &  (currentPath'=(58 * min(1, node60path58) - currentPath*(min(1,node60path58) - 1))) & (success'=min(1, node60path58)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path59 * min(1,node60path59) - currentNode*(min(1, node60path59) - 1))) &  (currentPath'=(59 * min(1, node60path59) - currentPath*(min(1,node60path59) - 1))) & (success'=min(1, node60path59)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path60 * min(1,node60path60) - currentNode*(min(1, node60path60) - 1))) &  (currentPath'=(60 * min(1, node60path60) - currentPath*(min(1,node60path60) - 1))) & (success'=min(1, node60path60)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path61 * min(1,node60path61) - currentNode*(min(1, node60path61) - 1))) &  (currentPath'=(61 * min(1, node60path61) - currentPath*(min(1,node60path61) - 1))) & (success'=min(1, node60path61)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path62 * min(1,node60path62) - currentNode*(min(1, node60path62) - 1))) &  (currentPath'=(62 * min(1, node60path62) - currentPath*(min(1,node60path62) - 1))) & (success'=min(1, node60path62)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path63 * min(1,node60path63) - currentNode*(min(1, node60path63) - 1))) &  (currentPath'=(63 * min(1, node60path63) - currentPath*(min(1,node60path63) - 1))) & (success'=min(1, node60path63)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path64 * min(1,node60path64) - currentNode*(min(1, node60path64) - 1))) &  (currentPath'=(64 * min(1, node60path64) - currentPath*(min(1,node60path64) - 1))) & (success'=min(1, node60path64)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path65 * min(1,node60path65) - currentNode*(min(1, node60path65) - 1))) &  (currentPath'=(65 * min(1, node60path65) - currentPath*(min(1,node60path65) - 1))) & (success'=min(1, node60path65)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path66 * min(1,node60path66) - currentNode*(min(1, node60path66) - 1))) &  (currentPath'=(66 * min(1, node60path66) - currentPath*(min(1,node60path66) - 1))) & (success'=min(1, node60path66)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path67 * min(1,node60path67) - currentNode*(min(1, node60path67) - 1))) &  (currentPath'=(67 * min(1, node60path67) - currentPath*(min(1,node60path67) - 1))) & (success'=min(1, node60path67)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path68 * min(1,node60path68) - currentNode*(min(1, node60path68) - 1))) &  (currentPath'=(68 * min(1, node60path68) - currentPath*(min(1,node60path68) - 1))) & (success'=min(1, node60path68)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path69 * min(1,node60path69) - currentNode*(min(1, node60path69) - 1))) &  (currentPath'=(69 * min(1, node60path69) - currentPath*(min(1,node60path69) - 1))) & (success'=min(1, node60path69)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path70 * min(1,node60path70) - currentNode*(min(1, node60path70) - 1))) &  (currentPath'=(70 * min(1, node60path70) - currentPath*(min(1,node60path70) - 1))) & (success'=min(1, node60path70)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path71 * min(1,node60path71) - currentNode*(min(1, node60path71) - 1))) &  (currentPath'=(71 * min(1, node60path71) - currentPath*(min(1,node60path71) - 1))) & (success'=min(1, node60path71)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path72 * min(1,node60path72) - currentNode*(min(1, node60path72) - 1))) &  (currentPath'=(72 * min(1, node60path72) - currentPath*(min(1,node60path72) - 1))) & (success'=min(1, node60path72)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path73 * min(1,node60path73) - currentNode*(min(1, node60path73) - 1))) &  (currentPath'=(73 * min(1, node60path73) - currentPath*(min(1,node60path73) - 1))) & (success'=min(1, node60path73)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path74 * min(1,node60path74) - currentNode*(min(1, node60path74) - 1))) &  (currentPath'=(74 * min(1, node60path74) - currentPath*(min(1,node60path74) - 1))) & (success'=min(1, node60path74)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path75 * min(1,node60path75) - currentNode*(min(1, node60path75) - 1))) &  (currentPath'=(75 * min(1, node60path75) - currentPath*(min(1,node60path75) - 1))) & (success'=min(1, node60path75)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path76 * min(1,node60path76) - currentNode*(min(1, node60path76) - 1))) &  (currentPath'=(76 * min(1, node60path76) - currentPath*(min(1,node60path76) - 1))) & (success'=min(1, node60path76)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path77 * min(1,node60path77) - currentNode*(min(1, node60path77) - 1))) &  (currentPath'=(77 * min(1, node60path77) - currentPath*(min(1,node60path77) - 1))) & (success'=min(1, node60path77)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path78 * min(1,node60path78) - currentNode*(min(1, node60path78) - 1))) &  (currentPath'=(78 * min(1, node60path78) - currentPath*(min(1,node60path78) - 1))) & (success'=min(1, node60path78)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path79 * min(1,node60path79) - currentNode*(min(1, node60path79) - 1))) &  (currentPath'=(79 * min(1, node60path79) - currentPath*(min(1,node60path79) - 1))) & (success'=min(1, node60path79)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path80 * min(1,node60path80) - currentNode*(min(1, node60path80) - 1))) &  (currentPath'=(80 * min(1, node60path80) - currentPath*(min(1,node60path80) - 1))) & (success'=min(1, node60path80)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path81 * min(1,node60path81) - currentNode*(min(1, node60path81) - 1))) &  (currentPath'=(81 * min(1, node60path81) - currentPath*(min(1,node60path81) - 1))) & (success'=min(1, node60path81)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path82 * min(1,node60path82) - currentNode*(min(1, node60path82) - 1))) &  (currentPath'=(82 * min(1, node60path82) - currentPath*(min(1,node60path82) - 1))) & (success'=min(1, node60path82)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path83 * min(1,node60path83) - currentNode*(min(1, node60path83) - 1))) &  (currentPath'=(83 * min(1, node60path83) - currentPath*(min(1,node60path83) - 1))) & (success'=min(1, node60path83)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path84 * min(1,node60path84) - currentNode*(min(1, node60path84) - 1))) &  (currentPath'=(84 * min(1, node60path84) - currentPath*(min(1,node60path84) - 1))) & (success'=min(1, node60path84)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path85 * min(1,node60path85) - currentNode*(min(1, node60path85) - 1))) &  (currentPath'=(85 * min(1, node60path85) - currentPath*(min(1,node60path85) - 1))) & (success'=min(1, node60path85)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path86 * min(1,node60path86) - currentNode*(min(1, node60path86) - 1))) &  (currentPath'=(86 * min(1, node60path86) - currentPath*(min(1,node60path86) - 1))) & (success'=min(1, node60path86)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path87 * min(1,node60path87) - currentNode*(min(1, node60path87) - 1))) &  (currentPath'=(87 * min(1, node60path87) - currentPath*(min(1,node60path87) - 1))) & (success'=min(1, node60path87)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path88 * min(1,node60path88) - currentNode*(min(1, node60path88) - 1))) &  (currentPath'=(88 * min(1, node60path88) - currentPath*(min(1,node60path88) - 1))) & (success'=min(1, node60path88)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path89 * min(1,node60path89) - currentNode*(min(1, node60path89) - 1))) &  (currentPath'=(89 * min(1, node60path89) - currentPath*(min(1,node60path89) - 1))) & (success'=min(1, node60path89)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path90 * min(1,node60path90) - currentNode*(min(1, node60path90) - 1))) &  (currentPath'=(90 * min(1, node60path90) - currentPath*(min(1,node60path90) - 1))) & (success'=min(1, node60path90)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path91 * min(1,node60path91) - currentNode*(min(1, node60path91) - 1))) &  (currentPath'=(91 * min(1, node60path91) - currentPath*(min(1,node60path91) - 1))) & (success'=min(1, node60path91)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path92 * min(1,node60path92) - currentNode*(min(1, node60path92) - 1))) &  (currentPath'=(92 * min(1, node60path92) - currentPath*(min(1,node60path92) - 1))) & (success'=min(1, node60path92)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path93 * min(1,node60path93) - currentNode*(min(1, node60path93) - 1))) &  (currentPath'=(93 * min(1, node60path93) - currentPath*(min(1,node60path93) - 1))) & (success'=min(1, node60path93)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path94 * min(1,node60path94) - currentNode*(min(1, node60path94) - 1))) &  (currentPath'=(94 * min(1, node60path94) - currentPath*(min(1,node60path94) - 1))) & (success'=min(1, node60path94)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path95 * min(1,node60path95) - currentNode*(min(1, node60path95) - 1))) &  (currentPath'=(95 * min(1, node60path95) - currentPath*(min(1,node60path95) - 1))) & (success'=min(1, node60path95)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path96 * min(1,node60path96) - currentNode*(min(1, node60path96) - 1))) &  (currentPath'=(96 * min(1, node60path96) - currentPath*(min(1,node60path96) - 1))) & (success'=min(1, node60path96)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path97 * min(1,node60path97) - currentNode*(min(1, node60path97) - 1))) &  (currentPath'=(97 * min(1, node60path97) - currentPath*(min(1,node60path97) - 1))) & (success'=min(1, node60path97)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path98 * min(1,node60path98) - currentNode*(min(1, node60path98) - 1))) &  (currentPath'=(98 * min(1, node60path98) - currentPath*(min(1,node60path98) - 1))) & (success'=min(1, node60path98)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path99 * min(1,node60path99) - currentNode*(min(1, node60path99) - 1))) &  (currentPath'=(99 * min(1, node60path99) - currentPath*(min(1,node60path99) - 1))) & (success'=min(1, node60path99)) & (checkNode'=true) & (good'=false)+
 numPathsInv: (currentNode'=(node60path100 * min(1,node60path100) - currentNode*(min(1, node60path100) - 1))) &  (currentPath'=(100 * min(1, node60path100) - currentPath*(min(1,node60path100) - 1))) & (success'=min(1, node60path100)) & (checkNode'=true) & (good'=false);



[]checkNode & !success -> (good'=true) & (checkNode'=false);

[]checkNode & success -> (success'=false) & (end'=true) & (checkNode'=false);


[]end & (currentNode <= userCount) & (useSearchLength != 1) -> (checkEnd'=true) & (end'=false);

[]end & (currentNode <= userCount) & (useSearchLength = 1) & (length >= minSearchLength) -> (checkEnd'=true) & (end'=false);

[]end & (currentNode <= userCount) & (useSearchLength = 1) & (length < minSearchLength) -> (launch'=true) & (end'=false);

[]end & (currentNode > userCount) -> (new'=true) & (end'=false);


[]checkEnd & ((currentNode != initNode) | (checkSelfLoop = 0)) -> (done'=true) & (checkEnd'=false);

[]checkEnd & (currentNode = initNode) & (checkSelfLoop = 1) -> (launch'=true) & (checkEnd'=false);


[]done -> (done'=true);



endmodule