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.r170-tall-167838856900193.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FMS-PT-00005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856900193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.7K Feb 25 19:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 19:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 19:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 19:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 19:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Feb 25 19:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FMS-PT-00005-CTLCardinality-00
FORMULA_NAME FMS-PT-00005-CTLCardinality-01
FORMULA_NAME FMS-PT-00005-CTLCardinality-02
FORMULA_NAME FMS-PT-00005-CTLCardinality-03
FORMULA_NAME FMS-PT-00005-CTLCardinality-04
FORMULA_NAME FMS-PT-00005-CTLCardinality-05
FORMULA_NAME FMS-PT-00005-CTLCardinality-06
FORMULA_NAME FMS-PT-00005-CTLCardinality-07
FORMULA_NAME FMS-PT-00005-CTLCardinality-08
FORMULA_NAME FMS-PT-00005-CTLCardinality-09
FORMULA_NAME FMS-PT-00005-CTLCardinality-10
FORMULA_NAME FMS-PT-00005-CTLCardinality-11
FORMULA_NAME FMS-PT-00005-CTLCardinality-12
FORMULA_NAME FMS-PT-00005-CTLCardinality-13
FORMULA_NAME FMS-PT-00005-CTLCardinality-14
FORMULA_NAME FMS-PT-00005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678493881050

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=FMS-PT-00005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:18:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:18:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:18:02] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-11 00:18:02] [INFO ] Transformed 22 places.
[2023-03-11 00:18:02] [INFO ] Transformed 20 transitions.
[2023-03-11 00:18:02] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:18:02] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-11 00:18:03] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-11 00:18:03] [INFO ] Invariant cache hit.
[2023-03-11 00:18:03] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2023-03-11 00:18:03] [INFO ] Invariant cache hit.
[2023-03-11 00:18:03] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-11 00:18:03] [INFO ] Flatten gal took : 15 ms
[2023-03-11 00:18:03] [INFO ] Flatten gal took : 4 ms
[2023-03-11 00:18:03] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 75) seen :63
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-11 00:18:04] [INFO ] Invariant cache hit.
[2023-03-11 00:18:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 00:18:04] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2023-03-11 00:18:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-11 00:18:04] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA FMS-PT-00005-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 4 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 12 edges and 14 vertex of which 9 / 14 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 16 place count 8 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 26 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 4 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 29 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 32 place count 2 transition count 3
Applied a total of 32 rules in 10 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 2/22 places, 3/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA FMS-PT-00005-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 19 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 18 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 17 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 9 place count 17 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 13 place count 15 transition count 14
Applied a total of 13 rules in 4 ms. Remains 15 /22 variables (removed 7) and now considering 14/20 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 15/22 places, 14/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 17 place count 13 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 20 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 20 place count 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 9 transition count 10
Applied a total of 22 rules in 3 ms. Remains 9 /22 variables (removed 13) and now considering 10/20 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 9/22 places, 10/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 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 1 place count 22 transition count 19
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 20 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 19 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 17 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 15 transition count 15
Applied a total of 12 rules in 3 ms. Remains 15 /22 variables (removed 7) and now considering 15/20 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 15/22 places, 15/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 19 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 18 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 9 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 15 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 place count 13 transition count 12
Applied a total of 17 rules in 4 ms. Remains 13 /22 variables (removed 9) and now considering 12/20 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 13/22 places, 12/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:04] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:04] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-11 00:18:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 0 ms.
Total runtime 2326 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: 20 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 2.674sec


RS generation: 0m 0.009sec


-> reachability set: #nodes 1005 (1.0e+03) #states 2,895,018 (6)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 2,895,018 (6)
.-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EX [EF [AG [~ [p2<=p4]]]]
normalized: EX [E [true U ~ [E [true U p2<=p4]]]]

abstracting: (p2<=p4)
states: 1,980,552 (6)
.-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

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

abstracting: (p20<=0)
states: 827,148 (5)
.
EG iterations: 1
abstracting: (p10<=p20)
states: 2,339,676 (6)
.-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [AG [[4<=p8 & ~ [E [3<=p3 U 2<=p16]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [E [3<=p3 U 2<=p16]] & 4<=p8]]]]]

