*** 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 * 40 variable(s) and 14 locs(s) and 41 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 : 40 vars, 14 locations, 41 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 80 vars, 42(42==42) transitions and 15 locs now * Printing option = Infile+Invars * Parsing OK, now analysing * LRA with acceleration with delay = 1 main *** Results : * Invariants = f78 -----> {4Z+I1__o>20, Z+A1>I1__o, Z>4, A1>0, I1__o>0, Z<=20, E<=X, F+1=0, I=0, O=0, P=0, S+1=0, T=0, U=0, D1=E1, A1=B1, Y=H1__o, V=W, Q=R, L=C1, L+A1+D1+F1+G1=I1__o+J1__o+K1__o+L1__o+M1__o, K=K__o, J=N, G=H, D=M, B=C, B=N1__o, A=A__o} f80 -----> {I>=0, 4Z+I1__o>20, Z+A1>I1__o, Z>4, A1>0, I1__o>0, Z<=20, I<=1, E<=X, A=A__o, F+1=0, L=C1, O=0, P=0, S+1=0, T=0, U=0, D1=E1, A1=B1, Y=H1__o, V=W, Q=R, L+A1+D1+F1+G1=I1__o+J1__o+K1__o+L1__o+M1__o, K=K__o, J=N, G=H, D=M, B=C, B=N1__o} f37 -----> {4Z+I1__o>20, Z+A1>I1__o, Z>4, A1>0, I1__o>0, Z<=20, E+L+A1+D1+G1=I1__o+J1__o+K1__o+L1__o+M1__o, D1=E1, A1=B1, Y=H1__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=C1, K=K__o, J=J__o, I=I__o, H=H__o, G=G__o, F=F__o, E=F1, D=D__o, C=C__o, B=N1__o, A=A__o} f41 -----> {4Z+I1__o>20, Z>4, I1__o>0, Z<=20, E+L+D1+G1 {4Z+I1__o>20, Z+A1>I1__o, Z>4, A1>0, I1__o>0, Z<=20, E+1<=X, L=C1, T=0, U=0, D1=E1, A1=B1, Y=H1__o, L+A1+D1+F1+G1=I1__o+J1__o+K1__o+L1__o+M1__o, K=K__o, F=S, D=M, B=C, B=N1__o, A=A__o} f48 -----> {A1>0, Z<=20, Z>4, I1__o>0, 4Z+I1__o>20, E<=X, Z+A1>I1__o, B=C, D=M, A1=B1, L=C1, D1=E1, A=A__o, K=K__o, Y=H1__o, L+A1+D1+F1+G1=I1__o+J1__o+K1__o+L1__o+M1__o, B=N1__o} f61 -----> {L+4Z+A1+D1+F1+G1>J1__o+K1__o+L1__o+M1__o+20, L+A1+D1+F1+G1>J1__o+K1__o+L1__o+M1__o, Z>4, A1>0, Z<=20, L+D1+F1+G1 {4Z+I1__o>20, Z+A1>I1__o, Z>4, A1>0, I1__o>0, Z<=20, E<=X, F+1=0, G=H, I=0, L=C1, S+1=0, T=0, U=0, D1=E1, A1=B1, Y=H1__o, V=W, L+A1+D1+F1+G1=I1__o+J1__o+K1__o+L1__o+M1__o, K=K__o, D=M, B=C, B=N1__o, A=A__o} f84 -----> {I>=0, 4Z+I1__o>20, Z+A1>I1__o, Z>4, A1>0, I1__o>0, Z<=20, I<=1, E<=X, F+1=0, S+1=0, T=0, U=0, D1=E1, A1=B1, Y=H1__o, V=W, O=P, L=C1, L+A1+D1+F1+G1=I1__o+J1__o+K1__o+L1__o+M1__o, K=K__o, J=N, G=H, D=M, B=C, B=N1__o, A=A__o} f77 -----> {L+4Z+A1+D1+F1+G1>J1__o+K1__o+L1__o+M1__o+20, L+A1+D1+F1+G1>J1__o+K1__o+L1__o+M1__o, Z>4, A1>0, Z<=20, L+D1+F1+G1 {false} f98 -----> {false} f0 -----> {N1=N1__o, M1=M1__o, L1=L1__o, K1=K1__o, J1=J1__o, I1=I1__o, H1=H1__o, G1=G1__o, F1=F1__o, E1=E1__o, 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} ____f0 -----> {true} f94 -----> {A1+20>I1__o, A=A__o, K=K__o, L=1, D1=E1, A1=B1, Y=H1__o} * Remember that we have no bad region * Acceleration has been applied around 1 location(s) * Stats = { time=2.276000; iterations=5; descendings=0; } print result in fast++ Finished !