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.r330-tall-167889203300465.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 Referendum-PT-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203300465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 11K Feb 26 17:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 147K Feb 26 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12K 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 Referendum-PT-0010-CTLCardinality-00
FORMULA_NAME Referendum-PT-0010-CTLCardinality-01
FORMULA_NAME Referendum-PT-0010-CTLCardinality-02
FORMULA_NAME Referendum-PT-0010-CTLCardinality-03
FORMULA_NAME Referendum-PT-0010-CTLCardinality-04
FORMULA_NAME Referendum-PT-0010-CTLCardinality-05
FORMULA_NAME Referendum-PT-0010-CTLCardinality-06
FORMULA_NAME Referendum-PT-0010-CTLCardinality-07
FORMULA_NAME Referendum-PT-0010-CTLCardinality-08
FORMULA_NAME Referendum-PT-0010-CTLCardinality-09
FORMULA_NAME Referendum-PT-0010-CTLCardinality-10
FORMULA_NAME Referendum-PT-0010-CTLCardinality-11
FORMULA_NAME Referendum-PT-0010-CTLCardinality-12
FORMULA_NAME Referendum-PT-0010-CTLCardinality-13
FORMULA_NAME Referendum-PT-0010-CTLCardinality-14
FORMULA_NAME Referendum-PT-0010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679164155992

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=Referendum-PT-0010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 18:29:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 18:29:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:29:17] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-18 18:29:17] [INFO ] Transformed 31 places.
[2023-03-18 18:29:17] [INFO ] Transformed 21 transitions.
[2023-03-18 18:29:17] [INFO ] Found NUPN structural information;
[2023-03-18 18:29:17] [INFO ] Parsed PT model containing 31 places and 21 transitions and 51 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2023-03-18 18:29:17] [INFO ] Computed 10 place invariants in 9 ms
[2023-03-18 18:29:17] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-18 18:29:17] [INFO ] Invariant cache hit.
[2023-03-18 18:29:17] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-18 18:29:17] [INFO ] Invariant cache hit.
[2023-03-18 18:29:17] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 31/31 places, 21/21 transitions.
Support contains 31 out of 31 places after structural reductions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 15 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 4 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10000 steps, including 833 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 42) seen :24
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-18 18:29:18] [INFO ] Invariant cache hit.
[2023-03-18 18:29:18] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :18 sat :0
Fused 18 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 18 atomic propositions for a total of 15 simplifications.
FORMULA Referendum-PT-0010-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 31 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 21
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.
FORMULA Referendum-PT-0010-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 31/31 places, 21/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 21
Applied a total of 10 rules in 1 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/31 places, 21/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 11 transition count 11
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 2 transition count 2
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 2 transition count 2
Applied a total of 48 rules in 3 ms. Remains 2 /31 variables (removed 29) and now considering 2/21 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 2/31 places, 2/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 21 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 21 transition count 21
Applied a total of 2 rules in 5 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 21/31 places, 21/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 13 transition count 13
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 7 transition count 7
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 7 transition count 7
Applied a total of 38 rules in 0 ms. Remains 7 /31 variables (removed 24) and now considering 7/21 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 7/31 places, 7/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 12 transition count 12
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 5 transition count 5
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 5 transition count 5
Applied a total of 42 rules in 1 ms. Remains 5 /31 variables (removed 26) and now considering 5/21 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 5/31 places, 5/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 16 transition count 16
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 13 transition count 13
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 13 transition count 13
Applied a total of 26 rules in 1 ms. Remains 13 /31 variables (removed 18) and now considering 13/21 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/31 places, 13/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 4 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 4 transition count 4
Applied a total of 3 rules in 1 ms. Remains 4 /31 variables (removed 27) and now considering 4/21 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 4/31 places, 4/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 8 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 8
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 8 transition count 8
Applied a total of 3 rules in 2 ms. Remains 8 /31 variables (removed 23) and now considering 8/21 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 8/31 places, 8/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 18 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 16 transition count 15
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 16 transition count 15
Applied a total of 21 rules in 1 ms. Remains 16 /31 variables (removed 15) and now considering 15/21 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/31 places, 15/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 3 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /31 variables (removed 29) and now considering 2/21 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 2/31 places, 2/21 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:18] [INFO ] Input system was already deterministic with 2 transitions.
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:29:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:29:18] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 18:29:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 21 transitions and 51 arcs took 0 ms.
Total runtime 1594 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: 31 NrTr: 21 NrArc: 51)

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

