*** 
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 
   * 8 variable(s) and 4 locs(s) and 14 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 : 8 vars, 4 locations, 14 transitions 
   * The initial state has label start0 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 16 vars, 15(15==15) transitions and 5 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
{F=F__o,C=C__o,A=G+2,G+2=A__o,H=H__o,D=G+2,E=0,G>0,1>0,$>=0}
*Hum* A problem occured when accelerating the loops, now trying with -noaccel option
   * Name of model = main, Name of file = main.fst 
   * 8 variable(s) and 4 locs(s) and 14 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 : 8 vars, 4 locations, 14 transitions 
   * The initial state has label start0 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 16 vars, 15(15==15) transitions and 5 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * classical LRA (CH79) with delay = 4 
main

*** Results : 
   *  Invariants =  
start -----> {G=H, G=H__o, E=F, E=F__o, B=C, B=C__o, A=D, A=A__o} 

stop -----> {A>=E+G, E>=0, G<=0, C=C__o, A=A__o, H=H__o, F=F__o, A=D} 

cut -----> {A>=G+1, G>0, E>=0, A>=E+G, A=D, A=A__o, C=C__o, F=F__o, H=H__o} 

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

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

  print result in fast++
 Finished !