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.r234-tall-167856420500570.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 MAPK-PT-00080, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420500570
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.9K Feb 26 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:22 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 25K 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 MAPK-PT-00080-CTLFireability-00
FORMULA_NAME MAPK-PT-00080-CTLFireability-01
FORMULA_NAME MAPK-PT-00080-CTLFireability-02
FORMULA_NAME MAPK-PT-00080-CTLFireability-03
FORMULA_NAME MAPK-PT-00080-CTLFireability-04
FORMULA_NAME MAPK-PT-00080-CTLFireability-05
FORMULA_NAME MAPK-PT-00080-CTLFireability-06
FORMULA_NAME MAPK-PT-00080-CTLFireability-07
FORMULA_NAME MAPK-PT-00080-CTLFireability-08
FORMULA_NAME MAPK-PT-00080-CTLFireability-09
FORMULA_NAME MAPK-PT-00080-CTLFireability-10
FORMULA_NAME MAPK-PT-00080-CTLFireability-11
FORMULA_NAME MAPK-PT-00080-CTLFireability-12
FORMULA_NAME MAPK-PT-00080-CTLFireability-13
FORMULA_NAME MAPK-PT-00080-CTLFireability-14
FORMULA_NAME MAPK-PT-00080-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679532951554

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=MAPK-PT-00080
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:55:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 00:55:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:55:53] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-23 00:55:53] [INFO ] Transformed 22 places.
[2023-03-23 00:55:53] [INFO ] Transformed 30 transitions.
[2023-03-23 00:55:53] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MAPK-PT-00080-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 9 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 00:55:53] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-23 00:55:53] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-23 00:55:53] [INFO ] Invariant cache hit.
[2023-03-23 00:55:53] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-23 00:55:53] [INFO ] Invariant cache hit.
[2023-03-23 00:55:53] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-23 00:55:53] [INFO ] Flatten gal took : 18 ms
[2023-03-23 00:55:53] [INFO ] Flatten gal took : 6 ms
[2023-03-23 00:55:53] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 41) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 00:55:54] [INFO ] Invariant cache hit.
[2023-03-23 00:55:54] [INFO ] After 28ms 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 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 6 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 4 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 30
Applied a total of 1 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 20 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 3 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 17 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 25
Applied a total of 10 rules in 7 ms. Remains 17 /22 variables (removed 5) and now considering 25/30 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 17/22 places, 25/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 20 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 3 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 17 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 25
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 17 transition count 25
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 16 transition count 24
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 16 transition count 24
Applied a total of 14 rules in 5 ms. Remains 16 /22 variables (removed 6) and now considering 24/30 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 16/22 places, 24/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 20 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 3 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 17 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 25
Applied a total of 10 rules in 3 ms. Remains 17 /22 variables (removed 5) and now considering 25/30 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 17/22 places, 25/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 30
Applied a total of 2 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:55:54] [INFO ] Input system was already deterministic with 30 transitions.
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:55:54] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:55:54] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-23 00:55:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 30 transitions and 90 arcs took 0 ms.
Total runtime 1121 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: 30 NrArc: 90)

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

net check time: 0m 0.000sec

init dd package: 0m 2.762sec


RS generation: 0m 2.940sec


-> reachability set: #nodes 179452 (1.8e+05) #states 5,634,903,909,420,423,840 (18)



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

checking: EF [AG [1<=p12]]
normalized: E [true U ~ [E [true U ~ [1<=p12]]]]

abstracting: (1<=p12)
states: 4,650,781,599,537,436,350 (18)
-> the formula is FALSE

FORMULA MAPK-PT-00080-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.226sec

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

abstracting: (p5<=0)
states: 398,096,337,866,829,110 (17)

EG iterations: 0
-> the formula is TRUE

FORMULA MAPK-PT-00080-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.713sec

checking: EF [EG [1<=p17]]
normalized: E [true U EG [1<=p17]]

abstracting: (1<=p17)
states: 5,284,270,986,026,983,055 (18)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-00080-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.345sec

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

abstracting: (1<=p15)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p7)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p19)
states: 5,456,047,635,655,681,980 (18)
abstracting: (1<=p12)
states: 4,650,781,599,537,436,350 (18)
..-> the formula is TRUE

FORMULA MAPK-PT-00080-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.425sec

