*** 
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 
   * 32 variable(s) and 12 locs(s) and 23 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 : 32 vars, 12 locations, 23 transitions 
   * The initial state has label start and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 64 vars, 24(24==24) transitions and 13 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 
   * 32 variable(s) and 12 locs(s) and 23 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 : 32 vars, 12 locations, 23 transitions 
   * The initial state has label start and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 64 vars, 24(24==24) transitions and 13 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * classical LRA (CH79) with delay = 4 
main

*** Results : 
   *  Invariants =  
f0 -----> {B>=B__o, A=A__o, D=D__o, E=E__o, F=F__o, G=G__o, H=H__o, I=I__o, J=J__o, K=K__o, L=L__o, M=M__o, N=N__o, O=O__o, P=P__o, Q=Q__o, R=R__o, S=S__o, T=T__o, U=U__o, V=V__o, W=W__o, X=X__o, Y=Y__o, Z=Z__o, A1=A1__o} 

f17 -----> {K>=K__o, A=A__o} 

f25 -----> {K>=K__o, B>0, A=A__o} 

f28 -----> {G>=J, B>0, K>=K__o, I>J, A=A__o} 

f30 -----> {F+J>K+1, B>0, K>=K__o, I>J, G>=J, A=A__o} 

f44 -----> {K>=K__o, G>=J, B>0, A=A__o} 

f55 -----> {K>=K__o, B>0, A=A__o} 

f64 -----> {K>=K__o, G>P, B>0, A=A__o} 

f66 -----> {G>P, B>0, L<=P, K>=K__o, A=A__o} 

f68 -----> {F+L>K+1, B>0, L<=P, K>=K__o, G>P, A=A__o} 

f93 -----> {B<=0, K>=K__o, A=A__o} 

start -----> {D1=D1__o, C1=C1__o, B1=B1__o, A1=A1__o, Z=Z__o, Y=Y__o, X=X__o, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, 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, 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, E1=E1__o, F1=F1__o} 

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

  print result in fast++
 Finished !