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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 11K Feb 25 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 63K 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 IOTPpurchase-PT-C01M01P01D01-CTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679451018988

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=IOTPpurchase-PT-C01M01P01D01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:10:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:10:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:10:20] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-22 02:10:20] [INFO ] Transformed 111 places.
[2023-03-22 02:10:20] [INFO ] Transformed 45 transitions.
[2023-03-22 02:10:20] [INFO ] Found NUPN structural information;
[2023-03-22 02:10:20] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Initial state reduction rules removed 4 formulas.
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 91 transition count 45
Applied a total of 20 rules in 12 ms. Remains 91 /111 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 91 cols
[2023-03-22 02:10:20] [INFO ] Computed 47 place invariants in 13 ms
[2023-03-22 02:10:20] [INFO ] Implicit Places using invariants in 197 ms returned [13, 16, 47, 49, 55, 56]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 219 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/111 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 234 ms. Remains : 85/111 places, 45/45 transitions.
Support contains 69 out of 85 places after structural reductions.
[2023-03-22 02:10:21] [INFO ] Flatten gal took : 21 ms
[2023-03-22 02:10:21] [INFO ] Flatten gal took : 8 ms
[2023-03-22 02:10:21] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 65) seen :59
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 45 rows 85 cols
[2023-03-22 02:10:22] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-22 02:10:22] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:10:22] [INFO ] [Real]Absence check using 9 positive and 32 generalized place invariants in 4 ms returned sat
[2023-03-22 02:10:22] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
[2023-03-22 02:10:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 5 ms
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 58 out of 85 places (down from 60) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 61 transition count 31
Reduce places removed 17 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 25 rules applied. Total rules applied 43 place count 43 transition count 24
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 51 place count 36 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 35 transition count 23
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 52 place count 35 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 64 place count 28 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 81 place count 18 transition count 11
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 84 place count 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 85 place count 15 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 90 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 91 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 92 place count 11 transition count 7
Applied a total of 92 rules in 15 ms. Remains 11 /85 variables (removed 74) and now considering 7/45 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 11/85 places, 7/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 63 transition count 45
Applied a total of 22 rules in 2 ms. Remains 63 /85 variables (removed 22) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/85 places, 45/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 63 transition count 45
Applied a total of 22 rules in 2 ms. Remains 63 /85 variables (removed 22) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/85 places, 45/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 61 transition count 45
Applied a total of 24 rules in 2 ms. Remains 61 /85 variables (removed 24) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/85 places, 45/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 61 transition count 45
Applied a total of 24 rules in 2 ms. Remains 61 /85 variables (removed 24) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/85 places, 45/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 62 transition count 45
Applied a total of 23 rules in 2 ms. Remains 62 /85 variables (removed 23) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 62/85 places, 45/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 62 transition count 45
Applied a total of 23 rules in 2 ms. Remains 62 /85 variables (removed 23) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 62/85 places, 45/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 18 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 63 transition count 45
Applied a total of 22 rules in 2 ms. Remains 63 /85 variables (removed 22) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/85 places, 45/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 63 transition count 45
Applied a total of 22 rules in 2 ms. Remains 63 /85 variables (removed 22) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/85 places, 45/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 63 transition count 45
Applied a total of 22 rules in 2 ms. Remains 63 /85 variables (removed 22) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/85 places, 45/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 18 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 63 transition count 39
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 55 transition count 36
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 28 place count 52 transition count 32
Reduce places removed 5 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 3 with 7 rules applied. Total rules applied 35 place count 46 transition count 31
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 37 place count 45 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 38 place count 44 transition count 30
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 38 place count 44 transition count 26
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 49 place count 37 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 49 place count 37 transition count 25
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 51 place count 36 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 61 place count 30 transition count 21
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 63 place count 29 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 64 place count 28 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 64 place count 28 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 67 place count 26 transition count 19
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 68 place count 26 transition count 18
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 71 place count 24 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 72 place count 23 transition count 17
Applied a total of 72 rules in 17 ms. Remains 23 /85 variables (removed 62) and now considering 17/45 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 23/85 places, 17/45 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:22] [INFO ] Input system was already deterministic with 17 transitions.
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:22] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:10:22] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 02:10:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 45 transitions and 172 arcs took 1 ms.
Total runtime 2590 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: 85 NrTr: 45 NrArc: 172)

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

