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

*** Results : 
   *  Invariants =  
f0 -----> {P=P__o, O=O__o, N=N__o, M=M__o, L=L__o, K=K__o, 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, Q=Q__o, R=R__o} 

f18 -----> {L=L__o, K=K__o, J=J__o, I=I__o, H=H__o, G=G__o, F=F__o, E=E__o, R=R__o, Q=Q__o, P=P__o, O=O__o, D=3, C=0, B=3, A=3, M=M__o, N=N__o} 

f10 -----> {false} 

f25 -----> {A=3, B=3, C=0, D=3, E=3, F=3, G+3=0, H=4, I=0, R=R__o, Q=Q__o, P=P__o, O=O__o, N=N__o, M=M__o, L=L__o, K=K__o, J=J__o} 

f33 -----> {N=N__o, M=M__o, L=L__o, R=R__o, J=J__o, K=4, Q=Q__o, I=0, H=4, G+3=0, F=3, E=3, D=3, C=0, B=3, A=3, O=O__o, P=P__o} 

f40 -----> {N+6>=0, A=3, B=3, C=0, D=3, E=3, F=3, G+3=0, H=4, I=0, J=4, K=4, L=4, M=3, O=0, P=P__o, Q=Q__o, R=R__o} 

f48 -----> {false} 

f52 -----> {false} 

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

  print result in fast++
 Finished !