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.r266-smll-167863540800369.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 ParamProductionCell-PT-1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540800369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 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 ParamProductionCell-PT-1-CTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679039653152

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=ParamProductionCell-PT-1
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 07:54:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 07:54:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 07:54:16] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-17 07:54:16] [INFO ] Transformed 231 places.
[2023-03-17 07:54:16] [INFO ] Transformed 202 transitions.
[2023-03-17 07:54:16] [INFO ] Found NUPN structural information;
[2023-03-17 07:54:16] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Support contains 83 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 68 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2023-03-17 07:54:17] [INFO ] Computed 59 place invariants in 25 ms
[2023-03-17 07:54:17] [INFO ] Implicit Places using invariants in 725 ms returned [1, 15, 16, 18, 19, 24, 36, 41, 42, 47, 59, 64, 65, 73, 78, 113, 116, 118, 160, 161, 163, 166, 190, 192, 196, 202, 203, 218]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 789 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/231 places, 198/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 199 /199 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 871 ms. Remains : 199/231 places, 198/202 transitions.
Support contains 83 out of 199 places after structural reductions.
[2023-03-17 07:54:18] [INFO ] Flatten gal took : 88 ms
[2023-03-17 07:54:18] [INFO ] Flatten gal took : 39 ms
[2023-03-17 07:54:18] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 77 out of 199 places (down from 83) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 54) seen :49
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 198 rows 199 cols
[2023-03-17 07:54:20] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-17 07:54:20] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 07:54:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-17 07:54:20] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-03-17 07:54:20] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-17 07:54:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-17 07:54:20] [INFO ] After 140ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-17 07:54:21] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 9 ms to minimize.
[2023-03-17 07:54:21] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2023-03-17 07:54:21] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 2 ms to minimize.
[2023-03-17 07:54:21] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2023-03-17 07:54:21] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2023-03-17 07:54:21] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2023-03-17 07:54:21] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-17 07:54:22] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 1 ms to minimize.
[2023-03-17 07:54:22] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 0 ms to minimize.
[2023-03-17 07:54:22] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2023-03-17 07:54:22] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-17 07:54:22] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2023-03-17 07:54:22] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2023-03-17 07:54:22] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2023-03-17 07:54:23] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2023-03-17 07:54:23] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2023-03-17 07:54:23] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2023-03-17 07:54:23] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 1 ms to minimize.
[2023-03-17 07:54:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 2671 ms
[2023-03-17 07:54:23] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2023-03-17 07:54:23] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2023-03-17 07:54:23] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2023-03-17 07:54:24] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 1 ms to minimize.
[2023-03-17 07:54:24] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2023-03-17 07:54:24] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2023-03-17 07:54:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 758 ms
[2023-03-17 07:54:24] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 1 ms to minimize.
[2023-03-17 07:54:24] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2023-03-17 07:54:24] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
[2023-03-17 07:54:24] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2023-03-17 07:54:25] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 1 ms to minimize.
[2023-03-17 07:54:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 656 ms
[2023-03-17 07:54:25] [INFO ] After 4352ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :0
[2023-03-17 07:54:25] [INFO ] After 4700ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA ParamProductionCell-PT-1-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 27 ms
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 27 ms
[2023-03-17 07:54:25] [INFO ] Input system was already deterministic with 198 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 37 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 22 ms
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 25 ms
[2023-03-17 07:54:25] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 198 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 198 transition count 197
Applied a total of 2 rules in 16 ms. Remains 198 /199 variables (removed 1) and now considering 197/198 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 198/199 places, 197/198 transitions.
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 23 ms
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 26 ms
[2023-03-17 07:54:25] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 14 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 21 ms
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 32 ms
[2023-03-17 07:54:25] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 8 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 13 ms
[2023-03-17 07:54:25] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 8 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 13 ms
[2023-03-17 07:54:25] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 199 transition count 179
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 180 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 179 transition count 178
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 40 place count 179 transition count 166
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 64 place count 167 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 166 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 166 transition count 165
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 132 place count 133 transition count 132
Applied a total of 132 rules in 44 ms. Remains 133 /199 variables (removed 66) and now considering 132/198 (removed 66) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 133/199 places, 132/198 transitions.
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:54:25] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 10 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:54:25] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 199 transition count 177
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 178 transition count 177
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 42 place count 178 transition count 164
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 138 place count 130 transition count 129
Applied a total of 138 rules in 30 ms. Remains 130 /199 variables (removed 69) and now considering 129/198 (removed 69) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 130/199 places, 129/198 transitions.
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 7 ms
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:54:25] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 10 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:54:25] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:54:26] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 9 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:54:26] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 9 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:54:26] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 9 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:54:26] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 9 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:54:26] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 8 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 197/199 places, 196/198 transitions.
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:54:26] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 199 transition count 176
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 177 transition count 176
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 44 place count 177 transition count 163
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 70 place count 164 transition count 163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 162 transition count 161
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 162 transition count 161
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 146 place count 126 transition count 125
Applied a total of 146 rules in 29 ms. Remains 126 /199 variables (removed 73) and now considering 125/198 (removed 73) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 126/199 places, 125/198 transitions.
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 7 ms
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 7 ms
[2023-03-17 07:54:26] [INFO ] Input system was already deterministic with 125 transitions.
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:54:26] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:54:26] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-17 07:54:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 198 transitions and 700 arcs took 1 ms.
Total runtime 9872 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: 199 NrTr: 198 NrArc: 700)

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

