*** 
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 2 locs(s) and 5 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, 2 locations, 5 transitions 
   * The initial state has label start and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 16 vars, 6(6==6) transitions and 3 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
start -----> {H=H__o, G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o} 

____start -----> {true} 

m1  -----> {A<=E+1, A+A__o<2E+2, B+A__o<=2E+2, 2A+5B+1>4E+F+2A__o, 2A+B+2C>2E+F+2A__o+1, A__o>=0, F>=A__o, D>=0, C>=E+1, B+A__o>=2E, B+1>=F, B>A__o, 2A+A__o<2E+F+2, A>=A__o, B=B__o, E+1=C__o, D=D__o, E=E__o, A__o=F__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 1 location(s)
   * Stats =  { time=23.782000; iterations=5; descendings=0; } 

  print result in fast++
 Finished !