fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856420500554
Last Updated
May 14, 2023

About the Execution of Marcie+red for MAPK-PT-00020

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5549.100 11690.00 14770.00 361.40 FFTTTFFTFFTTTFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.4K Feb 26 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 10:48 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.9K 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:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 26 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:21 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-00020-CTLFireability-00
FORMULA_NAME MAPK-PT-00020-CTLFireability-01
FORMULA_NAME MAPK-PT-00020-CTLFireability-02
FORMULA_NAME MAPK-PT-00020-CTLFireability-03
FORMULA_NAME MAPK-PT-00020-CTLFireability-04
FORMULA_NAME MAPK-PT-00020-CTLFireability-05
FORMULA_NAME MAPK-PT-00020-CTLFireability-06
FORMULA_NAME MAPK-PT-00020-CTLFireability-07
FORMULA_NAME MAPK-PT-00020-CTLFireability-08
FORMULA_NAME MAPK-PT-00020-CTLFireability-09
FORMULA_NAME MAPK-PT-00020-CTLFireability-10
FORMULA_NAME MAPK-PT-00020-CTLFireability-11
FORMULA_NAME MAPK-PT-00020-CTLFireability-12
FORMULA_NAME MAPK-PT-00020-CTLFireability-13
FORMULA_NAME MAPK-PT-00020-CTLFireability-14
FORMULA_NAME MAPK-PT-00020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679532535014

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-00020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:48:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 00:48:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:48:56] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-23 00:48:56] [INFO ] Transformed 22 places.
[2023-03-23 00:48:56] [INFO ] Transformed 30 transitions.
[2023-03-23 00:48:56] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MAPK-PT-00020-CTLFireability-10 TRUE 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:48:56] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-23 00:48:57] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-23 00:48:57] [INFO ] Invariant cache hit.
[2023-03-23 00:48:57] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-23 00:48:57] [INFO ] Invariant cache hit.
[2023-03-23 00:48:57] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 17 ms
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 6 ms
[2023-03-23 00:48:57] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 37) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Finished Best-First random walk after 3327 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=332 )
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 4 ms
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 4 ms
[2023-03-23 00:48:57] [INFO ] Input system was already deterministic with 30 transitions.
Computed a total of 0 stabilizing places and 0 stable 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
Performed 1 Post agglomeration using F-continuation condition.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.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 18 transition count 27
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 18 transition count 27
Applied a total of 9 rules in 11 ms. Remains 18 /22 variables (removed 4) and now considering 27/30 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 18/22 places, 27/30 transitions.
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:57] [INFO ] Input system was already deterministic with 27 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:48:57] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:57] [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 3 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 3 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:57] [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:48:57] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:57] [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:48:57] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:57] [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:48:57] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:57] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:57] [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
Applied a total of 3 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 29/30 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 20/22 places, 29/30 transitions.
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [INFO ] Input system was already deterministic with 29 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
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 20 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 19 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 19 transition count 28
Applied a total of 7 rules in 5 ms. Remains 19 /22 variables (removed 3) and now considering 28/30 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 19/22 places, 28/30 transitions.
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:58] [INFO ] Input system was already deterministic with 28 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:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [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:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:58] [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
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 17 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 17 transition count 24
Applied a total of 12 rules in 8 ms. Remains 17 /22 variables (removed 5) and now considering 24/30 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 17/22 places, 24/30 transitions.
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [INFO ] Input system was already deterministic with 24 transitions.
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
FORMULA MAPK-PT-00020-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:48:58] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [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 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 4 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:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 89 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=89 )
FORMULA MAPK-PT-00020-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:48:58] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [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:48:58] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:58] [INFO ] Input system was already deterministic with 30 transitions.
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:48:58] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:48:58] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-23 00:48:58] [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 1592 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.773sec


RS generation: 0m 0.042sec


-> reachability set: #nodes 4792 (4.8e+03) #states 88,125,763,956 (10)



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

checking: EX [[AX [p14<=0] & AF [1<=p17]]]
normalized: EX [[~ [EG [~ [1<=p17]]] & ~ [EX [~ [p14<=0]]]]]

abstracting: (p14<=0)
states: 35,509,487,256 (10)
.abstracting: (1<=p17)
states: 69,310,935,860 (10)
..
EG iterations: 2
.-> the formula is TRUE

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

MC time: 0m 0.087sec

checking: AG [EX [EF [[AF [[1<=p3 & 1<=p16]] | [p12<=0 & p13<=0]]]]]
normalized: ~ [E [true U ~ [EX [E [true U [[p12<=0 & p13<=0] | ~ [EG [~ [[1<=p3 & 1<=p16]]]]]]]]]]

abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p3)
states: 52,616,276,700 (10)
.
EG iterations: 1
abstracting: (p13<=0)
states: 35,509,487,256 (10)
abstracting: (p12<=0)
states: 41,129,824,956 (10)
.-> the formula is TRUE

