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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:13 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.5K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:14 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 149K 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-0-CTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679039105645

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-0
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 07:45:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 07:45:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 07:45:08] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-03-17 07:45:08] [INFO ] Transformed 198 places.
[2023-03-17 07:45:08] [INFO ] Transformed 176 transitions.
[2023-03-17 07:45:08] [INFO ] Found NUPN structural information;
[2023-03-17 07:45:08] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
FORMULA ParamProductionCell-PT-0-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 195 transition count 173
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 195 transition count 173
Applied a total of 6 rules in 60 ms. Remains 195 /198 variables (removed 3) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 195 cols
[2023-03-17 07:45:09] [INFO ] Computed 49 place invariants in 26 ms
[2023-03-17 07:45:09] [INFO ] Implicit Places using invariants in 671 ms returned [24, 31, 35, 36, 41, 47, 64, 65, 73, 79, 101, 115, 117, 119, 120, 161, 166, 167]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 758 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 177/198 places, 173/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 177 /177 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 831 ms. Remains : 177/198 places, 173/176 transitions.
Support contains 74 out of 177 places after structural reductions.
[2023-03-17 07:45:10] [INFO ] Flatten gal took : 80 ms
[2023-03-17 07:45:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ParamProductionCell-PT-0-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 07:45:10] [INFO ] Flatten gal took : 33 ms
[2023-03-17 07:45:10] [INFO ] Input system was already deterministic with 173 transitions.
Support contains 65 out of 177 places (down from 74) after GAL structural reductions.
FORMULA ParamProductionCell-PT-0-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 845 ms. (steps per millisecond=11 ) properties (out of 45) seen :41
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 173 rows 177 cols
[2023-03-17 07:45:11] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-17 07:45:11] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 07:45:11] [INFO ] [Nat]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-17 07:45:11] [INFO ] [Nat]Absence check using 25 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 07:45:12] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-17 07:45:12] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-17 07:45:12] [INFO ] After 70ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-17 07:45:12] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 10 ms to minimize.
[2023-03-17 07:45:12] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2023-03-17 07:45:12] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-17 07:45:12] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2023-03-17 07:45:12] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-17 07:45:12] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2023-03-17 07:45:12] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2023-03-17 07:45:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 788 ms
[2023-03-17 07:45:13] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-17 07:45:13] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2023-03-17 07:45:13] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2023-03-17 07:45:13] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 1 ms to minimize.
[2023-03-17 07:45:13] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2023-03-17 07:45:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 550 ms
[2023-03-17 07:45:13] [INFO ] After 1447ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-17 07:45:13] [INFO ] After 1756ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 173/173 transitions.
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 14 rules applied. Total rules applied 14 place count 177 transition count 159
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 163 transition count 159
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 28 place count 163 transition count 147
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 52 place count 151 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 149 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 149 transition count 145
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 116 place count 118 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 116 place count 118 transition count 115
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 117 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 115 transition count 114
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 115 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 131 place count 110 transition count 109
Applied a total of 131 rules in 62 ms. Remains 110 /177 variables (removed 67) and now considering 109/173 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 110/177 places, 109/173 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 110 cols
[2023-03-17 07:45:13] [INFO ] Computed 28 place invariants in 5 ms
[2023-03-17 07:45:13] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 07:45:14] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2023-03-17 07:45:14] [INFO ] [Nat]Absence check using 22 positive and 6 generalized place invariants in 11 ms returned sat
[2023-03-17 07:45:14] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 07:45:14] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-17 07:45:14] [INFO ] After 55ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 07:45:14] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2023-03-17 07:45:14] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2023-03-17 07:45:14] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2023-03-17 07:45:14] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-17 07:45:14] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2023-03-17 07:45:14] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2023-03-17 07:45:15] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2023-03-17 07:45:15] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2023-03-17 07:45:15] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-17 07:45:15] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2023-03-17 07:45:15] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2023-03-17 07:45:15] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2023-03-17 07:45:15] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2023-03-17 07:45:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1233 ms
[2023-03-17 07:45:15] [INFO ] After 1306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-17 07:45:15] [INFO ] After 1523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 109/109 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 110/110 places, 109/109 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36459 steps, run visited all 1 properties in 138 ms. (steps per millisecond=264 )
Probabilistic random walk after 36459 steps, saw 12620 distinct states, run finished after 138 ms. (steps per millisecond=264 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-17 07:45:15] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:45:15] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:45:15] [INFO ] Input system was already deterministic with 173 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 173/173 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 174 transition count 170
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 174 transition count 170
Applied a total of 6 rules in 8 ms. Remains 174 /177 variables (removed 3) and now considering 170/173 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 174/177 places, 170/173 transitions.
[2023-03-17 07:45:15] [INFO ] Flatten gal took : 13 ms
[2023-03-17 07:45:15] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:45:15] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 173/173 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 175 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 175 transition count 171
Applied a total of 4 rules in 6 ms. Remains 175 /177 variables (removed 2) and now considering 171/173 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 175/177 places, 171/173 transitions.
[2023-03-17 07:45:15] [INFO ] Flatten gal took : 13 ms
[2023-03-17 07:45:15] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:45:15] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 173/173 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 175 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 175 transition count 171
Applied a total of 4 rules in 6 ms. Remains 175 /177 variables (removed 2) and now considering 171/173 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 175/177 places, 171/173 transitions.
[2023-03-17 07:45:15] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:45:15] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:45:15] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 173/173 transitions.
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 14 rules applied. Total rules applied 14 place count 177 transition count 159
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 163 transition count 159
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 28 place count 163 transition count 148
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 152 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 149 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 149 transition count 145
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 116 place count 118 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 116 place count 118 transition count 115
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 117 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 115 transition count 114
Applied a total of 121 rules in 29 ms. Remains 115 /177 variables (removed 62) and now considering 114/173 (removed 59) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 115/177 places, 114/173 transitions.
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 8 ms
[2023-03-17 07:45:16] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 173/173 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 174 transition count 170
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 174 transition count 170
Applied a total of 6 rules in 6 ms. Remains 174 /177 variables (removed 3) and now considering 170/173 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 174/177 places, 170/173 transitions.
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:45:16] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 173/173 transitions.
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 14 rules applied. Total rules applied 14 place count 177 transition count 159
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 163 transition count 159
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 28 place count 163 transition count 148
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 152 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 149 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 149 transition count 145
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 118 place count 117 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 118 place count 117 transition count 114
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 116 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 114 transition count 113
Applied a total of 123 rules in 27 ms. Remains 114 /177 variables (removed 63) and now considering 113/173 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 114/177 places, 113/173 transitions.
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 8 ms
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:45:16] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 173/173 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 174 transition count 170
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 174 transition count 170
Applied a total of 6 rules in 6 ms. Remains 174 /177 variables (removed 3) and now considering 170/173 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 174/177 places, 170/173 transitions.
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:45:16] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 173/173 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 175 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 175 transition count 171
Applied a total of 4 rules in 7 ms. Remains 175 /177 variables (removed 2) and now considering 171/173 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 175/177 places, 171/173 transitions.
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:45:16] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 173/173 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 177 transition count 162
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 166 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 165 transition count 161
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 24 place count 165 transition count 151
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 44 place count 155 transition count 151
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 152 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 152 transition count 148
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 100 place count 126 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 100 place count 126 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 125 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 123 transition count 122
Applied a total of 105 rules in 37 ms. Remains 123 /177 variables (removed 54) and now considering 122/173 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 123/177 places, 122/173 transitions.
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 7 ms
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 7 ms
[2023-03-17 07:45:16] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 173/173 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 175 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 175 transition count 171
Applied a total of 4 rules in 6 ms. Remains 175 /177 variables (removed 2) and now considering 171/173 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 175/177 places, 171/173 transitions.
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 8 ms
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:45:16] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 173/173 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 174 transition count 170
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 174 transition count 170
Applied a total of 6 rules in 7 ms. Remains 174 /177 variables (removed 3) and now considering 170/173 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 174/177 places, 170/173 transitions.
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 8 ms
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:45:16] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 173/173 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 174 transition count 170
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 174 transition count 170
Applied a total of 6 rules in 6 ms. Remains 174 /177 variables (removed 3) and now considering 170/173 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 174/177 places, 170/173 transitions.
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 8 ms
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 8 ms
[2023-03-17 07:45:16] [INFO ] Input system was already deterministic with 170 transitions.
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:45:16] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:45:16] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-17 07:45:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 177 places, 173 transitions and 615 arcs took 2 ms.
Total runtime 8074 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: 177 NrTr: 173 NrArc: 615)

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

