*** 
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 5 locs(s) and 9 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, 5 locations, 9 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
 10 vars, 10(10==10) transitions and 6 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
{D=0,C+3=E__o,A+1=E__o,B=0,$>=0,E__o>2,1>0}just one = 
{
D=0,A+B+1=E__o,A=C+2,$>=0,A>1,1>0,B>=0}just one = 
{D=0,A+B+1=E__o,A=C+2,
                                                    $>=0,A>1,1>0,B>=0}just one = 
{
D=0,C+1>0,A>=C+2,$>=0,A+B+2>=E__o,1>0,B+1>0,A+1<=E__o,A+B+1<=E__o}just one = 
{
D=0,$>=0,C+1>0,A>=C+2,1>0,B+1>0,A+1<=E__o,A+B+1<=E__o}just one = 
{D=0,$>=0,
                                                                   C+1>0,
                                                                   A>=C+2,
                                                                   1>0,B+1>0,
                                                                   A+1<=E__o,
                                                                   A+B+1<=E__o}just one = 
{
D=0,$>=0,C+1>0,A>=C+2,1>0,B+1>0,A+1<=E__o,A+B+1<=E__o}
*** Results : 
   *  Invariants =  
f0 -----> {C=C__o, B=B__o, A=A__o, D=D__o, E=E__o} 

f6 -----> {A<=B+E__o, B<=0, B+1>0} 

f10 -----> {A+B<=E__o, A+1<=E__o, B+1>0, A+1>0} 

f25 -----> {A<=0, A<=B+E__o, B<=0, B+1>0} 

____f0 -----> {true} 

f14  -----> {A+B+1<=E__o, A+1<=E__o, C+2>0, B+1>0, A>=C+1} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 1 location(s)
   * Stats =  { time=0.017000; iterations=6; descendings=0; } 

  print result in fast++
 Finished !