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

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

evalbinsearchStepSize2bbin -----> {G=G__o} 

evalbinsearchStepSize2returnin -----> {G=G__o} 

evalbinsearchStepSize2bb1in -----> {G=G__o} 

evalbinsearchStepSize2bb2in -----> {G=G__o} 

evalbinsearchStepSize2bb3in -----> {G=G__o} 

evalbinsearchStepSize2bb4in -----> {E>G, G=G__o} 

evalbinsearchStepSize2bb9in -----> {E<=G, G=G__o} 

evalbinsearchStepSize2bb6in -----> {E>G, A=1, B=0, G=G__o} 

evalbinsearchStepSize2bb7in -----> {B+1>=H, E>G__o, B<=H, G=G__o} 

evalbinsearchStepSize2bb10in -----> {E<G, G=G__o} 

evalbinsearchStepSize2bb12in -----> {E<G, A=2, B=0, G=G__o} 

evalbinsearchStepSize2bb13in -----> {B+1>=H, E<G__o, B<=H, G=G__o} 

evalbinsearchStepSize2stop -----> {G=G__o} 

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

  print result in fast++
 Finished !