net check time: 0m 0.000sec

init dd package: 0m 3.698sec


RS generation: 0m 0.956sec


-> reachability set: #nodes 4456 (4.5e+03) #states 2,773,672 (6)



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

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

abstracting: (0<=p143)
states: 2,773,672 (6)
abstracting: (p143<=0)
states: 2,763,336 (6)
abstracting: (0<=0)
states: 2,773,672 (6)
..-> the formula is FALSE

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

MC time: 0m 0.419sec

checking: AG [EX [EF [[p131<=1 & 1<=p131]]]]
normalized: ~ [E [true U ~ [EX [E [true U [p131<=1 & 1<=p131]]]]]]

abstracting: (1<=p131)
states: 160,244 (5)
abstracting: (p131<=1)
states: 2,773,672 (6)
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-0-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.391sec

checking: EF [EX [[p79<=1 & 1<=p79]]]
normalized: E [true U EX [[p79<=1 & 1<=p79]]]

abstracting: (1<=p79)
states: 698,360 (5)
abstracting: (p79<=1)
states: 2,773,672 (6)
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-0-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.508sec

checking: AF [[EX [[0<=p125 & p125<=0]] & [p99<=1 & 1<=p99]]]
normalized: ~ [EG [~ [[[p99<=1 & 1<=p99] & EX [[0<=p125 & p125<=0]]]]]]

