*** 
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 
   * 26 variable(s) and 15 locs(s) and 44 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 : 26 vars, 15 locations, 44 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
 52 vars, 45(45==45) transitions and 16 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f20 -----> {D>=0, Y__o>0, H=0, S=0, T=T__o, U=1, V=Y__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, G=G__o, F=F__o, E=W__o, D=X__o, C=C__o, B=B__o, A=Z__o} 

f69 -----> {B+D>0, B>=0, C>=D+S, D>=0, H>=0, S>=0, V>0, B<=1, U=1, V=Y__o, T=T__o, O=O__o, I=I__o, E=W__o, D=X__o, A=Z__o} 

f39 -----> {B+D>0, B>=0, C>=D+S, D>=0, H>=0, S>=0, V>0, C<E, B<=1, U=1, V=Y__o, T=T__o, O=O__o, I=I__o, E=W__o, D=X__o, A=Z__o} 

f47 -----> {B+D>0, B>=0, C>=D+S, D>=0, H>=0, S>=0, V>0, H<I, C<E, B<=1, K=0, U=1, V=Y__o, T=T__o, O=O__o, I=I__o, E=W__o, D=X__o, A=Z__o} 

f50 -----> {B+X__o>0, B>=0, C>=S+X__o, H>=0, S>=0, V>0, X__o>=0, H<I, C<E, B<=1, D=X__o, K=0, U=1, V=Y__o, T=T__o, O=O__o, I=I__o, E=W__o, A=Z__o} 

f59 -----> {B+D>0, B>=0, C>=D+S, D>=0, H>=0, N>=0, S>=0, V>0, H<I, C<E, B<=1, K=0, O=O__o, U=1, V=Y__o, T=T__o, I=I__o, E=W__o, D=X__o, A=Z__o} 

f62 -----> {B+D>0, B>=0, C>=D+S, D>=0, H>=0, S>=0, V>0, R<=10, H<I__o, C<E, B<=1, I=I__o, K=0, U=1, V=Y__o, T=T__o, O=O__o, E=W__o, D=X__o, A=Z__o} 

f73 -----> {false} 

f76 -----> {false} 

f78 -----> {false} 

f0 -----> {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} 

f26  -----> {D>=0, C>=D+S, B>=0, B+D>0, B<=1, V>0, S>=0, H>=0, U=1, I=I__o, O=O__o, T=T__o, E=W__o, D=X__o, V=Y__o, A=Z__o} 
 
f33  -----> {S>=0, H>=0, D>=0, C>=D+S, B>=0, B+D>0, B<=1, C<E, V>0, U=1, I=I__o, O=O__o, T=T__o, E=W__o, D=X__o, V=Y__o, A=Z__o} 
 
f71  -----> {B+D>0, B>=0, C>=D, D>=0, H>=0, Y__o>0, B<=1, A=0, S=0, U=1, V=Y__o, T=T__o, O=O__o, I=I__o, E=W__o, D=X__o} 
 
f74  -----> {B+D>0, B>=0, C>=D+S, D>=0, H>=0, S>0, Y__o>0, B<=1, A=0, U=1, V=Y__o, T=T__o, O=O__o, I=I__o, E=W__o, D=X__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 4 location(s)
   * Stats =  { time=0.885000; iterations=5; descendings=0; } 

  print result in fast++
 Finished !