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-167889203400538.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 RefineWMG-PT-002003, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.0K Feb 26 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 26 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.9K 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 RefineWMG-PT-002003-CTLFireability-00
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-01
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-02
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-03
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-04
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-05
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-06
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-07
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-08
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-09
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-10
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-11
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-12
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-13
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-14
FORMULA_NAME RefineWMG-PT-002003-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679169861183

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-002003
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:04:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:04:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:04:22] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-18 20:04:22] [INFO ] Transformed 14 places.
[2023-03-18 20:04:22] [INFO ] Transformed 11 transitions.
[2023-03-18 20:04:22] [INFO ] Parsed PT model containing 14 places and 11 transitions and 32 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-002003-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-002003-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:04:22] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
[2023-03-18 20:04:23] [INFO ] Invariant cache hit.
[2023-03-18 20:04:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 20:04:23] [INFO ] Invariant cache hit.
[2023-03-18 20:04:23] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-18 20:04:23] [INFO ] Invariant cache hit.
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 14/14 places, 11/11 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 13 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:04:23] [INFO ] Invariant cache hit.
[2023-03-18 20:04:23] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 6 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 2 places and 0 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 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 5 transition count 5
Applied a total of 10 rules in 9 ms. Remains 5 /14 variables (removed 9) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-18 20:04:23] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 5/14 places, 5/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:04:23] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:04:23] [INFO ] Invariant cache hit.
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 10
Applied a total of 3 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 20:04:23] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 12/14 places, 10/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 2 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 20:04:23] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 12/14 places, 10/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 10 transition count 9
Applied a total of 6 rules in 1 ms. Remains 10 /14 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 20:04:23] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 10/14 places, 9/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:04:23] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:04:23] [INFO ] Invariant cache hit.
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 3 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 10 transition count 9
Applied a total of 4 rules in 1 ms. Remains 10 /14 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 20:04:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 10/14 places, 9/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:04:23] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:04:23] [INFO ] Invariant cache hit.
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 10
Applied a total of 3 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 20:04:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 20:04:23] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 12/14 places, 10/11 transitions.
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:23] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:04:24] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 20:04:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:24] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:24] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:04:24] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:04:24] [INFO ] Invariant cache hit.
[2023-03-18 20:04:24] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:24] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:04:24] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:04:24] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-18 20:04:24] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:24] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:24] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 20:04:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 11 transitions and 32 arcs took 1 ms.
Total runtime 1275 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 14 NrTr: 11 NrArc: 32)

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

net check time: 0m 0.000sec

init dd package: 0m 2.700sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 122 (1.2e+02) #states 184,320 (5)



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

checking: AF [AG [p4<=4]]
normalized: ~ [EG [E [true U ~ [p4<=4]]]]

abstracting: (p4<=4)
states: 168,960 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [EX [AG [AF [EX [1<=p7]]]]]
normalized: ~ [EX [~ [EX [~ [E [true U EG [~ [EX [1<=p7]]]]]]]]]

abstracting: (1<=p7)
states: 138,240 (5)
..
EG iterations: 1
..-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [AF [E [1<=p13 U 1<=p8]]]
normalized: ~ [E [true U EG [~ [E [1<=p13 U 1<=p8]]]]]

abstracting: (1<=p8)
states: 138,240 (5)
abstracting: (1<=p13)
states: 138,240 (5)
...............
EG iterations: 15
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [EG [AX [[EF [5<=p4] | AX [5<=p4]]]]]
normalized: ~ [EG [~ [EG [~ [EX [~ [[~ [EX [~ [5<=p4]]] | E [true U 5<=p4]]]]]]]]]