abstracting: (p125<=0)
states: 2,746,744 (6)
abstracting: (0<=p125)
states: 2,773,672 (6)
.abstracting: (1<=p99)
states: 11,864 (4)
abstracting: (p99<=1)
states: 2,773,672 (6)
......................................................
EG iterations: 54
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.562sec

checking: EG [EF [EX [[[p133<=0 & 0<=p133] | [p174<=1 & 1<=p174]]]]]
normalized: EG [E [true U EX [[[p133<=0 & 0<=p133] | [p174<=1 & 1<=p174]]]]]

abstracting: (1<=p174)
states: 1,386,836 (6)
abstracting: (p174<=1)
states: 2,773,672 (6)
abstracting: (0<=p133)
states: 2,773,672 (6)
abstracting: (p133<=0)
states: 2,717,024 (6)
.
EG iterations: 0
-> the formula is TRUE

FORMULA ParamProductionCell-PT-0-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: EF [EX [AG [[AF [[p0<=1 & 1<=p0]] | [[p10<=1 & 1<=p10] | [p103<=1 & 1<=p103]]]]]]
normalized: E [true U EX [~ [E [true U ~ [[[[p103<=1 & 1<=p103] | [p10<=1 & 1<=p10]] | ~ [EG [~ [[p0<=1 & 1<=p0]]]]]]]]]]

abstracting: (1<=p0)
states: 798,884 (5)
abstracting: (p0<=1)
states: 2,773,672 (6)
..................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 418
abstracting: (1<=p10)
states: 105,824 (5)
abstracting: (p10<=1)
states: 2,773,672 (6)
abstracting: (1<=p103)
states: 128,256 (5)
abstracting: (p103<=1)
states: 2,773,672 (6)
.-> the formula is TRUE

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

MC time: 0m12.235sec

checking: A [EG [AG [EF [[[p143<=1 & 1<=p143] & [p19<=1 & 1<=p19]]]]] U [p128<=0 & 0<=p128]]
normalized: [~ [EG [~ [[p128<=0 & 0<=p128]]]] & ~ [E [~ [[p128<=0 & 0<=p128]] U [~ [EG [~ [E [true U ~ [E [true U [[p19<=1 & 1<=p19] & [p143<=1 & 1<=p143]]]]]]]] & ~ [[p128<=0 & 0<=p128]]]]]]