net check time: 0m 0.000sec

init dd package: 0m 2.719sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 299 (3.0e+02) #states 59,050 (4)



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

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

abstracting: (0<=0)
states: 59,050 (4)
.............
EG iterations: 12
.-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EG [EF [[p8<=0 & 0<=p8]]]
normalized: EG [E [true U [p8<=0 & 0<=p8]]]

abstracting: (0<=p8)
states: 59,050 (4)
abstracting: (p8<=0)
states: 39,367 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [AX [[[p7<=0 & 0<=p7] | [p26<=1 & 1<=p26]]]]
normalized: EG [~ [EX [~ [[[p26<=1 & 1<=p26] | [p7<=0 & 0<=p7]]]]]]

abstracting: (0<=p7)
states: 59,050 (4)
abstracting: (p7<=0)
states: 39,367 (4)
abstracting: (1<=p26)
states: 19,683 (4)
abstracting: (p26<=1)
states: 59,050 (4)
..
EG iterations: 1
-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [EF [[[p10<=0 & 0<=p10] | [p21<=1 & 1<=p21]]]]
normalized: EG [E [true U [[p21<=1 & 1<=p21] | [p10<=0 & 0<=p10]]]]

abstracting: (0<=p10)
states: 59,050 (4)
abstracting: (p10<=0)
states: 39,367 (4)
abstracting: (1<=p21)
states: 19,683 (4)
abstracting: (p21<=1)
states: 59,050 (4)
..........
EG iterations: 10
-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: E [AG [~ [AX [EX [[[p11<=0 & 0<=p11] | [p8<=1 & 1<=p8]]]]]] U EF [EG [[[p28<=0 & 0<=p28] | [p23<=1 & 1<=p23]]]]]
normalized: E [~ [E [true U ~ [EX [~ [EX [[[p8<=1 & 1<=p8] | [p11<=0 & 0<=p11]]]]]]]] U E [true U EG [[[p28<=0 & 0<=p28] | [p23<=1 & 1<=p23]]]]]

abstracting: (1<=p23)
states: 19,683 (4)
abstracting: (p23<=1)
states: 59,050 (4)
abstracting: (0<=p28)
states: 59,050 (4)
abstracting: (p28<=0)
states: 39,367 (4)
.
EG iterations: 1
abstracting: (0<=p11)
states: 59,050 (4)
abstracting: (p11<=0)
states: 39,367 (4)
abstracting: (1<=p8)
states: 19,683 (4)
abstracting: (p8<=1)
states: 59,050 (4)
..-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: E [~ [AF [[AF [EG [[p4<=1 & 1<=p4]]] | ~ [AF [[[p6<=0 & 0<=p6] | [p23<=1 & 1<=p23]]]]]]] U EG [[[p7<=0 & 0<=p7] | [p27<=1 & 1<=p27]]]]
normalized: E [EG [~ [[EG [~ [[[p23<=1 & 1<=p23] | [p6<=0 & 0<=p6]]]] | ~ [EG [~ [EG [[p4<=1 & 1<=p4]]]]]]]] U EG [[[p27<=1 & 1<=p27] | [p7<=0 & 0<=p7]]]]

abstracting: (0<=p7)
states: 59,050 (4)
abstracting: (p7<=0)
states: 39,367 (4)
abstracting: (1<=p27)
states: 19,683 (4)
abstracting: (p27<=1)
states: 59,050 (4)
.
EG iterations: 1
abstracting: (1<=p4)
states: 19,683 (4)
abstracting: (p4<=1)
states: 59,050 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p6)
states: 59,050 (4)
abstracting: (p6<=0)
states: 39,367 (4)
abstracting: (1<=p23)
states: 19,683 (4)
abstracting: (p23<=1)
states: 59,050 (4)
.
EG iterations: 1
..........
EG iterations: 10
-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AX [AG [[~ [sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=p0] & AX [1<=0]]]]
normalized: ~ [EX [E [true U ~ [[~ [EX [~ [1<=0]]] & ~ [sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=p0]]]]]]

