*** 
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 6 locs(s) and 15 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, 6 locations, 15 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, 16(16==16) transitions and 7 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} 

f11 -----> {C>=0, C<=1, A=100, 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, B=O__o} 

f23 -----> {H>=0, H<=1, A=100, C=1, D=1, E=1, F=100, N=N__o, M=M__o, L=L__o, K=K__o, J=J__o, I=I__o, B=O__o} 

f26 -----> {A=100, C=1, D=1, E=0, F=100, H=0, I=100, N=N__o, M=M__o, L=L__o, K=K__o, J=J__o, B=O__o} 

f36 -----> {A=100, C=0, D=0, E=0, J=100, N=N__o, M=M__o, L=L__o, K=K__o, I=I__o, H=H__o, G=G__o, F=F__o, B=O__o} 

f32 -----> {D>=E, E>=0, D<=1, A=100, C=D, B=O__o} 

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

  print result in fast++
 Finished !