/* Promela (.pml) dump of boolean abstraction. */ /* Correspondence Table: reach[;n](t,k) <-> B[1] reach[&(t->n);n](x,k) <-> B[3] (t==k) <-> B[2] reach[;n](x,k) <-> B[0] */ /* -------------- Declarations ------------------ */ bool B[4]; hidden byte tmp_B[4]; short i; /* aux. var. */; #define SETNONDET(v) if :: v = true :: v = false fi /* Macro for setting values of tmp variables. */ #define SETTMPVARS \ skip; \ d_step{ \ i = 0; \ do \ :: i < 4 -> tmp_B[i] = B[i]; i++ \ :: else -> break \ od; \ i = 0 \ } /* --------------- Control Flow Graph ------------- */ active proctype cfg () { /* start at initial node: */ goto n1_approx; n1: atomic{ SETTMPVARS; if :: B[2] = false; B[3] = tmp_B[0]; true; goto n2; fi; } n4: atomic{ SETTMPVARS; if :: B[0] = tmp_B[1]; true; goto ne; fi; } n2: atomic{ SETTMPVARS; if :: B[3] = tmp_B[3]; B[2] = tmp_B[2]; true; goto n3; fi; } ne: end: (0); n3: atomic{ SETTMPVARS; if :: if :: tmp_B[2] -> B[1] = true :: else -> B[1] = tmp_B[3] fi; true; goto n4; fi; } n1_approx: atomic{ SETTMPVARS; if :: true; B[0] = true; goto n1; fi; } }