Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838856900218.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 FMS-PT-00050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856900218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.8K Feb 25 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 19:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 19:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 20:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 20:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 20:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K Mar 5 18:22 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 FMS-PT-00050-CTLFireability-00
FORMULA_NAME FMS-PT-00050-CTLFireability-01
FORMULA_NAME FMS-PT-00050-CTLFireability-02
FORMULA_NAME FMS-PT-00050-CTLFireability-03
FORMULA_NAME FMS-PT-00050-CTLFireability-04
FORMULA_NAME FMS-PT-00050-CTLFireability-05
FORMULA_NAME FMS-PT-00050-CTLFireability-06
FORMULA_NAME FMS-PT-00050-CTLFireability-07
FORMULA_NAME FMS-PT-00050-CTLFireability-08
FORMULA_NAME FMS-PT-00050-CTLFireability-09
FORMULA_NAME FMS-PT-00050-CTLFireability-10
FORMULA_NAME FMS-PT-00050-CTLFireability-11
FORMULA_NAME FMS-PT-00050-CTLFireability-12
FORMULA_NAME FMS-PT-00050-CTLFireability-13
FORMULA_NAME FMS-PT-00050-CTLFireability-14
FORMULA_NAME FMS-PT-00050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678494100016

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=FMS-PT-00050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:21:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:21:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:21:41] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-11 00:21:41] [INFO ] Transformed 22 places.
[2023-03-11 00:21:41] [INFO ] Transformed 20 transitions.
[2023-03-11 00:21:41] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:21:41] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-11 00:21:42] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-11 00:21:42] [INFO ] Invariant cache hit.
[2023-03-11 00:21:42] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-11 00:21:42] [INFO ] Invariant cache hit.
[2023-03-11 00:21:42] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 490 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 16 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 7 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 984 steps, including 0 resets, run visited all 38 properties in 42 ms. (steps per millisecond=23 )
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 20 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 15 place count 14 transition count 13
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 13 transition count 12
Applied a total of 17 rules in 8 ms. Remains 13 /22 variables (removed 9) and now considering 12/20 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 13/22 places, 12/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 8 edges and 19 vertex of which 6 / 19 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 15 transition count 16
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 15 place count 12 transition count 12
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 11 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 11 transition count 10
Applied a total of 18 rules in 7 ms. Remains 11 /22 variables (removed 11) and now considering 10/20 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 11/22 places, 10/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 18 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 7 transition count 8
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 6 transition count 7
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 6 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 27 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 4 with 2 rules applied. Total rules applied 29 place count 5 transition count 5
Applied a total of 29 rules in 7 ms. Remains 5 /22 variables (removed 17) and now considering 5/20 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 5/22 places, 5/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 8 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 13 transition count 13
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 10 transition count 10
Applied a total of 21 rules in 2 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 10/22 places, 10/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:21:42] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:21:42] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:21:42] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 00:21:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 0 ms.
Total runtime 1335 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: 22 NrTr: 20 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 2.754sec


RS generation: 0m59.225sec


-> reachability set: #nodes 305745 (3.1e+05) #states 424,025,581,818,265,596 (17)



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

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

abstracting: (p20<=0)
states: 16,308,676,223,779,446 (16)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA FMS-PT-00050-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.278sec

checking: EF [EX [AG [EF [EX [[1<=p2 & 1<=p18]]]]]]
normalized: E [true U EX [~ [E [true U ~ [E [true U EX [[1<=p2 & 1<=p18]]]]]]]]

abstracting: (1<=p18)
states: 381,583,852,607,400,300 (17)
abstracting: (1<=p2)
states: 380,558,460,392,121,960 (17)
..-> the formula is TRUE

FORMULA FMS-PT-00050-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.162sec

checking: EF [AG [EF [[EF [1<=p4] & [1<=p6 | EG [1<=p4]]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U [[1<=p6 | EG [1<=p4]] & E [true U 1<=p4]]]]]]]

abstracting: (1<=p4)
states: 380,558,460,392,121,960 (17)
abstracting: (1<=p4)
states: 380,558,460,392,121,960 (17)
.
EG iterations: 1
abstracting: (1<=p6)
states: 300,572,042,379,275,160 (17)
-> the formula is TRUE

FORMULA FMS-PT-00050-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.179sec

checking: AF [AG [EF [[1<=p16 & [1<=p8 & 1<=p10]]]]]
normalized: ~ [EG [E [true U ~ [E [true U [1<=p16 & [1<=p8 & 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 223,058,860,291,759,986 (17)
abstracting: (1<=p8)
states: 381,583,852,607,400,300 (17)
abstracting: (1<=p16)
states: 407,716,905,594,486,150 (17)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00050-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.011sec

checking: AF [AG [[E [~ [[1<=p8 & [1<=p10 & 1<=p0]]] U 1<=p6] & EX [AG [1<=p0]]]]]
normalized: ~ [EG [E [true U ~ [[EX [~ [E [true U ~ [1<=p0]]]] & E [~ [[1<=p8 & [1<=p10 & 1<=p0]]] U 1<=p6]]]]]]

abstracting: (1<=p6)
states: 300,572,042,379,275,160 (17)
abstracting: (1<=p0)
states: 380,558,460,392,121,960 (17)
abstracting: (1<=p10)
states: 223,058,860,291,759,986 (17)
abstracting: (1<=p8)
states: 381,583,852,607,400,300 (17)
abstracting: (1<=p0)
states: 380,558,460,392,121,960 (17)
.
EG iterations: 0
-> the formula is FALSE

FORMULA FMS-PT-00050-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.785sec

checking: AG [[~ [E [[A [1<=p19 U 1<=p16] & 1<=p0] U 1<=p12]] | AG [[1<=p13 & 1<=p15]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[1<=p13 & 1<=p15]]]] | ~ [E [[1<=p0 & [~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [1<=p19] & ~ [1<=p16]]]]]] U 1<=p12]]]]]]

