*** 
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 
   * 17 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 : 17 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
 34 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 -----> {O=O__o, 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, P=P__o, Q=Q__o} 

f1 -----> {O=O__o, 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 -----> {A+1>=I+A__o, H>0, G<=7, 4A+7>=H+4A__o, A+B>=A__o, A<=A__o, G>0, I>=0, B<=1, E>=I+F__o, B=J, E=F, C+F__o=E+D__o, C=D, M=7, G=K, H=L, N=N__o, O=O__o} 

f2 -----> {H<=7, C>=I+D__o, I<=1, G+2I>2, H>0, G<=4I+3, G+3I>=3, B=0, C=D, E=F, J=0, G=K, H=L, M=2, A=A__o, C+F__o=E+D__o, N=N__o, O=O__o} 

f3 -----> {C>=I+D__o, G>0, H>0, I>=0, I<=1, H<=7, G<=7, B=0, C+F__o=E+D__o, G=K, H=L, J=0, M=3, O=O__o, N=N__o, E=F, C=D, A=A__o} 

f6 -----> {C>=I+D__o, G>0, H>0, I>=0, I<=1, H<=7, G<=7, B=1, G=K, H=L, J=1, M=6, O=O__o, N=N__o, E=F, C=D, C+F__o=E+D__o, A=A__o} 

f4 -----> {5B+L>=7, 5C+2>=L+5D__o, G>0, L<=7, G<=7, B<=1, B=J, C+F__o=E+D__o, G=K, M=4, O=O__o, N=N__o, 5I+2=L, H=L, E=F, C=D, A=A__o} 

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

  print result in fast++
 Finished !