*** 
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 
   * 10 variable(s) and 14 locs(s) and 27 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 : 10 vars, 14 locations, 27 transitions 
   * The initial state has label f2 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 20 vars, 28(28==28) transitions and 15 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f4 -----> {A<E+G__o, A+H__o<=C+G__o, 2A+1<=E+2G__o, A<=G__o, H__o>0, G__o>0, E+1>0, C+1>E, A+1>0} 

f14 -----> {A+H__o<=C+G__o, 2A+1<=E+2G__o, A<E+G__o, A<=0, H__o>0, G__o>0, E+1>0, C+1>E, A+1>0} 

f13 -----> {A+1>0, C>=E, E+1>0, H__o>0, A+H__o<=E+G__o, A+1<=G__o, A=B} 

f400 -----> {false} 

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

f23 -----> {G__o>0, H__o>0, A=G__o, B=I__o, C=H__o, E=1, D=J__o} 

f33 -----> {A+1>0, C>=E, E+2>0, H__o>0, A+H__o+1<=E+G__o, A+1<=G__o} 

f6 -----> {A+1>0, C>=E, E+2>0, H__o>0, A+H__o+1<=E+G__o, A+1<=G__o} 

f43 -----> {A+1>0, C>=E, E+2>0, H__o>0, E<=0, A+H__o+1<=E+G__o} 

f53 -----> {A+1>0, C>=E, E+1>0, H__o>0, A+H__o<=E+G__o, A+1<=G__o} 

f61 -----> {B+1>0, E+1>0, H__o>0, B+H__o<=E+G__o, B+1<=G__o, A=B, C=E} 

f63 -----> {A+1>0, C>=E, E+1>0, H__o>0, A+H__o<=E+G__o, A+1<=G__o, A=B} 

f71 -----> {B+1>0, E+1>0, H__o>0, B+H__o<=E+G__o, B+1<=G__o, A=B, C=E} 

f73 -----> {A+1>0, C>=E, E+1>0, H__o>0, A+H__o<=E+G__o, A+1<=G__o, A=B} 

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

  print result in fast++
 Finished !