net check time: 0m 0.000sec

init dd package: 0m 3.367sec


RS generation: 0m 0.167sec


-> reachability set: #nodes 2835 (2.8e+03) #states 25,632 (4)



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

checking: AX [EX [EG [[EG [[p177<=0 & 0<=p177]] | EX [0<=0]]]]]
normalized: ~ [EX [~ [EX [EG [[EG [[p177<=0 & 0<=p177]] | EX [0<=0]]]]]]]

abstracting: (0<=0)
states: 25,632 (4)
.abstracting: (0<=p177)
states: 25,632 (4)
abstracting: (p177<=0)
states: 25,324 (4)
....................................................................................................................................................................................
EG iterations: 180

EG iterations: 0
..-> the formula is TRUE

FORMULA ParamProductionCell-PT-1-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.050sec

checking: EF [[EF [~ [[p144<=1 & 1<=p144]]] & AX [1<=0]]]
normalized: E [true U [E [true U ~ [[p144<=1 & 1<=p144]]] & ~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p144)
states: 1,240 (3)
abstracting: (p144<=1)
states: 25,632 (4)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-1-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.143sec

checking: EG [EF [~ [[p78<=1 & 1<=p78]]]]
normalized: EG [E [true U ~ [[p78<=1 & 1<=p78]]]]

abstracting: (1<=p78)
states: 154
abstracting: (p78<=1)
states: 25,632 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA ParamProductionCell-PT-1-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: [EG [EX [[p45<=0 & 0<=p45]]] & EX [[p64<=1 & 1<=p64]]]
normalized: [EX [[p64<=1 & 1<=p64]] & EG [EX [[p45<=0 & 0<=p45]]]]

abstracting: (0<=p45)
states: 25,632 (4)
abstracting: (p45<=0)
states: 25,576 (4)
.........
EG iterations: 8
abstracting: (1<=p64)
states: 25,464 (4)
abstracting: (p64<=1)
states: 25,632 (4)
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-1-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.104sec

checking: EG [A [EF [EG [EX [0<=0]]] U AF [AG [[[p128<=0 & 0<=p128] | [p83<=1 & 1<=p83]]]]]]
normalized: EG [[~ [EG [EG [E [true U ~ [[[p83<=1 & 1<=p83] | [p128<=0 & 0<=p128]]]]]]] & ~ [E [EG [E [true U ~ [[[p83<=1 & 1<=p83] | [p128<=0 & 0<=p128]]]]] U [~ [E [true U EG [EX [0<=0]]]] & EG [E [true U ~ [[[p83<=1 & 1<=p83] | [p128<=0 & 0<=p128]]]]]]]]]]

abstracting: (0<=p128)
states: 25,632 (4)
abstracting: (p128<=0)
states: 25,588 (4)
abstracting: (1<=p83)
states: 594
abstracting: (p83<=1)
states: 25,632 (4)

EG iterations: 0
abstracting: (0<=0)
states: 25,632 (4)
.
EG iterations: 0
abstracting: (0<=p128)
states: 25,632 (4)
abstracting: (p128<=0)
states: 25,588 (4)
abstracting: (1<=p83)
states: 594
abstracting: (p83<=1)
states: 25,632 (4)

EG iterations: 0
abstracting: (0<=p128)
states: 25,632 (4)
abstracting: (p128<=0)
states: 25,588 (4)
abstracting: (1<=p83)
states: 594
abstracting: (p83<=1)
states: 25,632 (4)

EG iterations: 0

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA ParamProductionCell-PT-1-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

checking: AF [AX [~ [A [~ [EG [[p169<=1 & 1<=p169]]] U AG [[[p195<=0 & 0<=p195] | [p196<=1 & 1<=p196]]]]]]]
normalized: ~ [EG [EX [[~ [EG [E [true U ~ [[[p196<=1 & 1<=p196] | [p195<=0 & 0<=p195]]]]]] & ~ [E [E [true U ~ [[[p196<=1 & 1<=p196] | [p195<=0 & 0<=p195]]]] U [EG [[p169<=1 & 1<=p169]] & E [true U ~ [[[p196<=1 & 1<=p196] | [p195<=0 & 0<=p195]]]]]]]]]]]

abstracting: (0<=p195)
states: 25,632 (4)
abstracting: (p195<=0)
states: 25,016 (4)
abstracting: (1<=p196)
states: 1,232 (3)
abstracting: (p196<=1)
states: 25,632 (4)
abstracting: (1<=p169)
states: 7,700 (3)
abstracting: (p169<=1)
states: 25,632 (4)
...................................
EG iterations: 35
abstracting: (0<=p195)
states: 25,632 (4)
abstracting: (p195<=0)
states: 25,016 (4)
abstracting: (1<=p196)
states: 1,232 (3)
abstracting: (p196<=1)
states: 25,632 (4)
abstracting: (0<=p195)
states: 25,632 (4)
abstracting: (p195<=0)
states: 25,016 (4)
abstracting: (1<=p196)
states: 1,232 (3)
abstracting: (p196<=1)
states: 25,632 (4)

EG iterations: 0
..
EG iterations: 1
-> the formula is TRUE

FORMULA ParamProductionCell-PT-1-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.573sec

checking: EG [EX [[EF [EX [[[p181<=0 & 0<=p181] | [p104<=1 & 1<=p104]]]] | [[p84<=0 & 0<=p84] | [p37<=1 & 1<=p37]]]]]
normalized: EG [EX [[[[p84<=0 & 0<=p84] | [p37<=1 & 1<=p37]] | E [true U EX [[[p104<=1 & 1<=p104] | [p181<=0 & 0<=p181]]]]]]]

abstracting: (0<=p181)
states: 25,632 (4)
abstracting: (p181<=0)
states: 25,324 (4)
abstracting: (1<=p104)
states: 154
abstracting: (p104<=1)
states: 25,632 (4)
.abstracting: (1<=p37)
states: 6,792 (3)
abstracting: (p37<=1)
states: 25,632 (4)
abstracting: (0<=p84)
states: 25,632 (4)
abstracting: (p84<=0)
states: 810
.
EG iterations: 0
-> the formula is TRUE

FORMULA ParamProductionCell-PT-1-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EX [AF [AG [[[AX [[p29<=1 & 1<=p29]] & [[p158<=0 & 0<=p158] & [p188<=1 & 1<=p188]]] | [[p184<=0 & 0<=p184] & [p28<=0 & 0<=p28]]]]]]
normalized: EX [~ [EG [E [true U ~ [[[[p28<=0 & 0<=p28] & [p184<=0 & 0<=p184]] | [[[p188<=1 & 1<=p188] & [p158<=0 & 0<=p158]] & ~ [EX [~ [[p29<=1 & 1<=p29]]]]]]]]]]]

abstracting: (1<=p29)
states: 2,516 (3)
abstracting: (p29<=1)
states: 25,632 (4)
.abstracting: (0<=p158)
states: 25,632 (4)
abstracting: (p158<=0)
states: 25,632 (4)
abstracting: (1<=p188)
states: 616
abstracting: (p188<=1)
states: 25,632 (4)
abstracting: (0<=p184)
states: 25,632 (4)
abstracting: (p184<=0)
states: 25,016 (4)
abstracting: (0<=p28)
states: 25,632 (4)
abstracting: (p28<=0)
states: 19,000 (4)

EG iterations: 0
.-> the formula is FALSE

FORMULA ParamProductionCell-PT-1-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.203sec

checking: AF [[EG [AG [[p19<=1 & 1<=p19]]] & [EF [EX [[p176<=0 & 0<=p176]]] | [[p106<=1 & 1<=p106] | [[p86<=0 & 0<=p86] & [p73<=1 & 1<=p73]]]]]]
normalized: ~ [EG [~ [[[[[[p73<=1 & 1<=p73] & [p86<=0 & 0<=p86]] | [p106<=1 & 1<=p106]] | E [true U EX [[p176<=0 & 0<=p176]]]] & EG [~ [E [true U ~ [[p19<=1 & 1<=p19]]]]]]]]]

abstracting: (1<=p19)
states: 14,232 (4)
abstracting: (p19<=1)
states: 25,632 (4)
.
EG iterations: 1
abstracting: (0<=p176)
states: 25,632 (4)
abstracting: (p176<=0)
states: 19,780 (4)
.abstracting: (1<=p106)
states: 44
abstracting: (p106<=1)
states: 25,632 (4)
abstracting: (0<=p86)
states: 25,632 (4)
abstracting: (p86<=0)
states: 25,416 (4)
abstracting: (1<=p73)
states: 88
abstracting: (p73<=1)
states: 25,632 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-1-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: [AX [[p49<=0 & 0<=p49]] & AG [[~ [E [~ [[[p6<=0 & 0<=p6] | [p81<=1 & 1<=p81]]] U [p40<=1 & 1<=p40]]] | [[p180<=0 & 0<=p180] | [p32<=1 & 1<=p32]]]]]
normalized: [~ [E [true U ~ [[[[p32<=1 & 1<=p32] | [p180<=0 & 0<=p180]] | ~ [E [~ [[[p81<=1 & 1<=p81] | [p6<=0 & 0<=p6]]] U [p40<=1 & 1<=p40]]]]]]] & ~ [EX [~ [[p49<=0 & 0<=p49]]]]]

abstracting: (0<=p49)
states: 25,632 (4)
abstracting: (p49<=0)
states: 25,324 (4)
.abstracting: (1<=p40)
states: 2,208 (3)
abstracting: (p40<=1)
states: 25,632 (4)
abstracting: (0<=p6)
states: 25,632 (4)
abstracting: (p6<=0)
states: 23,424 (4)
abstracting: (1<=p81)
states: 21,028 (4)
abstracting: (p81<=1)
states: 25,632 (4)
abstracting: (0<=p180)
states: 25,632 (4)
abstracting: (p180<=0)
states: 22,860 (4)
abstracting: (1<=p32)
states: 18,084 (4)
abstracting: (p32<=1)
states: 25,632 (4)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-1-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.098sec

checking: [AG [E [EG [[p178<=1 & 1<=p178]] U EG [[[p7<=0 & 0<=p7] | [p137<=1 & 1<=p137]]]]] & AF [EG [A [[[p42<=0 & 0<=p42] | [p34<=1 & 1<=p34]] U [p173<=1 & 1<=p173]]]]]
normalized: [~ [EG [~ [EG [[~ [EG [~ [[p173<=1 & 1<=p173]]]] & ~ [E [~ [[p173<=1 & 1<=p173]] U [~ [[[p34<=1 & 1<=p34] | [p42<=0 & 0<=p42]]] & ~ [[p173<=1 & 1<=p173]]]]]]]]]] & ~ [E [true U ~ [E [EG [[p178<=1 & 1<=p178]] U EG [[[p137<=1 & 1<=p137] | [p7<=0 & 0<=p7]]]]]]]]

abstracting: (0<=p7)
states: 25,632 (4)
abstracting: (p7<=0)
states: 25,324 (4)
abstracting: (1<=p137)
states: 0
abstracting: (p137<=1)
states: 25,632 (4)
...................................................................................................................................................................................
EG iterations: 179
abstracting: (1<=p178)
states: 308
abstracting: (p178<=1)
states: 25,632 (4)
....................
EG iterations: 20
abstracting: (1<=p173)
states: 308
abstracting: (p173<=1)
states: 25,632 (4)
abstracting: (0<=p42)
states: 25,632 (4)
abstracting: (p42<=0)
states: 25,576 (4)
abstracting: (1<=p34)
states: 2,208 (3)
abstracting: (p34<=1)
states: 25,632 (4)
abstracting: (1<=p173)
states: 308
abstracting: (p173<=1)
states: 25,632 (4)
abstracting: (1<=p173)
states: 308
abstracting: (p173<=1)
states: 25,632 (4)
....................................................................................................................................................................................
EG iterations: 180
......................................................................................................................................................
EG iterations: 150

EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-1-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.781sec

checking: A [EG [AG [[EF [[p180<=0 & 0<=p180]] & E [[p186<=1 & 1<=p186] U [[p104<=0 & 0<=p104] | [p171<=1 & 1<=p171]]]]]] U EG [EF [[[p31<=1 & 1<=p31] | [p70<=0 & 0<=p70]]]]]
normalized: [~ [E [~ [EG [E [true U [[p31<=1 & 1<=p31] | [p70<=0 & 0<=p70]]]]] U [~ [EG [~ [E [true U ~ [[E [true U [p180<=0 & 0<=p180]] & E [[p186<=1 & 1<=p186] U [[p104<=0 & 0<=p104] | [p171<=1 & 1<=p171]]]]]]]]] & ~ [EG [E [true U [[p31<=1 & 1<=p31] | [p70<=0 & 0<=p70]]]]]]]] & ~ [EG [~ [EG [E [true U [[p31<=1 & 1<=p31] | [p70<=0 & 0<=p70]]]]]]]]

abstracting: (0<=p70)
states: 25,632 (4)
abstracting: (p70<=0)
states: 25,604 (4)
abstracting: (1<=p31)
states: 2,208 (3)
abstracting: (p31<=1)
states: 25,632 (4)

EG iterations: 0
.
EG iterations: 1
abstracting: (0<=p70)
states: 25,632 (4)
abstracting: (p70<=0)
states: 25,604 (4)
abstracting: (1<=p31)
states: 2,208 (3)
abstracting: (p31<=1)
states: 25,632 (4)

EG iterations: 0
abstracting: (1<=p171)
states: 1,540 (3)
abstracting: (p171<=1)
states: 25,632 (4)
abstracting: (0<=p104)
states: 25,632 (4)
abstracting: (p104<=0)
states: 25,478 (4)
abstracting: (1<=p186)
states: 616
abstracting: (p186<=1)
states: 25,632 (4)
abstracting: (0<=p180)
states: 25,632 (4)
abstracting: (p180<=0)
states: 22,860 (4)
.
EG iterations: 1
abstracting: (0<=p70)
states: 25,632 (4)
abstracting: (p70<=0)
states: 25,604 (4)
abstracting: (1<=p31)
states: 2,208 (3)
abstracting: (p31<=1)
states: 25,632 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA ParamProductionCell-PT-1-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.113sec

checking: AG [AX [[[p96<=1 & 1<=p96] | [~ [A [[p62<=1 & 1<=p62] U [p0<=1 & 1<=p0]]] | A [E [[p37<=0 & 0<=p37] U [p82<=0 & 0<=p82]] U [[p67<=0 & 0<=p67] | [p195<=1 & 1<=p195]]]]]]]
normalized: ~ [E [true U EX [~ [[[[~ [EG [~ [[[p195<=1 & 1<=p195] | [p67<=0 & 0<=p67]]]]] & ~ [E [~ [[[p195<=1 & 1<=p195] | [p67<=0 & 0<=p67]]] U [~ [E [[p37<=0 & 0<=p37] U [p82<=0 & 0<=p82]]] & ~ [[[p195<=1 & 1<=p195] | [p67<=0 & 0<=p67]]]]]]] | ~ [[~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [[p62<=1 & 1<=p62]] & ~ [[p0<=1 & 1<=p0]]]]]]]] | [p96<=1 & 1<=p96]]]]]]

