text: /*CFG Analyzer, version 03/12/2007
  
  A word in the intersection of L(G1) ... L(G2) is, e.g., "bcacb" of length 5
  */
  var hampiStringVar : 5;
  cfg S0 :=  "a" | "b" S0 "b" | "c" S0 "c" ;
  reg limit0 := fix(S0, 5);
  assert hampiStringVar in limit0;
  cfg S1 :=  B1 A1 | A1 C1 ;
  cfg A1 :=  "a" | "a" B1 | B1 "a" ;
  cfg C1 :=  "c" | C1 B1 ;
  cfg B1 :=  "b" "c" | "b" | B1 "c" ;
  reg limit1 := fix(S1, 5);
  assert hampiStringVar in limit1;
  