abstracting: (4<=p8)
states: 41,496 (4)
abstracting: (2<=p16)
states: 1,378,580 (6)
abstracting: (3<=p3)
states: 12,054 (4)
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AF [AG [[p7<=p2 | [EF [p21<=3] | AX [AF [2<=p18]]]]]]
normalized: ~ [EG [E [true U ~ [[[~ [EX [EG [~ [2<=p18]]]] | E [true U p21<=3]] | p7<=p2]]]]]

abstracting: (p7<=p2)
states: 465,360 (5)
abstracting: (p21<=3)
states: 2,853,522 (6)
abstracting: (2<=p18)
states: 547,239 (5)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [[EF [~ [p19<=2]] & [AF [EG [~ [1<=p17]]] | [~ [p4<=4] | p16<=p6]]]]
normalized: ~ [EG [~ [[[[p16<=p6 | ~ [p4<=4]] | ~ [EG [~ [EG [~ [1<=p17]]]]]] & E [true U ~ [p19<=2]]]]]]

abstracting: (p19<=2)
states: 2,716,938 (6)
abstracting: (1<=p17)
states: 2,067,870 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p4<=4)
states: 2,890,902 (6)
abstracting: (p16<=p6)
states: 1,228,018 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EF [[~ [A [~ [[p16<=1 | [p12<=p17 | p19<=2]]] U p1<=p17]] & ~ [3<=p20]]]
normalized: E [true U [~ [3<=p20] & ~ [[~ [EG [~ [p1<=p17]]] & ~ [E [~ [p1<=p17] U [[p16<=1 | [p12<=p17 | p19<=2]] & ~ [p1<=p17]]]]]]]]

abstracting: (p1<=p17)
states: 2,379,498 (6)
abstracting: (p19<=2)
states: 2,716,938 (6)
abstracting: (p12<=p17)
states: 2,701,352 (6)
abstracting: (p16<=1)
states: 1,516,438 (6)
abstracting: (p1<=p17)
states: 2,379,498 (6)
abstracting: (p1<=p17)
states: 2,379,498 (6)
.
EG iterations: 1
abstracting: (3<=p20)
states: 827,148 (5)
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: EX [[EX [[3<=p8 & EF [AX [3<=p8]]]] & A [AF [AG [p5<=p2]] U EF [[AF [1<=p20] | ~ [p20<=p21]]]]]]
normalized: EX [[[~ [EG [~ [E [true U [~ [p20<=p21] | ~ [EG [~ [1<=p20]]]]]]]] & ~ [E [~ [E [true U [~ [p20<=p21] | ~ [EG [~ [1<=p20]]]]]] U [EG [E [true U ~ [p5<=p2]]] & ~ [E [true U [~ [p20<=p21] | ~ [EG [~ [1<=p20]]]]]]]]]] & EX [[3<=p8 & E [true U ~ [EX [~ [3<=p8]]]]]]]]

abstracting: (3<=p8)
states: 178,080 (5)
.abstracting: (3<=p8)
states: 178,080 (5)
.abstracting: (1<=p20)
states: 2,067,870 (6)
.
EG iterations: 1
abstracting: (p20<=p21)
states: 1,284,072 (6)
abstracting: (p5<=p2)
states: 1,980,552 (6)

EG iterations: 0
abstracting: (1<=p20)
states: 2,067,870 (6)
.
EG iterations: 1
abstracting: (p20<=p21)
states: 1,284,072 (6)
abstracting: (1<=p20)
states: 2,067,870 (6)
.
EG iterations: 1
abstracting: (p20<=p21)
states: 1,284,072 (6)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: AX [[AF [[EG [~ [p0<=p1]] & AX [[p19<=p13 & p9<=p0]]]] | EG [p2<=p10]]]
normalized: ~ [EX [~ [[~ [EG [~ [[~ [EX [~ [[p19<=p13 & p9<=p0]]]] & EG [~ [p0<=p1]]]]]] | EG [p2<=p10]]]]]

abstracting: (p2<=p10)
states: 2,146,116 (6)
.
EG iterations: 1
abstracting: (p0<=p1)
states: 1,980,552 (6)
.
EG iterations: 1
abstracting: (p9<=p0)
states: 1,974,378 (6)
abstracting: (p19<=p13)
states: 1,714,902 (6)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: [EF [[AG [p11<=p3] & ~ [p19<=p13]]] | AF [[E [p2<=p15 U p9<=p19] & EG [p14<=p1]]]]
normalized: [~ [EG [~ [[EG [p14<=p1] & E [p2<=p15 U p9<=p19]]]]] | E [true U [~ [p19<=p13] & ~ [E [true U ~ [p11<=p3]]]]]]