abstracting: (1<=p96)
states: 770
abstracting: (p96<=1)
states: 25,632 (4)
abstracting: (1<=p0)
states: 616
abstracting: (p0<=1)
states: 25,632 (4)
abstracting: (1<=p62)
states: 112
abstracting: (p62<=1)
states: 25,632 (4)
abstracting: (1<=p0)
states: 616
abstracting: (p0<=1)
states: 25,632 (4)
abstracting: (1<=p0)
states: 616
abstracting: (p0<=1)
states: 25,632 (4)
....................................................................................................................................................................................
EG iterations: 180
abstracting: (0<=p67)
states: 25,632 (4)
abstracting: (p67<=0)
states: 25,604 (4)
abstracting: (1<=p195)
states: 616
abstracting: (p195<=1)
states: 25,632 (4)
abstracting: (0<=p82)
states: 25,632 (4)
abstracting: (p82<=0)
states: 24,504 (4)
abstracting: (0<=p37)
states: 25,632 (4)
abstracting: (p37<=0)
states: 18,840 (4)
abstracting: (0<=p67)
states: 25,632 (4)
abstracting: (p67<=0)
states: 25,604 (4)
abstracting: (1<=p195)
states: 616
abstracting: (p195<=1)
states: 25,632 (4)
abstracting: (0<=p67)
states: 25,632 (4)
abstracting: (p67<=0)
states: 25,604 (4)
abstracting: (1<=p195)
states: 616
abstracting: (p195<=1)
states: 25,632 (4)
..........
EG iterations: 10
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-1-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.191sec

