Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r266-smll-167863540500121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is NeoElection-COL-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540500121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.2K Feb 26 15:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 15:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 16:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 16:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 26 16:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 75K Mar 5 18:23 model.pnml

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

=== Now, execution of the tool begins

BK_START 1678806081461

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 15:01:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 15:01:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:01:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 15:01:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 15:01:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 781 ms
[2023-03-14 15:01:24] [INFO ] Detected 6 constant HL places corresponding to 448 PT places.
[2023-03-14 15:01:24] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
[2023-03-14 15:01:24] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 24 ms.
[2023-03-14 15:01:24] [INFO ] Skeletonized 16 HLPN properties in 5 ms.
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-3-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Incomplete random walk after 10000 steps, including 397 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-03-14 15:01:25] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-14 15:01:26] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 15:01:26] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
FORMULA NeoElection-COL-3-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 15:01:26] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-14 15:01:26] [INFO ] Flatten gal took : 19 ms
FORMULA NeoElection-COL-3-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 15:01:26] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(4), POS(3), M(4)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 3)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-14 15:01:26] [INFO ] Unfolded HLPN to a Petri net with 972 places and 848 transitions 4688 arcs in 89 ms.
[2023-03-14 15:01:26] [INFO ] Unfolded 8 HLPN properties in 2 ms.
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 901 places and 790 transitions.
Reduce places removed 4 places and 0 transitions.
Support contains 45 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 58/58 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 58
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 58 transition count 49
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 58 transition count 49
Applied a total of 12 rules in 14 ms. Remains 58 /67 variables (removed 9) and now considering 49/58 (removed 9) transitions.
[2023-03-14 15:01:26] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 58 cols
[2023-03-14 15:01:26] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-14 15:01:26] [INFO ] Implicit Places using invariants in 126 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 129 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/67 places, 49/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 49/67 places, 49/58 transitions.
Support contains 45 out of 49 places after structural reductions.
[2023-03-14 15:01:26] [INFO ] Flatten gal took : 19 ms
[2023-03-14 15:01:26] [INFO ] Flatten gal took : 16 ms
[2023-03-14 15:01:26] [INFO ] Input system was already deterministic with 49 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-14 15:01:27] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 49 cols
[2023-03-14 15:01:27] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-14 15:01:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 15:01:28] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2023-03-14 15:01:28] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 9 ms
FORMULA NeoElection-COL-3-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 8 ms
[2023-03-14 15:01:28] [INFO ] Input system was already deterministic with 49 transitions.
FORMULA NeoElection-COL-3-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 49 stabilizing places and 49 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 49
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 49/49 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 44 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 44 transition count 43
Applied a total of 10 rules in 4 ms. Remains 44 /49 variables (removed 5) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 44/49 places, 43/49 transitions.
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 5 ms
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 5 ms
[2023-03-14 15:01:28] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 49/49 places, 49/49 transitions.
Reduce places removed 3 places and 3 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /49 variables (removed 3) and now considering 46/49 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 46/49 places, 46/49 transitions.
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 5 ms
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 5 ms
[2023-03-14 15:01:28] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 49/49 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 44 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 44 transition count 43
Applied a total of 10 rules in 3 ms. Remains 44 /49 variables (removed 5) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 44/49 places, 43/49 transitions.
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 4 ms
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 4 ms
[2023-03-14 15:01:28] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 49/49 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 44 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 44 transition count 43
Applied a total of 10 rules in 3 ms. Remains 44 /49 variables (removed 5) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 44/49 places, 43/49 transitions.
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 4 ms
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 4 ms
[2023-03-14 15:01:28] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 49/49 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 44 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 44 transition count 43
Applied a total of 10 rules in 2 ms. Remains 44 /49 variables (removed 5) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/49 places, 43/49 transitions.
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 4 ms
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 5 ms
[2023-03-14 15:01:28] [INFO ] Input system was already deterministic with 43 transitions.
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 4 ms
[2023-03-14 15:01:28] [INFO ] Flatten gal took : 5 ms
[2023-03-14 15:01:28] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-14 15:01:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 49 places, 49 transitions and 185 arcs took 1 ms.
Total runtime 4472 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 49 NrTr: 49 NrArc: 185)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 3.472sec


RS generation: 0m 0.155sec


-> reachability set: #nodes 8586 (8.6e+03) #states 424,713 (5)



starting MCC model checker
--------------------------

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 424,713 (5)
.-> the formula is TRUE

FORMULA NeoElection-COL-3-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.119sec

checking: AX [AX [1<=0]]
normalized: ~ [EX [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
..-> the formula is FALSE

FORMULA NeoElection-COL-3-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EF [EG [AX [1<=0]]]
normalized: E [true U EG [~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
..
EG iterations: 1
-> the formula is TRUE

FORMULA NeoElection-COL-3-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.167sec

checking: AX [sum(p33, p32, p31)<=0]
normalized: ~ [EX [~ [sum(p33, p32, p31)<=0]]]

abstracting: (sum(p33, p32, p31)<=0)
states: 126,301 (5)
.-> the formula is TRUE

FORMULA NeoElection-COL-3-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.104sec

checking: EF [[~ [sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8, p7)<=sum(p36, p35, p34)] & A [sum(p39, p38, p37)<=0 U EG [sum(p33, p32, p31)<=0]]]]
normalized: E [true U [[~ [EG [~ [EG [sum(p33, p32, p31)<=0]]]] & ~ [E [~ [EG [sum(p33, p32, p31)<=0]] U [~ [sum(p39, p38, p37)<=0] & ~ [EG [sum(p33, p32, p31)<=0]]]]]] & ~ [sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8, p7)<=sum(p36, p35, p34)]]]

abstracting: (sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8, p7)<=sum(p36, p35, p34))
states: 3,457 (3)
abstracting: (sum(p33, p32, p31)<=0)
states: 126,301 (5)
..............
EG iterations: 14
abstracting: (sum(p39, p38, p37)<=0)
states: 126,301 (5)
abstracting: (sum(p33, p32, p31)<=0)
states: 126,301 (5)
..............
EG iterations: 14
abstracting: (sum(p33, p32, p31)<=0)
states: 126,301 (5)
..............
EG iterations: 14

EG iterations: 0
-> the formula is FALSE

FORMULA NeoElection-COL-3-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m32.304sec

totally nodes used: 311365 (3.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 565615 1412794 1978409
used/not used/entry size/cache size: 1625541 65483323 16 1024MB
basic ops cache: hits/miss/sum: 126859 284775 411634
used/not used/entry size/cache size: 479416 16297800 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 134217741 134217741
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 7581 16004 23585
used/not used/entry size/cache size: 15990 8372618 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66813598
1 281147
2 12345
3 1587
4 171
5 14
6 1
7 1
8 0
9 0
>= 10 0

Total processing time: 1m37.976sec


BK_STOP 1678806187323

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1456 (29), effective:93 (1)

initing FirstDep: 0m 0.000sec


iterations count:1708 (34), effective:122 (2)

iterations count:600 (12), effective:43 (0)

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="NeoElection-COL-3"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is NeoElection-COL-3, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540500121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-3.tgz
mv NeoElection-COL-3 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;