FORMULA MAPK-PT-00020-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: EF [AG [AF [[AX [[p2<=0 | p16<=0]] | [AG [1<=p5] & 1<=p13]]]]]
normalized: E [true U ~ [E [true U EG [~ [[[1<=p13 & ~ [E [true U ~ [1<=p5]]]] | ~ [EX [~ [[p2<=0 | p16<=0]]]]]]]]]]

abstracting: (p16<=0)
states: 9,566,905,276 (9)
abstracting: (p2<=0)
states: 1,055,241,000 (9)
.abstracting: (1<=p5)
states: 67,744,017,220 (10)
abstracting: (1<=p13)
states: 52,616,276,700 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA MAPK-PT-00020-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.084sec

checking: AX [A [EG [EX [[1<=p0 & [1<=p10 & 1<=p16]]]] U 1<=p12]]
normalized: ~ [EX [~ [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [EG [EX [[1<=p0 & [1<=p10 & 1<=p16]]]]] & ~ [1<=p12]]]]]]]]

abstracting: (1<=p12)
states: 46,995,939,000 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p10)
states: 52,616,276,700 (10)
abstracting: (1<=p0)
states: 40,547,502,060 (10)
..
EG iterations: 1
abstracting: (1<=p12)
states: 46,995,939,000 (10)
abstracting: (1<=p12)
states: 46,995,939,000 (10)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA MAPK-PT-00020-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.223sec

checking: EG [[EF [AG [E [1<=p5 U 1<=p18]]] | AG [[1<=p2 & [1<=p16 & p19<=0]]]]]
normalized: EG [[~ [E [true U ~ [[1<=p2 & [1<=p16 & p19<=0]]]]] | E [true U ~ [E [true U ~ [E [1<=p5 U 1<=p18]]]]]]]

abstracting: (1<=p18)
states: 46,995,939,000 (10)
abstracting: (1<=p5)
states: 67,744,017,220 (10)
abstracting: (p19<=0)
states: 10,238,070,276 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p2)
states: 87,070,522,956 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA MAPK-PT-00020-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.127sec

checking: E [EF [AG [[[1<=p0 & 1<=p16] & 1<=p3]]] U [1<=p0 & AG [[1<=p9 & 1<=p11]]]]
normalized: E [E [true U ~ [E [true U ~ [[1<=p3 & [1<=p0 & 1<=p16]]]]]] U [1<=p0 & ~ [E [true U ~ [[1<=p9 & 1<=p11]]]]]]

abstracting: (1<=p11)
states: 67,744,017,220 (10)
abstracting: (1<=p9)
states: 88,024,261,668 (10)
abstracting: (1<=p0)
states: 40,547,502,060 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p0)
states: 40,547,502,060 (10)
abstracting: (1<=p3)
states: 52,616,276,700 (10)
-> the formula is FALSE

FORMULA MAPK-PT-00020-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: EX [AG [[1<=p0 & [~ [E [A [1<=p19 U 1<=p17] U ~ [[1<=p10 & 1<=p16]]]] & [[p6<=0 | p7<=0] | [p8<=0 | p10<=0]]]]]]
normalized: EX [~ [E [true U ~ [[1<=p0 & [[[p8<=0 | p10<=0] | [p6<=0 | p7<=0]] & ~ [E [[~ [EG [~ [1<=p17]]] & ~ [E [~ [1<=p17] U [~ [1<=p19] & ~ [1<=p17]]]]] U ~ [[1<=p10 & 1<=p16]]]]]]]]]]

abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p10)
states: 52,616,276,700 (10)
abstracting: (1<=p17)
states: 69,310,935,860 (10)
abstracting: (1<=p19)
states: 77,887,693,680 (10)
abstracting: (1<=p17)
states: 69,310,935,860 (10)
abstracting: (1<=p17)
states: 69,310,935,860 (10)
..
EG iterations: 2
abstracting: (p7<=0)
states: 35,509,487,256 (10)
abstracting: (p6<=0)
states: 20,381,746,736 (10)
abstracting: (p10<=0)
states: 35,509,487,256 (10)
abstracting: (p8<=0)
states: 45,023,616 (7)
abstracting: (1<=p0)
states: 40,547,502,060 (10)
.-> the formula is FALSE

FORMULA MAPK-PT-00020-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.080sec