abstracting: (5<=p4)
states: 15,360 (4)
abstracting: (5<=p4)
states: 15,360 (4)
..
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [p12<=0 U AG [~ [AG [[1<=p5 & 1<=p10]]]]]
normalized: E [p12<=0 U ~ [E [true U ~ [E [true U ~ [[1<=p5 & 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 138,240 (5)
abstracting: (1<=p5)
states: 138,240 (5)
abstracting: (p12<=0)
states: 46,080 (4)
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [[EF [[p10<=0 & 5<=p4]] | AF [1<=p12]]]
normalized: ~ [EX [~ [[~ [EG [~ [1<=p12]]] | E [true U [p10<=0 & 5<=p4]]]]]]

abstracting: (5<=p4)
states: 15,360 (4)
abstracting: (p10<=0)
states: 46,080 (4)
abstracting: (1<=p12)
states: 138,240 (5)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[AG [AX [[[p1<=1 | p2<=1] & p7<=0]]] & 1<=p12]]
normalized: E [true U [~ [E [true U EX [~ [[[p1<=1 | p2<=1] & p7<=0]]]]] & 1<=p12]]

abstracting: (1<=p12)
states: 138,240 (5)
abstracting: (p7<=0)
states: 46,080 (4)
abstracting: (p2<=1)
states: 61,440 (4)
abstracting: (p1<=1)
states: 98,304 (4)
.-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AG [EF [[p3<=2 | [[p12<=0 & p5<=0] | [3<=p3 & 1<=p5]]]]]]
normalized: ~ [EG [E [true U ~ [E [true U [[[3<=p3 & 1<=p5] | [p12<=0 & p5<=0]] | p3<=2]]]]]]

abstracting: (p3<=2)
states: 92,160 (4)
abstracting: (p5<=0)
states: 46,080 (4)
abstracting: (p12<=0)
states: 46,080 (4)
abstracting: (1<=p5)
states: 138,240 (5)
abstracting: (3<=p3)
states: 92,160 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[AX [EF [1<=p7]] | [AG [1<=p7] & EX [[p6<=0 | [p7<=0 | p9<=0]]]]]]
normalized: ~ [E [true U ~ [[[~ [E [true U ~ [1<=p7]]] & EX [[[p7<=0 | p9<=0] | p6<=0]]] | ~ [EX [~ [E [true U 1<=p7]]]]]]]]

abstracting: (1<=p7)
states: 138,240 (5)
.abstracting: (p6<=0)
states: 46,080 (4)
abstracting: (p9<=0)
states: 55,296 (4)
abstracting: (p7<=0)
states: 46,080 (4)
.abstracting: (1<=p7)
states: 138,240 (5)
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [A [EG [[AG [[2<=p1 & 2<=p2]] | [1<=p13 | [1<=p6 & [1<=p7 & 1<=p9]]]]] U 1<=p5]]]
normalized: ~ [E [true U [~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [EG [[[[[1<=p7 & 1<=p9] & 1<=p6] | 1<=p13] | ~ [E [true U ~ [[2<=p1 & 2<=p2]]]]]]] & ~ [1<=p5]]]]]]]

abstracting: (1<=p5)
states: 138,240 (5)
abstracting: (2<=p2)
states: 122,880 (5)
abstracting: (2<=p1)
states: 86,016 (4)
abstracting: (1<=p13)
states: 138,240 (5)
abstracting: (1<=p6)
states: 138,240 (5)
abstracting: (1<=p9)
states: 129,024 (5)
abstracting: (1<=p7)
states: 138,240 (5)
.
EG iterations: 1
abstracting: (1<=p5)
states: 138,240 (5)
abstracting: (1<=p5)
states: 138,240 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [[AF [[[EX [p4<=4] & 3<=p3] | [[p5<=0 & 1<=p10] | AG [3<=p3]]]] | AF [E [1<=p7 U A [5<=p4 U 5<=p4]]]]]
normalized: EG [[~ [EG [~ [E [1<=p7 U [~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [5<=p4] & ~ [5<=p4]]]]]]]]] | ~ [EG [~ [[[~ [E [true U ~ [3<=p3]]] | [p5<=0 & 1<=p10]] | [EX [p4<=4] & 3<=p3]]]]]]]

