*** 
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 12 locs(s) and 35 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, 12 locations, 35 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, 36(36==36) transitions and 13 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
empty(28)just one = 
{J=J__o,I=I__o,A=1,B=12,C=0,D=1,K=K__o,
                                      F=2,G=0,L=L__o,E=M__o,H=H__o,$>=0,1>0}just one = 
{
J=J__o,I=I__o,A=1,B=12,C=0,D=1,K=K__o,H=H__o,G=0,L=L__o,E=M__o,F>=2,1>0,F<13,
$>=0}just one = 
{J=J__o,I=I__o,A=1,B=12,C=0,D=1,K=K__o,H=H__o,G=0,L=L__o,
                  E=M__o,F>=2,1>0,F<13,$>=0}just one = 
empty(28)just one = 
{
E=M__o,L=L__o,A=0,B=12,I=0,D=1,J=J__o,F=0,K=K__o,H=3,C+12>0,$>=0,C<=1,1>0}just one = 
{
E=M__o,L=L__o,A=0,B=12,K=K__o,D=1,J=J__o,I=0,F+2<=H,11F+H>=3,C<=1,10F+H>2,
11F+H<=14,F>=0,10F+H<14,1>0,C+12>0,H<13,$>=0}just one = 
{E=M__o,L=L__o,A=0,
                                                          B=12,K=K__o,D=1,
                                                          J=J__o,I=0,F<11,
                                                          C<=1,$>=0,H<13,
                                                          F>=0,C+12>0,1>0,
                                                          11F+H>=3}just one = 
{
E=M__o,L=L__o,A=0,B=12,K=K__o,D=1,J=J__o,I=0,F<11,C<=1,$>=0,H<13,F>=0,C+12>0,
1>0,11F+H>=3}
*** Results : 
   *  Invariants =  
f62 -----> {A+132>0, C+12>0, D>=0, F>=11, F<12, D<=1, C<=1, A<=1, B=12, L=L__o, E=M__o} 

f63 -----> {A+132>0, C+12>0, D>=0, F>=11, F<12, D<=1, C<=1, A<=1, B=12, L=L__o, E=M__o} 

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} 

f22 -----> {C+F>=1, F<12, C<=1, A=1, B=12, D=1, L=L__o, K=K__o, J=J__o, I=I__o, H=H__o, E=M__o} 

f32 -----> {A+12F>=1, A+11F>0, C+12>0, F<12, C<=1, A<=1, B=12, D=1, E=M__o, J=J__o, K=K__o, L=L__o} 

f38 -----> {A+11F+H>=2, C+12>0, F>=0, H<12, F<11, C<=1, A<=1, B=12, D=1, L=L__o, K=K__o, J=J__o, E=M__o} 

f52 -----> {A+132>0, C+12>0, D+F>=1, D>0, F<11, D<=1, C<=1, A<=1, B=12, L=L__o, E=M__o} 

f71 -----> {D>=0, C<=1, A+396>=132C+132D+132L, F>=11, A+372>120C+120D+120L, A+11C+396>132D+132L, 11A+120C+4212>1320D+1320L, L>=0, 11A+120C+4332>1440D+1440L, 11A+11D+11L<C+34, A+132>0, C+12>0, D+L>0, D<=1, 12A+12D+12L<=C+36, A+C+D+L<=3, F<12, A<=1, L<=1, B=12, E=M__o} 

____f0 -----> {true} 

f13  -----> {F>=0, F<13, A=1, B=12, C=1, D=1, L=L__o, K=K__o, J=J__o, I=I__o, H=H__o, G=G__o, E=M__o} 
 
f19  -----> {C<=1, C+F>=1, F<13, A=1, B=12, D=1, L=L__o, K=K__o, J=J__o, I=I__o, H=H__o, E=M__o} 
 
f35  -----> {C+12>0, F>=0, H<13, C<=1, F<11, A<=1, A+11F+H>=2, B=12, D=1, L=L__o, K=K__o, J=J__o, E=M__o} 
 
f48  -----> {D>=0, D+F>=1, A+132>0, C+12>0, D<=1, C<=1, A<=1, F<12, B=12, L=L__o, E=M__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 4 location(s)
   * Stats =  { time=0.229000; iterations=14; descendings=0; } 

  print result in fast++
 Finished !