abstracting: (0<=p128)
states: 2,773,672 (6)
abstracting: (p128<=0)
states: 1,930,160 (6)
abstracting: (1<=p143)
states: 10,336 (4)
abstracting: (p143<=1)
states: 2,773,672 (6)
abstracting: (1<=p19)
states: 350,592 (5)
abstracting: (p19<=1)
states: 2,773,672 (6)

EG iterations: 0
abstracting: (0<=p128)
states: 2,773,672 (6)
abstracting: (p128<=0)
states: 1,930,160 (6)
abstracting: (0<=p128)
states: 2,773,672 (6)
abstracting: (p128<=0)
states: 1,930,160 (6)
............................................................................................................................................................
EG iterations: 156
-> the formula is TRUE

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

MC time: 0m 3.816sec

checking: AG [AF [~ [A [[p78<=0 & 0<=p78] U [[p78<=0 & 0<=p78] & [[p84<=0 & 0<=p84] | [p101<=1 & 1<=p101]]]]]]]
normalized: ~ [E [true U EG [[~ [E [~ [[[[p84<=0 & 0<=p84] | [p101<=1 & 1<=p101]] & [p78<=0 & 0<=p78]]] U [~ [[[[p84<=0 & 0<=p84] | [p101<=1 & 1<=p101]] & [p78<=0 & 0<=p78]]] & ~ [[p78<=0 & 0<=p78]]]]] & ~ [EG [~ [[[[p84<=0 & 0<=p84] | [p101<=1 & 1<=p101]] & [p78<=0 & 0<=p78]]]]]]]]]

abstracting: (0<=p78)
states: 2,773,672 (6)
abstracting: (p78<=0)
states: 2,728,384 (6)
abstracting: (1<=p101)
states: 146,440 (5)
abstracting: (p101<=1)
states: 2,773,672 (6)
abstracting: (0<=p84)
states: 2,773,672 (6)
abstracting: (p84<=0)
states: 2,738,176 (6)
...............................................................................................................
EG iterations: 111
abstracting: (0<=p78)
states: 2,773,672 (6)
abstracting: (p78<=0)
states: 2,728,384 (6)
abstracting: (0<=p78)
states: 2,773,672 (6)
abstracting: (p78<=0)
states: 2,728,384 (6)
abstracting: (1<=p101)
states: 146,440 (5)
abstracting: (p101<=1)
states: 2,773,672 (6)
abstracting: (0<=p84)
states: 2,773,672 (6)
abstracting: (p84<=0)
states: 2,738,176 (6)
abstracting: (0<=p78)
states: 2,773,672 (6)
abstracting: (p78<=0)
states: 2,728,384 (6)
abstracting: (1<=p101)
states: 146,440 (5)
abstracting: (p101<=1)
states: 2,773,672 (6)
abstracting: (0<=p84)
states: 2,773,672 (6)
abstracting: (p84<=0)
states: 2,738,176 (6)
....................................................................................................................................................................................................................................................
EG iterations: 244
-> the formula is TRUE

FORMULA ParamProductionCell-PT-0-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.618sec

checking: AG [[[p131<=0 & 0<=p131] | [[p122<=1 & 1<=p122] | [AF [[[p97<=0 & 0<=p97] | [[p136<=0 & 0<=p136] & [p153<=1 & 1<=p153]]]] & ~ [A [[p130<=1 & 1<=p130] U [[[p107<=0 & 0<=p107] | [p142<=1 & 1<=p142]] & [p11<=1 & 1<=p11]]]]]]]]
normalized: ~ [E [true U ~ [[[p131<=0 & 0<=p131] | [[~ [[~ [EG [~ [[[p11<=1 & 1<=p11] & [[p142<=1 & 1<=p142] | [p107<=0 & 0<=p107]]]]]] & ~ [E [~ [[[p11<=1 & 1<=p11] & [[p142<=1 & 1<=p142] | [p107<=0 & 0<=p107]]]] U [~ [[[p11<=1 & 1<=p11] & [[p142<=1 & 1<=p142] | [p107<=0 & 0<=p107]]]] & ~ [[p130<=1 & 1<=p130]]]]]]] & ~ [EG [~ [[[[p153<=1 & 1<=p153] & [p136<=0 & 0<=p136]] | [p97<=0 & 0<=p97]]]]]] | [p122<=1 & 1<=p122]]]]]]