net check time: 0m 0.000sec

init dd package: 0m 2.735sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 338 (3.4e+02) #states 204



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

checking: AG [EF [EX [EF [[p13<=0 & 0<=p13]]]]]
normalized: ~ [E [true U ~ [E [true U EX [E [true U [p13<=0 & 0<=p13]]]]]]]

abstracting: (0<=p13)
states: 204
abstracting: (p13<=0)
states: 160
.-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [EX [[p35<=1 & 1<=p35]] | EG [AF [[p64<=0 & 0<=p64]]]]
normalized: [EG [~ [EG [~ [[p64<=0 & 0<=p64]]]]] | EX [[p35<=1 & 1<=p35]]]

abstracting: (1<=p35)
states: 4
abstracting: (p35<=1)
states: 204
.abstracting: (0<=p64)
states: 204
abstracting: (p64<=0)
states: 190
.........
EG iterations: 9

EG iterations: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[AG [[AF [[[p11<=1 & 1<=p11] | [[p45<=0 & 0<=p45] | [p83<=1 & 1<=p83]]]] & [p14<=0 & 0<=p14]]] & [AG [[[p27<=0 & 0<=p27] & [p48<=1 & 1<=p48]]] | AX [AG [[[p33<=0 & 0<=p33] | [p56<=1 & 1<=p56]]]]]]]
normalized: E [true U [~ [E [true U ~ [[[p14<=0 & 0<=p14] & ~ [EG [~ [[[[p83<=1 & 1<=p83] | [p45<=0 & 0<=p45]] | [p11<=1 & 1<=p11]]]]]]]]] & [~ [EX [E [true U ~ [[[p56<=1 & 1<=p56] | [p33<=0 & 0<=p33]]]]]] | ~ [E [true U ~ [[[p48<=1 & 1<=p48] & [p27<=0 & 0<=p27]]]]]]]]

abstracting: (0<=p27)
states: 204
abstracting: (p27<=0)
states: 198
abstracting: (1<=p48)
states: 200
abstracting: (p48<=1)
states: 204
abstracting: (0<=p33)
states: 204
abstracting: (p33<=0)
states: 106
abstracting: (1<=p56)
states: 4
abstracting: (p56<=1)
states: 204
.abstracting: (1<=p11)
states: 8
abstracting: (p11<=1)
states: 204
abstracting: (0<=p45)
states: 204
abstracting: (p45<=0)
states: 200
abstracting: (1<=p83)
states: 4
abstracting: (p83<=1)
states: 204
....
EG iterations: 4
abstracting: (0<=p14)
states: 204
abstracting: (p14<=0)
states: 196
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AX [[EG [[EX [[p77<=1 & 1<=p77]] & [[p71<=0 & 0<=p71] & [p67<=1 & 1<=p67]]]] | [[p17<=0 & 0<=p17] | AX [[AF [[p5<=1 & 1<=p5]] & [[p71<=0 & 0<=p71] | ~ [E [[p9<=1 & 1<=p9] U [p55<=1 & 1<=p55]]]]]]]]]
normalized: ~ [EX [~ [[[~ [EX [~ [[[~ [E [[p9<=1 & 1<=p9] U [p55<=1 & 1<=p55]]] | [p71<=0 & 0<=p71]] & ~ [EG [~ [[p5<=1 & 1<=p5]]]]]]]] | [p17<=0 & 0<=p17]] | EG [[[[p67<=1 & 1<=p67] & [p71<=0 & 0<=p71]] & EX [[p77<=1 & 1<=p77]]]]]]]]

