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

stop -----> {A>=G, G<0, A=D, A=A__o, C=C__o, F=F__o, H=H__o} 

lbl91 -----> {A>=G, E>=0, E<G, C=C__o, F=F__o, H=H__o, A=D, A=A__o} 

start0 -----> {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} 

____start0 -----> {true} 

lbl142  -----> {A>=E, E>=0, A=D, E=G+1, A=A__o, C=C__o, F=F__o, H=H__o} 
 
lbl131  -----> {E<G+1, E>=1, A>=G, A=D, A=A__o, C=C__o, F=F__o, H=H__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 2 location(s)
   * Stats =  { time=0.022000; iterations=5; descendings=0; } 

  print result in fast++
 Finished !