abstracting: (3<=p3)
states: 92,160 (4)
abstracting: (p4<=4)
states: 168,960 (5)
.abstracting: (1<=p10)
states: 138,240 (5)
abstracting: (p5<=0)
states: 46,080 (4)
abstracting: (3<=p3)
states: 92,160 (4)
.
EG iterations: 1
abstracting: (5<=p4)
states: 15,360 (4)
abstracting: (5<=p4)
states: 15,360 (4)
abstracting: (5<=p4)
states: 15,360 (4)
abstracting: (5<=p4)
states: 15,360 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 138,240 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [E [~ [[E [[1<=p6 & [1<=p7 & 1<=p9]] U 5<=p4] & [1<=p13 & [p5<=0 | [1<=p7 | 1<=p7]]]]] U AF [EG [1<=p7]]]]
normalized: ~ [E [true U ~ [E [~ [[[[[1<=p7 | 1<=p7] | p5<=0] & 1<=p13] & E [[[1<=p7 & 1<=p9] & 1<=p6] U 5<=p4]]] U ~ [EG [~ [EG [1<=p7]]]]]]]]

abstracting: (1<=p7)
states: 138,240 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (5<=p4)
states: 15,360 (4)
abstracting: (1<=p6)
states: 138,240 (5)
abstracting: (1<=p9)
states: 129,024 (5)
abstracting: (1<=p7)
states: 138,240 (5)
abstracting: (1<=p13)
states: 138,240 (5)
abstracting: (p5<=0)
states: 46,080 (4)
abstracting: (1<=p7)
states: 138,240 (5)
abstracting: (1<=p7)
states: 138,240 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [EX [[[[EF [[1<=p13 | [1<=p6 & [1<=p7 & 1<=p9]]]] & p3<=2] & [5<=p4 & 1<=p0]] & [[1<=p11 & 1<=p12] & [[p1<=1 | p2<=1] & [[p6<=0 | [p7<=0 | p9<=0]] & [p10<=0 | p5<=0]]]]]]]
normalized: E [true U EX [[[[[[p10<=0 | p5<=0] & [[p7<=0 | p9<=0] | p6<=0]] & [p1<=1 | p2<=1]] & [1<=p11 & 1<=p12]] & [[5<=p4 & 1<=p0] & [E [true U [[[1<=p7 & 1<=p9] & 1<=p6] | 1<=p13]] & p3<=2]]]]]

abstracting: (p3<=2)
states: 92,160 (4)
abstracting: (1<=p13)
states: 138,240 (5)
abstracting: (1<=p6)
states: 138,240 (5)
abstracting: (1<=p9)
states: 129,024 (5)
abstracting: (1<=p7)
states: 138,240 (5)
abstracting: (1<=p0)
states: 129,024 (5)
abstracting: (5<=p4)
states: 15,360 (4)
abstracting: (1<=p12)
states: 138,240 (5)
abstracting: (1<=p11)
states: 138,240 (5)
abstracting: (p2<=1)
states: 61,440 (4)
abstracting: (p1<=1)
states: 98,304 (4)
abstracting: (p6<=0)
states: 46,080 (4)
abstracting: (p9<=0)
states: 55,296 (4)
abstracting: (p7<=0)
states: 46,080 (4)
abstracting: (p5<=0)
states: 46,080 (4)
abstracting: (p10<=0)
states: 46,080 (4)
.-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [~ [A [AF [AX [1<=p10]] U 1<=p10]] & EG [[~ [A [[1<=p10 & E [1<=p5 U [1<=p6 & [1<=p7 & 1<=p9]]]] U ~ [EX [1<=p7]]]] | [~ [A [A [1<=p13 U [1<=p6 & [1<=p7 & 1<=p9]]] U [1<=p8 & 1<=p10]]] & AG [[p5<=0 & [p1<=1 | p2<=1]]]]]]]
normalized: [EG [[[~ [E [true U ~ [[[p1<=1 | p2<=1] & p5<=0]]]] & ~ [[~ [EG [~ [[1<=p8 & 1<=p10]]]] & ~ [E [~ [[1<=p8 & 1<=p10]] U [~ [[~ [EG [~ [[[1<=p7 & 1<=p9] & 1<=p6]]]] & ~ [E [~ [[[1<=p7 & 1<=p9] & 1<=p6]] U [~ [1<=p13] & ~ [[[1<=p7 & 1<=p9] & 1<=p6]]]]]]] & ~ [[1<=p8 & 1<=p10]]]]]]]] | ~ [[~ [EG [EX [1<=p7]]] & ~ [E [EX [1<=p7] U [~ [[E [1<=p5 U [[1<=p7 & 1<=p9] & 1<=p6]] & 1<=p10]] & EX [1<=p7]]]]]]]] & ~ [[~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [EG [EX [~ [1<=p10]]] & ~ [1<=p10]]]]]]]

