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-167856420500553.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420500553
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME MAPK-PT-00020-CTLCardinality-01
FORMULA_NAME MAPK-PT-00020-CTLCardinality-02
FORMULA_NAME MAPK-PT-00020-CTLCardinality-03
FORMULA_NAME MAPK-PT-00020-CTLCardinality-04
FORMULA_NAME MAPK-PT-00020-CTLCardinality-05
FORMULA_NAME MAPK-PT-00020-CTLCardinality-06
FORMULA_NAME MAPK-PT-00020-CTLCardinality-07
FORMULA_NAME MAPK-PT-00020-CTLCardinality-08
FORMULA_NAME MAPK-PT-00020-CTLCardinality-09
FORMULA_NAME MAPK-PT-00020-CTLCardinality-10
FORMULA_NAME MAPK-PT-00020-CTLCardinality-11
FORMULA_NAME MAPK-PT-00020-CTLCardinality-12
FORMULA_NAME MAPK-PT-00020-CTLCardinality-13
FORMULA_NAME MAPK-PT-00020-CTLCardinality-14
FORMULA_NAME MAPK-PT-00020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679532469947

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-00020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:47:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 00:47:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:47:51] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-23 00:47:51] [INFO ] Transformed 22 places.
[2023-03-23 00:47:51] [INFO ] Transformed 30 transitions.
[2023-03-23 00:47:51] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
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:47:51] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-23 00:47:51] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-23 00:47:51] [INFO ] Invariant cache hit.
[2023-03-23 00:47:51] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-23 00:47:51] [INFO ] Invariant cache hit.
[2023-03-23 00:47:51] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-23 00:47:52] [INFO ] Flatten gal took : 18 ms
[2023-03-23 00:47:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MAPK-PT-00020-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 00:47:52] [INFO ] Flatten gal took : 6 ms
[2023-03-23 00:47:52] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 99) seen :67
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-23 00:47:52] [INFO ] Invariant cache hit.
[2023-03-23 00:47:52] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-23 00:47:52] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:26
[2023-03-23 00:47:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-23 00:47:52] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :28 sat :4
[2023-03-23 00:47:52] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :28 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-23 00:47:52] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :28 sat :4
Fused 32 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 19 ms.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 13 transition count 23
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 4 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 22 place count 12 transition count 18
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 12 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 12 transition count 15
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 12 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 11 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 11 transition count 13
Applied a total of 29 rules in 14 ms. Remains 11 /22 variables (removed 11) and now considering 13/30 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 11/22 places, 13/30 transitions.
Finished random walk after 1770 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=590 )
Successfully simplified 28 atomic propositions for a total of 15 simplifications.
FORMULA MAPK-PT-00020-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 00:47:52] [INFO ] Flatten gal took : 4 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 4 ms
[2023-03-23 00:47:53] [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:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [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:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [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:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [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:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [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
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 13 place count 17 transition count 25
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 16 transition count 24
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 16 transition count 24
Applied a total of 15 rules in 6 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:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [INFO ] Input system was already deterministic with 24 transitions.
Support contains 1 out of 16 places (down from 3) after GAL structural reductions.
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 1 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 1 ms. Remains : 20/22 places, 29/30 transitions.
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Input system was already deterministic with 29 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:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [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:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [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:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [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
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
Applied a total of 7 rules in 3 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 3 ms. Remains : 18/22 places, 27/30 transitions.
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [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:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [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:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [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:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [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:47:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Input system was already deterministic with 30 transitions.
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:47:53] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-23 00:47:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 30 transitions and 90 arcs took 1 ms.
Total runtime 1747 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 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.713sec


RS generation: 0m 0.042sec


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



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

checking: AX [EX [AF [EX [0<=0]]]]
normalized: ~ [EX [~ [EX [~ [EG [~ [EX [0<=0]]]]]]]]

abstracting: (0<=0)
states: 88,125,763,956 (10)
..
EG iterations: 1
..-> the formula is TRUE

FORMULA MAPK-PT-00020-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: AF [AG [~ [19<=p16]]]
normalized: ~ [EG [E [true U 19<=p16]]]

abstracting: (19<=p16)
states: 90,146,342 (7)

EG iterations: 0
-> the formula is FALSE

FORMULA MAPK-PT-00020-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [EF [E [p0<=p6 U 3<=p13]]]
normalized: ~ [E [true U ~ [E [true U E [p0<=p6 U 3<=p13]]]]]

abstracting: (3<=p13)
states: 16,079,210,945 (10)
abstracting: (p0<=p6)
states: 73,182,486,647 (10)
-> the formula is TRUE

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

MC time: 0m 0.145sec

checking: AX [AX [[AG [[~ [p13<=16] | ~ [20<=p16]]] & EX [p5<=p21]]]]
normalized: ~ [EX [EX [~ [[EX [p5<=p21] & ~ [E [true U ~ [[~ [20<=p16] | ~ [p13<=16]]]]]]]]]]

abstracting: (p13<=16)
states: 88,125,763,956 (10)
abstracting: (20<=p16)
states: 16,927,768 (7)
abstracting: (p5<=p21)
states: 65,031,674,718 (10)
...-> the formula is FALSE

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

MC time: 0m 0.333sec

checking: [~ [E [A [AX [p11<=6] U ~ [E [p3<=1 U 3<=p1]]] U 6<=p4]] | AX [AX [AX [9<=p4]]]]
normalized: [~ [EX [EX [EX [~ [9<=p4]]]]] | ~ [E [[~ [EG [E [p3<=1 U 3<=p1]]] & ~ [E [E [p3<=1 U 3<=p1] U [EX [~ [p11<=6]] & E [p3<=1 U 3<=p1]]]]] U 6<=p4]]]

abstracting: (6<=p4)
states: 13,097,868,275 (10)
abstracting: (3<=p1)
states: 7,081,176,804 (9)
abstracting: (p3<=1)
states: 58,193,204,656 (10)
abstracting: (p11<=6)
states: 79,539,928,251 (10)
.abstracting: (3<=p1)
states: 7,081,176,804 (9)
abstracting: (p3<=1)
states: 58,193,204,656 (10)
abstracting: (3<=p1)
states: 7,081,176,804 (9)
abstracting: (p3<=1)
states: 58,193,204,656 (10)
.
EG iterations: 1
abstracting: (9<=p4)
states: 3,178,395,000 (9)
...-> the formula is FALSE

FORMULA MAPK-PT-00020-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.506sec

checking: AG [[EG [[[A [5<=p1 U p16<=p13] & [~ [6<=p0] & ~ [4<=p19]]] | p4<=8]] | 12<=p9]]
normalized: ~ [E [true U ~ [[12<=p9 | EG [[p4<=8 | [[~ [4<=p19] & ~ [6<=p0]] & [~ [EG [~ [p16<=p13]]] & ~ [E [~ [p16<=p13] U [~ [5<=p1] & ~ [p16<=p13]]]]]]]]]]]]

abstracting: (p16<=p13)
states: 20,510,758,476 (10)
abstracting: (5<=p1)
states: 876,943,768 (8)
abstracting: (p16<=p13)
states: 20,510,758,476 (10)
abstracting: (p16<=p13)
states: 20,510,758,476 (10)
.
EG iterations: 1
abstracting: (6<=p0)
states: 257,682,625 (8)
abstracting: (4<=p19)
states: 50,995,513,428 (10)
abstracting: (p4<=8)
states: 84,947,368,956 (10)
.
EG iterations: 1
abstracting: (12<=p9)
states: 28,308,181,330 (10)
-> the formula is FALSE

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

MC time: 0m 0.325sec

checking: [AG [[E [p16<=p3 U p5<=5] & E [p17<=p21 U p4<=p19]]] & EF [~ [p11<=7]]]
normalized: [E [true U ~ [p11<=7]] & ~ [E [true U ~ [[E [p17<=p21 U p4<=p19] & E [p16<=p3 U p5<=5]]]]]]

abstracting: (p5<=5)
states: 75,027,895,681 (10)
abstracting: (p16<=p3)
states: 20,510,758,476 (10)
abstracting: (p4<=p19)
states: 64,189,124,328 (10)
abstracting: (p17<=p21)
states: 66,970,570,215 (10)
abstracting: (p11<=7)
states: 82,751,388,756 (10)
-> the formula is FALSE

FORMULA MAPK-PT-00020-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.086sec

checking: AG [~ [E [[~ [AX [1<=0]] | [~ [10<=p18] | 3<=p15]] U [[EG [3<=p12] | [~ [p15<=16] | ~ [p12<=p17]]] & AG [[p9<=p7 & p16<=10]]]]]]
normalized: ~ [E [true U E [[[3<=p15 | ~ [10<=p18]] | EX [~ [1<=0]]] U [~ [E [true U ~ [[p9<=p7 & p16<=10]]]] & [[~ [p12<=p17] | ~ [p15<=16]] | EG [3<=p12]]]]]]

abstracting: (3<=p12)
states: 11,256,664,704 (10)
.
EG iterations: 1
abstracting: (p15<=16)
states: 88,125,763,956 (10)
abstracting: (p12<=p17)
states: 70,150,770,231 (10)
abstracting: (p16<=10)
states: 76,255,423,276 (10)
abstracting: (p9<=p7)
states: 1,792,869,030 (9)
abstracting: (1<=0)
states: 0
.abstracting: (10<=p18)
states: 972,876 (5)
abstracting: (3<=p15)
states: 37,845,286,015 (10)
-> the formula is TRUE

FORMULA MAPK-PT-00020-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.124sec

checking: AX [AF [E [[A [p21<=p2 U p17<=p15] | ~ [[p11<=0 | 7<=p11]]] U ~ [[19<=p8 | p3<=p2]]]]]
normalized: ~ [EX [EG [~ [E [[~ [[p11<=0 | 7<=p11]] | [~ [EG [~ [p17<=p15]]] & ~ [E [~ [p17<=p15] U [~ [p21<=p2] & ~ [p17<=p15]]]]]] U ~ [[19<=p8 | p3<=p2]]]]]]]

abstracting: (p3<=p2)
states: 85,955,543,513 (10)
abstracting: (19<=p8)
states: 0
abstracting: (p17<=p15)
states: 53,006,246,651 (10)
abstracting: (p21<=p2)
states: 77,387,123,956 (10)
abstracting: (p17<=p15)
states: 53,006,246,651 (10)
abstracting: (p17<=p15)
states: 53,006,246,651 (10)
.
EG iterations: 1
abstracting: (7<=p11)
states: 8,585,835,705 (9)
abstracting: (p11<=0)
states: 20,381,746,736 (10)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA MAPK-PT-00020-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.090sec

checking: EF [[~ [p7<=p2] | [~ [p14<=7] | [AG [[~ [p7<=p21] | ~ [p19<=2]]] & ~ [A [EX [0<=0] U [10<=p20 | [p3<=5 | p6<=9]]]]]]]]
normalized: E [true U [[[~ [[~ [EG [~ [[10<=p20 | [p3<=5 | p6<=9]]]]] & ~ [E [~ [[10<=p20 | [p3<=5 | p6<=9]]] U [~ [EX [0<=0]] & ~ [[10<=p20 | [p3<=5 | p6<=9]]]]]]]] & ~ [E [true U ~ [[~ [p19<=2] | ~ [p7<=p21]]]]]] | ~ [p14<=7]] | ~ [p7<=p2]]]

abstracting: (p7<=p2)
states: 85,955,543,513 (10)
abstracting: (p14<=7)
states: 87,965,496,456 (10)
abstracting: (p7<=p21)
states: 76,697,673,756 (10)
abstracting: (p19<=2)
states: 28,803,195,540 (10)
abstracting: (p6<=9)
states: 86,375,840,891 (10)
abstracting: (p3<=5)
states: 86,594,297,076 (10)
abstracting: (10<=p20)
states: 0
abstracting: (0<=0)
states: 88,125,763,956 (10)
.abstracting: (p6<=9)
states: 86,375,840,891 (10)
abstracting: (p3<=5)
states: 86,594,297,076 (10)
abstracting: (10<=p20)
states: 0
abstracting: (p6<=9)
states: 86,375,840,891 (10)
abstracting: (p3<=5)
states: 86,594,297,076 (10)
abstracting: (10<=p20)
states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-00020-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.847sec

checking: EF [~ [E [[[19<=p15 | p17<=p9] | [[p18<=13 & 1<=p15] | p9<=p21]] U [~ [AF [p17<=p19]] & AF [AG [p16<=9]]]]]]
normalized: E [true U ~ [E [[[p9<=p21 | [p18<=13 & 1<=p15]] | [19<=p15 | p17<=p9]] U [~ [EG [E [true U ~ [p16<=9]]]] & EG [~ [p17<=p19]]]]]]

abstracting: (p17<=p19)
states: 66,511,870,116 (10)
.
EG iterations: 1
abstracting: (p16<=9)
states: 72,380,695,320 (10)

EG iterations: 0
abstracting: (p17<=p9)
states: 86,567,654,777 (10)
abstracting: (19<=p15)
states: 0
abstracting: (1<=p15)
states: 67,744,017,220 (10)
abstracting: (p18<=13)
states: 88,125,763,956 (10)
abstracting: (p9<=p21)
states: 20,583,191,056 (10)
-> the formula is TRUE

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

MC time: 0m 0.345sec

checking: E [E [AF [p6<=p7] U [AX [~ [p12<=p6]] | EX [A [p2<=p6 U p21<=p5]]]] U ~ [[14<=p11 | p1<=p2]]]
normalized: E [E [~ [EG [~ [p6<=p7]]] U [EX [[~ [EG [~ [p21<=p5]]] & ~ [E [~ [p21<=p5] U [~ [p2<=p6] & ~ [p21<=p5]]]]]] | ~ [EX [p12<=p6]]]] U ~ [[14<=p11 | p1<=p2]]]

abstracting: (p1<=p2)
states: 86,966,366,856 (10)
abstracting: (14<=p11)
states: 39,897,465 (7)
abstracting: (p12<=p6)
states: 70,405,403,508 (10)
.abstracting: (p21<=p5)
states: 31,344,128,969 (10)
abstracting: (p2<=p6)
states: 8,420,402,396 (9)
abstracting: (p21<=p5)
states: 31,344,128,969 (10)
abstracting: (p21<=p5)
states: 31,344,128,969 (10)
.
EG iterations: 1
.abstracting: (p6<=p7)
states: 37,756,812,816 (10)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m36.867sec

checking: [E [AF [[p15<=p12 | [[p5<=p8 & p8<=18] & [[p17<=16 | p4<=12] & [p19<=p3 & p14<=p17]]]]] U AF [[~ [AG [p15<=13]] & ~ [[p11<=1 | [p8<=p15 & 10<=p6]]]]]] | A [AX [AX [p16<=16]] U [~ [[p15<=12 | ~ [AX [14<=p4]]]] | ~ [EF [AX [1<=0]]]]]]
normalized: [[~ [EG [~ [[~ [E [true U ~ [EX [~ [1<=0]]]]] | ~ [[p15<=12 | EX [~ [14<=p4]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [EX [~ [1<=0]]]]] | ~ [[p15<=12 | EX [~ [14<=p4]]]]]] U [EX [EX [~ [p16<=16]]] & ~ [[~ [E [true U ~ [EX [~ [1<=0]]]]] | ~ [[p15<=12 | EX [~ [14<=p4]]]]]]]]]] | E [~ [EG [~ [[p15<=p12 | [[[p19<=p3 & p14<=p17] & [p17<=16 | p4<=12]] & [p5<=p8 & p8<=18]]]]]] U ~ [EG [~ [[~ [[p11<=1 | [p8<=p15 & 10<=p6]]] & E [true U ~ [p15<=13]]]]]]]]

abstracting: (p15<=13)
states: 88,085,866,491 (10)
abstracting: (10<=p6)
states: 1,749,923,065 (9)
abstracting: (p8<=p15)
states: 9,698,236,741 (9)
abstracting: (p11<=1)
states: 36,972,612,791 (10)
.
EG iterations: 1
abstracting: (p8<=18)
states: 88,125,763,956 (10)
abstracting: (p5<=p8)
states: 81,673,165,305 (10)
abstracting: (p4<=12)
states: 87,982,127,865 (10)
abstracting: (p17<=16)
states: 88,125,763,956 (10)
abstracting: (p14<=p17)
states: 66,345,854,376 (10)
abstracting: (p19<=p3)
states: 21,525,369,876 (10)
abstracting: (p15<=p12)
states: 34,730,252,784 (10)
..
EG iterations: 2
abstracting: (14<=p4)
states: 39,897,465 (7)
.abstracting: (p15<=12)
states: 87,982,127,865 (10)
abstracting: (1<=0)
states: 0
.abstracting: (p16<=16)
states: 87,459,841,556 (10)
..abstracting: (14<=p4)
states: 39,897,465 (7)
.abstracting: (p15<=12)
states: 87,982,127,865 (10)
abstracting: (1<=0)
states: 0
.abstracting: (14<=p4)
states: 39,897,465 (7)
.abstracting: (p15<=12)
states: 87,982,127,865 (10)
abstracting: (1<=0)
states: 0
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 7.454sec

checking: AF [[AX [E [[[p16<=p21 | p10<=p18] | [2<=p11 & p6<=p9]] U [16<=p4 | 5<=p14]]] & [[EG [[[p2<=p6 & p15<=p8] | ~ [p15<=p10]]] | [AX [EX [0<=0]] | ~ [p5<=13]]] | [~ [p21<=p14] | [~ [p18<=p7] | [15<=p6 & AF [p7<=p20]]]]]]]
normalized: ~ [EG [~ [[[[[[15<=p6 & ~ [EG [~ [p7<=p20]]]] | ~ [p18<=p7]] | ~ [p21<=p14]] | [[~ [p5<=13] | ~ [EX [~ [EX [0<=0]]]]] | EG [[~ [p15<=p10] | [p2<=p6 & p15<=p8]]]]] & ~ [EX [~ [E [[[2<=p11 & p6<=p9] | [p16<=p21 | p10<=p18]] U [16<=p4 | 5<=p14]]]]]]]]]

abstracting: (5<=p14)
states: 3,709,210,608 (9)
abstracting: (16<=p4)
states: 0
abstracting: (p10<=p18)
states: 52,126,808,913 (10)
abstracting: (p16<=p21)
states: 46,492,181,583 (10)
abstracting: (p6<=p9)
states: 88,125,763,956 (10)
abstracting: (2<=p11)
states: 51,153,151,165 (10)
.abstracting: (p15<=p8)
states: 81,673,165,305 (10)
abstracting: (p2<=p6)
states: 8,420,402,396 (9)
abstracting: (p15<=p10)
states: 37,756,812,816 (10)
.
EG iterations: 1
abstracting: (0<=0)
states: 88,125,763,956 (10)
..abstracting: (p5<=13)
states: 88,085,866,491 (10)
abstracting: (p21<=p14)
states: 20,510,758,476 (10)
abstracting: (p18<=p7)
states: 59,760,229,504 (10)
abstracting: (p7<=p20)
states: 72,551,622,373 (10)
..
EG iterations: 2
abstracting: (15<=p6)
states: 6,343,893 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-00020-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.871sec

totally nodes used: 9491773 (9.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 97790754 28846334 126637088
used/not used/entry size/cache size: 28648278 38460586 16 1024MB
basic ops cache: hits/miss/sum: 31349557 11048588 42398145
used/not used/entry size/cache size: 10958668 5818548 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: 684396 213942 898338
used/not used/entry size/cache size: 211377 8177231 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 60746999
1 5717784
2 417479
3 66304
4 43247
5 17782
6 11719
7 14907
8 8983
9 6891
>= 10 56769

Total processing time: 1m21.544sec


BK_STOP 1679532555829

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1850 (61), effective:280 (9)

initing FirstDep: 0m 0.000sec


iterations count:700 (23), effective:73 (2)

iterations count:281 (9), effective:31 (1)

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

iterations count:715 (23), effective:75 (2)

iterations count:324 (10), effective:41 (1)

iterations count:324 (10), effective:41 (1)

iterations count:372 (12), effective:62 (2)

iterations count:324 (10), effective:41 (1)

iterations count:307 (10), effective:51 (1)

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

iterations count:691 (23), effective:123 (4)

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

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

iterations count:1118 (37), effective:179 (5)

iterations count:437 (14), effective:73 (2)

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

iterations count:422 (14), effective:38 (1)

iterations count:982 (32), effective:114 (3)

iterations count:407 (13), effective:63 (2)

iterations count:984 (32), effective:115 (3)

iterations count:520 (17), effective:50 (1)

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

iterations count:533 (17), effective:94 (3)

iterations count:833 (27), effective:169 (5)

iterations count:2453 (81), effective:373 (12)

iterations count:416 (13), effective:76 (2)

iterations count:545 (18), effective:80 (2)

iterations count:2393 (79), effective:378 (12)

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="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is MAPK-PT-00020, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420500553"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;