26/9/17:

1. Wrote a function to check if the guessed value of the relation actually possible
2. Still have to fill up some if and else
3. Wrote some memory all

include/tpdaCGPP.h

@@ -25,7 +25,9 @@ class stateGCPP{
 	
         relation **r_matrix; // the matrix of relation which denotes the relation between the points fractional part. clearly the size of the matrix is P*P as p is the total number of active colors.
 	relation **allocate_r_matrix();
+        relation **allocate_r_matrix(char P);
         void delete_r_matrix();
+        void delete_r_matrix(relation **matrix,char P);
         void delete_del();
         void delete_w();
         void delete_all();
@@ -41,11 +43,12 @@ class stateGCPP{
 	stateGCPP* reduce(char dn);
 	
 	// return true iff clock gurards on new transition 'dn' with tsm value 'wn' is satisfied
-	bool consSatisfied(char dn, char wn, short *clockDis, bool *clockAcc);
+	bool consSatisfied(char dn, char wn, relation r, short *clockDis, bool *clockAcc);
 	
 	// check for stack constraint where 'dlr' and 'aclr' are distance and accuracy resp. from L to R
-	bool stackCheck(char dn, char wn, short dlr, bool aclr);
-	
+	bool stackCheck(char dn, char wn,relation r, short dlr, bool aclr);
+        //check if the relation between the fractional parts are good or not.
+	bool relationSatisfied(char dn,char wn,relation r,short *clockDis,bool *clockAcc);
 	// reduce the #points after shuffle operation by using forget operation if possible
 	stateGCPP* reduceShuffle(stateGCPP* vs);