*** 
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 6 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 : 12 vars, 6 locations, 17 transitions 
   * The initial state has label start0 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 24 vars, 18(18==18) transitions and 7 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
{F=G__o,L=A__o,A=A__o,B=C__o,B=C,D=0,E=0,K=K__o,F=G,H=0,
                 E__o=0,J=2,I=I__o,A__o>=0,1>0,$>=0,B>1}just one = 
{
I=I__o,L=A__o,A=A__o,G=G__o,B=C,D=0,E=0,B=C__o,K=K__o,H=0,E__o=0,J=2,A__o>=0,
1>0,$>=0,B>1}just one = 
{L=A__o,I=I__o,A=L,G=G__o,B=C,D=0,E=0,B=C__o,K=K__o,
                          H=0,E__o=0,L>=0,1>0,$>=0,J>=2,B+1>J}just one = 
{
L=A__o,I=I__o,A=L,G=G__o,B=C,D=0,E=0,B=C__o,K=K__o,H=0,E__o=0,L>=0,1>0,$>=0,
J>=2,B+1>J}
*** Results : 
   *  Invariants =  
start -----> {J=K, J=K__o, H=I, H=I__o, F=G, F=G__o, D=E, D=E__o, B=C, B=C__o, A=L, A=A__o} 

stop -----> {I=I__o, K=K__o, A=L, A=A__o, B=C__o, D=E__o, G=G__o, D=E, B=C} 

start0 -----> {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} 

____start0 -----> {true} 

lbl131  -----> {D>=0, A>=0, J>=1, B>0, A+B+1>J, B=C, D=E, D=H, A=L, A=A__o, B=C__o, D=E__o, G=G__o, I=I__o, K=K__o} 
 
lbl121  -----> {A<=F, A+B>F, H>=1, D+1>H, A>=0, B=C, D=E, F=J, A=L, A=A__o, B=C__o, D=E__o, G=G__o, I=I__o, K=K__o} 
 
lbl111  -----> {A+1>F, J>=0, F>=J+1, D>0, B>J, B=C, D=E, H=1, A=L, A=A__o, B=C__o, D=E__o, G=G__o, I=I__o, K=K__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 3 location(s)
   * Stats =  { time=0.046000; iterations=5; descendings=0; } 

  print result in fast++
 Finished !