abstracting: (sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=p0)
states: 1,025 (3)
abstracting: (1<=0)
states: 0
..-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: AF [AG [EF [~ [p0<=sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)]]]]
normalized: ~ [EG [E [true U ~ [E [true U ~ [p0<=sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)]]]]]]

abstracting: (p0<=sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1))
states: 59,049 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: AX [[EG [A [[p30<=1 & 1<=p30] U ~ [[p11<=1 & 1<=p11]]]] | [AG [[[[p3<=0 & 0<=p3] | [p20<=1 & 1<=p20]] & [p17<=0 & 0<=p17]]] & E [[[[p27<=0 & 0<=p27] | [p22<=1 & 1<=p22]] | [[p11<=0 & 0<=p11] | [p4<=1 & 1<=p4]]] U EX [0<=0]]]]]
normalized: ~ [EX [~ [[[~ [E [true U ~ [[[p17<=0 & 0<=p17] & [[p20<=1 & 1<=p20] | [p3<=0 & 0<=p3]]]]]] & E [[[[p4<=1 & 1<=p4] | [p11<=0 & 0<=p11]] | [[p22<=1 & 1<=p22] | [p27<=0 & 0<=p27]]] U EX [0<=0]]] | EG [[~ [EG [[p11<=1 & 1<=p11]]] & ~ [E [[p11<=1 & 1<=p11] U [~ [[p30<=1 & 1<=p30]] & [p11<=1 & 1<=p11]]]]]]]]]]

abstracting: (1<=p11)
states: 19,683 (4)
abstracting: (p11<=1)
states: 59,050 (4)
abstracting: (1<=p30)
states: 19,683 (4)
abstracting: (p30<=1)
states: 59,050 (4)
abstracting: (1<=p11)
states: 19,683 (4)
abstracting: (p11<=1)
states: 59,050 (4)
abstracting: (1<=p11)
states: 19,683 (4)
abstracting: (p11<=1)
states: 59,050 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=0)
states: 59,050 (4)
.abstracting: (0<=p27)
states: 59,050 (4)
abstracting: (p27<=0)
states: 39,367 (4)
abstracting: (1<=p22)
states: 19,683 (4)
abstracting: (p22<=1)
states: 59,050 (4)
abstracting: (0<=p11)
states: 59,050 (4)
abstracting: (p11<=0)
states: 39,367 (4)
abstracting: (1<=p4)
states: 19,683 (4)
abstracting: (p4<=1)
states: 59,050 (4)
abstracting: (0<=p3)
states: 59,050 (4)
abstracting: (p3<=0)
states: 39,367 (4)
abstracting: (1<=p20)
states: 19,683 (4)
abstracting: (p20<=1)
states: 59,050 (4)
abstracting: (0<=p17)
states: 59,050 (4)
abstracting: (p17<=0)
states: 39,367 (4)
.-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [AX [AF [EX [[[[[p11<=0 & 0<=p11] | [p1<=1 & 1<=p1]] & [[p12<=0 & 0<=p12] | [p28<=1 & 1<=p28]]] & [[p23<=1 & 1<=p23] & [[p22<=0 & 0<=p22] | [p3<=1 & 1<=p3]]]]]]] & [EF [AG [[p19<=0 & 0<=p19]]] | EG [E [[[p21<=0 & 0<=p21] | [p16<=1 & 1<=p16]] U EF [[p5<=0 & 0<=p5]]]]]]
normalized: [[EG [E [[[p16<=1 & 1<=p16] | [p21<=0 & 0<=p21]] U E [true U [p5<=0 & 0<=p5]]]] | E [true U ~ [E [true U ~ [[p19<=0 & 0<=p19]]]]]] & ~ [EX [EG [~ [EX [[[[[p3<=1 & 1<=p3] | [p22<=0 & 0<=p22]] & [p23<=1 & 1<=p23]] & [[[p28<=1 & 1<=p28] | [p12<=0 & 0<=p12]] & [[p1<=1 & 1<=p1] | [p11<=0 & 0<=p11]]]]]]]]]]