checking: [[EX [[[0<=p140 & p140<=0] & [p181<=1 & 1<=p181]]] & [EX [0<=0] & AG [[[[[[p57<=1 & 1<=p57] & [p110<=0 & 0<=p110]] | [p178<=1 & 1<=p178]] | [[[p157<=0 & 0<=p157] & [p154<=1 & 1<=p154]] | [[p25<=0 & 0<=p25] & [p61<=1 & 1<=p61]]]] & [AF [[p38<=0 & 0<=p38]] | [EX [[[p61<=0 & 0<=p61] | [p100<=1 & 1<=p100]]] & AG [[p52<=1 & 1<=p52]]]]]]]] | EX [EF [EG [[p101<=0 & 0<=p101]]]]]
normalized: [EX [E [true U EG [[p101<=0 & 0<=p101]]]] | [EX [[[p181<=1 & 1<=p181] & [0<=p140 & p140<=0]]] & [~ [E [true U ~ [[[[~ [E [true U ~ [[p52<=1 & 1<=p52]]]] & EX [[[p100<=1 & 1<=p100] | [p61<=0 & 0<=p61]]]] | ~ [EG [~ [[p38<=0 & 0<=p38]]]]] & [[[[p61<=1 & 1<=p61] & [p25<=0 & 0<=p25]] | [[p154<=1 & 1<=p154] & [p157<=0 & 0<=p157]]] | [[p178<=1 & 1<=p178] | [[p110<=0 & 0<=p110] & [p57<=1 & 1<=p57]]]]]]]] & EX [0<=0]]]]