abstracting: (1<=p122)
states: 13,464 (4)
abstracting: (p122<=1)
states: 2,773,672 (6)
abstracting: (0<=p97)
states: 2,773,672 (6)
abstracting: (p97<=0)
states: 2,764,784 (6)
abstracting: (0<=p136)
states: 2,773,672 (6)
abstracting: (p136<=0)
states: 2,763,032 (6)
abstracting: (1<=p153)
states: 21,280 (4)
abstracting: (p153<=1)
states: 2,773,672 (6)
.......................................................
EG iterations: 55
abstracting: (1<=p130)
states: 968,448 (5)
abstracting: (p130<=1)
states: 2,773,672 (6)
abstracting: (0<=p107)
states: 2,773,672 (6)
abstracting: (p107<=0)
states: 2,715,096 (6)
abstracting: (1<=p142)
states: 4,256 (3)
abstracting: (p142<=1)
states: 2,773,672 (6)
abstracting: (1<=p11)
states: 105,824 (5)
abstracting: (p11<=1)
states: 2,773,672 (6)
abstracting: (0<=p107)
states: 2,773,672 (6)
abstracting: (p107<=0)
states: 2,715,096 (6)
abstracting: (1<=p142)
states: 4,256 (3)
abstracting: (p142<=1)
states: 2,773,672 (6)
abstracting: (1<=p11)
states: 105,824 (5)
abstracting: (p11<=1)
states: 2,773,672 (6)
abstracting: (0<=p107)
states: 2,773,672 (6)
abstracting: (p107<=0)
states: 2,715,096 (6)
abstracting: (1<=p142)
states: 4,256 (3)
abstracting: (p142<=1)
states: 2,773,672 (6)
abstracting: (1<=p11)
states: 105,824 (5)
abstracting: (p11<=1)
states: 2,773,672 (6)
.........................................................
EG iterations: 57
abstracting: (0<=p131)
states: 2,773,672 (6)
abstracting: (p131<=0)
states: 2,613,428 (6)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.725sec

checking: EG [[[AF [[[p57<=0 & 0<=p57] & [p174<=1 & 1<=p174]]] & [p33<=0 & 0<=p33]] & [[[AX [[[[p70<=0 & 0<=p70] | [p18<=1 & 1<=p18]] & [p53<=1 & 1<=p53]]] | [p99<=1 & 1<=p99]] | [[p16<=1 & 1<=p16] | [p67<=0 & 0<=p67]]] & [[p56<=0 & 0<=p56] | [p50<=1 & 1<=p50]]]]]
normalized: EG [[[[[~ [EX [~ [[[[p70<=0 & 0<=p70] | [p18<=1 & 1<=p18]] & [p53<=1 & 1<=p53]]]]] | [p99<=1 & 1<=p99]] | [[p67<=0 & 0<=p67] | [p16<=1 & 1<=p16]]] & [[p56<=0 & 0<=p56] | [p50<=1 & 1<=p50]]] & [[p33<=0 & 0<=p33] & ~ [EG [~ [[[p174<=1 & 1<=p174] & [p57<=0 & 0<=p57]]]]]]]]

abstracting: (0<=p57)
states: 2,773,672 (6)
abstracting: (p57<=0)
states: 522,624 (5)
abstracting: (1<=p174)
states: 1,386,836 (6)
abstracting: (p174<=1)
states: 2,773,672 (6)
..........................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 410
abstracting: (0<=p33)
states: 2,773,672 (6)
abstracting: (p33<=0)
states: 2,667,848 (6)
abstracting: (1<=p50)
states: 211,648 (5)
abstracting: (p50<=1)
states: 2,773,672 (6)
abstracting: (0<=p56)
states: 2,773,672 (6)
abstracting: (p56<=0)
states: 2,251,048 (6)
abstracting: (1<=p16)
states: 551,088 (5)
abstracting: (p16<=1)
states: 2,773,672 (6)
abstracting: (0<=p67)
states: 2,773,672 (6)
abstracting: (p67<=0)
states: 2,667,848 (6)
abstracting: (1<=p99)
states: 11,864 (4)
abstracting: (p99<=1)
states: 2,773,672 (6)
abstracting: (1<=p53)
states: 1,075,144 (6)
abstracting: (p53<=1)
states: 2,773,672 (6)
abstracting: (1<=p18)
states: 1,713,520 (6)
abstracting: (p18<=1)
states: 2,773,672 (6)
abstracting: (0<=p70)
states: 2,773,672 (6)
abstracting: (p70<=0)
states: 2,747,216 (6)
...................................................................................................................................................................................................
EG iterations: 194
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.371sec

