*** 
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 
   * 11 variable(s) and 10 locs(s) and 23 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 : 11 vars, 10 locations, 23 transitions 
   * The initial state has label start and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 22 vars, 24(24==24) transitions and 11 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
{A=A__o,B=B__o,H=0,1>0,A>B__o,A<E,A+E+1>D+E__o,E>=E__o,$>=0,
                 A+1>=D}just one = 
{H=0,A=A__o,E>=E__o,1>0,B>=B__o,A+1>=D,
                                     A>B,A<E,$>=0}just one = 
{H=0,A=A__o,
                                                               E>=E__o,1>0,
                                                               B>=B__o,
                                                               A+1>=D,A>B,
                                                               A<E,$>=0}just one = 
{
H=0,A=A__o,E>=E__o,1>0,B>=B__o,A+1>=D,A>B,A<E,$>=0}
*** Results : 
   *  Invariants =  
f0 -----> {B>=B__o, E>=E__o, A=A__o} 

f35 -----> {A+E>D+E__o, A>=D, A>B, B>=B__o, E>=E__o, A<E, A=A__o} 

f58 -----> {A<=B, B>=B__o, E>=E__o, A=A__o} 

start -----> {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, J=J__o, K=K__o} 

____start -----> {true} 

f12  -----> {E>=E__o, B>=B__o, A>B, A>=D, A+E>D+E__o, A=A__o} 
 
f22  -----> {2A+2E>B+D+2E__o, A+E>D+E__o, A>=D, A>B, B>=B__o, E>=E__o, A<E, A=A__o} 
 
f29  -----> {2A+2E>B+D+2E__o, A+E>D+E__o, A>=D, A>B, B>=B__o, E>=E__o, A<E, A=A__o} 
 
f37  -----> {E>=E__o, B>=B__o, A>B, A+1>=D, A<E, A=A__o} 
 
f43  -----> {E>=E__o, B>=B__o, A>B, A>=D, A<E, A=A__o} 
 
f48  -----> {E>=E__o, B>=B__o, A>B, A>=D, A<E, A=A__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 6 location(s)
   * Stats =  { time=0.127000; iterations=5; descendings=0; } 

  print result in fast++
 Finished !