abstracting: (1<=p77)
states: 8
abstracting: (p77<=1)
states: 204
.abstracting: (0<=p71)
states: 204
abstracting: (p71<=0)
states: 200
abstracting: (1<=p67)
states: 4
abstracting: (p67<=1)
states: 204
.
EG iterations: 1
abstracting: (0<=p17)
states: 204
abstracting: (p17<=0)
states: 200
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (0<=p71)
states: 204
abstracting: (p71<=0)
states: 200
abstracting: (1<=p55)
states: 4
abstracting: (p55<=1)
states: 204
abstracting: (1<=p9)
states: 4
abstracting: (p9<=1)
states: 204
..-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: E [AF [AG [[p74<=1 & 1<=p74]]] U A [[~ [[p57<=1 & 1<=p57]] & [AG [[[p76<=0 & 0<=p76] | [p82<=1 & 1<=p82]]] & E [[p74<=1 & 1<=p74] U ~ [[[[p14<=0 & 0<=p14] | [p21<=1 & 1<=p21]] & [p35<=1 & 1<=p35]]]]]] U AF [EX [~ [[[p49<=0 & 0<=p49] | [p62<=1 & 1<=p62]]]]]]]
normalized: E [~ [EG [E [true U ~ [[p74<=1 & 1<=p74]]]]] U [~ [EG [EG [~ [EX [~ [[[p62<=1 & 1<=p62] | [p49<=0 & 0<=p49]]]]]]]] & ~ [E [EG [~ [EX [~ [[[p62<=1 & 1<=p62] | [p49<=0 & 0<=p49]]]]]] U [~ [[[E [[p74<=1 & 1<=p74] U ~ [[[p35<=1 & 1<=p35] & [[p21<=1 & 1<=p21] | [p14<=0 & 0<=p14]]]]] & ~ [E [true U ~ [[[p82<=1 & 1<=p82] | [p76<=0 & 0<=p76]]]]]] & ~ [[p57<=1 & 1<=p57]]]] & EG [~ [EX [~ [[[p62<=1 & 1<=p62] | [p49<=0 & 0<=p49]]]]]]]]]]]

abstracting: (0<=p49)
states: 204
abstracting: (p49<=0)
states: 4
abstracting: (1<=p62)
states: 4
abstracting: (p62<=1)
states: 204
...
EG iterations: 2
abstracting: (1<=p57)
states: 4
abstracting: (p57<=1)
states: 204
abstracting: (0<=p76)
states: 204
abstracting: (p76<=0)
states: 180
abstracting: (1<=p82)
states: 4
abstracting: (p82<=1)
states: 204
abstracting: (0<=p14)
states: 204
abstracting: (p14<=0)
states: 196
abstracting: (1<=p21)
states: 8
abstracting: (p21<=1)
states: 204
abstracting: (1<=p35)
states: 4
abstracting: (p35<=1)
states: 204
abstracting: (1<=p74)
states: 8
abstracting: (p74<=1)
states: 204
abstracting: (0<=p49)
states: 204
abstracting: (p49<=0)
states: 4
abstracting: (1<=p62)
states: 4
abstracting: (p62<=1)
states: 204
...
EG iterations: 2
abstracting: (0<=p49)
states: 204
abstracting: (p49<=0)
states: 4
abstracting: (1<=p62)
states: 4
abstracting: (p62<=1)
states: 204
...
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p74)
states: 8
abstracting: (p74<=1)
states: 204

EG iterations: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [AG [[p49<=1 & 1<=p49]] & [EG [EF [[AX [[p26<=0 & 0<=p26]] | AF [[p13<=0 & 0<=p13]]]]] | [[AX [[[p43<=0 & 0<=p43] & [[p81<=0 & 0<=p81] | [p71<=1 & 1<=p71]]]] | AF [[p18<=1 & 1<=p18]]] & [E [[[p74<=0 & 0<=p74] | [p34<=1 & 1<=p34]] U ~ [[p30<=1 & 1<=p30]]] | EF [~ [[p40<=0 & 0<=p40]]]]]]]
normalized: [~ [E [true U ~ [[p49<=1 & 1<=p49]]]] & [[[E [true U ~ [[p40<=0 & 0<=p40]]] | E [[[p34<=1 & 1<=p34] | [p74<=0 & 0<=p74]] U ~ [[p30<=1 & 1<=p30]]]] & [~ [EG [~ [[p18<=1 & 1<=p18]]]] | ~ [EX [~ [[[[p71<=1 & 1<=p71] | [p81<=0 & 0<=p81]] & [p43<=0 & 0<=p43]]]]]]] | EG [E [true U [~ [EG [~ [[p13<=0 & 0<=p13]]]] | ~ [EX [~ [[p26<=0 & 0<=p26]]]]]]]]]

