*** 
Aspic by Laure Gonnord, version 3.4  
Binary compiled on vendredi  1 janvier 2016 
Input file = main.fst 
***
 Configuration of Aspic * (version 3.4) 
   * name of file : main.fst 
   * inputfile of type (real) Fast format 
   * PRINTING all stuff for compsys ranking method 
   * DEBUG : Only prints analysis steps in a separate .log file 
   * PRINTING STUFF : Infile+Invars 
   * ANALYSIS 
    * with acceleration 
   * delay of widening = 1 
   * steps of descending sequence = 0 
   * newpath heuristic = disabled 
   * Name of model = main, Name of file = main.fst 
   * 7 variable(s) and 5 locs(s) and 6 transitions(s) in the .fst
   * Searching objective in fast strategy 
       -> we suppose that we want to compute post*(init) with init a convex set
       or post*(init) and bad if the state bad exists and bad is convex
       -> Initial region "init" found
       -> Finding initial polyhedron. OK. 
       -> No bad region
INFO : 7 vars, 5 locations, 6 transitions 
   * The initial state has label f0 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 14 vars, 7(7==7) transitions and 6 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f24 -----> {false} 

f27 -----> {false} 

f0 -----> {G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o} 

____f0 -----> {true} 

f12  -----> {A+1>0, A+G__o+1>B, G__o>0, B<=G__o, A+G__o<=B+4, F=4, E=G__o, B+C=G__o} 
 
f22  -----> {A+C+1>0, A+1>0, B+C>0, C>=0, A<=0, A+C<=4, F=4, B+C=E, B+C=G__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 2 location(s)
   * Stats =  { time=0.009000; iterations=4; descendings=0; } 

  print result in fast++
 Finished !