*** 
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 
   * 28 variable(s) and 11 locs(s) and 21 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 : 28 vars, 11 locations, 21 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
 56 vars, 22(22==22) transitions and 12 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f25 -----> {C>=0, C<Y__o, G=0, Q=0, R=Y__o, V=W, X=1, U=V, P=P__o, O=O__o, N=N__o, M=M__o, L=L__o, K=K__o, J=J__o, I=I__o, H=Z__o, B=B__o, A=A__o} 

f33 -----> {false} 

f36 -----> {C>=1, G=0, Q=0, A=A__o, B=B__o, F=F__o, S=S__o, T=T__o, U=U__o, V=V__o, W=W__o, X=Y__o, R=Z__o, H=A1__o} 

f45 -----> {C<=H, C>=1, G=0, L=M, Q=0, A=A__o, B=B__o, F=F__o, S=S__o, T=T__o, U=U__o, V=V__o, W=W__o, X=Y__o, R=Z__o, H=A1__o} 

f46 -----> {C>=1, C<=H, G=0, L=N, L=M, Q=0, X=Y__o, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, R=Z__o, H=A1__o, F=F__o, B=B__o, A=A__o} 

f63 -----> {false} 

f65 -----> {false} 

f0 -----> {B1=B1__o, A1=A1__o, Z=Z__o, Y=Y__o, X=X__o, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, R=R__o, Q=Q__o, P=P__o, 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} 

____f0 -----> {true} 

f15  -----> {C>=0, G=0, Q=0, X=1, A=A__o, B=B__o, I=I__o, J=J__o, K=K__o, L=L__o, M=M__o, N=N__o, O=O__o, P=P__o, R=Y__o, H=Z__o} 
 
f31  -----> {C>=0, C>=R, G=0, Q=0, X=1, R=Y__o, P=P__o, O=O__o, N=N__o, M=M__o, L=L__o, K=K__o, J=J__o, I=I__o, H=Z__o, B=B__o, A=A__o} 
 
f61  -----> {C>=1, C>A1__o, A=A__o, B=B__o, F=F__o, G=0, Q=0, R=Z__o, S=S__o, T=T__o, U=U__o, V=V__o, W=W__o, X=Y__o, H=A1__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 3 location(s)
   * Stats =  { time=0.401000; iterations=8; descendings=0; } 

  print result in fast++
 Finished !