fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r141-qhx2-152673582600060
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for QuasiCertifProtocol-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.390 9200.00 12385.00 566.30 FTFTFFFFTFFFFFFF normal

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)
...................................
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is QuasiCertifProtocol-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-qhx2-152673582600060
=====================================================================


--------------------
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-PT-02-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1527893260331

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph1853697645441082783.txt, -o, /tmp/graph1853697645441082783.bin, -w, /tmp/graph1853697645441082783.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph1853697645441082783.bin, -l, -1, -v, -w, /tmp/graph1853697645441082783.weights, -q, 0, -e, 0.001], workingDir=null]
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 18 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1029,0.090914,5956,571,208,2152,389,258,2244,76,1919,0


Converting to forward existential form...Done !
original formula: ((i5.u6.a4>=1) + AF((((!(i5.u6.a4>=1))||((i5.u6.a4>=1)||(i5.u6.a5>=1)))&&(((((u4.malicious_reservoir>=1)&&(i1.u0.c1_0>=1))||((u4.malicious_reservoir>=1)&&(i1.u0.c1_2>=1)))||((i1.u0.c1_1>=1)&&(u4.malicious_reservoir>=1)))||(((((i3.u18.n4_0>=1)&&(i5.u15.n4_1>=1))&&(i6.u17.n4_2>=1))&&(i5.u6.a3>=1))||(((u4.s4_1>=1)||(i2.u10.s4_0>=1))||(i0.u5.s4_2>=1)))))))
=> equivalent forward existential formula: [FwdG((Init * !((i5.u6.a4>=1))),!((((!(i5.u6.a4>=1))||((i5.u6.a4>=1)||(i5.u6.a5>=1)))&&(((((u4.malicious_reservoir>=1)&&(i1.u0.c1_0>=1))||((u4.malicious_reservoir>=1)&&(i1.u0.c1_2>=1)))||((i1.u0.c1_1>=1)&&(u4.malicious_reservoir>=1)))||(((((i3.u18.n4_0>=1)&&(i5.u15.n4_1>=1))&&(i6.u17.n4_2>=1))&&(i5.u6.a3>=1))||(((u4.s4_1>=1)||(i2.u10.s4_0>=1))||(i0.u5.s4_2>=1)))))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,0.20754,9184,1,0,7201,2596,882,11637,364,10343,18245
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: !((AF((((((u4.malicious_reservoir>=1)&&(i1.u0.c1_0>=1))||((u4.malicious_reservoir>=1)&&(i1.u0.c1_2>=1)))||((i1.u0.c1_1>=1)&&(u4.malicious_reservoir>=1)))&&(((((i2.u10.s5_0>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(u4.s5_1>=1)))||((i0.u5.s5_2>=1)&&(u4.malicious_reservoir>=1)))&&(i5.u6.a3>=1)))) * !(AG(((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1)))))))
=> equivalent forward existential formula: ([FwdG(Init,!((((((u4.malicious_reservoir>=1)&&(i1.u0.c1_0>=1))||((u4.malicious_reservoir>=1)&&(i1.u0.c1_2>=1)))||((i1.u0.c1_1>=1)&&(u4.malicious_reservoir>=1)))&&(((((i2.u10.s5_0>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(u4.s5_1>=1)))||((i0.u5.s5_2>=1)&&(u4.malicious_reservoir>=1)))&&(i5.u6.a3>=1)))))] != FALSE + [(Init * !(E(TRUE U !(((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1)))))))] != FALSE)
(forward)formula 1,1,0.227856,9712,1,0,7673,2598,1044,12202,378,10403,21614
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (AF((((!(i3.u14.Astart>=1))&&(((((u4.malicious_reservoir>=1)&&(i1.u0.c1_0>=1))||((u4.malicious_reservoir>=1)&&(i1.u0.c1_2>=1)))||((i1.u0.c1_1>=1)&&(u4.malicious_reservoir>=1)))&&(i5.u6.a2>=1))) * EF(((((u4.s3_1>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i6.u17.s3_2>=1)))||((i3.u18.s3_0>=1)&&(u4.malicious_reservoir>=1)))))) * A((((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1)))||(!((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1))))) U ((((((((i2.u1.n8_0_2>=1)&&(i2.u1.n8_0_0>=1))&&(i2.u1.n8_0_1>=1))&&(i2.u10.s5_0>=1))||((((i0.u3.n8_2_2>=1)&&(i0.u3.n8_2_0>=1))&&(i0.u3.n8_2_1>=1))&&(i0.u5.s5_2>=1)))||((((i1.u2.n8_1_1>=1)&&(i1.u2.n8_1_2>=1))&&(u4.s5_1>=1))&&(i1.u2.n8_1_0>=1)))&&((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))||(!((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1)))))))
=> equivalent forward existential formula: ([FwdG(Init,!((((!(i3.u14.Astart>=1))&&(((((u4.malicious_reservoir>=1)&&(i1.u0.c1_0>=1))||((u4.malicious_reservoir>=1)&&(i1.u0.c1_2>=1)))||((i1.u0.c1_1>=1)&&(u4.malicious_reservoir>=1)))&&(i5.u6.a2>=1))) * E(TRUE U ((((u4.s3_1>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i6.u17.s3_2>=1)))||((i3.u18.s3_0>=1)&&(u4.malicious_reservoir>=1)))))))] = FALSE * ([(FwdU(Init,!(((((((((i2.u1.n8_0_2>=1)&&(i2.u1.n8_0_0>=1))&&(i2.u1.n8_0_1>=1))&&(i2.u10.s5_0>=1))||((((i0.u3.n8_2_2>=1)&&(i0.u3.n8_2_0>=1))&&(i0.u3.n8_2_1>=1))&&(i0.u5.s5_2>=1)))||((((i1.u2.n8_1_1>=1)&&(i1.u2.n8_1_2>=1))&&(u4.s5_1>=1))&&(i1.u2.n8_1_0>=1)))&&((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))||(!((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1))))))) * (!((((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1)))||(!((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1)))))) * !(((((((((i2.u1.n8_0_2>=1)&&(i2.u1.n8_0_0>=1))&&(i2.u1.n8_0_1>=1))&&(i2.u10.s5_0>=1))||((((i0.u3.n8_2_2>=1)&&(i0.u3.n8_2_0>=1))&&(i0.u3.n8_2_1>=1))&&(i0.u5.s5_2>=1)))||((((i1.u2.n8_1_1>=1)&&(i1.u2.n8_1_2>=1))&&(u4.s5_1>=1))&&(i1.u2.n8_1_0>=1)))&&((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))||(!((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1))))))))] = FALSE * [FwdG(Init,!(((((((((i2.u1.n8_0_2>=1)&&(i2.u1.n8_0_0>=1))&&(i2.u1.n8_0_1>=1))&&(i2.u10.s5_0>=1))||((((i0.u3.n8_2_2>=1)&&(i0.u3.n8_2_0>=1))&&(i0.u3.n8_2_1>=1))&&(i0.u5.s5_2>=1)))||((((i1.u2.n8_1_1>=1)&&(i1.u2.n8_1_2>=1))&&(u4.s5_1>=1))&&(i1.u2.n8_1_0>=1)))&&((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))||(!((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1)))))))] = FALSE))
dead was empty
Reverse transition relation is NOT exact ! Due to transitions malS6_1, malS6_0, malS5_0, malS6_2, malC1_0, malC1_2, malC1_1, malS3_2, malS4_2, malS3_0, malS4_0, malS5_2, malS1_2, malS2_2, malS1_0, malS2_0, u4.malS3_1, u4.malS4_1, u4.malS5_1, u4.malS1_1, u4.malS2_1, i5.u6.malA5, i5.u6.malA3, i5.u6.malA1, i5.u6.malA2, i5.u6.malA4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/26/56
(forward)formula 2,0,0.298371,11296,1,0,10211,3027,1491,17601,501,16516,31387
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: ((((((((i3.u18.n4_0>=1)&&(i5.u15.n4_1>=1))&&(i6.u17.n4_2>=1))&&(i5.u6.a3>=1)) * AG((i3.u14.Astart>=1))) + (EX(((((i5.u19.n6_2>=1)&&(i5.u20.n6_1>=1))&&(i5.u16.n6_0>=1))&&(i5.u6.a5>=1))) * (i5.u6.a5>=1))) + !(AF(((((u4.malicious_reservoir>=1)&&(i0.u5.s4_2>=1))||((i2.u10.s4_0>=1)&&(u4.malicious_reservoir>=1)))||((u4.s4_1>=1)&&(u4.malicious_reservoir>=1)))))) + !((!(AX(((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))) + (((!(((i1.u2.s6_1>=1)||(i2.u1.s6_0>=1))||(i0.u3.s6_2>=1)))||(!(i5.u6.a4>=1))) * EX(((((i6.u11.s2_2>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i3.u18.s2_0>=1)))||((u4.malicious_reservoir>=1)&&(u4.s2_1>=1))))))))
=> equivalent forward existential formula: ([((((Init * !(!((!(!(EX(!(((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))))) + (((!(((i1.u2.s6_1>=1)||(i2.u1.s6_0>=1))||(i0.u3.s6_2>=1)))||(!(i5.u6.a4>=1))) * EX(((((i6.u11.s2_2>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i3.u18.s2_0>=1)))||((u4.malicious_reservoir>=1)&&(u4.s2_1>=1))))))))) * !(!(!(EG(!(((((u4.malicious_reservoir>=1)&&(i0.u5.s4_2>=1))||((i2.u10.s4_0>=1)&&(u4.malicious_reservoir>=1)))||((u4.s4_1>=1)&&(u4.malicious_reservoir>=1))))))))) * !((EX(((((i5.u19.n6_2>=1)&&(i5.u20.n6_1>=1))&&(i5.u16.n6_0>=1))&&(i5.u6.a5>=1))) * (i5.u6.a5>=1)))) * !(((((i3.u18.n4_0>=1)&&(i5.u15.n4_1>=1))&&(i6.u17.n4_2>=1))&&(i5.u6.a3>=1))))] = FALSE * [(FwdU((((Init * !(!((!(!(EX(!(((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))))) + (((!(((i1.u2.s6_1>=1)||(i2.u1.s6_0>=1))||(i0.u3.s6_2>=1)))||(!(i5.u6.a4>=1))) * EX(((((i6.u11.s2_2>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i3.u18.s2_0>=1)))||((u4.malicious_reservoir>=1)&&(u4.s2_1>=1))))))))) * !(!(!(EG(!(((((u4.malicious_reservoir>=1)&&(i0.u5.s4_2>=1))||((i2.u10.s4_0>=1)&&(u4.malicious_reservoir>=1)))||((u4.s4_1>=1)&&(u4.malicious_reservoir>=1))))))))) * !((EX(((((i5.u19.n6_2>=1)&&(i5.u20.n6_1>=1))&&(i5.u16.n6_0>=1))&&(i5.u6.a5>=1))) * (i5.u6.a5>=1)))),TRUE) * !((i3.u14.Astart>=1)))] = FALSE)
(forward)formula 3,1,0.367899,12880,1,0,12913,3143,1568,21641,504,17854,38447
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (A(EG((((i1.u2.s6_1>=1)||(i2.u1.s6_0>=1))||(i0.u3.s6_2>=1))) U AF(((((i3.u12.n2_0>=1)&&(i3.u13.n2_1>=1))&&(i6.u11.n2_2>=1))&&(i5.u6.a1>=1)))) * ((i5.u6.a2>=1)||((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1)))))
=> equivalent forward existential formula: [(((Init * ((i5.u6.a2>=1)||((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))) * !(EG(!(!(EG(!(((((i3.u12.n2_0>=1)&&(i3.u13.n2_1>=1))&&(i6.u11.n2_2>=1))&&(i5.u6.a1>=1))))))))) * !(E(!(!(EG(!(((((i3.u12.n2_0>=1)&&(i3.u13.n2_1>=1))&&(i6.u11.n2_2>=1))&&(i5.u6.a1>=1)))))) U (!(EG((((i1.u2.s6_1>=1)||(i2.u1.s6_0>=1))||(i0.u3.s6_2>=1)))) * !(!(EG(!(((((i3.u12.n2_0>=1)&&(i3.u13.n2_1>=1))&&(i6.u11.n2_2>=1))&&(i5.u6.a1>=1))))))))))] != FALSE
(forward)formula 4,0,0.433731,14464,1,0,15090,3178,1609,24532,504,18237,43954
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (EF((AF(((((u4.malicious_reservoir>=1)&&(i0.u5.s4_2>=1))||((i2.u10.s4_0>=1)&&(u4.malicious_reservoir>=1)))||((u4.s4_1>=1)&&(u4.malicious_reservoir>=1)))) + ((i5.u6.a4>=1)||(i5.u6.a1>=1)))) * A(((((((u4.s3_1>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i6.u17.s3_2>=1)))||((i3.u18.s3_0>=1)&&(u4.malicious_reservoir>=1)))&&((((i6.u17.s3_2>=1)&&(i5.u19.n5_2>=1))||((u4.s3_1>=1)&&(i5.u20.n5_1>=1)))||((i3.u18.s3_0>=1)&&(i5.u16.n5_0>=1))))&&(!((((u4.s3_1>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i6.u17.s3_2>=1)))||((i3.u18.s3_0>=1)&&(u4.malicious_reservoir>=1))))) U AF(((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1))))))
=> equivalent forward existential formula: [(((Init * E(TRUE U (!(EG(!(((((u4.malicious_reservoir>=1)&&(i0.u5.s4_2>=1))||((i2.u10.s4_0>=1)&&(u4.malicious_reservoir>=1)))||((u4.s4_1>=1)&&(u4.malicious_reservoir>=1)))))) + ((i5.u6.a4>=1)||(i5.u6.a1>=1))))) * !(EG(!(!(EG(!(((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1)))))))))) * !(E(!(!(EG(!(((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1))))))) U (!(((((((u4.s3_1>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i6.u17.s3_2>=1)))||((i3.u18.s3_0>=1)&&(u4.malicious_reservoir>=1)))&&((((i6.u17.s3_2>=1)&&(i5.u19.n5_2>=1))||((u4.s3_1>=1)&&(i5.u20.n5_1>=1)))||((i3.u18.s3_0>=1)&&(i5.u16.n5_0>=1))))&&(!((((u4.s3_1>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i6.u17.s3_2>=1)))||((i3.u18.s3_0>=1)&&(u4.malicious_reservoir>=1)))))) * !(!(EG(!(((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1)))))))))))] != FALSE
(forward)formula 5,0,0.476612,14992,1,0,16218,3186,1651,25801,505,18441,46787
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: ((((((((((i5.u19.n6_2>=1)&&(i5.u20.n6_1>=1))&&(i5.u16.n6_0>=1))&&(i5.u6.a5>=1))||((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))&&(!((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))) * EF(((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1))))) * !(AF((((i1.u2.s6_1>=1)||(i2.u1.s6_0>=1))||(i0.u3.s6_2>=1))))) + EX(((((((i2.u10.s5_0>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(u4.s5_1>=1)))||((i0.u5.s5_2>=1)&&(u4.malicious_reservoir>=1)))&&((((i6.u11.s2_2>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i3.u18.s2_0>=1)))||((u4.malicious_reservoir>=1)&&(u4.s2_1>=1))))||(((((u4.malicious_reservoir>=1)&&(i1.u0.c1_0>=1))||((u4.malicious_reservoir>=1)&&(i1.u0.c1_2>=1)))||((i1.u0.c1_1>=1)&&(u4.malicious_reservoir>=1)))&&((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))))) + ((AX(((i5.u6.a2>=1)||((((i6.u17.s3_2>=1)&&(i5.u19.n5_2>=1))||((u4.s3_1>=1)&&(i5.u20.n5_1>=1)))||((i3.u18.s3_0>=1)&&(i5.u16.n5_0>=1))))) + EX((((((i3.u12.n2_0>=1)&&(i3.u13.n2_1>=1))&&(i6.u11.n2_2>=1))&&(i5.u6.a1>=1))||((((i2.u10.s5_0>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(u4.s5_1>=1)))||((i0.u5.s5_2>=1)&&(u4.malicious_reservoir>=1)))))) + AF((((i1.u2.s6_1>=1)||(i2.u1.s6_0>=1))||(i0.u3.s6_2>=1)))))
=> equivalent forward existential formula: [FwdG(((Init * !((((((((((i5.u19.n6_2>=1)&&(i5.u20.n6_1>=1))&&(i5.u16.n6_0>=1))&&(i5.u6.a5>=1))||((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))&&(!((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))) * E(TRUE U ((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1))||((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))||((i3.u18.s2_0>=1)&&(i3.u18.n3_0>=1))))) * !(!(EG(!((((i1.u2.s6_1>=1)||(i2.u1.s6_0>=1))||(i0.u3.s6_2>=1))))))) + EX(((((((i2.u10.s5_0>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(u4.s5_1>=1)))||((i0.u5.s5_2>=1)&&(u4.malicious_reservoir>=1)))&&((((i6.u11.s2_2>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(i3.u18.s2_0>=1)))||((u4.malicious_reservoir>=1)&&(u4.s2_1>=1))))||(((((u4.malicious_reservoir>=1)&&(i1.u0.c1_0>=1))||((u4.malicious_reservoir>=1)&&(i1.u0.c1_2>=1)))||((i1.u0.c1_1>=1)&&(u4.malicious_reservoir>=1)))&&((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))))))) * !((!(EX(!(((i5.u6.a2>=1)||((((i6.u17.s3_2>=1)&&(i5.u19.n5_2>=1))||((u4.s3_1>=1)&&(i5.u20.n5_1>=1)))||((i3.u18.s3_0>=1)&&(i5.u16.n5_0>=1))))))) + EX((((((i3.u12.n2_0>=1)&&(i3.u13.n2_1>=1))&&(i6.u11.n2_2>=1))&&(i5.u6.a1>=1))||((((i2.u10.s5_0>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(u4.s5_1>=1)))||((i0.u5.s5_2>=1)&&(u4.malicious_reservoir>=1)))))))),!((((i1.u2.s6_1>=1)||(i2.u1.s6_0>=1))||(i0.u3.s6_2>=1))))] = FALSE
(forward)formula 6,0,0.53475,15520,1,0,17851,3215,1709,27623,505,18564,51276
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX(EG(AF(((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(!(((((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))||((u4.malicious_reservoir>=1)&&(i6.u11.Sstart_2>=1)))||((u4.malicious_reservoir>=1)&&(i3.u12.Sstart_0>=1)))))))))] = FALSE
(forward)formula 7,0,0.565178,16048,1,0,18546,3216,1724,28368,505,18610,53165
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: ((!(((i0.u5.s5_2>=1)&&(u4.malicious_reservoir>=1))) * !((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1)) + AF(((u4.malicious_reservoir>=1)&&(u4.s2_1>=1)))))) * !(AG(AX((i2.u1.s6_0>=1)))))
=> equivalent forward existential formula: [(EY(FwdU((Init * (!(((i0.u5.s5_2>=1)&&(u4.malicious_reservoir>=1))) * !((((i6.u11.s2_2>=1)&&(i6.u17.n3_2>=1)) + !(EG(!(((u4.malicious_reservoir>=1)&&(u4.s2_1>=1))))))))),TRUE)) * !((i2.u1.s6_0>=1)))] != FALSE
(forward)formula 8,1,0.58049,16576,1,0,18943,3216,1746,28902,507,18619,54385
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (AF((((((u4.s3_1>=1)&&(i5.u20.n5_1>=1))&&(i0.u5.s4_2>=1))||(!((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))) * AG((i0.u5.s4_2>=1)))) + ((i6.u17.s3_2>=1)&&(i5.u19.n5_2>=1)))
=> equivalent forward existential formula: [FwdG((Init * !(((i6.u17.s3_2>=1)&&(i5.u19.n5_2>=1)))),!((((((u4.s3_1>=1)&&(i5.u20.n5_1>=1))&&(i0.u5.s4_2>=1))||(!((u4.s2_1>=1)&&(i5.u15.n3_1>=1)))) * !(E(TRUE U !((i0.u5.s4_2>=1)))))))] = FALSE
(forward)formula 9,0,0.584307,16840,1,0,18968,3216,1754,28925,508,18620,54638
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF((i5.u6.a5>=1))
=> equivalent forward existential formula: [FwdG(Init,!((i5.u6.a5>=1)))] = FALSE
(forward)formula 10,0,0.587145,16840,1,0,19105,3216,1769,29073,509,18627,55192
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX(AF(((((i2.u10.s5_0>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(u4.s2_1>=1)))||(((u4.malicious_reservoir>=1)&&(i3.u18.s2_0>=1))&&((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((((i2.u10.s5_0>=1)&&(u4.malicious_reservoir>=1))||((u4.malicious_reservoir>=1)&&(u4.s2_1>=1)))||(((u4.malicious_reservoir>=1)&&(i3.u18.s2_0>=1))&&((u4.malicious_reservoir>=1)&&(u4.Sstart_1>=1))))))] = FALSE
(forward)formula 11,0,0.590747,16840,1,0,19231,3216,1800,29190,511,18627,55825
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF((EF(((i5.u6.a5>=1)||((i6.u11.Sstart_2>=1)&&(i6.u11.n1_2>=1)))) * !(EX(((i3.u12.Sstart_0>=1)&&(i3.u14.n1_0>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((i5.u6.a5>=1)||((i6.u11.Sstart_2>=1)&&(i6.u11.n1_2>=1)))) * !(EX(((i3.u12.Sstart_0>=1)&&(i3.u14.n1_0>=1)))))))] = FALSE
(forward)formula 12,0,0.597377,16840,1,0,19616,3217,1816,29608,512,18628,56749
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (EF(((i5.u6.a2>=1)&&((u4.malicious_reservoir>=1)&&(i6.u17.s3_2>=1)))) + AX((AF((i5.u6.a5>=1)) * !((((((i2.u10.n7_0_2>=1)&&(i2.u1.Cstart_2>=1))&&(u4.n7_1_2>=1))&&(i0.u5.n7_2_2>=1))||((((i3.u18.n4_0>=1)&&(i5.u15.n4_1>=1))&&(i6.u17.n4_2>=1))&&(i5.u6.a3>=1)))))))
=> equivalent forward existential formula: ([FwdG(EY((Init * !(E(TRUE U ((i5.u6.a2>=1)&&((u4.malicious_reservoir>=1)&&(i6.u17.s3_2>=1))))))),!((i5.u6.a5>=1)))] = FALSE * [(EY((Init * !(E(TRUE U ((i5.u6.a2>=1)&&((u4.malicious_reservoir>=1)&&(i6.u17.s3_2>=1))))))) * (((((i2.u10.n7_0_2>=1)&&(i2.u1.Cstart_2>=1))&&(u4.n7_1_2>=1))&&(i0.u5.n7_2_2>=1))||((((i3.u18.n4_0>=1)&&(i5.u15.n4_1>=1))&&(i6.u17.n4_2>=1))&&(i5.u6.a3>=1))))] = FALSE)
(forward)formula 13,0,0.603358,17104,1,0,19674,3217,1833,29678,512,18628,57202
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(AG((i5.u6.a5>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((i5.u6.a5>=1))))))] = FALSE
(forward)formula 14,0,0.605622,17104,1,0,19775,3217,1833,29791,512,18628,57401
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(((((i5.u19.n6_2>=1)&&(i5.u20.n6_1>=1))&&(i5.u16.n6_0>=1))&&(i5.u6.a5>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((i5.u19.n6_2>=1)&&(i5.u20.n6_1>=1))&&(i5.u16.n6_0>=1))&&(i5.u6.a5>=1))))] = FALSE
(forward)formula 15,0,0.609875,17104,1,0,20019,3217,1843,30035,512,18628,58003
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1527893269531

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 01, 2018 10:47:46 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 01, 2018 10:47:46 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 10:47:46 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 92 ms
Jun 01, 2018 10:47:46 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 86 places.
Jun 01, 2018 10:47:46 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
Jun 01, 2018 10:47:46 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 14 ms
Jun 01, 2018 10:47:46 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 01, 2018 10:47:46 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 52 ms
Jun 01, 2018 10:47:46 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 38 ms
Begin: Fri Jun 1 22:47:47 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Fri Jun 1 22:47:47 2018
network size: 86 nodes, 368 links, 112 weight
quality increased from -0.0453205 to 0.437669
end computation: Fri Jun 1 22:47:47 2018
level 1:
start computation: Fri Jun 1 22:47:47 2018
network size: 21 nodes, 147 links, 112 weight
quality increased from 0.437669 to 0.48581
end computation: Fri Jun 1 22:47:47 2018
level 2:
start computation: Fri Jun 1 22:47:47 2018
network size: 9 nodes, 57 links, 112 weight
quality increased from 0.48581 to 0.490394
end computation: Fri Jun 1 22:47:47 2018
level 3:
start computation: Fri Jun 1 22:47:47 2018
network size: 7 nodes, 39 links, 112 weight
quality increased from 0.490394 to 0.490394
end computation: Fri Jun 1 22:47:47 2018
End: Fri Jun 1 22:47:47 2018
Total duration: 0 sec
0.490394
Jun 01, 2018 10:47:47 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2018 10:47:47 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 26 ms
Jun 01, 2018 10:47:47 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 01, 2018 10:47:47 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 19 redundant transitions.
Jun 01, 2018 10:47:47 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 18 ms
Jun 01, 2018 10:47:47 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 7 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="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstoolsl"
export BK_RESULT_DIR="/tmp/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/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is QuasiCertifProtocol-PT-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r141-qhx2-152673582600060"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;