abstracting: (0<=0)
states: 25,632 (4)
.abstracting: (1<=p57)
states: 616
abstracting: (p57<=1)
states: 25,632 (4)
abstracting: (0<=p110)
states: 25,632 (4)
abstracting: (p110<=0)
states: 25,588 (4)
abstracting: (1<=p178)
states: 308
abstracting: (p178<=1)
states: 25,632 (4)
abstracting: (0<=p157)
states: 25,632 (4)
abstracting: (p157<=0)
states: 25,632 (4)
abstracting: (1<=p154)
states: 0
abstracting: (p154<=1)
states: 25,632 (4)
abstracting: (0<=p25)
states: 25,632 (4)
abstracting: (p25<=0)
states: 15,684 (4)
abstracting: (1<=p61)
states: 10,226 (4)
abstracting: (p61<=1)
states: 25,632 (4)
abstracting: (0<=p38)
states: 25,632 (4)
abstracting: (p38<=0)
states: 23,424 (4)
............................................................................................................................
EG iterations: 124
abstracting: (0<=p61)
states: 25,632 (4)
abstracting: (p61<=0)
states: 15,406 (4)
abstracting: (1<=p100)
states: 154
abstracting: (p100<=1)
states: 25,632 (4)
.abstracting: (1<=p52)
states: 24,400 (4)
abstracting: (p52<=1)
states: 25,632 (4)
abstracting: (p140<=0)
states: 25,492 (4)
abstracting: (0<=p140)
states: 25,632 (4)
abstracting: (1<=p181)
states: 308
abstracting: (p181<=1)
states: 25,632 (4)
.abstracting: (0<=p101)
states: 25,632 (4)
abstracting: (p101<=0)
states: 23,102 (4)
............................................................................................................................................................
EG iterations: 156
.-> the formula is FALSE

