*** 
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 
   * 5 variable(s) and 19 locs(s) and 32 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 : 5 vars, 19 locations, 32 transitions 
   * The initial state has label evalrandom2dstart and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 10 vars, 33(33==33) transitions and 20 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
evalrandom2dstart -----> {C=C__o, B=B__o, A=A__o, D=D__o, E=E__o} 

evalrandom2dentryin -----> {B=B__o, A=A__o, D=D__o, C=C__o} 

evalrandom2dbb10in -----> {A>=0, B=B__o} 

evalrandom2dbbin -----> {A>=0, A<B, B=B__o} 

evalrandom2dreturnin -----> {A>=B, A>=0, B=B__o} 

evalrandom2dbb2in -----> {C>=1, D>=0, D<=3, C<B__o+1, B=B__o, A+1=C} 

evalrandom2dNodeBlock9in -----> {C>=1, D>=0, D<=3, C<B__o+1, A+1=C, B=B__o} 

evalrandom2dNodeBlockin -----> {A>=0, D>=0, D<=1, A<B, B=B__o, A+1=C} 

evalrandom2dNodeBlock7in -----> {A>=0, D>1, D<=3, A<B, B=B__o, A+1=C} 

evalrandom2dLeafBlockin -----> {A>=0, A<B, D=0, B=B__o, A+1=C} 

evalrandom2dLeafBlock1in -----> {A>=0, D>0, D<=1, A<B, B=B__o, A+1=C} 

evalrandom2dbb3in -----> {A>=0, A<B, A+1=C, D=0, B=B__o} 

evalrandom2dNewDefaultin -----> {false} 

evalrandom2dbb5in -----> {A>=0, A<B, A+1=C, D=1, B=B__o} 

evalrandom2dLeafBlock3in -----> {A>=0, D>1, D<=2, A<B, B=B__o, A+1=C} 

evalrandom2dLeafBlock5in -----> {A>=0, D>2, D<=3, A<B, B=B__o, A+1=C} 

evalrandom2dbb7in -----> {A>=0, A<B, A+1=C, D=2, B=B__o} 

evalrandom2dbb9in -----> {A>=0, A<B, A+1=C, D=3, B=B__o} 

evalrandom2dstop -----> {A>=B, A>=0, B=B__o} 

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

  print result in fast++
 Finished !