checking: EG [[AF [AG [[1<=p20 & 1<=p21]]] & EG [[1<=p20 & 1<=p21]]]]
normalized: EG [[EG [[1<=p20 & 1<=p21]] & ~ [EG [E [true U ~ [[1<=p20 & 1<=p21]]]]]]]

abstracting: (1<=p21)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p20)
states: 5,445,173,364,364,368,760 (18)

EG iterations: 0
abstracting: (1<=p21)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p20)
states: 5,445,173,364,364,368,760 (18)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA MAPK-PT-00080-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.227sec

checking: AG [EF [[AG [1<=p12] | AG [~ [E [1<=p18 U [1<=p6 & 1<=p9]]]]]]]
normalized: ~ [E [true U ~ [E [true U [~ [E [true U E [1<=p18 U [1<=p6 & 1<=p9]]]] | ~ [E [true U ~ [1<=p12]]]]]]]]

abstracting: (1<=p12)
states: 4,650,781,599,537,436,350 (18)
abstracting: (1<=p9)
states: 5,634,881,950,640,142,996 (18)
abstracting: (1<=p6)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p18)
states: 4,650,781,599,537,436,350 (18)
-> the formula is FALSE

FORMULA MAPK-PT-00080-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.150sec

checking: [EF [EX [[1<=p1 & EG [p18<=0]]]] & EX [[p8<=0 | p10<=0]]]
normalized: [EX [[p8<=0 | p10<=0]] & E [true U EX [[1<=p1 & EG [p18<=0]]]]]

abstracting: (p18<=0)
states: 984,122,309,882,987,490 (17)
.
EG iterations: 1
abstracting: (1<=p1)
states: 4,455,346,573,836,523,080 (18)
.abstracting: (p10<=0)
states: 841,843,990,226,218,980 (17)
abstracting: (p8<=0)
states: 1,368,193,898,736 (12)
.-> the formula is TRUE

FORMULA MAPK-PT-00080-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.205sec

checking: E [~ [[1<=p6 & 1<=p9]] U EG [AF [AX [[[1<=p2 & 1<=p16] & [1<=p9 & 1<=p11]]]]]]
normalized: E [~ [[1<=p6 & 1<=p9]] U EG [~ [EG [EX [~ [[[1<=p9 & 1<=p11] & [1<=p2 & 1<=p16]]]]]]]]

abstracting: (1<=p16)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p2)
states: 5,622,469,027,462,495,920 (18)
abstracting: (1<=p11)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p9)
states: 5,634,881,950,640,142,996 (18)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p9)
states: 5,634,881,950,640,142,996 (18)
abstracting: (1<=p6)
states: 5,236,807,571,553,594,730 (18)
-> the formula is FALSE

FORMULA MAPK-PT-00080-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.150sec

checking: ~ [E [[[1<=p7 & 1<=p15] | [~ [AG [~ [[1<=p9 & 1<=p11]]]] | AG [E [[1<=p6 & 1<=p7] U 1<=p5]]]] U EG [1<=p17]]]
normalized: ~ [E [[[~ [E [true U ~ [E [[1<=p6 & 1<=p7] U 1<=p5]]]] | E [true U [1<=p9 & 1<=p11]]] | [1<=p7 & 1<=p15]] U EG [1<=p17]]]

abstracting: (1<=p17)
states: 5,284,270,986,026,983,055 (18)
.
EG iterations: 1
abstracting: (1<=p15)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p7)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p11)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p9)
states: 5,634,881,950,640,142,996 (18)
abstracting: (1<=p5)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p7)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p6)
states: 5,236,807,571,553,594,730 (18)
-> the formula is FALSE

FORMULA MAPK-PT-00080-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.405sec

checking: [EX [[[[EX [1<=p5] | AX [1<=p4]] & [1<=p7 & 1<=p15]] | AX [[1<=p10 & [1<=p16 & 1<=p5]]]]] | ~ [A [E [[p14<=0 | ~ [[1<=p7 & 1<=p15]]] U EG [1<=p19]] U [EF [[1<=p4 & [1<=p6 & 1<=p9]]] & AG [EX [[1<=p8 & 1<=p10]]]]]]]
normalized: [~ [[~ [EG [~ [[~ [E [true U ~ [EX [[1<=p8 & 1<=p10]]]]] & E [true U [1<=p4 & [1<=p6 & 1<=p9]]]]]]] & ~ [E [~ [[~ [E [true U ~ [EX [[1<=p8 & 1<=p10]]]]] & E [true U [1<=p4 & [1<=p6 & 1<=p9]]]]] U [~ [E [[p14<=0 | ~ [[1<=p7 & 1<=p15]]] U EG [1<=p19]]] & ~ [[~ [E [true U ~ [EX [[1<=p8 & 1<=p10]]]]] & E [true U [1<=p4 & [1<=p6 & 1<=p9]]]]]]]]]] | EX [[~ [EX [~ [[1<=p10 & [1<=p16 & 1<=p5]]]]] | [[1<=p7 & 1<=p15] & [~ [EX [~ [1<=p4]]] | EX [1<=p5]]]]]]

