*** 
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 
   * 12 variable(s) and 10 locs(s) and 17 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 : 12 vars, 10 locations, 17 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
 24 vars, 18(18==18) transitions and 11 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f0 -----> {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, K=K__o, L=L__o} 

f93 -----> {A>=E, A>=0, D>=0, D+1>J, D+1>I, D+1>H, D+1>G, D+1>F, D>=E, F>=0, F+1>J, F+1>I, F+1>H, F+1>G, G>=0, G+1>J, G+1>I, G+1>H, H>=0, H+1>J, H+1>I, I>=0, I+1>J, J>=0, E<=F, E<=G, E<=H, E<=I, E<=J, A<D+1, A<F+1, A<G+1, A<H+1, A<I+1, A<J+1, E=E__o, B=K__o, C=L__o} 

____f0 -----> {true} 

f17  -----> {D>=0, A=0, J=J__o, I=I__o, H=H__o, G=G__o, F=F__o, E=E__o, C=L__o, B=K__o} 
 
f27  -----> {D>=0, D+1>F, D>=E, F>=0, A=0, J=J__o, I=I__o, H=H__o, G=G__o, E=E__o, C=L__o, B=K__o} 
 
f37  -----> {D>=0, D+1>G, D+1>F, D>=E, F>=0, F+1>G, G>=0, E<=F, A=0, J=J__o, I=I__o, H=H__o, E=E__o, C=L__o, B=K__o} 
 
f45  -----> {A>=0, D>=0, D+1>G, D+1>F, D>=E, F>=0, F+1>G, G>=0, E<=F, E<=G, A<D+1, A<F+1, A<G+1, J=J__o, I=I__o, H=H__o, E=E__o, C=L__o, B=K__o} 
 
f55  -----> {A>=0, A+1>H, A>=E, D>=0, D+1>H, D+1>G, D+1>F, D>=E, F>=0, F+1>H, F+1>G, G>=0, G+1>H, H>=0, E<=F, E<=G, A<D+1, A<F+1, A<G+1, J=J__o, I=I__o, E=E__o, C=L__o, B=K__o} 
 
f65  -----> {A>=0, A+1>I, A+1>H, A>=E, D>=0, D+1>I, D+1>H, D+1>G, D+1>F, D>=E, F>=0, F+1>I, F+1>H, F+1>G, G>=0, G+1>I, G+1>H, H>=0, H+1>I, I>=0, E<=F, E<=G, E<=H, A<D+1, A<F+1, A<G+1, J=J__o, E=E__o, C=L__o, B=K__o} 
 
f75  -----> {A>=0, A+1>J, A+1>I, A+1>H, A>=E, D>=0, D+1>J, D+1>I, D+1>H, D+1>G, D+1>F, D>=E, F>=0, F+1>J, F+1>I, F+1>H, F+1>G, G>=0, G+1>J, G+1>I, G+1>H, H>=0, H+1>J, H+1>I, I>=0, I+1>J, J>=0, E<=F, E<=G, E<=H, E<=I, A<D+1, A<F+1, A<G+1, E=E__o, C=L__o, B=K__o} 
 
f83  -----> {A>=0, D>=0, D+1>J, D+1>I, D+1>H, D+1>G, D+1>F, D>=E, F>=0, F+1>J, F+1>I, F+1>H, F+1>G, G>=0, G+1>J, G+1>I, G+1>H, H>=0, H+1>J, H+1>I, I>=0, I+1>J, J>=0, E<=F, E<=G, E<=H, E<=I, E<=J, A<D+1, A<F+1, A<G+1, A<H+1, A<I+1, A<J+1, E=E__o, C=L__o, B=K__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 8 location(s)
   * Stats =  { time=0.045000; iterations=1; descendings=0; } 

  print result in fast++
 Finished !