abstracting: (0<=p11)
states: 59,050 (4)
abstracting: (p11<=0)
states: 39,367 (4)
abstracting: (1<=p1)
states: 19,683 (4)
abstracting: (p1<=1)
states: 59,050 (4)
abstracting: (0<=p12)
states: 59,050 (4)
abstracting: (p12<=0)
states: 39,367 (4)
abstracting: (1<=p28)
states: 19,683 (4)
abstracting: (p28<=1)
states: 59,050 (4)
abstracting: (1<=p23)
states: 19,683 (4)
abstracting: (p23<=1)
states: 59,050 (4)
abstracting: (0<=p22)
states: 59,050 (4)
abstracting: (p22<=0)
states: 39,367 (4)
abstracting: (1<=p3)
states: 19,683 (4)
abstracting: (p3<=1)
states: 59,050 (4)
...
EG iterations: 2
.abstracting: (0<=p19)
states: 59,050 (4)
abstracting: (p19<=0)
states: 39,367 (4)
abstracting: (0<=p5)
states: 59,050 (4)
abstracting: (p5<=0)
states: 39,367 (4)
abstracting: (0<=p21)
states: 59,050 (4)
abstracting: (p21<=0)
states: 39,367 (4)
abstracting: (1<=p16)
states: 19,683 (4)
abstracting: (p16<=1)
states: 59,050 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [[[EF [sum(p20, p19, p18, p17, p16, p15, p14, p13, p12, p11)<=sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21)] & sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=sum(p20, p19, p18, p17, p16, p15, p14, p13, p12, p11)] & EX [AG [sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=sum(p20, p19, p18, p17, p16, p15, p14, p13, p12, p11)]]]]
normalized: E [true U [EX [~ [E [true U ~ [sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=sum(p20, p19, p18, p17, p16, p15, p14, p13, p12, p11)]]]] & [sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=sum(p20, p19, p18, p17, p16, p15, p14, p13, p12, p11) & E [true U sum(p20, p19, p18, p17, p16, p15, p14, p13, p12, p11)<=sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21)]]]]

abstracting: (sum(p20, p19, p18, p17, p16, p15, p14, p13, p12, p11)<=sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21))
states: 34,002 (4)
abstracting: (sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=sum(p20, p19, p18, p17, p16, p15, p14, p13, p12, p11))
states: 34,002 (4)
abstracting: (sum(p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=sum(p20, p19, p18, p17, p16, p15, p14, p13, p12, p11))
states: 34,002 (4)
.-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.932sec

totally nodes used: 62734 (6.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 81023 212848 293871
used/not used/entry size/cache size: 253766 66855098 16 1024MB
basic ops cache: hits/miss/sum: 20996 52161 73157
used/not used/entry size/cache size: 95498 16681718 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 2101244 2101244
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 2555 6202 8757
used/not used/entry size/cache size: 6202 8382406 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 67047990
1 59081
2 1726
3 67
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.336sec


BK_STOP 1679164165386

--------------------
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:112 (5), effective:21 (1)

initing FirstDep: 0m 0.000sec


iterations count:21 (1), effective:0 (0)

iterations count:21 (1), effective:0 (0)

iterations count:21 (1), effective:0 (0)

iterations count:25 (1), effective:1 (0)

iterations count:46 (2), effective:10 (0)

iterations count:21 (1), effective:0 (0)

iterations count:21 (1), effective:0 (0)

iterations count:21 (1), effective:0 (0)

iterations count:21 (1), effective:0 (0)

iterations count:32 (1), effective:1 (0)

iterations count:27 (1), effective:1 (0)

iterations count:21 (1), effective:0 (0)

iterations count:41 (1), effective:3 (0)

iterations count:42 (2), effective:2 (0)

iterations count:37 (1), effective:2 (0)

iterations count:21 (1), effective:0 (0)

iterations count:21 (1), effective:0 (0)

iterations count:21 (1), effective:0 (0)

iterations count:51 (2), effective:10 (0)

iterations count:49 (2), effective:7 (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="Referendum-PT-0010"
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 Referendum-PT-0010, 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 r330-tall-167889203300465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0010.tgz
mv Referendum-PT-0010 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 ;