*** 
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 
   * 19 variable(s) and 6 locs(s) and 10 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 : 19 vars, 6 locations, 10 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
 38 vars, 11(11==11) transitions and 7 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 
   * 19 variable(s) and 6 locs(s) and 10 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 : 19 vars, 6 locations, 10 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
 38 vars, 11(11==11) transitions and 7 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * classical LRA (CH79) with delay = 4 
main

*** Results : 
   *  Invariants =  
f11 -----> {A>=0, C=C__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, Q=Q__o} 

f14 -----> {A<=9, B<=10, B>=0, A>=0, C=C__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, Q=Q__o} 

f33 -----> {H>=0, F>=0, 10C>=F+H, A>9, 9C<=F+H, Q=1000, I=I__o, J=J__o, K=K__o, L=L__o, M=M__o, N=N__o} 

f36 -----> {9C+D<=F+H, C<=9, H>=0, F>=0, 10C+D>=F+H, A>9, D<=10, Q=1000, I=I__o, J=J__o, K=K__o, L=L__o, M=M__o, N=N__o} 

f58 -----> {9C<=J+L, J>=0, L>=0, 10C>=J+L, C>9, A>9, M=1500, E=I, G=K, H=L, F=J, Q=1000} 

f0 -----> {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, R=R__o, S=S__o} 

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

  print result in fast++
 Finished !