abstracting: (1<=p10)
states: 138,240 (5)
abstracting: (1<=p10)
states: 138,240 (5)
..
EG iterations: 1
abstracting: (1<=p10)
states: 138,240 (5)
abstracting: (1<=p10)
states: 138,240 (5)
.
EG iterations: 1
abstracting: (1<=p7)
states: 138,240 (5)
.abstracting: (1<=p10)
states: 138,240 (5)
abstracting: (1<=p6)
states: 138,240 (5)
abstracting: (1<=p9)
states: 129,024 (5)
abstracting: (1<=p7)
states: 138,240 (5)
abstracting: (1<=p5)
states: 138,240 (5)
abstracting: (1<=p7)
states: 138,240 (5)
.abstracting: (1<=p7)
states: 138,240 (5)
.
EG iterations: 0
abstracting: (1<=p10)
states: 138,240 (5)
abstracting: (1<=p8)
states: 138,240 (5)
abstracting: (1<=p6)
states: 138,240 (5)
abstracting: (1<=p9)
states: 129,024 (5)
abstracting: (1<=p7)
states: 138,240 (5)
abstracting: (1<=p13)
states: 138,240 (5)
abstracting: (1<=p6)
states: 138,240 (5)
abstracting: (1<=p9)
states: 129,024 (5)
abstracting: (1<=p7)
states: 138,240 (5)
abstracting: (1<=p6)
states: 138,240 (5)
abstracting: (1<=p9)
states: 129,024 (5)
abstracting: (1<=p7)
states: 138,240 (5)
.
EG iterations: 1
abstracting: (1<=p10)
states: 138,240 (5)
abstracting: (1<=p8)
states: 138,240 (5)
abstracting: (1<=p10)
states: 138,240 (5)
abstracting: (1<=p8)
states: 138,240 (5)
.
EG iterations: 1
abstracting: (p5<=0)
states: 46,080 (4)
abstracting: (p2<=1)
states: 61,440 (4)
abstracting: (p1<=1)
states: 98,304 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 18283 (1.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 46285 41709 87994
used/not used/entry size/cache size: 55382 67053482 16 1024MB
basic ops cache: hits/miss/sum: 22976 20806 43782
used/not used/entry size/cache size: 41594 16735622 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 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1736 1482 3218
used/not used/entry size/cache size: 1482 8387126 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 67091605
1 16713
2 351
3 116
4 36
5 21
6 11
7 0
8 0
9 0
>= 10 11

Total processing time: 0m 4.287sec


BK_STOP 1679169869323

--------------------
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 CTLFireability -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:581 (52), effective:246 (22)

initing FirstDep: 0m 0.000sec


iterations count:92 (8), effective:36 (3)

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

iterations count:92 (8), effective:36 (3)

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

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

iterations count:95 (8), effective:39 (3)

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

iterations count:22 (2), effective:5 (0)

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

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

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

iterations count:20 (1), effective:6 (0)

iterations count:34 (3), effective:8 (0)

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

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

iterations count:91 (8), effective:35 (3)

iterations count:80 (7), effective:30 (2)

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

iterations count:103 (9), effective:43 (3)

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

iterations count:212 (19), effective:93 (8)

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

iterations count:31 (2), effective:8 (0)

iterations count:20 (1), effective:6 (0)

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

iterations count:20 (1), effective:6 (0)

iterations count:31 (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="RefineWMG-PT-002003"
export BK_EXAMINATION="CTLFireability"
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 RefineWMG-PT-002003, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203400538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-002003.tgz
mv RefineWMG-PT-002003 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;