*** 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 4 locs(s) and 7 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, 4 locations, 7 transitions * The initial state has label f22 and the associated polyhedron is { $>=0,1>0} * There is/are 0 bad node(s) * Precomputing special stuff for ranking option 34 vars, 8(8==8) transitions and 5 locs now * Printing option = Infile+Invars * Parsing OK, now analysing * LRA with acceleration with delay = 1 main *** Results : * Invariants = f18 -----> {F__o>=0, A=A__o, B=H__o, B=H, F=F__o, G=Q__o, I=2, N=3, O=0, J=K, J=L, J=M, J=P__o, E=E__o, D=D__o, C=C__o} f20 -----> {D>=1, C>=0, F>=0, J=P__o, I=2, C=C__o, F=F__o, J=K, A=A__o, O=0, J=L, A=B, H=H__o, J=M, N=3} f22 -----> {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} ____f22 -----> {true} f17 -----> {D>=1, F__o>=0, A=A__o, F=F__o, G=Q__o, H=H__o, I=2, N=3, O=0, J=K, J=L, J=M, J=P__o, C=C__o} * Remember that we have no bad region * Acceleration has been applied around 1 location(s) * Stats = { time=0.042000; iterations=4; descendings=0; } print result in fast++ Finished !