abstracting: (1<=p5)
states: 5,236,807,571,553,594,730 (18)
.abstracting: (1<=p4)
states: 5,236,807,571,553,594,730 (18)
.abstracting: (1<=p15)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p7)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p5)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p16)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
..abstracting: (1<=p9)
states: 5,634,881,950,640,142,996 (18)
abstracting: (1<=p6)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p4)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p8)
states: 5,634,902,541,226,525,104 (18)
.abstracting: (1<=p19)
states: 5,456,047,635,655,681,980 (18)
.
EG iterations: 1
abstracting: (1<=p15)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p7)
states: 4,793,059,919,194,204,860 (18)
abstracting: (p14<=0)
states: 841,843,990,226,218,980 (17)
abstracting: (1<=p9)
states: 5,634,881,950,640,142,996 (18)
abstracting: (1<=p6)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p4)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p8)
states: 5,634,902,541,226,525,104 (18)
.abstracting: (1<=p9)
states: 5,634,881,950,640,142,996 (18)
abstracting: (1<=p6)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p4)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p8)
states: 5,634,902,541,226,525,104 (18)
.
EG iterations: 0
-> the formula is TRUE

FORMULA MAPK-PT-00080-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.441sec

checking: ~ [E [EX [AF [[AG [1<=p4] | [1<=p19 | 1<=p4]]]] U [[AG [[[1<=p2 & 1<=p16] | [[1<=p8 & 1<=p10] | [1<=p10 & 1<=p16]]]] | EG [[1<=p7 & 1<=p8]]] & [~ [AF [[[1<=p7 & 1<=p15] | 1<=p18]]] | [AX [~ [[1<=p10 & 1<=p16]]] & ~ [EX [[1<=p20 & 1<=p21]]]]]]]]
normalized: ~ [E [EX [~ [EG [~ [[[1<=p19 | 1<=p4] | ~ [E [true U ~ [1<=p4]]]]]]]] U [[[~ [EX [[1<=p20 & 1<=p21]]] & ~ [EX [[1<=p10 & 1<=p16]]]] | EG [~ [[1<=p18 | [1<=p7 & 1<=p15]]]]] & [EG [[1<=p7 & 1<=p8]] | ~ [E [true U ~ [[[[1<=p10 & 1<=p16] | [1<=p8 & 1<=p10]] | [1<=p2 & 1<=p16]]]]]]]]]

abstracting: (1<=p16)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p2)
states: 5,622,469,027,462,495,920 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p8)
states: 5,634,902,541,226,525,104 (18)
abstracting: (1<=p16)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p8)
states: 5,634,902,541,226,525,104 (18)
abstracting: (1<=p7)
states: 4,793,059,919,194,204,860 (18)
.
EG iterations: 1
abstracting: (1<=p15)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p7)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p18)
states: 4,650,781,599,537,436,350 (18)
.
EG iterations: 1
abstracting: (1<=p16)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
.abstracting: (1<=p21)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p20)
states: 5,445,173,364,364,368,760 (18)
.abstracting: (1<=p4)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p4)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p19)
states: 5,456,047,635,655,681,980 (18)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA MAPK-PT-00080-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m54.459sec

