Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is S_QuasiCertifProtocol-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444110200015
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-0
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-1
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-15
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-2
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-3
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-4
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-5
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-6
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-7
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-8
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1464443632201


its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G(X("a2.a2[0]>=1"))))
Formula 0 simplified : !GX"a2.a2[0]>=1"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
26 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.303219,32000,1,0,19014,3510,1009,17482,422,19157,55833
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(X(X("a1.a1[0]>=1"))))U(X(F(G("a2.a2[0]>=1"))))))
Formula 1 simplified : !(GXX"a1.a1[0]>=1" U XFG"a2.a2[0]>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.389887,36232,1,0,27738,3529,1016,25096,422,19376,78670
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X(F(X(((((("tsidxtsid0.n9_0>=1")&&("tsidxtsid6.n9_6>=1"))&&("tsidxtsid3.n9_3>=1"))&&("tsid0.c1_0>=1"))||(((("tsidxtsid1.n9_1>=1")&&("tsidxtsid7.n9_7>=1"))&&("tsidxtsid4.n9_4>=1"))&&("tsid1.c1_1>=1")))||(((("tsidxtsid2.n9_2>=1")&&("tsidxtsid8.n9_8>=1"))&&("tsidxtsid5.n9_5>=1"))&&("tsid2.c1_2>=1"))))))U(F(G(G("a4.a4[0]>=1"))))))
Formula 2 simplified : !(XFX(("tsid0.c1_0>=1" & "tsidxtsid0.n9_0>=1" & "tsidxtsid3.n9_3>=1" & "tsidxtsid6.n9_6>=1") | ("tsid1.c1_1>=1" & "tsidxtsid1.n9_1>=1" & "tsidxtsid4.n9_4>=1" & "tsidxtsid7.n9_7>=1") | ("tsid2.c1_2>=1" & "tsidxtsid2.n9_2>=1" & "tsidxtsid5.n9_5>=1" & "tsidxtsid8.n9_8>=1")) U FG"a4.a4[0]>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.567454,40192,1,0,29932,3529,1039,29045,422,19380,84623
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X((G("Astart.Astart[0]>=1"))U(G(((("tsid0.n1_0>=1")&&("tsid0.Sstart_0>=1"))||(("tsid1.n1_1>=1")&&("tsid1.Sstart_1>=1")))||(("tsid2.n1_2>=1")&&("tsid2.Sstart_2>=1"))))))))
Formula 3 simplified : !FX(G"Astart.Astart[0]>=1" U G(("tsid0.Sstart_0>=1" & "tsid0.n1_0>=1") | ("tsid1.Sstart_1>=1" & "tsid1.n1_1>=1") | ("tsid2.Sstart_2>=1" & "tsid2.n1_2>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.657324,43144,1,0,34031,3536,1122,33904,429,19454,107407
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((X(F(((("tsid0.n4_0>=1")&&("tsid2.n4_2>=1"))&&("tsid1.n4_1>=1"))&&("a3.a3[0]>=1"))))U("a2.a2[0]>=1"))))
Formula 4 simplified : !X(XF("a3.a3[0]>=1" & "tsid0.n4_0>=1" & "tsid1.n4_1>=1" & "tsid2.n4_2>=1") U "a2.a2[0]>=1")
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.690841,43668,1,0,36398,3536,1184,37289,430,19716,116324
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(G(G(F(((((("tsid0.s5_0>=1")&&("tsidxtsid0.n8_0>=1"))&&("tsidxtsid2.n8_2>=1"))&&("tsidxtsid1.n8_1>=1"))||(((("tsid1.s5_1>=1")&&("tsidxtsid3.n8_3>=1"))&&("tsidxtsid5.n8_5>=1"))&&("tsidxtsid4.n8_4>=1")))||(((("tsid2.s5_2>=1")&&("tsidxtsid6.n8_6>=1"))&&("tsidxtsid8.n8_8>=1"))&&("tsidxtsid7.n8_7>=1")))))))))
Formula 5 simplified : !XFGF(("tsid0.s5_0>=1" & "tsidxtsid0.n8_0>=1" & "tsidxtsid1.n8_1>=1" & "tsidxtsid2.n8_2>=1") | ("tsid1.s5_1>=1" & "tsidxtsid3.n8_3>=1" & "tsidxtsid4.n8_4>=1" & "tsidxtsid5.n8_5>=1") | ("tsid2.s5_2>=1" & "tsidxtsid6.n8_6>=1" & "tsidxtsid7.n8_7>=1" & "tsidxtsid8.n8_8>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.1454,46788,1,0,41993,3536,1275,41983,432,19741,140790
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(((("a1.a1[0]>=1")&&("tsid0.n2_0>=1"))&&("tsid2.n2_2>=1"))&&("tsid1.n2_1>=1"))))
Formula 6 simplified : !X("a1.a1[0]>=1" & "tsid0.n2_0>=1" & "tsid1.n2_1>=1" & "tsid2.n2_2>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.14709,47048,1,0,41993,3536,1297,41983,433,19742,140862
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(("a4.a4[0]>=1")U(((("tsid0.s5_0>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1"))||(("tsid1.s5_1>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1")))||(("tsid2.s5_2>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1")))))U(G(F(X("a4.a4[0]>=1"))))))
Formula 7 simplified : !(F("a4.a4[0]>=1" U (("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid0.s5_0>=1") | ("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid1.s5_1>=1") | ("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid2.s5_2>=1"))) U GFX"a4.a4[0]>=1")
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.20665,47716,1,0,42065,3536,1319,44432,433,19796,148308
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F(((("tsid0.s5_0>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1"))||(("tsid1.s5_1>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1")))||(("tsid2.s5_2>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1"))))))
Formula 8 simplified : !GF(("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid0.s5_0>=1") | ("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid1.s5_1>=1") | ("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid2.s5_2>=1"))
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.2472,48480,1,0,45025,3536,1347,47099,433,19796,154099
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(((((("tsid0.s5_0>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1"))||(("tsid1.s5_1>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1")))||(("tsid2.s5_2>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1")))U(((("tsid0.n3_0>=1")&&("tsid0.s2_0>=1"))||(("tsid1.n3_1>=1")&&("tsid1.s2_1>=1")))||(("tsid2.n3_2>=1")&&("tsid2.s2_2>=1"))))U(F(((((("tsidxtsid0.n9_0>=1")&&("tsidxtsid6.n9_6>=1"))&&("tsidxtsid3.n9_3>=1"))&&("tsid0.c1_0>=1"))||(((("tsidxtsid1.n9_1>=1")&&("tsidxtsid7.n9_7>=1"))&&("tsidxtsid4.n9_4>=1"))&&("tsid1.c1_1>=1")))||(((("tsidxtsid2.n9_2>=1")&&("tsidxtsid8.n9_8>=1"))&&("tsidxtsid5.n9_5>=1"))&&("tsid2.c1_2>=1")))))))
Formula 9 simplified : !G(((("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid0.s5_0>=1") | ("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid1.s5_1>=1") | ("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid2.s5_2>=1")) U (("tsid0.n3_0>=1" & "tsid0.s2_0>=1") | ("tsid1.n3_1>=1" & "tsid1.s2_1>=1") | ("tsid2.n3_2>=1" & "tsid2.s2_2>=1"))) U F(("tsid0.c1_0>=1" & "tsidxtsid0.n9_0>=1" & "tsidxtsid3.n9_3>=1" & "tsidxtsid6.n9_6>=1") | ("tsid1.c1_1>=1" & "tsidxtsid1.n9_1>=1" & "tsidxtsid4.n9_4>=1" & "tsidxtsid7.n9_7>=1") | ("tsid2.c1_2>=1" & "tsidxtsid2.n9_2>=1" & "tsidxtsid5.n9_5>=1" & "tsidxtsid8.n9_8>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,396.077,494092,1,0,49578,3536,1432,50330,434,19797,188910
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(F(F(G(((("tsid0.Sstart_0>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1"))||(("tsid1.Sstart_1>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1")))||(("tsid2.Sstart_2>=1")&&("malicious_reservoir.malicious_reservoir[0]>=1")))))))))
Formula 10 simplified : !FGFG(("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid0.Sstart_0>=1") | ("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid1.Sstart_1>=1") | ("malicious_reservoir.malicious_reservoir[0]>=1" & "tsid2.Sstart_2>=1"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,396.143,249068,1,0,50802,3536,1476,52479,434,19799,197778
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F(((((("tsidxtsid0.n9_0>=1")&&("tsidxtsid6.n9_6>=1"))&&("tsidxtsid3.n9_3>=1"))&&("tsid0.c1_0>=1"))||(((("tsidxtsid1.n9_1>=1")&&("tsidxtsid7.n9_7>=1"))&&("tsidxtsid4.n9_4>=1"))&&("tsid1.c1_1>=1")))||(((("tsidxtsid2.n9_2>=1")&&("tsidxtsid8.n9_8>=1"))&&("tsidxtsid5.n9_5>=1"))&&("tsid2.c1_2>=1"))))U("Astart.Astart[0]>=1")))
Formula 11 simplified : !(F(("tsid0.c1_0>=1" & "tsidxtsid0.n9_0>=1" & "tsidxtsid3.n9_3>=1" & "tsidxtsid6.n9_6>=1") | ("tsid1.c1_1>=1" & "tsidxtsid1.n9_1>=1" & "tsidxtsid4.n9_4>=1" & "tsidxtsid7.n9_7>=1") | ("tsid2.c1_2>=1" & "tsidxtsid2.n9_2>=1" & "tsidxtsid5.n9_5>=1" & "tsidxtsid8.n9_8>=1")) U "Astart.Astart[0]>=1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,396.531,250384,1,0,50802,3536,1534,52479,434,19799,197848
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(((("tsid0.n5_0>=1")&&("tsid0.s3_0>=1"))||(("tsid1.n5_1>=1")&&("tsid1.s3_1>=1")))||(("tsid2.n5_2>=1")&&("tsid2.s3_2>=1"))))))
Formula 12 simplified : !GX(("tsid0.n5_0>=1" & "tsid0.s3_0>=1") | ("tsid1.n5_1>=1" & "tsid1.s3_1>=1") | ("tsid2.n5_2>=1" & "tsid2.s3_2>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,396.535,250644,1,0,50802,3536,1606,52479,441,19803,197994
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("Astart.Astart[0]>=1"))
Formula 13 simplified : !"Astart.Astart[0]>=1"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,396.536,250644,1,0,50802,3536,1606,52479,441,19803,197994
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(G(X(("a4.a4[0]>=1")U(((("tsid0.n5_0>=1")&&("tsid0.s3_0>=1"))||(("tsid1.n5_1>=1")&&("tsid1.s3_1>=1")))||(("tsid2.n5_2>=1")&&("tsid2.s3_2>=1"))))))))
Formula 14 simplified : !XGX("a4.a4[0]>=1" U (("tsid0.n5_0>=1" & "tsid0.s3_0>=1") | ("tsid1.n5_1>=1" & "tsid1.s3_1>=1") | ("tsid2.n5_2>=1" & "tsid2.s3_2>=1")))
34 unique states visited
34 strongly connected components in search stack
35 transitions explored
34 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,396.543,250644,1,0,50807,3536,1612,52483,441,19817,198347
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(F(((("a1.a1[0]>=1")&&("tsid0.n2_0>=1"))&&("tsid2.n2_2>=1"))&&("tsid1.n2_1>=1")))))
Formula 15 simplified : !F("a1.a1[0]>=1" & "tsid0.n2_0>=1" & "tsid1.n2_1>=1" & "tsid2.n2_2>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,396.548,250644,1,0,50963,3536,1637,52689,441,19818,199763
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1464444034708

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 28, 2016 1:53:55 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2016 1:53:55 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 28, 2016 1:53:57 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1516 ms
May 28, 2016 1:53:57 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 30 places.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: read order :VarOrder [vars=[malicious_reservoir[0], CstopAbort[0], SstopAbort[0], AstopAbort[0], n9[0], n9[1], n9[2], n9[3], n9[4], n9[5], n9[6], n9[7], n9[8], n8[0], n8[1], n8[2], n8[3], n8[4], n8[5], n8[6], n8[7], n8[8], n7[0], n7[1], n7[2], n7[3], n7[4], n7[5], n7[6], n7[7], n7[8], n6[0], n6[1], n6[2], n5[0], n5[1], n5[2], n4[0], n4[1], n4[2], n3[0], n3[1], n3[2], n2[0], n2[1], n2[2], n1[0], n1[1], n1[2], c1[0], c1[1], c1[2], Cstart[0], Cstart[1], Cstart[2], Sstart[0], Sstart[1], Sstart[2], s2[0], s2[1], s2[2], s3[0], s3[1], s3[2], s4[0], s4[1], s4[2], s5[0], s5[1], s5[2], s6[0], s6[1], s6[2], SstopOK[0], SstopOK[1], SstopOK[2], a5[0], a4[0], a3[0], a2[0], a1[0], Astart[0], AstopOK[0], CstopOK[0], CstopOK[1], CstopOK[2]]]
May 28, 2016 1:53:57 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

May 28, 2016 1:53:57 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 26 transitions.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains : CompositeGalOrder [children=[VarOrder [vars=[n9[0], n8[0], n7[0]]], VarOrder [vars=[n9[1], n8[1], n7[1]]], VarOrder [vars=[n9[2], n8[2], n7[2]]], VarOrder [vars=[n9[3], n8[3], n7[3]]], VarOrder [vars=[n9[4], n8[4], n7[4]]], VarOrder [vars=[n9[5], n8[5], n7[5]]], VarOrder [vars=[n9[6], n8[6], n7[6]]], VarOrder [vars=[n9[7], n8[7], n7[7]]], VarOrder [vars=[n9[8], n8[8], n7[8]]], VarOrder [vars=[malicious_reservoir[0]]], VarOrder [vars=[CstopAbort[0]]], VarOrder [vars=[SstopAbort[0]]], VarOrder [vars=[AstopAbort[0]]], VarOrder [vars=[a5[0]]], VarOrder [vars=[a4[0]]], VarOrder [vars=[a3[0]]], VarOrder [vars=[a2[0]]], VarOrder [vars=[a1[0]]], VarOrder [vars=[Astart[0]]], VarOrder [vars=[AstopOK[0]]], VarOrder [vars=[n6[0], n5[0], n4[0], n3[0], n2[0], n1[0], c1[0], Cstart[0], Sstart[0], s2[0], s3[0], s4[0], s5[0], s6[0], SstopOK[0], CstopOK[0]]], VarOrder [vars=[n6[1], n5[1], n4[1], n3[1], n2[1], n1[1], c1[1], Cstart[1], Sstart[1], s2[1], s3[1], s4[1], s5[1], s6[1], SstopOK[1], CstopOK[1]]], VarOrder [vars=[n6[2], n5[2], n4[2], n3[2], n2[2], n1[2], c1[2], Cstart[2], Sstart[2], s2[2], s3[2], s4[2], s5[2], s6[2], SstopOK[2], CstopOK[2]]]]]
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 58 ms
May 28, 2016 1:53:57 PM fr.lip6.move.gal.application.Application applyOrder
INFO: Applying decomposition
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 28 ms
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Partition obtained :[n9[0], n8[0], n7[0], ],[n9[1], n8[1], n7[1], ],[n9[2], n8[2], n7[2], ],[n9[3], n8[3], n7[3], ],[n9[4], n8[4], n7[4], ],[n9[5], n8[5], n7[5], ],[n9[6], n8[6], n7[6], ],[n9[7], n8[7], n7[7], ],[n9[8], n8[8], n7[8], ],[malicious_reservoir[0], ],[CstopAbort[0], ],[SstopAbort[0], ],[AstopAbort[0], ],[a5[0], ],[a4[0], ],[a3[0], ],[a2[0], ],[a1[0], ],[Astart[0], ],[AstopOK[0], ],[n6[0], n5[0], n4[0], n3[0], n2[0], n1[0], c1[0], Cstart[0], Sstart[0], s2[0], s3[0], s4[0], s5[0], s6[0], SstopOK[0], CstopOK[0], ],[n6[1], n5[1], n4[1], n3[1], n2[1], n1[1], c1[1], Cstart[1], Sstart[1], s2[1], s3[1], s4[1], s5[1], s6[1], SstopOK[1], CstopOK[1], ],[n6[2], n5[2], n4[2], n3[2], n2[2], n1[2], c1[2], Cstart[2], Sstart[2], s2[2], s3[2], s4[2], s5[2], s6[2], SstopOK[2], CstopOK[2], ],

May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array n9 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array n8 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array n7 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array n6 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array n5 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array n4 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array n3 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array n2 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array n1 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array c1 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array Cstart to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array Sstart to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array s2 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array s3 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array s4 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array s5 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array s6 to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array SstopOK to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array CstopOK to variables to allow decomposition.
May 28, 2016 1:53:57 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 20 redundant transitions.
May 28, 2016 1:53:57 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 12 ms
May 28, 2016 1:53:57 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_QuasiCertifProtocol-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_QuasiCertifProtocol-COL-02.tgz
mv S_QuasiCertifProtocol-COL-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_QuasiCertifProtocol-COL-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r181kn-smll-146444110200015"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;