checking: [EX [[[[EG [1<=p1] | EG [1<=p14]] & [EG [1<=p0] | AG [1<=p13]]] & [EF [[1<=p2 & 1<=p16]] & EF [1<=p14]]]] | EF [AX [[1<=p14 | 1<=p5]]]]
normalized: [E [true U ~ [EX [~ [[1<=p14 | 1<=p5]]]]] | EX [[[E [true U 1<=p14] & E [true U [1<=p2 & 1<=p16]]] & [[~ [E [true U ~ [1<=p13]]] | EG [1<=p0]] & [EG [1<=p14] | EG [1<=p1]]]]]]

abstracting: (1<=p1)
states: 40,547,502,060 (10)
.
EG iterations: 1
abstracting: (1<=p14)
states: 52,616,276,700 (10)
.
EG iterations: 1
abstracting: (1<=p0)
states: 40,547,502,060 (10)
.
EG iterations: 1
abstracting: (1<=p13)
states: 52,616,276,700 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p2)
states: 87,070,522,956 (10)
abstracting: (1<=p14)
states: 52,616,276,700 (10)
.abstracting: (1<=p5)
states: 67,744,017,220 (10)
abstracting: (1<=p14)
states: 52,616,276,700 (10)
.-> the formula is TRUE

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

MC time: 0m 0.295sec

checking: AG [EF [[1<=p8 & [1<=p10 & [1<=p1 | A [[[1<=p3 & 1<=p16] | [1<=p2 & 1<=p16]] U [[1<=p2 & 1<=p16] | [1<=p6 & 1<=p7]]]]]]]]
normalized: ~ [E [true U ~ [E [true U [1<=p8 & [1<=p10 & [1<=p1 | [~ [EG [~ [[[1<=p6 & 1<=p7] | [1<=p2 & 1<=p16]]]]] & ~ [E [~ [[[1<=p6 & 1<=p7] | [1<=p2 & 1<=p16]]] U [~ [[[1<=p2 & 1<=p16] | [1<=p3 & 1<=p16]]] & ~ [[[1<=p6 & 1<=p7] | [1<=p2 & 1<=p16]]]]]]]]]]]]]]

abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p2)
states: 87,070,522,956 (10)
abstracting: (1<=p7)
states: 52,616,276,700 (10)
abstracting: (1<=p6)
states: 67,744,017,220 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p3)
states: 52,616,276,700 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p2)
states: 87,070,522,956 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p2)
states: 87,070,522,956 (10)
abstracting: (1<=p7)
states: 52,616,276,700 (10)
abstracting: (1<=p6)
states: 67,744,017,220 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p2)
states: 87,070,522,956 (10)
abstracting: (1<=p7)
states: 52,616,276,700 (10)
abstracting: (1<=p6)
states: 67,744,017,220 (10)
.
EG iterations: 1
abstracting: (1<=p1)
states: 40,547,502,060 (10)
abstracting: (1<=p10)
states: 52,616,276,700 (10)
abstracting: (1<=p8)
states: 88,080,740,340 (10)
-> the formula is TRUE

FORMULA MAPK-PT-00020-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.376sec

checking: E [~ [[AF [[AG [1<=p18] | A [[1<=p3 & 1<=p16] U 1<=p18]]] & [1<=p20 & 1<=p21]]] U ~ [[EG [[EX [1<=p13] | E [1<=p4 U [1<=p20 & 1<=p21]]]] | [EF [AG [[1<=p7 & 1<=p15]]] | AX [p12<=0]]]]]
normalized: E [~ [[[1<=p20 & 1<=p21] & ~ [EG [~ [[[~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [~ [[1<=p3 & 1<=p16]] & ~ [1<=p18]]]]] | ~ [E [true U ~ [1<=p18]]]]]]]]] U ~ [[[~ [EX [~ [p12<=0]]] | E [true U ~ [E [true U ~ [[1<=p7 & 1<=p15]]]]]] | EG [[E [1<=p4 U [1<=p20 & 1<=p21]] | EX [1<=p13]]]]]]

abstracting: (1<=p13)
states: 52,616,276,700 (10)
.abstracting: (1<=p21)
states: 78,558,858,680 (10)
abstracting: (1<=p20)
states: 77,436,914,880 (10)
abstracting: (1<=p4)
states: 67,744,017,220 (10)
.
EG iterations: 1
abstracting: (1<=p15)
states: 67,744,017,220 (10)
abstracting: (1<=p7)
states: 52,616,276,700 (10)
abstracting: (p12<=0)
states: 41,129,824,956 (10)
.abstracting: (1<=p18)
states: 46,995,939,000 (10)
abstracting: (1<=p18)
states: 46,995,939,000 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p3)
states: 52,616,276,700 (10)
abstracting: (1<=p18)
states: 46,995,939,000 (10)
abstracting: (1<=p18)
states: 46,995,939,000 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p21)
states: 78,558,858,680 (10)
abstracting: (1<=p20)
states: 77,436,914,880 (10)
-> the formula is TRUE