abstracting: (p11<=p3)
states: 2,130,576 (6)
abstracting: (p19<=p13)
states: 1,714,902 (6)
abstracting: (p9<=p19)
states: 1,943,697 (6)
abstracting: (p2<=p15)
states: 2,664,501 (6)
abstracting: (p14<=p1)
states: 2,494,422 (6)
.
EG iterations: 1
............
EG iterations: 12
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: EF [[[~ [E [[[p11<=p0 & 2<=p3] | p6<=p13] U A [p5<=3 U p3<=4]]] | EF [p2<=p5]] & [AG [EX [~ [p13<=p1]]] | AG [p5<=p9]]]]
normalized: E [true U [[~ [E [true U ~ [p5<=p9]]] | ~ [E [true U ~ [EX [~ [p13<=p1]]]]]] & [E [true U p2<=p5] | ~ [E [[p6<=p13 | [p11<=p0 & 2<=p3]] U [~ [EG [~ [p3<=4]]] & ~ [E [~ [p3<=4] U [~ [p5<=3] & ~ [p3<=4]]]]]]]]]]

abstracting: (p3<=4)
states: 2,894,997 (6)
abstracting: (p5<=3)
states: 2,861,502 (6)
abstracting: (p3<=4)
states: 2,894,997 (6)
abstracting: (p3<=4)
states: 2,894,997 (6)
.
EG iterations: 1
abstracting: (2<=p3)
states: 102,039 (5)
abstracting: (p11<=p0)
states: 2,370,858 (6)
abstracting: (p6<=p13)
states: 1,814,211 (6)
abstracting: (p2<=p5)
states: 1,980,552 (6)
abstracting: (p13<=p1)
states: 2,494,422 (6)
.abstracting: (p5<=p9)
states: 2,067,492 (6)
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: [AX [[EG [AG [[p12<=1 & p11<=2]]] & EX [[4<=p18 & AG [1<=p21]]]]] | EF [AX [[[EX [[p7<=p2 & 5<=p16]] & A [p14<=3 U p6<=0]] & [1<=p16 & [3<=p18 & [~ [p0<=4] | ~ [p0<=p13]]]]]]]]
normalized: [E [true U ~ [EX [~ [[[1<=p16 & [3<=p18 & [~ [p0<=p13] | ~ [p0<=4]]]] & [[~ [EG [~ [p6<=0]]] & ~ [E [~ [p6<=0] U [~ [p14<=3] & ~ [p6<=0]]]]] & EX [[p7<=p2 & 5<=p16]]]]]]]] | ~ [EX [~ [[EX [[4<=p18 & ~ [E [true U ~ [1<=p21]]]]] & EG [~ [E [true U ~ [[p12<=1 & p11<=2]]]]]]]]]]

