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

*** Results : 
   *  Invariants =  
start -----> {O=P, O=P__o, M=N, M=N__o, K=L, K=L__o, I=J, I=J__o, G=H, G=H__o, E=F, E=F__o, C=D, C=D__o, A=B, A=B__o} 

lbl21 -----> {P=P__o, M=N, M=N__o, K=L, K=L__o, I=J, I=J__o, G=H, G=H__o, E=F, E=F__o, C=D, C=D__o, A=B, A=B__o} 

lbl121 -----> {G>0, G<=O, E>=0, I<=2O+1, E+1<=I, I>=2O, I=K, I=L, I=M+1, B=B__o, D=D__o, F=F__o, H=H__o, J=J__o, I=L__o, N=N__o, P=P__o} 

lbl123 -----> {2A+1>0, E>=0, M+1>=2O, O>0, M<=2O, E<=M, 2A<=O, B=B__o, D=D__o, F=F__o, H=H__o, I=M+1, J=J__o, K=M+1, L=M+1, N=N__o, P=P__o, M+1=L__o, A=G} 

stop -----> {2O<=L__o, G<=O, 2O+1>=L__o, G<=0, K=L__o, B=B__o, D=D__o, F=F__o, H=H__o, J=J__o, L=L__o, N=N__o, P=P__o} 

lbl71 -----> {K>=2O, G>0, E>=0, G<=O, E<K, K<=2O+1, E=I, K=L, B=B__o, D=D__o, F=F__o, H=H__o, J=J__o, K=L__o, N=N__o, P=P__o} 

lbl101 -----> {G<=O, I<K, G>0, E+G<=I, E>=0, K<=2O+1, K>=2O, K=L, B=B__o, D=D__o, F=F__o, H=H__o, J=J__o, K=L__o, N=N__o, P=P__o} 

lbl53 -----> {E>=0, G>0, 2O+1>=L__o, 2O<=L__o, M<L__o, G<=O, E<=M, B=B__o, D=D__o, F=F__o, H=H__o, I=M+1, J=J__o, K=L__o, L=L__o, N=N__o, P=P__o} 

start0 -----> {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, P=P__o, Q=Q__o} 

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

  print result in fast++
 Finished !