checking: EG [[EF [~ [E [AG [[[p145<=0 & 0<=p145] | [p162<=1 & 1<=p162]]] U [[p117<=0 & 0<=p117] | [p85<=1 & 1<=p85]]]]] | [[AX [[p18<=0 & 0<=p18]] & [~ [E [EG [[p48<=1 & 1<=p48]] U ~ [[p7<=1 & 1<=p7]]]] & [EF [[p77<=0 & 0<=p77]] | [[p2<=0 & 0<=p2] & [p167<=1 & 1<=p167]]]]] | [~ [E [[[p162<=0 & 0<=p162] | [[p138<=1 & 1<=p138] | [p45<=0 & 0<=p45]]] U [[p92<=0 & 0<=p92] | [p151<=1 & 1<=p151]]]] & [[p37<=0 & 0<=p37] | [[p18<=0 & 0<=p18] & [p7<=1 & 1<=p7]]]]]]]
normalized: EG [[[[[[[p7<=1 & 1<=p7] & [p18<=0 & 0<=p18]] | [p37<=0 & 0<=p37]] & ~ [E [[[[p45<=0 & 0<=p45] | [p138<=1 & 1<=p138]] | [p162<=0 & 0<=p162]] U [[p151<=1 & 1<=p151] | [p92<=0 & 0<=p92]]]]] | [[[[[p167<=1 & 1<=p167] & [p2<=0 & 0<=p2]] | E [true U [p77<=0 & 0<=p77]]] & ~ [E [EG [[p48<=1 & 1<=p48]] U ~ [[p7<=1 & 1<=p7]]]]] & ~ [EX [~ [[p18<=0 & 0<=p18]]]]]] | E [true U ~ [E [~ [E [true U ~ [[[p162<=1 & 1<=p162] | [p145<=0 & 0<=p145]]]]] U [[p85<=1 & 1<=p85] | [p117<=0 & 0<=p117]]]]]]]

abstracting: (0<=p117)
states: 2,773,672 (6)
abstracting: (p117<=0)
states: 2,760,480 (6)
abstracting: (1<=p85)
states: 29,288 (4)
abstracting: (p85<=1)
states: 2,773,672 (6)
abstracting: (0<=p145)
states: 2,773,672 (6)
abstracting: (p145<=0)
states: 123,040 (5)
abstracting: (1<=p162)
states: 7,372 (3)
abstracting: (p162<=1)
states: 2,773,672 (6)
abstracting: (0<=p18)
states: 2,773,672 (6)
abstracting: (p18<=0)
states: 1,060,152 (6)
.abstracting: (1<=p7)
states: 105,824 (5)
abstracting: (p7<=1)
states: 2,773,672 (6)
abstracting: (1<=p48)
states: 105,824 (5)
abstracting: (p48<=1)
states: 2,773,672 (6)
...............................................................................................................................................................................................................
EG iterations: 207
abstracting: (0<=p77)
states: 2,773,672 (6)
abstracting: (p77<=0)
states: 1,915,240 (6)
abstracting: (0<=p2)
states: 2,773,672 (6)
abstracting: (p2<=0)
states: 2,139,780 (6)
abstracting: (1<=p167)
states: 13,968 (4)
abstracting: (p167<=1)
states: 2,773,672 (6)
abstracting: (0<=p92)
states: 2,773,672 (6)
abstracting: (p92<=0)
states: 2,761,808 (6)
abstracting: (1<=p151)
states: 21,280 (4)
abstracting: (p151<=1)
states: 2,773,672 (6)
abstracting: (0<=p162)
states: 2,773,672 (6)
abstracting: (p162<=0)
states: 2,766,300 (6)
abstracting: (1<=p138)
states: 2,128 (3)
abstracting: (p138<=1)
states: 2,773,672 (6)
abstracting: (0<=p45)
states: 2,773,672 (6)
abstracting: (p45<=0)
states: 2,562,024 (6)
abstracting: (0<=p37)
states: 2,773,672 (6)
abstracting: (p37<=0)
states: 634,944 (5)
abstracting: (0<=p18)
states: 2,773,672 (6)
abstracting: (p18<=0)
states: 1,060,152 (6)
abstracting: (1<=p7)
states: 105,824 (5)
abstracting: (p7<=1)
states: 2,773,672 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA ParamProductionCell-PT-0-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.098sec