FORMULA MAPK-PT-00020-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.295sec

checking: [AG [[EX [[EF [[1<=p20 & 1<=p21]] & A [1<=p4 U 1<=p13]]] & [EX [EG [1<=p4]] & [[1<=p7 & 1<=p15] | [[1<=p9 & [1<=p11 & [1<=p1 | [1<=p7 & 1<=p8]]]] | EF [p12<=0]]]]]] & EG [p4<=0]]
normalized: [EG [p4<=0] & ~ [E [true U ~ [[[[[E [true U p12<=0] | [1<=p9 & [1<=p11 & [1<=p1 | [1<=p7 & 1<=p8]]]]] | [1<=p7 & 1<=p15]] & EX [EG [1<=p4]]] & EX [[[~ [EG [~ [1<=p13]]] & ~ [E [~ [1<=p13] U [~ [1<=p4] & ~ [1<=p13]]]]] & E [true U [1<=p20 & 1<=p21]]]]]]]]]

abstracting: (1<=p21)
states: 78,558,858,680 (10)
abstracting: (1<=p20)
states: 77,436,914,880 (10)
abstracting: (1<=p13)
states: 52,616,276,700 (10)
abstracting: (1<=p4)
states: 67,744,017,220 (10)
abstracting: (1<=p13)
states: 52,616,276,700 (10)
abstracting: (1<=p13)
states: 52,616,276,700 (10)
.
EG iterations: 1
.abstracting: (1<=p4)
states: 67,744,017,220 (10)
.
EG iterations: 1
.abstracting: (1<=p15)
states: 67,744,017,220 (10)
abstracting: (1<=p7)
states: 52,616,276,700 (10)
abstracting: (1<=p8)
states: 88,080,740,340 (10)
abstracting: (1<=p7)
states: 52,616,276,700 (10)
abstracting: (1<=p1)
states: 40,547,502,060 (10)
abstracting: (1<=p11)
states: 67,744,017,220 (10)
abstracting: (1<=p9)
states: 88,024,261,668 (10)
abstracting: (p12<=0)
states: 41,129,824,956 (10)
abstracting: (p4<=0)
states: 20,381,746,736 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA MAPK-PT-00020-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.214sec

checking: E [[1<=p4 & [1<=p7 & 1<=p8]] U ~ [E [[~ [[[1<=p12 | 1<=p19] & [[1<=p3 & 1<=p16] | [1<=p20 & 1<=p21]]]] & [[1<=p17 | [1<=p2 & 1<=p16]] | [EF [1<=p19] | AG [1<=p0]]]] U [1<=p13 & ~ [EF [[1<=p6 & 1<=p7]]]]]]]
normalized: E [[1<=p4 & [1<=p7 & 1<=p8]] U ~ [E [[[[~ [E [true U ~ [1<=p0]]] | E [true U 1<=p19]] | [1<=p17 | [1<=p2 & 1<=p16]]] & ~ [[[[1<=p20 & 1<=p21] | [1<=p3 & 1<=p16]] & [1<=p12 | 1<=p19]]]] U [1<=p13 & ~ [E [true U [1<=p6 & 1<=p7]]]]]]]

abstracting: (1<=p7)
states: 52,616,276,700 (10)
abstracting: (1<=p6)
states: 67,744,017,220 (10)
abstracting: (1<=p13)
states: 52,616,276,700 (10)
abstracting: (1<=p19)
states: 77,887,693,680 (10)
abstracting: (1<=p12)
states: 46,995,939,000 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p3)
states: 52,616,276,700 (10)
abstracting: (1<=p21)
states: 78,558,858,680 (10)
abstracting: (1<=p20)
states: 77,436,914,880 (10)
abstracting: (1<=p16)
states: 78,558,858,680 (10)
abstracting: (1<=p2)
states: 87,070,522,956 (10)
abstracting: (1<=p17)
states: 69,310,935,860 (10)
abstracting: (1<=p19)
states: 77,887,693,680 (10)
abstracting: (1<=p0)
states: 40,547,502,060 (10)
abstracting: (1<=p8)
states: 88,080,740,340 (10)
abstracting: (1<=p7)
states: 52,616,276,700 (10)
abstracting: (1<=p4)
states: 67,744,017,220 (10)
-> the formula is TRUE

