Q1:Royal Garden’s Puzzle as a Model Checking Problem Pictures from UbiSoft
http://www.youtube.com/watch?v=1xv4KSUGSS8&hl=ko
R1 R2 R3 R4 Source H1 H2 R5 R6 R7 Type A H3 H4 R8 R9 R10 R11 Type B Type C Sink Handle Areas rotated H1 R1,R2,R5,R6 H2 R2,R3,R4,R6,R7 H3 R5,R6,R8,R9,R10 H4 -R6,R7,-R10,R11
Use assert statement to detect when the route is established Write down a C model and a Promela model to solve the puzzle by using CBMC and Spin (no embedded C allowed for Promela solution) Use assert statement to detect when the route is established Find and explain the shortest solution by analyzing counter examples. Also show that why your solution is the shortest one for the route Hint: there exists a solution less than 10 steps Report the complexity of the problem i.e., # of clauses and variables, # of states, memory usage, verification time, etc.