checking: [E [AF [[~ [AF [[[p38<=0 & 0<=p38] | [p96<=1 & 1<=p96]]]] & [[p127<=1 & 1<=p127] | AG [[p137<=1 & 1<=p137]]]]] U [[~ [[E [[[p10<=0 & 0<=p10] | [p130<=1 & 1<=p130]] U [[p71<=0 & 0<=p71] | [p119<=1 & 1<=p119]]] | EX [[p21<=0 & 0<=p21]]]] | ~ [AG [[[p54<=0 & 0<=p54] | [p105<=1 & 1<=p105]]]]] & [AG [[p41<=1 & 1<=p41]] & EX [AF [[[p35<=0 & 0<=p35] | [p8<=1 & 1<=p8]]]]]]] & ~ [E [~ [[A [[[p28<=0 & 0<=p28] | [p53<=1 & 1<=p53]] U [p102<=1 & 1<=p102]] | ~ [[[p125<=1 & 1<=p125] | [[p134<=0 & 0<=p134] | [p15<=1 & 1<=p15]]]]]] U ~ [AG [AF [[[p35<=0 & 0<=p35] | [p137<=1 & 1<=p137]]]]]]]]
normalized: [~ [E [~ [[~ [[[[p15<=1 & 1<=p15] | [p134<=0 & 0<=p134]] | [p125<=1 & 1<=p125]]] | [~ [EG [~ [[p102<=1 & 1<=p102]]]] & ~ [E [~ [[p102<=1 & 1<=p102]] U [~ [[[p53<=1 & 1<=p53] | [p28<=0 & 0<=p28]]] & ~ [[p102<=1 & 1<=p102]]]]]]]] U E [true U EG [~ [[[p137<=1 & 1<=p137] | [p35<=0 & 0<=p35]]]]]]] & E [~ [EG [~ [[[~ [E [true U ~ [[p137<=1 & 1<=p137]]]] | [p127<=1 & 1<=p127]] & EG [~ [[[p96<=1 & 1<=p96] | [p38<=0 & 0<=p38]]]]]]]] U [[EX [~ [EG [~ [[[p8<=1 & 1<=p8] | [p35<=0 & 0<=p35]]]]]] & ~ [E [true U ~ [[p41<=1 & 1<=p41]]]]] & [E [true U ~ [[[p105<=1 & 1<=p105] | [p54<=0 & 0<=p54]]]] | ~ [[EX [[p21<=0 & 0<=p21]] | E [[[p130<=1 & 1<=p130] | [p10<=0 & 0<=p10]] U [[p119<=1 & 1<=p119] | [p71<=0 & 0<=p71]]]]]]]]]