FORMULA ParamProductionCell-PT-1-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.149sec

checking: E [~ [[p193<=1 & 1<=p193]] U EF [[[E [E [[[p139<=0 & 0<=p139] | [p57<=1 & 1<=p57]] U [[p179<=0 & 0<=p179] | [p151<=1 & 1<=p151]]] U AF [[[p43<=0 & 0<=p43] | [p107<=1 & 1<=p107]]]] & EX [EG [[p51<=1 & 1<=p51]]]] & [~ [EF [[p6<=0 & 0<=p6]]] & [AX [[p77<=1 & 1<=p77]] | [EF [[p103<=0 & 0<=p103]] & [[[p52<=0 & 0<=p52] | [p132<=1 & 1<=p132]] | [[p104<=0 & 0<=p104] | [p121<=1 & 1<=p121]]]]]]]]]
normalized: E [~ [[p193<=1 & 1<=p193]] U E [true U [[~ [E [true U [p6<=0 & 0<=p6]]] & [[E [true U [p103<=0 & 0<=p103]] & [[[p52<=0 & 0<=p52] | [p132<=1 & 1<=p132]] | [[p104<=0 & 0<=p104] | [p121<=1 & 1<=p121]]]] | ~ [EX [~ [[p77<=1 & 1<=p77]]]]]] & [EX [EG [[p51<=1 & 1<=p51]]] & E [E [[[p57<=1 & 1<=p57] | [p139<=0 & 0<=p139]] U [[p151<=1 & 1<=p151] | [p179<=0 & 0<=p179]]] U ~ [EG [~ [[[p107<=1 & 1<=p107] | [p43<=0 & 0<=p43]]]]]]]]]]

