*** 
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 
   * 14 variable(s) and 9 locs(s) and 23 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 : 14 vars, 9 locations, 23 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
 28 vars, 24(24==24) transitions and 10 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
empty(28)just one = 
empty(28)just one = 
empty(28)just one = 
empty(28)just one = 
empty(28)just one = 
{
B=10,C=20,G=1,D>=E,1>0,E+11F>9,F<=1,F>=0,E<=20,$>=0,E>=9,D+10E>10F+81,
D+10E+100F>81}just one = 
empty(28)just one = 
{B=10,C=20,G=1,D>=E,1>0,
                                                E+11F>9,F<=1,F>=0,E<=20,$>=0,
                                                E>=9,D+10E>10F+81,
                                                D+10E+100F>81}just one = 
empty(28)just one = 
{
B=10,C=20,G=1,D>=E,1>0,E+11F>9,F<=1,F>=0,E<=20,$>=0,E>=9,D+10E>10F+81,
D+10E+100F>81}just one = 
empty(28)just one = 
empty(28)just one = 
{
C=20,B=10,G=1,$>=0,1>0,F>=0,D>=E}just one = 
empty(28)just one = 
{C=20,B=10,
                                                                   G=1,$>=0,
                                                                   1>0,F>=0,
                                                                   D>=E}
*** Results : 
   *  Invariants =  
f63 -----> {F>0, B=10, C=20, G=0} 

f0 -----> {L=L__o, K=K__o, 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, M=M__o, N=N__o} 

f40 -----> {F>=0, B=10, C=20, G=0} 

f59 -----> {F>0, B=10, C=20, G=0} 

f54 -----> {F>=0, F<=1, B=10, C=20, G=0} 

f69 -----> {F>=0, G>0, B=10, C=20} 

____f0 -----> {true} 

f11  -----> {G>=0, F>=0, B=10, C=20} 
 
f43  -----> {B=10, C=20, F=0, G=0} 
 
f48  -----> {B=10, C=20, F=0, G=0} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 3 location(s)
   * Stats =  { time=0.192000; iterations=6; descendings=0; } 

  print result in fast++
 Finished !