*** 
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 
   * 9 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 : 9 vars, 5 locations, 6 transitions 
   * The initial state has label f3 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 18 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 =  
f2 -----> {C<=I__o, G=G__o, F=F__o, E=E__o} 

f1 -----> {false} 

f4 -----> {C<=I__o, C<=0, E=E__o, F=F__o} 

f3 -----> {G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o, H=H__o, I=I__o} 

____f3 -----> {true} 

f0  -----> {C<=I__o, A+I__o>C, I__o>0, A+1>0, G=G__o, F=F__o, E=E__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 1 location(s)
   * Stats =  { time=0.008000; iterations=4; descendings=0; } 

  print result in fast++
 Finished !