abstracting: (0<=p43)
states: 25,632 (4)
abstracting: (p43<=0)
states: 25,576 (4)
abstracting: (1<=p107)
states: 44
abstracting: (p107<=1)
states: 25,632 (4)
...........
EG iterations: 11
abstracting: (0<=p179)
states: 25,632 (4)
abstracting: (p179<=0)
states: 25,324 (4)
abstracting: (1<=p151)
states: 44
abstracting: (p151<=1)
states: 25,632 (4)
abstracting: (0<=p139)
states: 25,632 (4)
abstracting: (p139<=0)
states: 25,576 (4)
abstracting: (1<=p57)
states: 616
abstracting: (p57<=1)
states: 25,632 (4)
abstracting: (1<=p51)
states: 1,232 (3)
abstracting: (p51<=1)
states: 25,632 (4)
.......................
EG iterations: 23
.abstracting: (1<=p77)
states: 154
abstracting: (p77<=1)
states: 25,632 (4)
.abstracting: (1<=p121)
states: 44
abstracting: (p121<=1)
states: 25,632 (4)
abstracting: (0<=p104)
states: 25,632 (4)
abstracting: (p104<=0)
states: 25,478 (4)
abstracting: (1<=p132)
states: 0
abstracting: (p132<=1)
states: 25,632 (4)
abstracting: (0<=p52)
states: 25,632 (4)
abstracting: (p52<=0)
states: 1,232 (3)
abstracting: (0<=p103)
states: 25,632 (4)
abstracting: (p103<=0)
states: 25,324 (4)
abstracting: (0<=p6)
states: 25,632 (4)
abstracting: (p6<=0)
states: 23,424 (4)
abstracting: (1<=p193)
states: 616
abstracting: (p193<=1)
states: 25,632 (4)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-1-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.372sec