abstracting: (0<=p26)
states: 204
abstracting: (p26<=0)
states: 200
.abstracting: (0<=p13)
states: 204
abstracting: (p13<=0)
states: 160
................
EG iterations: 16

EG iterations: 0
abstracting: (0<=p43)
states: 204
abstracting: (p43<=0)
states: 196
abstracting: (0<=p81)
states: 204
abstracting: (p81<=0)
states: 160
abstracting: (1<=p71)
states: 4
abstracting: (p71<=1)
states: 204
.abstracting: (1<=p18)
states: 16
abstracting: (p18<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (1<=p30)
states: 4
abstracting: (p30<=1)
states: 204
abstracting: (0<=p74)
states: 204
abstracting: (p74<=0)
states: 196
abstracting: (1<=p34)
states: 4
abstracting: (p34<=1)
states: 204
abstracting: (0<=p40)
states: 204
abstracting: (p40<=0)
states: 200
abstracting: (1<=p49)
states: 200
abstracting: (p49<=1)
states: 204
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AF [E [[EF [~ [[[p55<=0 & 0<=p55] | [p77<=1 & 1<=p77]]]] & [A [EG [[[p25<=0 & 0<=p25] | [p20<=1 & 1<=p20]]] U ~ [EF [[p24<=1 & 1<=p24]]]] & [[[p82<=1 & 1<=p82] & [[p43<=0 & 0<=p43] | [p13<=1 & 1<=p13]]] | [[p79<=0 & 0<=p79] & [p25<=1 & 1<=p25]]]]] U [p38<=1 & 1<=p38]]]
normalized: ~ [EG [~ [E [[[[[[p25<=1 & 1<=p25] & [p79<=0 & 0<=p79]] | [[[p13<=1 & 1<=p13] | [p43<=0 & 0<=p43]] & [p82<=1 & 1<=p82]]] & [~ [EG [E [true U [p24<=1 & 1<=p24]]]] & ~ [E [E [true U [p24<=1 & 1<=p24]] U [~ [EG [[[p20<=1 & 1<=p20] | [p25<=0 & 0<=p25]]]] & E [true U [p24<=1 & 1<=p24]]]]]]] & E [true U ~ [[[p77<=1 & 1<=p77] | [p55<=0 & 0<=p55]]]]] U [p38<=1 & 1<=p38]]]]]

abstracting: (1<=p38)
states: 4
abstracting: (p38<=1)
states: 204
abstracting: (0<=p55)
states: 204
abstracting: (p55<=0)
states: 200
abstracting: (1<=p77)
states: 8
abstracting: (p77<=1)
states: 204
abstracting: (1<=p24)
states: 4
abstracting: (p24<=1)
states: 204
abstracting: (0<=p25)
states: 204
abstracting: (p25<=0)
states: 200
abstracting: (1<=p20)
states: 4
abstracting: (p20<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (1<=p24)
states: 4
abstracting: (p24<=1)
states: 204
abstracting: (1<=p24)
states: 4
abstracting: (p24<=1)
states: 204

EG iterations: 0
abstracting: (1<=p82)
states: 4
abstracting: (p82<=1)
states: 204
abstracting: (0<=p43)
states: 204
abstracting: (p43<=0)
states: 196
abstracting: (1<=p13)
states: 44
abstracting: (p13<=1)
states: 204
abstracting: (0<=p79)
states: 204
abstracting: (p79<=0)
states: 200
abstracting: (1<=p25)
states: 4
abstracting: (p25<=1)
states: 204
...............................................
EG iterations: 47
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: E [[EG [[EG [[p61<=0 & 0<=p61]] | [[p80<=0 & 0<=p80] | [p64<=1 & 1<=p64]]]] | [AF [~ [AX [[p22<=1 & 1<=p22]]]] & [[p74<=0 & 0<=p74] | [p57<=1 & 1<=p57]]]] U ~ [[[p71<=0 & 0<=p71] & E [AG [[p36<=1 & 1<=p36]] U [E [[[p48<=0 & 0<=p48] | [p68<=1 & 1<=p68]] U [p44<=1 & 1<=p44]] | [[p23<=0 & 0<=p23] | [p22<=1 & 1<=p22]]]]]]]
normalized: E [[[[[p57<=1 & 1<=p57] | [p74<=0 & 0<=p74]] & ~ [EG [~ [EX [~ [[p22<=1 & 1<=p22]]]]]]] | EG [[[[p64<=1 & 1<=p64] | [p80<=0 & 0<=p80]] | EG [[p61<=0 & 0<=p61]]]]] U ~ [[E [~ [E [true U ~ [[p36<=1 & 1<=p36]]]] U [[[p22<=1 & 1<=p22] | [p23<=0 & 0<=p23]] | E [[[p68<=1 & 1<=p68] | [p48<=0 & 0<=p48]] U [p44<=1 & 1<=p44]]]] & [p71<=0 & 0<=p71]]]]

abstracting: (0<=p71)
states: 204
abstracting: (p71<=0)
states: 200
abstracting: (1<=p44)
states: 4
abstracting: (p44<=1)
states: 204
abstracting: (0<=p48)
states: 204
abstracting: (p48<=0)
states: 4
abstracting: (1<=p68)
states: 4
abstracting: (p68<=1)
states: 204
abstracting: (0<=p23)
states: 204
abstracting: (p23<=0)
states: 188
abstracting: (1<=p22)
states: 2
abstracting: (p22<=1)
states: 204
abstracting: (1<=p36)
states: 4
abstracting: (p36<=1)
states: 204
abstracting: (0<=p61)
states: 204
abstracting: (p61<=0)
states: 188
............................................
EG iterations: 44
abstracting: (0<=p80)
states: 204
abstracting: (p80<=0)
states: 200
abstracting: (1<=p64)
states: 14
abstracting: (p64<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (1<=p22)
states: 2
abstracting: (p22<=1)
states: 204
...
EG iterations: 2
abstracting: (0<=p74)
states: 204
abstracting: (p74<=0)
states: 196
abstracting: (1<=p57)
states: 4
abstracting: (p57<=1)
states: 204
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: EF [[A [~ [[EX [0<=0] & [[p72<=0 & 0<=p72] & [p77<=1 & 1<=p77]]]] U EX [AX [[p5<=0 & 0<=p5]]]] | [[[EF [[[p27<=1 & 1<=p27] & [p62<=0 & 0<=p62]]] | E [[p53<=0 & 0<=p53] U [p11<=0 & 0<=p11]]] | [EX [0<=0] | [p64<=1 & 1<=p64]]] & [[AG [[p71<=1 & 1<=p71]] | [p60<=1 & 1<=p60]] | [[p58<=1 & 1<=p58] | [[p16<=1 & 1<=p16] | [[p28<=0 & 0<=p28] & [p69<=1 & 1<=p69]]]]]]]]
normalized: E [true U [[[[[[[p69<=1 & 1<=p69] & [p28<=0 & 0<=p28]] | [p16<=1 & 1<=p16]] | [p58<=1 & 1<=p58]] | [[p60<=1 & 1<=p60] | ~ [E [true U ~ [[p71<=1 & 1<=p71]]]]]] & [[[p64<=1 & 1<=p64] | EX [0<=0]] | [E [[p53<=0 & 0<=p53] U [p11<=0 & 0<=p11]] | E [true U [[p62<=0 & 0<=p62] & [p27<=1 & 1<=p27]]]]]] | [~ [EG [~ [EX [~ [EX [~ [[p5<=0 & 0<=p5]]]]]]]] & ~ [E [~ [EX [~ [EX [~ [[p5<=0 & 0<=p5]]]]]] U [[[[p77<=1 & 1<=p77] & [p72<=0 & 0<=p72]] & EX [0<=0]] & ~ [EX [~ [EX [~ [[p5<=0 & 0<=p5]]]]]]]]]]]]

abstracting: (0<=p5)
states: 204
abstracting: (p5<=0)
states: 200
..abstracting: (0<=0)
states: 204
.abstracting: (0<=p72)
states: 204
abstracting: (p72<=0)
states: 106
abstracting: (1<=p77)
states: 8
abstracting: (p77<=1)
states: 204
abstracting: (0<=p5)
states: 204
abstracting: (p5<=0)
states: 200
..abstracting: (0<=p5)
states: 204
abstracting: (p5<=0)
states: 200
.....
EG iterations: 3
abstracting: (1<=p27)
states: 6
abstracting: (p27<=1)
states: 204
abstracting: (0<=p62)
states: 204
abstracting: (p62<=0)
states: 200
abstracting: (0<=p11)
states: 204
abstracting: (p11<=0)
states: 196
abstracting: (0<=p53)
states: 204
abstracting: (p53<=0)
states: 8
abstracting: (0<=0)
states: 204
.abstracting: (1<=p64)
states: 14
abstracting: (p64<=1)
states: 204
abstracting: (1<=p71)
states: 4
abstracting: (p71<=1)
states: 204
abstracting: (1<=p60)
states: 4
abstracting: (p60<=1)
states: 204
abstracting: (1<=p58)
states: 16
abstracting: (p58<=1)
states: 204
abstracting: (1<=p16)
states: 4
abstracting: (p16<=1)
states: 204
abstracting: (0<=p28)
states: 204
abstracting: (p28<=0)
states: 200
abstracting: (1<=p69)
states: 4
abstracting: (p69<=1)
states: 204
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EX [[A [~ [[p41<=0 & 0<=p41]] U [~ [EF [[p22<=1 & 1<=p22]]] | [[p28<=0 & 0<=p28] | [p81<=1 & 1<=p81]]]] | [EG [~ [A [[p51<=1 & 1<=p51] U [[p20<=0 & 0<=p20] | [p29<=1 & 1<=p29]]]]] | [~ [A [[[p42<=1 & 1<=p42] | [p39<=0 & 0<=p39]] U E [[[p31<=0 & 0<=p31] | [p76<=1 & 1<=p76]] U [[p74<=0 & 0<=p74] | [p2<=1 & 1<=p2]]]]] & [p41<=1 & 1<=p41]]]]]
normalized: EX [[[[[p41<=1 & 1<=p41] & ~ [[~ [EG [~ [E [[[p76<=1 & 1<=p76] | [p31<=0 & 0<=p31]] U [[p2<=1 & 1<=p2] | [p74<=0 & 0<=p74]]]]]] & ~ [E [~ [E [[[p76<=1 & 1<=p76] | [p31<=0 & 0<=p31]] U [[p2<=1 & 1<=p2] | [p74<=0 & 0<=p74]]]] U [~ [[[p39<=0 & 0<=p39] | [p42<=1 & 1<=p42]]] & ~ [E [[[p76<=1 & 1<=p76] | [p31<=0 & 0<=p31]] U [[p2<=1 & 1<=p2] | [p74<=0 & 0<=p74]]]]]]]]]] | EG [~ [[~ [EG [~ [[[p29<=1 & 1<=p29] | [p20<=0 & 0<=p20]]]]] & ~ [E [~ [[[p29<=1 & 1<=p29] | [p20<=0 & 0<=p20]]] U [~ [[p51<=1 & 1<=p51]] & ~ [[[p29<=1 & 1<=p29] | [p20<=0 & 0<=p20]]]]]]]]]] | [~ [EG [~ [[[[p81<=1 & 1<=p81] | [p28<=0 & 0<=p28]] | ~ [E [true U [p22<=1 & 1<=p22]]]]]]] & ~ [E [~ [[[[p81<=1 & 1<=p81] | [p28<=0 & 0<=p28]] | ~ [E [true U [p22<=1 & 1<=p22]]]]] U [[p41<=0 & 0<=p41] & ~ [[[[p81<=1 & 1<=p81] | [p28<=0 & 0<=p28]] | ~ [E [true U [p22<=1 & 1<=p22]]]]]]]]]]]

abstracting: (1<=p22)
states: 2
abstracting: (p22<=1)
states: 204
abstracting: (0<=p28)
states: 204
abstracting: (p28<=0)
states: 200
abstracting: (1<=p81)
states: 44
abstracting: (p81<=1)
states: 204
abstracting: (0<=p41)
states: 204
abstracting: (p41<=0)
states: 196
abstracting: (1<=p22)
states: 2
abstracting: (p22<=1)
states: 204
abstracting: (0<=p28)
states: 204
abstracting: (p28<=0)
states: 200
abstracting: (1<=p81)
states: 44
abstracting: (p81<=1)
states: 204
abstracting: (1<=p22)
states: 2
abstracting: (p22<=1)
states: 204
abstracting: (0<=p28)
states: 204
abstracting: (p28<=0)
states: 200
abstracting: (1<=p81)
states: 44
abstracting: (p81<=1)
states: 204
....
EG iterations: 4
abstracting: (0<=p20)
states: 204
abstracting: (p20<=0)
states: 200
abstracting: (1<=p29)
states: 4
abstracting: (p29<=1)
states: 204
abstracting: (1<=p51)
states: 196
abstracting: (p51<=1)
states: 204
abstracting: (0<=p20)
states: 204
abstracting: (p20<=0)
states: 200
abstracting: (1<=p29)
states: 4
abstracting: (p29<=1)
states: 204
abstracting: (0<=p20)
states: 204
abstracting: (p20<=0)
states: 200
abstracting: (1<=p29)
states: 4
abstracting: (p29<=1)
states: 204
....
EG iterations: 4
.
EG iterations: 1
abstracting: (0<=p74)
states: 204
abstracting: (p74<=0)
states: 196
abstracting: (1<=p2)
states: 4
abstracting: (p2<=1)
states: 204
abstracting: (0<=p31)
states: 204
abstracting: (p31<=0)
states: 202
abstracting: (1<=p76)
states: 24
abstracting: (p76<=1)
states: 204
abstracting: (1<=p42)
states: 4
abstracting: (p42<=1)
states: 204
abstracting: (0<=p39)
states: 204
abstracting: (p39<=0)
states: 200
abstracting: (0<=p74)
states: 204
abstracting: (p74<=0)
states: 196
abstracting: (1<=p2)
states: 4
abstracting: (p2<=1)
states: 204
abstracting: (0<=p31)
states: 204
abstracting: (p31<=0)
states: 202
abstracting: (1<=p76)
states: 24
abstracting: (p76<=1)
states: 204
abstracting: (0<=p74)
states: 204
abstracting: (p74<=0)
states: 196
abstracting: (1<=p2)
states: 4
abstracting: (p2<=1)
states: 204
abstracting: (0<=p31)
states: 204
abstracting: (p31<=0)
states: 202
abstracting: (1<=p76)
states: 24
abstracting: (p76<=1)
states: 204
.
EG iterations: 1
abstracting: (1<=p41)
states: 8
abstracting: (p41<=1)
states: 204
.-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

totally nodes used: 141905 (1.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 99757 452915 552672
used/not used/entry size/cache size: 604022 66504842 16 1024MB
basic ops cache: hits/miss/sum: 8104 60686 68790
used/not used/entry size/cache size: 117002 16660214 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: 962 4010 4972
used/not used/entry size/cache size: 4010 8384598 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 66974395
1 127431
2 6648
3 382
4 8
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.522sec


BK_STOP 1679451028458

--------------------
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:373 (8), effective:83 (1)

initing FirstDep: 0m 0.000sec


iterations count:111 (2), effective:13 (0)

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

iterations count:209 (4), effective:43 (0)

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

iterations count:170 (3), effective:43 (0)

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

iterations count:205 (4), effective:41 (0)

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

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

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

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

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

iterations count:216 (4), effective:44 (0)

iterations count:216 (4), effective:44 (0)

iterations count:215 (4), effective:44 (0)

iterations count:216 (4), effective:44 (0)

iterations count:216 (4), effective:44 (0)

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

iterations count:216 (4), effective:44 (0)

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

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

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

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

iterations count:208 (4), effective:42 (0)

iterations count:215 (4), effective:44 (0)

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

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

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

iterations count:216 (4), effective:44 (0)

iterations count:216 (4), effective:44 (0)

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

iterations count:216 (4), effective:44 (0)

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

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

iterations count:46 (1), effective:1 (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="IOTPpurchase-PT-C01M01P01D01"
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 IOTPpurchase-PT-C01M01P01D01, 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-167856419800105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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