FORMULA MAPK-PT-00020-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

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

abstracting: (p16<=0)
states: 9,566,905,276 (9)
abstracting: (p2<=0)
states: 1,055,241,000 (9)
.abstracting: (1<=p14)
states: 52,616,276,700 (10)
abstracting: (p4<=0)
states: 20,381,746,736 (10)
abstracting: (p16<=0)
states: 9,566,905,276 (9)
abstracting: (p2<=0)
states: 1,055,241,000 (9)
.
EG iterations: 1
abstracting: (p4<=0)
states: 20,381,746,736 (10)
abstracting: (p5<=0)
states: 20,381,746,736 (10)
abstracting: (1<=p12)
states: 46,995,939,000 (10)
abstracting: (p1<=0)
states: 47,578,261,896 (10)
.abstracting: (p19<=0)
states: 10,238,070,276 (10)
.abstracting: (1<=p11)
states: 67,744,017,220 (10)
abstracting: (1<=p9)
states: 88,024,261,668 (10)
.abstracting: (1<=p10)
states: 52,616,276,700 (10)
abstracting: (1<=p8)
states: 88,080,740,340 (10)
abstracting: (1<=p12)
states: 46,995,939,000 (10)
abstracting: (1<=p10)
states: 52,616,276,700 (10)
abstracting: (1<=p8)
states: 88,080,740,340 (10)
abstracting: (1<=p10)
states: 52,616,276,700 (10)
abstracting: (1<=p8)
states: 88,080,740,340 (10)
.
EG iterations: 1
abstracting: (1<=p8)
states: 88,080,740,340 (10)
abstracting: (1<=p7)
states: 52,616,276,700 (10)
.abstracting: (1<=p4)
states: 67,744,017,220 (10)
abstracting: (1<=p1)
states: 40,547,502,060 (10)
abstracting: (1<=p19)
states: 77,887,693,680 (10)
abstracting: (1<=p1)
states: 40,547,502,060 (10)
.abstracting: (1<=p19)
states: 77,887,693,680 (10)
abstracting: (1<=p10)
states: 52,616,276,700 (10)
abstracting: (1<=p8)
states: 88,080,740,340 (10)
abstracting: (1<=p1)
states: 40,547,502,060 (10)
abstracting: (1<=p4)
states: 67,744,017,220 (10)
abstracting: (1<=p1)
states: 40,547,502,060 (10)
abstracting: (1<=p4)
states: 67,744,017,220 (10)
abstracting: (1<=p1)
states: 40,547,502,060 (10)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.653sec

totally nodes used: 854810 (8.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 10587966 3592375 14180341
used/not used/entry size/cache size: 4145609 62963255 16 1024MB
basic ops cache: hits/miss/sum: 2256324 827753 3084077
used/not used/entry size/cache size: 1364222 15412994 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: 150422 50519 200941
used/not used/entry size/cache size: 50400 8338208 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 66413950
1 659460
2 21449
3 3837
4 4085
5 1646
6 1169
7 461
8 166
9 410
>= 10 2231

Total processing time: 0m 7.450sec


BK_STOP 1679532546704

--------------------
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:1850 (61), effective:280 (9)

initing FirstDep: 0m 0.000sec


iterations count:250 (8), effective:20 (0)

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

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

iterations count:114 (3), effective:39 (1)

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

iterations count:190 (6), effective:25 (0)

iterations count:428 (14), effective:71 (2)

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

iterations count:39 (1), effective:9 (0)

iterations count:165 (5), effective:15 (0)

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

iterations count:39 (1), effective:9 (0)

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

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

iterations count:115 (3), effective:11 (0)

iterations count:163 (5), effective:21 (0)

iterations count:955 (31), effective:175 (5)

iterations count:217 (7), effective:25 (0)

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

iterations count:50 (1), effective:10 (0)

iterations count:100 (3), effective:10 (0)

iterations count:493 (16), effective:79 (2)

iterations count:477 (15), effective:58 (1)

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

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

iterations count:210 (7), effective:10 (0)

iterations count:225 (7), effective:30 (1)

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

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

iterations count:40 (1), effective:10 (0)

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

iterations count:473 (15), effective:46 (1)

iterations count:210 (7), effective:10 (0)

iterations count:290 (9), effective:50 (1)

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

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

iterations count:165 (5), effective:15 (0)

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

iterations count:225 (7), effective:23 (0)

iterations count:142 (4), effective:16 (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="MAPK-PT-00020"
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-00020, 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-167856420500554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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