abstracting: (0<=p71)
states: 2,773,672 (6)
abstracting: (p71<=0)
states: 2,747,216 (6)
abstracting: (1<=p119)
states: 13,464 (4)
abstracting: (p119<=1)
states: 2,773,672 (6)
abstracting: (0<=p10)
states: 2,773,672 (6)
abstracting: (p10<=0)
states: 2,667,848 (6)
abstracting: (1<=p130)
states: 968,448 (5)
abstracting: (p130<=1)
states: 2,773,672 (6)
abstracting: (0<=p21)
states: 2,773,672 (6)
abstracting: (p21<=0)
states: 1,632,680 (6)
.abstracting: (0<=p54)
states: 2,773,672 (6)
abstracting: (p54<=0)
states: 2,512,360 (6)
abstracting: (1<=p105)
states: 29,288 (4)
abstracting: (p105<=1)
states: 2,773,672 (6)
abstracting: (1<=p41)
states: 634,944 (5)
abstracting: (p41<=1)
states: 2,773,672 (6)
abstracting: (0<=p35)
states: 2,773,672 (6)
abstracting: (p35<=0)
states: 1,371,504 (6)
abstracting: (1<=p8)
states: 261,312 (5)
abstracting: (p8<=1)
states: 2,773,672 (6)
.............................................................................................................................
EG iterations: 125
.abstracting: (0<=p38)
states: 2,773,672 (6)
abstracting: (p38<=0)
states: 2,667,848 (6)
abstracting: (1<=p96)
states: 29,488 (4)
abstracting: (p96<=1)
states: 2,773,672 (6)
..........................................................................................................................................................................................
EG iterations: 186
abstracting: (1<=p127)
states: 26,928 (4)
abstracting: (p127<=1)
states: 2,773,672 (6)
abstracting: (1<=p137)
states: 6,608 (3)
abstracting: (p137<=1)
states: 2,773,672 (6)

EG iterations: 0
abstracting: (0<=p35)
states: 2,773,672 (6)
abstracting: (p35<=0)
states: 1,371,504 (6)
abstracting: (1<=p137)
states: 6,608 (3)
abstracting: (p137<=1)
states: 2,773,672 (6)
......................................................................................................................................................................................................................................
EG iterations: 230
abstracting: (1<=p102)
states: 2,559,912 (6)
abstracting: (p102<=1)
states: 2,773,672 (6)
abstracting: (0<=p28)
states: 2,773,672 (6)
abstracting: (p28<=0)
states: 2,539,944 (6)
abstracting: (1<=p53)
states: 1,075,144 (6)
abstracting: (p53<=1)
states: 2,773,672 (6)
abstracting: (1<=p102)
states: 2,559,912 (6)
abstracting: (p102<=1)
states: 2,773,672 (6)
abstracting: (1<=p102)
states: 2,559,912 (6)
abstracting: (p102<=1)
states: 2,773,672 (6)
...............................................................
EG iterations: 63
abstracting: (1<=p125)
states: 26,928 (4)
abstracting: (p125<=1)
states: 2,773,672 (6)
abstracting: (0<=p134)
states: 2,773,672 (6)
abstracting: (p134<=0)
states: 2,763,032 (6)
abstracting: (1<=p15)
states: 572,528 (5)
abstracting: (p15<=1)
states: 2,773,672 (6)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.714sec

totally nodes used: 49858258 (5.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 20767245 122163244 142930489
used/not used/entry size/cache size: 61850119 5258745 16 1024MB
basic ops cache: hits/miss/sum: 1063966 6098832 7162798
used/not used/entry size/cache size: 9430803 7346413 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: 6851 62634 69485
used/not used/entry size/cache size: 62401 8326207 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 33403364
1 21680321
2 8752173
3 2566078
4 581077
5 106795
6 16601
7 2196
8 238
9 18
>= 10 3

Total processing time: 1m13.950sec


BK_STOP 1679039191637

--------------------
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:18341 (106), effective:1281 (7)

initing FirstDep: 0m 0.000sec


iterations count:4035 (23), effective:291 (1)

iterations count:4384 (25), effective:297 (1)

iterations count:3987 (23), effective:259 (1)

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

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

iterations count:6182 (35), effective:421 (2)

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

iterations count:1152 (6), effective:84 (0)

iterations count:6456 (37), effective:449 (2)

iterations count:262 (1), effective:11 (0)

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

iterations count:5321 (30), effective:359 (2)

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

iterations count:1518 (8), effective:99 (0)

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

iterations count:1933 (11), effective:138 (0)

iterations count:3680 (21), effective:263 (1)

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

iterations count:228 (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-0"
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-0, 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-167863540800361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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