abstracting: (1<=p12)
states: 252,058,643,709,125,760 (17)
abstracting: (1<=p16)
states: 407,716,905,594,486,150 (17)
abstracting: (1<=p19)
states: 381,583,852,607,400,300 (17)
abstracting: (1<=p16)
states: 407,716,905,594,486,150 (17)
abstracting: (1<=p16)
states: 407,716,905,594,486,150 (17)
.
EG iterations: 1
abstracting: (1<=p0)
states: 380,558,460,392,121,960 (17)
abstracting: (1<=p15)
states: 311,411,909,417,398,686 (17)
abstracting: (1<=p13)
states: 342,619,299,282,007,800 (17)
-> the formula is FALSE

FORMULA FMS-PT-00050-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.434sec

checking: EF [AG [[1<=p5 & [1<=p7 & AG [[1<=p12 | [1<=p0 | [1<=p2 & 1<=p18]]]]]]]]
normalized: E [true U ~ [E [true U ~ [[1<=p5 & [1<=p7 & ~ [E [true U ~ [[1<=p12 | [1<=p0 | [1<=p2 & 1<=p18]]]]]]]]]]]]

abstracting: (1<=p18)
states: 381,583,852,607,400,300 (17)
abstracting: (1<=p2)
states: 380,558,460,392,121,960 (17)
abstracting: (1<=p0)
states: 380,558,460,392,121,960 (17)
abstracting: (1<=p12)
states: 252,058,643,709,125,760 (17)
abstracting: (1<=p7)
states: 334,521,580,915,640,196 (17)
abstracting: (1<=p5)
states: 380,558,460,392,121,960 (17)
-> the formula is FALSE

FORMULA FMS-PT-00050-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.729sec

checking: ~ [E [~ [EG [EX [[1<=p19 | 1<=p6]]]] U ~ [[p0<=0 | [~ [[1<=p10 & 1<=p17]] | 1<=p12]]]]]
normalized: ~ [E [~ [EG [EX [[1<=p19 | 1<=p6]]]] U ~ [[p0<=0 | [1<=p12 | ~ [[1<=p10 & 1<=p17]]]]]]]

abstracting: (1<=p17)
states: 407,716,905,594,486,150 (17)
abstracting: (1<=p10)
states: 223,058,860,291,759,986 (17)
abstracting: (1<=p12)
states: 252,058,643,709,125,760 (17)
abstracting: (p0<=0)
states: 43,467,121,426,143,636 (16)
abstracting: (1<=p6)
states: 300,572,042,379,275,160 (17)
abstracting: (1<=p19)
states: 381,583,852,607,400,300 (17)
..
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00050-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.758sec

checking: AX [[~ [A [AX [AF [[1<=p8 & 1<=p10]]] U [1<=p11 | 1<=p4]]] | [p14<=0 & [p12<=0 & AX [~ [E [1<=p11 U 1<=p21]]]]]]]
normalized: ~ [EX [~ [[[p14<=0 & [p12<=0 & ~ [EX [E [1<=p11 U 1<=p21]]]]] | ~ [[~ [EG [~ [[1<=p11 | 1<=p4]]]] & ~ [E [~ [[1<=p11 | 1<=p4]] U [EX [EG [~ [[1<=p8 & 1<=p10]]]] & ~ [[1<=p11 | 1<=p4]]]]]]]]]]]

abstracting: (1<=p4)
states: 380,558,460,392,121,960 (17)
abstracting: (1<=p11)
states: 200,966,721,526,505,610 (17)
abstracting: (1<=p10)
states: 223,058,860,291,759,986 (17)
abstracting: (1<=p8)
states: 381,583,852,607,400,300 (17)
......................................................................................................................................................................................................
EG iterations: 198
.abstracting: (1<=p4)
states: 380,558,460,392,121,960 (17)
abstracting: (1<=p11)
states: 200,966,721,526,505,610 (17)
abstracting: (1<=p4)
states: 380,558,460,392,121,960 (17)
abstracting: (1<=p11)
states: 200,966,721,526,505,610 (17)
.
EG iterations: 1
abstracting: (1<=p21)
states: 381,583,852,607,400,300 (17)
abstracting: (1<=p11)
states: 200,966,721,526,505,610 (17)

BK_STOP 1678494742651

--------------------
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:3870 (193), effective:850 (42)

initing FirstDep: 0m 0.000sec


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

iterations count:92 (4), effective:18 (0)

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

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

iterations count:72 (3), effective:13 (0)

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

iterations count:90 (4), effective:17 (0)

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

iterations count:70 (3), effective:50 (2)

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

iterations count:120 (6), effective:50 (2)

iterations count:87 (4), effective:15 (0)

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

iterations count:75 (3), effective:16 (0)

iterations count:290 (14), effective:102 (5)

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

iterations count:45 (2), effective:4 (0)

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

iterations count:22 (1), effective:1 (0)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 464 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="FMS-PT-00050"
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 FMS-PT-00050, 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 r170-tall-167838856900218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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