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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.0K Feb 26 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 10:47 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-00008-CTLCardinality-00
FORMULA_NAME MAPK-PT-00008-CTLCardinality-01
FORMULA_NAME MAPK-PT-00008-CTLCardinality-02
FORMULA_NAME MAPK-PT-00008-CTLCardinality-03
FORMULA_NAME MAPK-PT-00008-CTLCardinality-04
FORMULA_NAME MAPK-PT-00008-CTLCardinality-05
FORMULA_NAME MAPK-PT-00008-CTLCardinality-06
FORMULA_NAME MAPK-PT-00008-CTLCardinality-07
FORMULA_NAME MAPK-PT-00008-CTLCardinality-08
FORMULA_NAME MAPK-PT-00008-CTLCardinality-09
FORMULA_NAME MAPK-PT-00008-CTLCardinality-10
FORMULA_NAME MAPK-PT-00008-CTLCardinality-11
FORMULA_NAME MAPK-PT-00008-CTLCardinality-12
FORMULA_NAME MAPK-PT-00008-CTLCardinality-13
FORMULA_NAME MAPK-PT-00008-CTLCardinality-14
FORMULA_NAME MAPK-PT-00008-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679532330163

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-00008
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:45:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 00:45:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:45:32] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-23 00:45:32] [INFO ] Transformed 22 places.
[2023-03-23 00:45:32] [INFO ] Transformed 30 transitions.
[2023-03-23 00:45:32] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MAPK-PT-00008-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 8 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:45:32] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-23 00:45:32] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-23 00:45:32] [INFO ] Invariant cache hit.
[2023-03-23 00:45:32] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-23 00:45:32] [INFO ] Invariant cache hit.
[2023-03-23 00:45:32] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-23 00:45:32] [INFO ] Flatten gal took : 16 ms
[2023-03-23 00:45:32] [INFO ] Flatten gal took : 5 ms
[2023-03-23 00:45:32] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 80) seen :55
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Running SMT prover for 25 properties.
[2023-03-23 00:45:33] [INFO ] Invariant cache hit.
[2023-03-23 00:45:33] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-23 00:45:33] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:22
[2023-03-23 00:45:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-23 00:45:33] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :24 sat :1
[2023-03-23 00:45:33] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :24 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-23 00:45:33] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :24 sat :1
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 30/30 transitions.
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 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 16 transition count 25
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 16 place count 16 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 16 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 16 transition count 18
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 21 place count 14 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 14 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 13 transition count 15
Applied a total of 24 rules in 14 ms. Remains 13 /22 variables (removed 9) and now considering 15/30 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 13/22 places, 15/30 transitions.
Finished random walk after 2593 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=648 )
Successfully simplified 24 atomic propositions for a total of 14 simplifications.
FORMULA MAPK-PT-00008-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00008-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 9 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 4 ms
[2023-03-23 00:45:33] [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 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:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [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:45:33] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [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:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [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:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [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:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [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 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:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [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:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [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:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 4 ms
[2023-03-23 00:45:33] [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:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 20 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 3 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 17 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 25
Applied a total of 10 rules in 7 ms. Remains 17 /22 variables (removed 5) and now considering 25/30 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 17/22 places, 25/30 transitions.
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 131 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=131 )
FORMULA MAPK-PT-00008-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 17 transition count 24
Applied a total of 14 rules in 4 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 4 ms. Remains : 17/22 places, 24/30 transitions.
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [INFO ] Input system was already deterministic with 24 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:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [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:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:33] [INFO ] Input system was already deterministic with 30 transitions.
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:33] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-23 00:45:33] [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 1925 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.720sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 667 (6.7e+02) #states 6,110,643 (6)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

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

MC time: 0m 0.026sec

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [AX [AG [p6<=4]]]
normalized: E [true U ~ [EX [E [true U ~ [p6<=4]]]]]

abstracting: (p6<=4)
states: 6,010,040 (6)
.-> the formula is FALSE

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

MC time: 0m 0.019sec

checking: AG [EX [EG [~ [p9<=p0]]]]
normalized: ~ [E [true U ~ [EX [EG [~ [p9<=p0]]]]]]

abstracting: (p9<=p0)
states: 180,451 (5)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: AX [[p17<=p7 | AG [EF [[~ [5<=p1] & ~ [p14<=2]]]]]]
normalized: ~ [EX [~ [[p17<=p7 | ~ [E [true U ~ [E [true U [~ [p14<=2] & ~ [5<=p1]]]]]]]]]]

abstracting: (5<=p1)
states: 0
abstracting: (p14<=2)
states: 5,938,653 (6)
abstracting: (p17<=p7)
states: 3,506,328 (6)
.-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: E [~ [[~ [EF [3<=p6]] & ~ [EF [EX [p12<=p10]]]]] U AG [A [2<=p17 U EX [~ [1<=p14]]]]]
normalized: E [~ [[~ [E [true U EX [p12<=p10]]] & ~ [E [true U 3<=p6]]]] U ~ [E [true U ~ [[~ [EG [~ [EX [~ [1<=p14]]]]] & ~ [E [~ [EX [~ [1<=p14]]] U [~ [2<=p17] & ~ [EX [~ [1<=p14]]]]]]]]]]]

abstracting: (1<=p14)
states: 2,358,384 (6)
.abstracting: (2<=p17)
states: 1,552,180 (6)
abstracting: (1<=p14)
states: 2,358,384 (6)
.abstracting: (1<=p14)
states: 2,358,384 (6)
..
EG iterations: 1
abstracting: (3<=p6)
states: 863,522 (5)
abstracting: (p12<=p10)
states: 4,773,195 (6)
.-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: EF [~ [E [EX [p4<=2] U [EG [p12<=1] | [p8<=p12 | 6<=p7]]]]]
normalized: E [true U ~ [E [EX [p4<=2] U [[p8<=p12 | 6<=p7] | EG [p12<=1]]]]]

abstracting: (p12<=1)
states: 5,675,649 (6)
.
EG iterations: 1
abstracting: (6<=p7)
states: 0
abstracting: (p8<=p12)
states: 246,960 (5)
abstracting: (p4<=2)
states: 5,247,121 (6)
.-> the formula is TRUE

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

MC time: 0m 0.030sec

checking: EF [AG [[6<=p5 | [EF [p6<=p15] & ~ [p7<=p15]]]]]
normalized: E [true U ~ [E [true U ~ [[6<=p5 | [~ [p7<=p15] & E [true U p6<=p15]]]]]]]

abstracting: (p6<=p15)
states: 3,840,359 (6)
abstracting: (p7<=p15)
states: 4,889,661 (6)
abstracting: (6<=p5)
states: 17,185 (4)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [[AG [EX [p1<=0]] & E [AG [[[1<=p1 | p17<=0] & [2<=p17 | p11<=7]]] U ~ [AG [p14<=0]]]]]
normalized: E [true U [E [~ [E [true U ~ [[[2<=p17 | p11<=7] & [1<=p1 | p17<=0]]]]] U E [true U ~ [p14<=0]]] & ~ [E [true U ~ [EX [p1<=0]]]]]]

abstracting: (p1<=0)
states: 4,741,884 (6)
.abstracting: (p14<=0)
states: 3,752,259 (6)
abstracting: (p17<=0)
states: 2,528,288 (6)
abstracting: (1<=p1)
states: 1,368,759 (6)
abstracting: (p11<=7)
states: 6,110,643 (6)
abstracting: (2<=p17)
states: 1,552,180 (6)
-> the formula is FALSE

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

MC time: 0m 0.017sec

checking: EF [[~ [p5<=p17] & AG [~ [A [~ [p1<=p12] U p18<=p6]]]]]
normalized: E [true U [~ [E [true U [~ [EG [~ [p18<=p6]]] & ~ [E [~ [p18<=p6] U [p1<=p12 & ~ [p18<=p6]]]]]]] & ~ [p5<=p17]]]

abstracting: (p5<=p17)
states: 3,824,610 (6)
abstracting: (p18<=p6)
states: 5,211,423 (6)
abstracting: (p1<=p12)
states: 5,044,452 (6)
abstracting: (p18<=p6)
states: 5,211,423 (6)
abstracting: (p18<=p6)
states: 5,211,423 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: AF [[EX [EX [[[p11<=p1 & p17<=p7] | [p8<=1 & p19<=2]]]] & EF [AG [p17<=0]]]]
normalized: ~ [EG [~ [[E [true U ~ [E [true U ~ [p17<=0]]]] & EX [EX [[[p8<=1 & p19<=2] | [p11<=p1 & p17<=p7]]]]]]]]

abstracting: (p17<=p7)
states: 3,506,328 (6)
abstracting: (p11<=p1)
states: 3,016,170 (6)
abstracting: (p19<=2)
states: 3,899,133 (6)
abstracting: (p8<=1)
states: 621,810 (5)
..abstracting: (p17<=0)
states: 2,528,288 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: E [~ [A [p5<=3 U ~ [[AF [p16<=p13] & [~ [[4<=p16 | p2<=p17]] & [p13<=p10 | p21<=0]]]]]] U EG [[AG [p9<=p16] & [~ [EF [~ [p18<=p20]]] & [AG [p16<=p11] | ~ [p11<=p21]]]]]]
normalized: E [~ [[~ [EG [[[[p13<=p10 | p21<=0] & ~ [[4<=p16 | p2<=p17]]] & ~ [EG [~ [p16<=p13]]]]]] & ~ [E [[[[p13<=p10 | p21<=0] & ~ [[4<=p16 | p2<=p17]]] & ~ [EG [~ [p16<=p13]]]] U [~ [p5<=3] & [[[p13<=p10 | p21<=0] & ~ [[4<=p16 | p2<=p17]]] & ~ [EG [~ [p16<=p13]]]]]]]]] U EG [[[[~ [p11<=p21] | ~ [E [true U ~ [p16<=p11]]]] & ~ [E [true U ~ [p18<=p20]]]] & ~ [E [true U ~ [p9<=p16]]]]]]

abstracting: (p9<=p16)
states: 1,878,035 (6)
abstracting: (p18<=p20)
states: 5,493,201 (6)
abstracting: (p16<=p11)
states: 2,634,993 (6)
abstracting: (p11<=p21)
states: 4,700,658 (6)
.
EG iterations: 1
abstracting: (p16<=p13)
states: 2,047,605 (6)
.
EG iterations: 1
abstracting: (p2<=p17)
states: 622,930 (5)
abstracting: (4<=p16)
states: 1,479,437 (6)
abstracting: (p21<=0)
states: 1,409,345 (6)
abstracting: (p13<=p10)
states: 4,346,475 (6)
abstracting: (p5<=3)
states: 5,771,657 (6)
abstracting: (p16<=p13)
states: 2,047,605 (6)
.
EG iterations: 1
abstracting: (p2<=p17)
states: 622,930 (5)
abstracting: (4<=p16)
states: 1,479,437 (6)
abstracting: (p21<=0)
states: 1,409,345 (6)
abstracting: (p13<=p10)
states: 4,346,475 (6)
abstracting: (p16<=p13)
states: 2,047,605 (6)
.
EG iterations: 1
abstracting: (p2<=p17)
states: 622,930 (5)
abstracting: (4<=p16)
states: 1,479,437 (6)
abstracting: (p21<=0)
states: 1,409,345 (6)
abstracting: (p13<=p10)
states: 4,346,475 (6)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.041sec

totally nodes used: 112018 (1.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 654144 509062 1163206
used/not used/entry size/cache size: 603733 66505131 16 1024MB
basic ops cache: hits/miss/sum: 129133 111142 240275
used/not used/entry size/cache size: 202051 16575165 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: 14013 10155 24168
used/not used/entry size/cache size: 10155 8378453 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 67010681
1 93559
2 2729
3 692
4 509
5 195
6 64
7 83
8 58
9 20
>= 10 274

Total processing time: 0m 4.537sec


BK_STOP 1679532339164

--------------------
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:761 (25), effective:112 (3)

initing FirstDep: 0m 0.000sec


iterations count:275 (9), effective:43 (1)

iterations count:323 (10), effective:33 (1)

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

iterations count:219 (7), effective:22 (0)

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

iterations count:74 (2), effective:6 (0)

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

iterations count:607 (20), effective:106 (3)

iterations count:88 (2), effective:15 (0)

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

iterations count:267 (8), effective:32 (1)

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

iterations count:61 (2), effective:7 (0)

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

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

iterations count:195 (6), effective:28 (0)

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

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

iterations count:320 (10), effective:34 (1)

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

iterations count:242 (8), effective:38 (1)

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-00008"
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-00008, 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-167856420500545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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