*** 
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 
   * 9 variable(s) and 13 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 : 9 vars, 13 locations, 21 transitions 
   * The initial state has label evalNestedLoopstart and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 18 vars, 22(22==22) transitions and 14 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
evalNestedLoopstart -----> {G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o, H=H__o, I=I__o} 

evalNestedLoopentryin -----> {H=H__o, G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o} 

evalNestedLoopbb9in -----> {D>=0, C>=0, B>=0, A>=0, A=A__o, B=B__o, C=C__o} 

evalNestedLoopreturnin -----> {A>=0, D>=0, C>=0, B>=0, A=A__o, B=B__o, C=C__o} 

evalNestedLoopbb10in -----> {A>D, B>=0, C>=0, D>=0, C=C__o, B=B__o, A=A__o} 

evalNestedLoopbb6in -----> {B>=0, A>D, D<=F, D>=0, C>=0, B+1>E, A=A__o, B=B__o, C=C__o} 

evalNestedLoopbb8in -----> {B+1>E, D<=F, B>=0, D>=0, A>D, C>=0, A=A__o, B=B__o, C=C__o} 

evalNestedLoopbb7in -----> {A>D, B>=0, B>E, C>=0, D>=0, D<=F, C=C__o, B=B__o, A=A__o} 

evalNestedLoopbb1in -----> {B>=0, D<=F, B>E, D>=0, C>=0, A>D, A=A__o, B=B__o, C=C__o} 

evalNestedLoopbb3in -----> {B>E, B>=0, A>D, D<=F, F<=H, D>=0, C>=0, C+F+1>H, E+1=G, A=A__o, B=B__o, C=C__o} 

evalNestedLoopbb4in -----> {A>D, B>=0, B>E, C>H, D>=0, F<=H, D<=F, E+1=G, C=C__o, B=B__o, A=A__o} 

evalNestedLoopbb2in -----> {B>=0, D<=F, B>E, D>=0, F<=H, C>H, A>D, E+1=G, A=A__o, B=B__o, C=C__o} 

evalNestedLoopstop -----> {A>=0, D>=0, C>=0, B>=0, A=A__o, B=B__o, C=C__o} 

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

  print result in fast++
 Finished !