abstracting: (p11<=2)
states: 2,895,018 (6)
abstracting: (p12<=1)
states: 2,805,012 (6)
.
EG iterations: 1
abstracting: (1<=p21)
states: 1,356,810 (6)
abstracting: (4<=p18)
states: 41,496 (4)
..abstracting: (5<=p16)
states: 137,858 (5)
abstracting: (p7<=p2)
states: 465,360 (5)
.abstracting: (p6<=0)
states: 1,643,712 (6)
abstracting: (p14<=3)
states: 2,894,178 (6)
abstracting: (p6<=0)
states: 1,643,712 (6)
abstracting: (p6<=0)
states: 1,643,712 (6)
.
EG iterations: 1
abstracting: (p0<=4)
states: 2,890,902 (6)
abstracting: (p0<=p13)
states: 1,784,811 (6)
abstracting: (3<=p18)
states: 178,080 (5)
abstracting: (1<=p16)
states: 2,067,870 (6)
.-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: A [E [[AX [[[1<=p17 | 4<=p9] & EX [5<=p3]]] | [p18<=1 & AG [[p15<=p20 & 3<=p0]]]] U [p9<=3 & p6<=p19]] U [AF [~ [p1<=3]] | A [EX [~ [[p15<=3 & p3<=0]]] U E [~ [AX [4<=p0]] U ~ [p1<=3]]]]]
normalized: [~ [EG [~ [[[~ [EG [~ [E [EX [~ [4<=p0]] U ~ [p1<=3]]]]] & ~ [E [~ [E [EX [~ [4<=p0]] U ~ [p1<=3]]] U [~ [EX [~ [[p15<=3 & p3<=0]]]] & ~ [E [EX [~ [4<=p0]] U ~ [p1<=3]]]]]]] | ~ [EG [p1<=3]]]]]] & ~ [E [~ [[[~ [EG [~ [E [EX [~ [4<=p0]] U ~ [p1<=3]]]]] & ~ [E [~ [E [EX [~ [4<=p0]] U ~ [p1<=3]]] U [~ [EX [~ [[p15<=3 & p3<=0]]]] & ~ [E [EX [~ [4<=p0]] U ~ [p1<=3]]]]]]] | ~ [EG [p1<=3]]]] U [~ [E [[[p18<=1 & ~ [E [true U ~ [[p15<=p20 & 3<=p0]]]]] | ~ [EX [~ [[EX [5<=p3] & [1<=p17 | 4<=p9]]]]]] U [p9<=3 & p6<=p19]]] & ~ [[[~ [EG [~ [E [EX [~ [4<=p0]] U ~ [p1<=3]]]]] & ~ [E [~ [E [EX [~ [4<=p0]] U ~ [p1<=3]]] U [~ [EX [~ [[p15<=3 & p3<=0]]]] & ~ [E [EX [~ [4<=p0]] U ~ [p1<=3]]]]]]] | ~ [EG [p1<=3]]]]]]]]

abstracting: (p1<=3)
states: 2,861,502 (6)
.
EG iterations: 1
abstracting: (p1<=3)
states: 2,861,502 (6)
abstracting: (4<=p0)
states: 33,516 (4)
.abstracting: (p3<=0)
states: 2,280,978 (6)
abstracting: (p15<=3)
states: 2,895,018 (6)
.abstracting: (p1<=3)
states: 2,861,502 (6)
abstracting: (4<=p0)
states: 33,516 (4)
.abstracting: (p1<=3)
states: 2,861,502 (6)
abstracting: (4<=p0)
states: 33,516 (4)
..
EG iterations: 1
abstracting: (p6<=p19)
states: 2,098,362 (6)
abstracting: (p9<=3)
states: 2,853,522 (6)
abstracting: (4<=p9)
states: 41,496 (4)
abstracting: (1<=p17)
states: 2,067,870 (6)
abstracting: (5<=p3)
states: 21
..abstracting: (3<=p0)
states: 149,856 (5)
abstracting: (p15<=p20)
states: 1,547,826 (6)
abstracting: (p18<=1)
states: 2,347,779 (6)
abstracting: (p1<=3)
states: 2,861,502 (6)
.
EG iterations: 1
abstracting: (p1<=3)
states: 2,861,502 (6)
abstracting: (4<=p0)
states: 33,516 (4)
.abstracting: (p3<=0)
states: 2,280,978 (6)
abstracting: (p15<=3)
states: 2,895,018 (6)
.abstracting: (p1<=3)
states: 2,861,502 (6)
abstracting: (4<=p0)
states: 33,516 (4)
.abstracting: (p1<=3)
states: 2,861,502 (6)
abstracting: (4<=p0)
states: 33,516 (4)
..
EG iterations: 1
abstracting: (p1<=3)
states: 2,861,502 (6)
.
EG iterations: 1
abstracting: (p1<=3)
states: 2,861,502 (6)
abstracting: (4<=p0)
states: 33,516 (4)
.abstracting: (p3<=0)
states: 2,280,978 (6)
abstracting: (p15<=3)
states: 2,895,018 (6)
.abstracting: (p1<=3)
states: 2,861,502 (6)
abstracting: (4<=p0)
states: 33,516 (4)
.abstracting: (p1<=3)
states: 2,861,502 (6)
abstracting: (4<=p0)
states: 33,516 (4)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: [E [[[A [~ [p1<=p10] U [p7<=p18 | p18<=1]] & AX [[p13<=0 & 4<=p9]]] | ~ [p5<=2]] U [AG [~ [p16<=p9]] | [[~ [A [p14<=p18 U 4<=p3]] & p7<=0] | AG [[AG [p20<=p16] | E [3<=p14 U 1<=p21]]]]]] & EF [EG [p5<=0]]]
normalized: [E [true U EG [p5<=0]] & E [[~ [p5<=2] | [~ [EX [~ [[p13<=0 & 4<=p9]]]] & [~ [EG [~ [[p7<=p18 | p18<=1]]]] & ~ [E [~ [[p7<=p18 | p18<=1]] U [p1<=p10 & ~ [[p7<=p18 | p18<=1]]]]]]]] U [[~ [E [true U ~ [[E [3<=p14 U 1<=p21] | ~ [E [true U ~ [p20<=p16]]]]]]] | [p7<=0 & ~ [[~ [EG [~ [4<=p3]]] & ~ [E [~ [4<=p3] U [~ [p14<=p18] & ~ [4<=p3]]]]]]]] | ~ [E [true U p16<=p9]]]]]

