*** 
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 
   * 8 variable(s) and 6 locs(s) and 12 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 : 8 vars, 6 locations, 12 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
 16 vars, 13(13==13) transitions and 7 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f0 -----> {F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o, G=G__o, H=H__o} 

f18 -----> {C<=101, C>100, D>=1, A+1=0, B+1=0, E=0} 

f33 -----> {C>100, D+F>100, D>=1, E+F>=2, E>=0, E<=1, D<=99, D+F<=101, C<=101, A+1=0, B+1=0} 

f40 -----> {E<=1, C>100, D+99E>1, E>=0, D>=1, C<=101, B+1=0, A+1=0} 

____f0 -----> {true} 

f8  -----> {C>=1, C<=101, A+1=0, B+1=0, G=G__o, F=F__o, E=E__o, D=D__o} 
 
f22  -----> {D+F<=101, E>=0, E+F>=2, D>=1, C>100, D<=99, E<=1, C<=101, A+1=0, B+1=0} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 2 location(s)
   * Stats =  { time=0.030000; iterations=5; descendings=0; } 

  print result in fast++
 Finished !