*** 
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 
   * 5 variable(s) and 9 locs(s) and 17 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 : 5 vars, 9 locations, 13 transitions 
   * The initial state has label evalEx1start and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 10 vars, 14(14==14) transitions and 10 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
evalEx1start -----> {C=C__o, B=B__o, A=A__o, D=D__o, E=E__o} 

evalEx1entryin -----> {B=B__o, A=A__o, D=D__o, C=C__o} 

evalEx1bb6in -----> {B<=A__o} 

evalEx1bbin -----> {B<=A__o, A<B} 

evalEx1returnin -----> {A>=B, B<=A__o} 

evalEx1bb4in -----> {C<D+1, A+1<=C, B<=A__o, B>=D} 

evalEx1bb1in -----> {B>=D, C<D, B<=A__o, A+1<=C} 

evalEx1bb5in -----> {A+1<=C, C<D+1, B<=A__o, B>=D, C>=D} 

evalEx1stop -----> {A>=B, B<=A__o} 

____evalEx1start -----> {true} 
   * Remember that we have no bad region 
   * No accel has been applied
   * Stats =  { time=0.011000; iterations=6; descendings=0; } 

  print result in fast++
 Finished !