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 204K
-rw-r--r-- 1 mcc users 3.9K 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 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.7K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 34K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is QuasiCertifProtocol-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r190-qhx2-152732141800041
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528353714107


BK_STOP 1528353790854

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-COL-02 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 129, 'Memory': 106.48, 'Tool': 'lola'}, {'Time': 167, 'Memory': 106.75, 'Tool': 'lola'}, {'Time': 5968, 'Memory': 349.87, 'Tool': 'itstools'}, {'Time': 6771, 'Memory': 349.78, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 46.263565891472865x far from the best tool lola.
LTLCardinality itstools QuasiCertifProtocol-COL-02...
Jun 07, 2018 6:42:18 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-z3path, /usr/bin/z3, -yices2path, /usr/bin/yices, -ltsminpath, /usr/bin, -smt, -its, -pnfolder, /mcc-data, -examination, LTLCardinality]
Jun 07, 2018 6:42:18 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
Jun 07, 2018 6:42:19 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
06:43:00.397 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
06:43:00.403 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Jun 07, 2018 6:43:01 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 42602 ms
Jun 07, 2018 6:43:01 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 30 places.
Jun 07, 2018 6:43:01 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 07, 2018 6:43:01 AM 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,

Jun 07, 2018 6:43:01 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 26 transitions.
Jun 07, 2018 6:43:01 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 07, 2018 6:43:01 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 25 ms
Jun 07, 2018 6:43:01 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 160 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
Jun 07, 2018 6:43:03 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLCardinality.pnml.gal : 9 ms
Jun 07, 2018 6:43:03 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLCardinality.ltl : 12 ms
Invoking ITS tools like this :CommandLine [args=[/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /mcc-data/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /mcc-data/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/mcc-data]

its-ltl command run as :

/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64 --gc-threshold 2000000 -i /mcc-data/LTLCardinality.pnml.gal -t CGAL -LTL /mcc-data/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("(((n1_0+n1_1)+n1_2)>=2)"))
Formula 0 simplified : !"(((n1_0+n1_1)+n1_2)>=2)"
Jun 07, 2018 6:43:04 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 42 transitions. Expanding to a total of 63 deterministic transitions.
Jun 07, 2018 6:43:04 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 9 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 86 cols
invariant :n9_5 + -1'SstopOK_1 + CstopOK_2 = 0
invariant :n6_1 + -1'n6_2 + n5_1 + -1'n5_2 = 0
invariant :n4_1 + -1'n4_2 + n3_1 + -1'n3_2 = 0
invariant :n8_1 + -1'n8_2 + Cstart_1 + -1'Cstart_2 = 0
invariant :n6_0 + -1'n6_2 + n5_0 + -1'n5_2 = 0
invariant :n7_6 + -1'n7_8 + -1'Cstart_0 + Cstart_2 = 0
invariant :n7_4 + -1'n7_5 + -1'Cstart_1 + Cstart_2 = 0
invariant :n9_0 + -1'SstopOK_0 + CstopOK_0 = 0
invariant :n7_3 + -1'n7_5 + -1'Cstart_0 + Cstart_2 = 0
invariant :n9_2 + -1'SstopOK_0 + CstopOK_2 = 0
invariant :n8_0 + -1'n8_2 + Cstart_0 + -1'Cstart_2 = 0
invariant :n8_4 + -1'n8_5 + Cstart_1 + -1'Cstart_2 = 0
invariant :CstopAbort_0 + c1_0 + c1_1 + c1_2 + Cstart_0 + Cstart_1 + Cstart_2 + CstopOK_0 + CstopOK_1 + CstopOK_2 = 3
invariant :n9_6 + -1'SstopOK_2 + CstopOK_0 = 0
invariant :AstopAbort_0 + a5_0 + a4_0 + a3_0 + a2_0 + a1_0 + Astart_0 + AstopOK_0 = 1
invariant :n9_3 + -1'SstopOK_1 + CstopOK_0 = 0
invariant :n9_1 + -1'SstopOK_0 + CstopOK_1 = 0
invariant :n8_7 + -1'n8_8 + Cstart_1 + -1'Cstart_2 = 0
invariant :n4_0 + -1'n4_2 + n3_0 + -1'n3_2 = 0
invariant :n8_3 + -1'n8_5 + Cstart_0 + -1'Cstart_2 = 0
invariant :malicious_reservoir_0 + -1'c1_0 + -1'c1_1 + -1'c1_2 + -1'Cstart_0 + -1'Cstart_1 + -1'Cstart_2 + -1'Sstart_0 + -1'Sstart_1 + -1'Sstart_2 + -1's2_0 + -1's2_1 + -1's2_2 + -1's3_0 + -1's3_1 + -1's3_2 + -1's4_0 + -1's4_1 + -1's4_2 + -1's5_0 + -1's5_1 + -1's5_2 + -1's6_0 + -1's6_1 + -1's6_2 + -1'SstopOK_0 + -1'SstopOK_1 + -1'SstopOK_2 + -1'CstopOK_0 + -1'CstopOK_1 + -1'CstopOK_2 = -5
invariant :n9_7 + -1'SstopOK_2 + CstopOK_1 = 0
invariant :n7_1 + -1'n7_2 + -1'Cstart_1 + Cstart_2 = 0
invariant :n2_0 + -1'n2_2 + n1_0 + -1'n1_2 = 0
invariant :n9_8 + -1'SstopOK_2 + CstopOK_2 = 0
invariant :SstopAbort_0 + 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 = 3
invariant :n9_4 + -1'SstopOK_1 + CstopOK_1 = 0
invariant :n8_6 + -1'n8_8 + Cstart_0 + -1'Cstart_2 = 0
invariant :n7_0 + -1'n7_2 + -1'Cstart_0 + Cstart_2 = 0
invariant :n2_1 + -1'n2_2 + n1_1 + -1'n1_2 = 0
invariant :n7_7 + -1'n7_8 + -1'Cstart_1 + Cstart_2 = 0
Jun 07, 2018 6:43:04 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 31 place invariants in 71 ms
Jun 07, 2018 6:43:05 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 86 variables to be positive in 676 ms
Jun 07, 2018 6:43:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 56 transitions.
Jun 07, 2018 6:43:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/56 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 07, 2018 6:43:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 07, 2018 6:43:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 56 transitions.
Jun 07, 2018 6:43:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions malC1, malS6, malS5, malS4, malS3, malS2, malS1, malA5, malA3, malA4, malA2, malA1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/12/42
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
189 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,2.18103,30736,1,0,158,60524,110,106,2492,55625,195
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(X(G("(((n6_0+n6_1)+n6_2)<=((SstopOK_0+SstopOK_1)+SstopOK_2))"))))))
Formula 1 simplified : !XXXG"(((n6_0+n6_1)+n6_2)<=((SstopOK_0+SstopOK_1)+SstopOK_2))"
Computing Next relation with stutter on 47 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
13 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,2.32511,32136,1,0,208,66537,116,180,2508,65851,334
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X("(SstopAbort_0>=3)")))
Formula 2 simplified : !X"(SstopAbort_0>=3)"
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 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,2.33699,32136,1,0,208,66662,119,180,2510,66157,341
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((n3_0+n3_1)+n3_2)>=3)"))
Formula 3 simplified : !"(((n3_0+n3_1)+n3_2)>=3)"
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,2.34329,32400,1,0,208,66662,122,180,2514,66158,343
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(F("(CstopAbort_0>=1)")))))
Formula 4 simplified : !GF"(CstopAbort_0>=1)"
Computing Next relation with stutter on 47 deadlock states
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 items max in DFS search stack
18 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,2.52136,33792,1,0,239,68899,131,267,2516,74680,594
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(((Sstart_0+Sstart_1)+Sstart_2)>=1)"))
Formula 5 simplified : !"(((Sstart_0+Sstart_1)+Sstart_2)>=1)"
Computing Next relation with stutter on 47 deadlock states
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,2.52587,33792,1,0,239,68899,134,267,2520,74680,596
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("(((s6_0+s6_1)+s6_2)<=((n4_0+n4_1)+n4_2))")U(F("(AstopAbort_0<=a1_0)"))))
Formula 6 simplified : !("(((s6_0+s6_1)+s6_2)<=((n4_0+n4_1)+n4_2))" U F"(AstopAbort_0<=a1_0)")
Computing Next relation with stutter on 47 deadlock states
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,2.53536,34052,1,0,239,68899,143,267,2523,74682,600
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(((Sstart_0+Sstart_1)+Sstart_2)<=((((((((n8_0+n8_1)+n8_2)+n8_3)+n8_4)+n8_5)+n8_6)+n8_7)+n8_8))"))
Formula 7 simplified : !"(((Sstart_0+Sstart_1)+Sstart_2)<=((((((((n8_0+n8_1)+n8_2)+n8_3)+n8_4)+n8_5)+n8_6)+n8_7)+n8_8))"
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,2.5377,34052,1,0,239,68899,146,267,2536,74682,602
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F(G("(((n4_0+n4_1)+n4_2)<=((s4_0+s4_1)+s4_2))")))U(X(G("(((n2_0+n2_1)+n2_2)<=a5_0)")))))
Formula 8 simplified : !(FG"(((n4_0+n4_1)+n4_2)<=((s4_0+s4_1)+s4_2))" U XG"(((n2_0+n2_1)+n2_2)<=a5_0)")
Computing Next relation with stutter on 47 deadlock states
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
60 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,3.1576,39808,1,0,383,89433,165,474,2590,108017,1070
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("(((s3_0+s3_1)+s3_2)<=AstopOK_0)")U(F("(((n1_0+n1_1)+n1_2)<=a4_0)"))))
Formula 9 simplified : !("(((s3_0+s3_1)+s3_2)<=AstopOK_0)" U F"(((n1_0+n1_1)+n1_2)<=a4_0)")
Computing Next relation with stutter on 47 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,3.16199,39808,1,0,383,89433,174,474,2595,108017,1074
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F("(a3_0>=1)")))
Formula 10 simplified : !F"(a3_0>=1)"
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16 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,3.3331,40336,1,0,411,93405,183,505,2596,113831,1154
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(X(G(X("(((CstopOK_0+CstopOK_1)+CstopOK_2)>=2)"))))))
Formula 11 simplified : !FXGX"(((CstopOK_0+CstopOK_1)+CstopOK_2)>=2)"
Computing Next relation with stutter on 47 deadlock states
34 unique states visited
33 strongly connected components in search stack
36 transitions explored
34 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,3.37669,40572,1,0,493,94107,188,591,2603,123677,1334
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(G("(((((((((n7_0+n7_1)+n7_2)+n7_3)+n7_4)+n7_5)+n7_6)+n7_7)+n7_8)>=2)"))))
Formula 12 simplified : !G"(((((((((n7_0+n7_1)+n7_2)+n7_3)+n7_4)+n7_5)+n7_6)+n7_7)+n7_8)>=2)"
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,3.38472,40828,1,0,493,94107,194,591,2621,123678,1339
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((("(AstopAbort_0<=((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8))")U(("(AstopOK_0<=((s5_0+s5_1)+s5_2))")U("(malicious_reservoir_0>=3)"))))
Formula 13 simplified : !("(AstopAbort_0<=((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8))" U ("(AstopOK_0<=((s5_0+s5_1)+s5_2))" U "(malicious_reservoir_0>=3)"))
Computing Next relation with stutter on 47 deadlock states
20 unique states visited
20 strongly connected components in search stack
20 transitions explored
20 items max in DFS search stack
51 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,3.90512,45476,1,0,627,112879,219,731,2751,151822,1668
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((F(F("(a2_0<=a3_0)")))U(X(X("(((SstopOK_0+SstopOK_1)+SstopOK_2)>=3)")))))
Formula 14 simplified : !(F"(a2_0<=a3_0)" U XX"(((SstopOK_0+SstopOK_1)+SstopOK_2)>=3)")
Computing Next relation with stutter on 47 deadlock states
33 unique states visited
30 strongly connected components in search stack
36 transitions explored
30 items max in DFS search stack
11 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,4.03231,46656,1,0,725,116109,230,884,2765,161120,2024
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X((X("(a4_0>=1)"))U(G("(((n1_0+n1_1)+n1_2)>=3)")))))
Formula 15 simplified : !X(X"(a4_0>=1)" U G"(((n1_0+n1_1)+n1_2)>=3)")
Computing Next relation with stutter on 47 deadlock states
30 unique states visited
30 strongly connected components in search stack
30 transitions explored
30 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,4.13725,48032,1,0,737,117278,236,895,2777,162566,2181
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

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-COL-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-full"
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-COL-02.tgz
mv QuasiCertifProtocol-COL-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 mcc4mcc-full"
echo " Input is QuasiCertifProtocol-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r190-qhx2-152732141800041"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;