totally nodes used: 10560074 (1.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4703427 40038764 44742191
used/not used/entry size/cache size: 35951478 31157386 16 1024MB
basic ops cache: hits/miss/sum: 149779 1258139 1407918
used/not used/entry size/cache size: 2611317 14165899 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: 4261 39129 43390
used/not used/entry size/cache size: 39067 8349541 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 59129922
1 5978880
2 1525529
3 384283
4 76042
5 12366
6 1633
7 185
8 20
9 4
>= 10 0

Total processing time: 0m22.212sec


BK_STOP 1679039689656

--------------------
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:4091 (20), effective:294 (1)

initing FirstDep: 0m 0.000sec


iterations count:624 (3), effective:24 (0)

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

iterations count:2296 (11), effective:161 (0)

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

iterations count:2296 (11), effective:161 (0)

iterations count:2296 (11), effective:161 (0)

iterations count:2350 (11), effective:161 (0)

iterations count:2350 (11), effective:161 (0)

iterations count:2350 (11), effective:161 (0)

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

iterations count:2339 (11), effective:158 (0)

iterations count:1730 (8), effective:134 (0)

iterations count:296 (1), effective:16 (0)

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

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

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

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

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

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

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

iterations count:2319 (11), effective:161 (0)

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

iterations count:211 (1), effective:4 (0)

iterations count:623 (3), effective:24 (0)

iterations count:2340 (11), effective:158 (0)

iterations count:212 (1), effective:4 (0)

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

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

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

iterations count:200 (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="ParamProductionCell-PT-1"
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 ParamProductionCell-PT-1, 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 r266-smll-167863540800369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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