*** 
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 
   * 16 variable(s) and 7 locs(s) and 27 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 : 16 vars, 7 locations, 27 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
 32 vars, 28(28==28) transitions and 8 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f0 -----> {N=N__o, M=M__o, 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, O=O__o, P=P__o} 

f1 -----> {N=N__o, M=M__o, 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} 

f7 -----> {G>0, H<=1, A>=0, F<=7, G<=7, H>=0, F>0, A<=1, D>=H+E__o, F=J, A=I, D=E, B+E__o=D+C__o, B=C, L=7, G=K, M=M__o, N=N__o} 

f2 -----> {2B+F>2H+2C__o+2, 3B+F>=3H+3C__o+3, 4B+3>=F+4H+4C__o, F+4H<=7, F>=3H, F>2H, G>3H, G>=4H, H>=0, G+3H<=7, A=0, B=C, D=E, I=0, F=J, G=K, L=2, B+E__o=D+C__o, M=M__o, N=N__o} 

f3 -----> {B>=H+C__o, F>0, G>0, H>=0, H<=1, G<=7, F<=7, A=0, B+E__o=D+C__o, F=J, G=K, I=0, L=3, N=N__o, M=M__o, D=E, B=C} 

f6 -----> {B>=H+C__o, F>0, G>0, H>=0, H<=1, G<=7, F<=7, A=1, F=J, G=K, I=1, L=6, N=N__o, M=M__o, D=E, B=C, B+E__o=D+C__o} 

f4 -----> {A>=0, 5B+2>=K+5C__o, F>0, K>=2, K<=7, F<=7, A<=1, A=I, B+E__o=D+C__o, F=J, G=K, 5H+2=K, L=4, N=N__o, M=M__o, D=E, B=C} 

____f0 -----> {true} 
   * Remember that we have no bad region 
   * No accel has been applied
   * Stats =  { time=0.235000; iterations=5; descendings=0; } 

  print result in fast++
 Finished !