abstracting: (p16<=p9)
states: 1,284,072 (6)
abstracting: (4<=p3)
states: 840
abstracting: (p14<=p18)
states: 2,508,177 (6)
abstracting: (4<=p3)
states: 840
abstracting: (4<=p3)
states: 840
.
EG iterations: 1
abstracting: (p7<=0)
states: 116,340 (5)
abstracting: (p20<=p16)
states: 1,654,296 (6)
abstracting: (1<=p21)
states: 1,356,810 (6)
abstracting: (3<=p14)
states: 12,054 (4)
abstracting: (p18<=1)
states: 2,347,779 (6)
abstracting: (p7<=p18)
states: 528,654 (5)
abstracting: (p1<=p10)
states: 2,146,116 (6)
abstracting: (p18<=1)
states: 2,347,779 (6)
abstracting: (p7<=p18)
states: 528,654 (5)
abstracting: (p18<=1)
states: 2,347,779 (6)
abstracting: (p7<=p18)
states: 528,654 (5)
.
EG iterations: 1
abstracting: (4<=p9)
states: 41,496 (4)
abstracting: (p13<=0)
states: 2,280,978 (6)
.abstracting: (p5<=2)
states: 2,745,162 (6)
abstracting: (p5<=0)
states: 1,614,312 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

totally nodes used: 241726 (2.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 880170 706930 1587100
used/not used/entry size/cache size: 898972 66209892 16 1024MB
basic ops cache: hits/miss/sum: 331880 265961 597841
used/not used/entry size/cache size: 463489 16313727 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: 39923 28692 68615
used/not used/entry size/cache size: 28666 8359942 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 66878725
1 223254
2 5539
3 500
4 200
5 188
6 161
7 120
8 43
9 20
>= 10 114

Total processing time: 0m 4.665sec


BK_STOP 1678493890519

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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:405 (20), effective:85 (4)

initing FirstDep: 0m 0.000sec


iterations count:162 (8), effective:36 (1)

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

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

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

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

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

iterations count:206 (10), effective:42 (2)

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

iterations count:156 (7), effective:47 (2)

iterations count:252 (12), effective:52 (2)

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

iterations count:191 (9), effective:44 (2)

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

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

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

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

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

iterations count:164 (8), effective:36 (1)

iterations count:91 (4), effective:22 (1)

iterations count:131 (6), effective:33 (1)

iterations count:148 (7), effective:28 (1)

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

iterations count:304 (15), effective:56 (2)

iterations count:241 (12), effective:59 (2)

iterations count:241 (12), effective:59 (2)

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

iterations count:241 (12), effective:59 (2)

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

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

iterations count:241 (12), effective:59 (2)

iterations count:241 (12), effective:59 (2)

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

iterations count:241 (12), effective:59 (2)

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

iterations count:241 (12), effective:59 (2)

iterations count:241 (12), effective:59 (2)

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

iterations count:241 (12), effective:59 (2)

iterations count:95 (4), effective:30 (1)

iterations count:185 (9), effective:32 (1)

iterations count:32 (1), effective:5 (0)

iterations count:82 (4), effective:14 (0)

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

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

iterations count:142 (7), effective:42 (2)

iterations count:34 (1), effective:7 (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="FMS-PT-00005"
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 FMS-PT-00005, 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 r170-tall-167838856900193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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