*** 
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 
   * 12 variable(s) and 3 locs(s) and 4 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 : 12 vars, 3 locations, 4 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
 24 vars, 5(5==5) transitions and 4 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
{E=E__o,A=K__o,F=F__o,B=0,C=1,D=0,G=G__o,H=H__o,I=I__o,
                 J=J__o,$>=0,1>0}just one = 
{E=E__o,A=K__o,F=F__o,B=1,C=1,
                                              D=1,G=G__o,H=H__o,I=I__o,
                                              J=J__o,$>=0,1>0}just one = 
{
E=E__o,A=K__o,F=F__o,B=1,J=J__o,D=1,G=G__o,H=H__o,I=I__o,C>=1,$>=0,C<=32,1>0}just one = 
{
E=E__o,A=K__o,F=F__o,J=J__o,B+1=C,D=0,G=G__o,H=H__o,I=I__o,B>=0,$>=0,B<=31,
1>0}just one = 
{E=E__o,A=K__o,F=F__o,I=I__o,J=J__o,D=0,G=G__o,H=H__o,C<=32,
                 B+1<=C,$>=0,B>=0,1>0}just one = 
{E=E__o,A=K__o,F=F__o,
                                                   I=I__o,J=J__o,D=1,G=G__o,
                                                   H=H__o,B<=C,C<=32,$>=0,
                                                   B>=1,1>0}just one = 
{
E=E__o,A=K__o,F=F__o,I=I__o,J=J__o,D=0,G=G__o,H=H__o,C<=32,B+1<=C,$>=0,B>=0,
1>0}just one = 
{E=E__o,A=K__o,F=F__o,I=I__o,J=J__o,D=1,G=G__o,H=H__o,B<=C,
                 C<=32,$>=0,B>=1,1>0}
*** Results : 
   *  Invariants =  
f0 -----> {J=J__o, I=I__o, H=H__o, G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o, K=K__o, L=L__o} 

f28 -----> {C<=32, C>31, B<=C, B>=0, B=E, B=F, H=J, A=K__o, H=I} 

____f0 -----> {true} 

f5  -----> {B>=0, C<=32, B<=C, J=J__o, I=I__o, H=H__o, G=G__o, F=F__o, E=E__o, A=K__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 1 location(s)
   * Stats =  { time=0.018000; iterations=4; descendings=0; } 

  print result in fast++
 Finished !