checking: A [[~ [[1<=p20 & 1<=p21]] & [~ [EF [1<=p18]] | ~ [[1<=p6 & 1<=p9]]]] U [EX [E [1<=p1 U [1<=p5 & [1<=p14 & ~ [[1<=p10 & 1<=p16]]]]]] & [EF [1<=p17] | EX [[[EX [1<=p17] | [1<=p13 | 1<=p12]] & [E [1<=p14 U [1<=p8 & 1<=p10]] & AX [[1<=p8 & 1<=p10]]]]]]]]
normalized: [~ [EG [~ [[[EX [[[~ [EX [~ [[1<=p8 & 1<=p10]]]] & E [1<=p14 U [1<=p8 & 1<=p10]]] & [[1<=p13 | 1<=p12] | EX [1<=p17]]]] | E [true U 1<=p17]] & EX [E [1<=p1 U [1<=p5 & [1<=p14 & ~ [[1<=p10 & 1<=p16]]]]]]]]]] & ~ [E [~ [[[EX [[[~ [EX [~ [[1<=p8 & 1<=p10]]]] & E [1<=p14 U [1<=p8 & 1<=p10]]] & [[1<=p13 | 1<=p12] | EX [1<=p17]]]] | E [true U 1<=p17]] & EX [E [1<=p1 U [1<=p5 & [1<=p14 & ~ [[1<=p10 & 1<=p16]]]]]]]] U [~ [[[~ [[1<=p6 & 1<=p9]] | ~ [E [true U 1<=p18]]] & ~ [[1<=p20 & 1<=p21]]]] & ~ [[[EX [[[~ [EX [~ [[1<=p8 & 1<=p10]]]] & E [1<=p14 U [1<=p8 & 1<=p10]]] & [[1<=p13 | 1<=p12] | EX [1<=p17]]]] | E [true U 1<=p17]] & EX [E [1<=p1 U [1<=p5 & [1<=p14 & ~ [[1<=p10 & 1<=p16]]]]]]]]]]]]

abstracting: (1<=p16)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p14)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p5)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p1)
states: 4,455,346,573,836,523,080 (18)
.abstracting: (1<=p17)
states: 5,284,270,986,026,983,055 (18)
abstracting: (1<=p17)
states: 5,284,270,986,026,983,055 (18)
.abstracting: (1<=p12)
states: 4,650,781,599,537,436,350 (18)
abstracting: (1<=p13)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p8)
states: 5,634,902,541,226,525,104 (18)
abstracting: (1<=p14)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p8)
states: 5,634,902,541,226,525,104 (18)
..abstracting: (1<=p21)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p20)
states: 5,445,173,364,364,368,760 (18)
abstracting: (1<=p18)
states: 4,650,781,599,537,436,350 (18)
abstracting: (1<=p9)
states: 5,634,881,950,640,142,996 (18)
abstracting: (1<=p6)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p16)
states: 5,466,869,564,924,771,675 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p14)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p5)
states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=p1)
states: 4,455,346,573,836,523,080 (18)
.abstracting: (1<=p17)
states: 5,284,270,986,026,983,055 (18)
abstracting: (1<=p17)
states: 5,284,270,986,026,983,055 (18)
.abstracting: (1<=p12)
states: 4,650,781,599,537,436,350 (18)
abstracting: (1<=p13)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p10)
states: 4,793,059,919,194,204,860 (18)
abstracting: (1<=p8)
states: 5,634,902,541,226,525,104 (18)
abstracting: (1<=p14)
states: 4,793,059,919,194,204,860 (18)

BK_STOP 1679533525479

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:7295 (243), effective:1120 (37)

initing FirstDep: 0m 0.000sec


iterations count:750 (25), effective:40 (1)

iterations count:390 (13), effective:60 (2)

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

iterations count:110 (3), effective:40 (1)

iterations count:236 (7), effective:31 (1)

iterations count:110 (3), effective:20 (0)

iterations count:750 (25), effective:40 (1)

iterations count:143 (4), effective:16 (0)

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

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

iterations count:411 (13), effective:57 (1)

iterations count:162 (5), effective:14 (0)

iterations count:150 (5), effective:17 (0)

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

iterations count:670 (22), effective:140 (4)

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

iterations count:176 (5), effective:23 (0)

iterations count:3252 (108), effective:319 (10)

iterations count:205 (6), effective:44 (1)

iterations count:176 (5), effective:23 (0)

iterations count:3252 (108), effective:319 (10)

iterations count:777 (25), effective:86 (2)

iterations count:176 (5), effective:23 (0)

iterations count:3252 (108), effective:319 (10)

iterations count:2110 (70), effective:360 (12)

iterations count:450 (15), effective:60 (2)

iterations count:765 (25), effective:209 (6)

iterations count:363 (12), effective:59 (1)

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

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

iterations count:134 (4), effective:12 (0)

iterations count:363 (12), effective:59 (1)

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

iterations count:33 (1), effective:1 (0)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 466 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="MAPK-PT-00080"
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 MAPK-PT-00080, 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 r234-tall-167856420500570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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