fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r266-smll-167863540800378
Last Updated
May 14, 2023

About the Execution of Marcie+red for ParamProductionCell-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9853.283 159458.00 170124.00 1052.60 FFFTFFTFTTTTFTFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.4K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.1K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 17:17 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-2-CTLFireability-00
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-01
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-02
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-03
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-04
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-05
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-06
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-07
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-08
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-09
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-10
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-11
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-12
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-13
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-14
FORMULA_NAME ParamProductionCell-PT-2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679040089598

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 08:01:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 08:01:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 08:01:33] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-03-17 08:01:33] [INFO ] Transformed 231 places.
[2023-03-17 08:01:33] [INFO ] Transformed 202 transitions.
[2023-03-17 08:01:33] [INFO ] Found NUPN structural information;
[2023-03-17 08:01:33] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Support contains 118 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 200
Applied a total of 4 rules in 62 ms. Remains 229 /231 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 229 cols
[2023-03-17 08:01:33] [INFO ] Computed 59 place invariants in 37 ms
[2023-03-17 08:01:34] [INFO ] Implicit Places using invariants in 678 ms returned [15, 18, 19, 24, 31, 35, 36, 42, 65, 119, 120, 167, 168, 194, 195, 204, 220]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 738 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/231 places, 200/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 212 /212 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 809 ms. Remains : 212/231 places, 200/202 transitions.
Support contains 118 out of 212 places after structural reductions.
[2023-03-17 08:01:34] [INFO ] Flatten gal took : 101 ms
[2023-03-17 08:01:34] [INFO ] Flatten gal took : 49 ms
[2023-03-17 08:01:35] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 117 out of 212 places (down from 118) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 739 ms. (steps per millisecond=13 ) properties (out of 78) seen :74
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 200 rows 212 cols
[2023-03-17 08:01:36] [INFO ] Computed 42 place invariants in 6 ms
[2023-03-17 08:01:36] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 08:01:36] [INFO ] [Nat]Absence check using 28 positive place invariants in 12 ms returned sat
[2023-03-17 08:01:36] [INFO ] [Nat]Absence check using 28 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-17 08:01:36] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-17 08:01:36] [INFO ] Flatten gal took : 19 ms
[2023-03-17 08:01:36] [INFO ] Flatten gal took : 18 ms
[2023-03-17 08:01:36] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 107 out of 212 places (down from 111) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 202 transition count 190
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 20 place count 202 transition count 174
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 52 place count 186 transition count 174
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 182 transition count 170
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 182 transition count 170
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 104 place count 160 transition count 148
Applied a total of 104 rules in 107 ms. Remains 160 /212 variables (removed 52) and now considering 148/200 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 107 ms. Remains : 160/212 places, 148/200 transitions.
[2023-03-17 08:01:36] [INFO ] Flatten gal took : 19 ms
[2023-03-17 08:01:36] [INFO ] Flatten gal took : 20 ms
[2023-03-17 08:01:36] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 196
Applied a total of 8 rules in 16 ms. Remains 208 /212 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 208/212 places, 196/200 transitions.
[2023-03-17 08:01:36] [INFO ] Flatten gal took : 23 ms
[2023-03-17 08:01:36] [INFO ] Flatten gal took : 24 ms
[2023-03-17 08:01:36] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 196
Applied a total of 8 rules in 16 ms. Remains 208 /212 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 208/212 places, 196/200 transitions.
[2023-03-17 08:01:36] [INFO ] Flatten gal took : 20 ms
[2023-03-17 08:01:36] [INFO ] Flatten gal took : 20 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 202 transition count 190
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 20 place count 202 transition count 174
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 52 place count 186 transition count 174
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 182 transition count 170
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 182 transition count 170
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 104 place count 160 transition count 148
Applied a total of 104 rules in 44 ms. Remains 160 /212 variables (removed 52) and now considering 148/200 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 160/212 places, 148/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 148 transitions.
Finished random walk after 99 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=49 )
FORMULA ParamProductionCell-PT-2-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 196
Applied a total of 8 rules in 9 ms. Remains 208 /212 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 208/212 places, 196/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 209 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 209 transition count 197
Applied a total of 6 rules in 8 ms. Remains 209 /212 variables (removed 3) and now considering 197/200 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 209/212 places, 197/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 13 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 196
Applied a total of 8 rules in 9 ms. Remains 208 /212 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 208/212 places, 196/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 196
Applied a total of 8 rules in 7 ms. Remains 208 /212 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 208/212 places, 196/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 196
Applied a total of 8 rules in 9 ms. Remains 208 /212 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 208/212 places, 196/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 196
Applied a total of 8 rules in 8 ms. Remains 208 /212 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 208/212 places, 196/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 209 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 209 transition count 197
Applied a total of 6 rules in 7 ms. Remains 209 /212 variables (removed 3) and now considering 197/200 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 209/212 places, 197/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 196
Applied a total of 8 rules in 8 ms. Remains 208 /212 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 208/212 places, 196/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 196
Applied a total of 8 rules in 8 ms. Remains 208 /212 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 208/212 places, 196/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 209 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 209 transition count 197
Applied a total of 6 rules in 8 ms. Remains 209 /212 variables (removed 3) and now considering 197/200 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 209/212 places, 197/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 209 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 209 transition count 197
Applied a total of 6 rules in 7 ms. Remains 209 /212 variables (removed 3) and now considering 197/200 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 209/212 places, 197/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 200/200 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 209 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 209 transition count 197
Applied a total of 6 rules in 6 ms. Remains 209 /212 variables (removed 3) and now considering 197/200 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 209/212 places, 197/200 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:01:37] [INFO ] Input system was already deterministic with 197 transitions.
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 23 ms
[2023-03-17 08:01:37] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:01:37] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-17 08:01:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 212 places, 200 transitions and 786 arcs took 2 ms.
Total runtime 4765 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 212 NrTr: 200 NrArc: 786)

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

net check time: 0m 0.000sec

init dd package: 0m 3.450sec


RS generation: 0m 0.872sec


-> reachability set: #nodes 10778 (1.1e+04) #states 348,510 (5)



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

checking: AF [EG [[[p88<=1 & 1<=p88] & [p162<=1 & 1<=p162]]]]
normalized: ~ [EG [~ [EG [[[p88<=1 & 1<=p88] & [p162<=1 & 1<=p162]]]]]]

abstracting: (1<=p162)
states: 2,852 (3)
abstracting: (p162<=1)
states: 348,510 (5)
abstracting: (1<=p88)
states: 38,472 (4)
abstracting: (p88<=1)
states: 348,510 (5)
.............................................................................
EG iterations: 77

EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.080sec

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

abstracting: (1<=p91)
states: 176
abstracting: (p91<=1)
states: 348,510 (5)
abstracting: (1<=p90)
states: 316,547 (5)
abstracting: (p90<=1)
states: 348,510 (5)
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.333sec

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

abstracting: (0<=p106)
states: 348,510 (5)
abstracting: (p106<=0)
states: 34,518 (4)
abstracting: (0<=p127)
states: 348,510 (5)
abstracting: (p127<=0)
states: 347,102 (5)
........................
EG iterations: 23
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.372sec

checking: EF [[AX [[[p108<=0 & 0<=p108] | [p130<=0 & 0<=p130]]] & AF [EX [[[p95<=1 & 1<=p95] & [p139<=1 & 1<=p139]]]]]]
normalized: E [true U [~ [EG [~ [EX [[[p139<=1 & 1<=p139] & [p95<=1 & 1<=p95]]]]]] & ~ [EX [~ [[[p130<=0 & 0<=p130] | [p108<=0 & 0<=p108]]]]]]]

abstracting: (0<=p108)
states: 348,510 (5)
abstracting: (p108<=0)
states: 331,251 (5)
abstracting: (0<=p130)
states: 348,510 (5)
abstracting: (p130<=0)
states: 347,102 (5)
.abstracting: (1<=p95)
states: 59,066 (4)
abstracting: (p95<=1)
states: 348,510 (5)
abstracting: (1<=p139)
states: 964
abstracting: (p139<=1)
states: 348,510 (5)
..
EG iterations: 1
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.635sec

checking: EX [[AG [[EX [[[p103<=0 & 0<=p103] | [[p108<=0 & 0<=p108] | [p113<=0 & 0<=p113]]]] | EG [[p136<=1 & 1<=p136]]]] | [[p8<=1 & 1<=p8] & [p51<=1 & 1<=p51]]]]
normalized: EX [[~ [E [true U ~ [[EG [[p136<=1 & 1<=p136]] | EX [[[[p113<=0 & 0<=p113] | [p108<=0 & 0<=p108]] | [p103<=0 & 0<=p103]]]]]]] | [[p51<=1 & 1<=p51] & [p8<=1 & 1<=p8]]]]

abstracting: (1<=p8)
states: 10,946 (4)
abstracting: (p8<=1)
states: 348,510 (5)
abstracting: (1<=p51)
states: 181,599 (5)
abstracting: (p51<=1)
states: 348,510 (5)
abstracting: (0<=p103)
states: 348,510 (5)
abstracting: (p103<=0)
states: 326,785 (5)
abstracting: (0<=p108)
states: 348,510 (5)
abstracting: (p108<=0)
states: 331,251 (5)
abstracting: (0<=p113)
states: 348,510 (5)
abstracting: (p113<=0)
states: 339,820 (5)
.abstracting: (1<=p136)
states: 10,510 (4)
abstracting: (p136<=1)
states: 348,510 (5)
...................................................................................
EG iterations: 83
.-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.598sec

checking: EF [[AG [EX [[[[p203<=0 & 0<=p203] | [p37<=0 & 0<=p37]] | [[p38<=0 & 0<=p38] | [p43<=0 & 0<=p43]]]]] | [[p14<=1 & 1<=p14] & [p79<=1 & 1<=p79]]]]
normalized: E [true U [~ [E [true U ~ [EX [[[[p43<=0 & 0<=p43] | [p38<=0 & 0<=p38]] | [[p37<=0 & 0<=p37] | [p203<=0 & 0<=p203]]]]]]] | [[p79<=1 & 1<=p79] & [p14<=1 & 1<=p14]]]]

abstracting: (1<=p14)
states: 110,160 (5)
abstracting: (p14<=1)
states: 348,510 (5)
abstracting: (1<=p79)
states: 4,256 (3)
abstracting: (p79<=1)
states: 348,510 (5)
abstracting: (0<=p203)
states: 348,510 (5)
abstracting: (p203<=0)
states: 337,706 (5)
abstracting: (0<=p37)
states: 348,510 (5)
abstracting: (p37<=0)
states: 133,656 (5)
abstracting: (0<=p38)
states: 348,510 (5)
abstracting: (p38<=0)
states: 260,256 (5)
abstracting: (0<=p43)
states: 348,510 (5)
abstracting: (p43<=0)
states: 294,474 (5)
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: AF [[EX [AG [[[p181<=1 & 1<=p181] & [p211<=1 & 1<=p211]]]] | AG [[AG [[[p36<=0 & 0<=p36] | [p43<=0 & 0<=p43]]] & [[p150<=1 & 1<=p150] & [p178<=1 & 1<=p178]]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[[[p178<=1 & 1<=p178] & [p150<=1 & 1<=p150]] & ~ [E [true U ~ [[[p43<=0 & 0<=p43] | [p36<=0 & 0<=p36]]]]]]]]] | EX [~ [E [true U ~ [[[p211<=1 & 1<=p211] & [p181<=1 & 1<=p181]]]]]]]]]]

abstracting: (1<=p181)
states: 261,180 (5)
abstracting: (p181<=1)
states: 348,510 (5)
abstracting: (1<=p211)
states: 21,608 (4)
abstracting: (p211<=1)
states: 348,510 (5)
.abstracting: (0<=p36)
states: 348,510 (5)
abstracting: (p36<=0)
states: 214,854 (5)
abstracting: (0<=p43)
states: 348,510 (5)
abstracting: (p43<=0)
states: 294,474 (5)
abstracting: (1<=p150)
states: 336,800 (5)
abstracting: (p150<=1)
states: 348,510 (5)
abstracting: (1<=p178)
states: 2,852 (3)
abstracting: (p178<=1)
states: 348,510 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.482sec

checking: AG [EX [EF [[A [[[p89<=1 & 1<=p89] & [p97<=1 & 1<=p97]] U [[p90<=1 & 1<=p90] & [p117<=1 & 1<=p117]]] | [[p87<=1 & 1<=p87] & [p98<=1 & 1<=p98]]]]]]
normalized: ~ [E [true U ~ [EX [E [true U [[[p98<=1 & 1<=p98] & [p87<=1 & 1<=p87]] | [~ [EG [~ [[[p117<=1 & 1<=p117] & [p90<=1 & 1<=p90]]]]] & ~ [E [~ [[[p117<=1 & 1<=p117] & [p90<=1 & 1<=p90]]] U [~ [[[p97<=1 & 1<=p97] & [p89<=1 & 1<=p89]]] & ~ [[[p117<=1 & 1<=p117] & [p90<=1 & 1<=p90]]]]]]]]]]]]]

abstracting: (1<=p90)
states: 316,547 (5)
abstracting: (p90<=1)
states: 348,510 (5)
abstracting: (1<=p117)
states: 44
abstracting: (p117<=1)
states: 348,510 (5)
abstracting: (1<=p89)
states: 17,313 (4)
abstracting: (p89<=1)
states: 348,510 (5)
abstracting: (1<=p97)
states: 176
abstracting: (p97<=1)
states: 348,510 (5)
abstracting: (1<=p90)
states: 316,547 (5)
abstracting: (p90<=1)
states: 348,510 (5)
abstracting: (1<=p117)
states: 44
abstracting: (p117<=1)
states: 348,510 (5)
abstracting: (1<=p90)
states: 316,547 (5)
abstracting: (p90<=1)
states: 348,510 (5)
abstracting: (1<=p117)
states: 44
abstracting: (p117<=1)
states: 348,510 (5)
..........................................
EG iterations: 42
abstracting: (1<=p87)
states: 196,176 (5)
abstracting: (p87<=1)
states: 348,510 (5)
abstracting: (1<=p98)
states: 352
abstracting: (p98<=1)
states: 348,510 (5)
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.037sec

checking: A [[AF [[p86<=1 & 1<=p86]] | ~ [[[p96<=1 & 1<=p96] & [p121<=1 & 1<=p121]]]] U [AX [[[p108<=1 & 1<=p108] & [p112<=1 & 1<=p112]]] & EX [E [EF [[[p150<=1 & 1<=p150] & [p159<=1 & 1<=p159]]] U AX [[[p92<=1 & 1<=p92] & [p99<=1 & 1<=p99]]]]]]]
normalized: [~ [EG [~ [[~ [EX [~ [[[p112<=1 & 1<=p112] & [p108<=1 & 1<=p108]]]]] & EX [E [E [true U [[p150<=1 & 1<=p150] & [p159<=1 & 1<=p159]]] U ~ [EX [~ [[[p92<=1 & 1<=p92] & [p99<=1 & 1<=p99]]]]]]]]]]] & ~ [E [~ [[~ [EX [~ [[[p112<=1 & 1<=p112] & [p108<=1 & 1<=p108]]]]] & EX [E [E [true U [[p150<=1 & 1<=p150] & [p159<=1 & 1<=p159]]] U ~ [EX [~ [[[p92<=1 & 1<=p92] & [p99<=1 & 1<=p99]]]]]]]]] U [~ [[~ [EX [~ [[[p112<=1 & 1<=p112] & [p108<=1 & 1<=p108]]]]] & EX [E [E [true U [[p150<=1 & 1<=p150] & [p159<=1 & 1<=p159]]] U ~ [EX [~ [[[p92<=1 & 1<=p92] & [p99<=1 & 1<=p99]]]]]]]]] & ~ [[~ [[[p96<=1 & 1<=p96] & [p121<=1 & 1<=p121]]] | ~ [EG [~ [[p86<=1 & 1<=p86]]]]]]]]]]

abstracting: (1<=p86)
states: 4,345 (3)
abstracting: (p86<=1)
states: 348,510 (5)
...............................................................................................................................................................................................................................................................................................
EG iterations: 287
abstracting: (1<=p121)
states: 88
abstracting: (p121<=1)
states: 348,510 (5)
abstracting: (1<=p96)
states: 54,796 (4)
abstracting: (p96<=1)
states: 348,510 (5)
abstracting: (1<=p99)
states: 242
abstracting: (p99<=1)
states: 348,510 (5)
abstracting: (1<=p92)
states: 14,650 (4)
abstracting: (p92<=1)
states: 348,510 (5)
.abstracting: (1<=p159)
states: 1,832 (3)
abstracting: (p159<=1)
states: 348,510 (5)
abstracting: (1<=p150)
states: 336,800 (5)
abstracting: (p150<=1)
states: 348,510 (5)
.abstracting: (1<=p108)
states: 17,259 (4)
abstracting: (p108<=1)
states: 348,510 (5)
abstracting: (1<=p112)
states: 4,345 (3)
abstracting: (p112<=1)
states: 348,510 (5)
.abstracting: (1<=p99)
states: 242
abstracting: (p99<=1)
states: 348,510 (5)
abstracting: (1<=p92)
states: 14,650 (4)
abstracting: (p92<=1)
states: 348,510 (5)
.abstracting: (1<=p159)
states: 1,832 (3)
abstracting: (p159<=1)
states: 348,510 (5)
abstracting: (1<=p150)
states: 336,800 (5)
abstracting: (p150<=1)
states: 348,510 (5)
.abstracting: (1<=p108)
states: 17,259 (4)
abstracting: (p108<=1)
states: 348,510 (5)
abstracting: (1<=p112)
states: 4,345 (3)
abstracting: (p112<=1)
states: 348,510 (5)
.abstracting: (1<=p99)
states: 242
abstracting: (p99<=1)
states: 348,510 (5)
abstracting: (1<=p92)
states: 14,650 (4)
abstracting: (p92<=1)
states: 348,510 (5)
.abstracting: (1<=p159)
states: 1,832 (3)
abstracting: (p159<=1)
states: 348,510 (5)
abstracting: (1<=p150)
states: 336,800 (5)
abstracting: (p150<=1)
states: 348,510 (5)
.abstracting: (1<=p108)
states: 17,259 (4)
abstracting: (p108<=1)
states: 348,510 (5)
abstracting: (1<=p112)
states: 4,345 (3)
abstracting: (p112<=1)
states: 348,510 (5)
..................
EG iterations: 17
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.197sec

checking: AG [E [EX [~ [[A [[[p92<=1 & 1<=p92] & [p170<=1 & 1<=p170]] U [p53<=1 & 1<=p53]] | AF [[[p90<=1 & 1<=p90] & [p91<=1 & 1<=p91]]]]]] U [~ [E [[[p104<=1 & 1<=p104] & [[p105<=1 & 1<=p105] & [p129<=1 & 1<=p129]]] U EG [[[p39<=1 & 1<=p39] & [p46<=1 & 1<=p46]]]]] & [[p89<=1 & 1<=p89] & [p166<=1 & 1<=p166]]]]]
normalized: ~ [E [true U ~ [E [EX [~ [[~ [EG [~ [[[p91<=1 & 1<=p91] & [p90<=1 & 1<=p90]]]]] | [~ [EG [~ [[p53<=1 & 1<=p53]]]] & ~ [E [~ [[p53<=1 & 1<=p53]] U [~ [[[p170<=1 & 1<=p170] & [p92<=1 & 1<=p92]]] & ~ [[p53<=1 & 1<=p53]]]]]]]]] U [~ [E [[[p104<=1 & 1<=p104] & [[p129<=1 & 1<=p129] & [p105<=1 & 1<=p105]]] U EG [[[p46<=1 & 1<=p46] & [p39<=1 & 1<=p39]]]]] & [[p166<=1 & 1<=p166] & [p89<=1 & 1<=p89]]]]]]]

abstracting: (1<=p89)
states: 17,313 (4)
abstracting: (p89<=1)
states: 348,510 (5)
abstracting: (1<=p166)
states: 1,426 (3)
abstracting: (p166<=1)
states: 348,510 (5)
abstracting: (1<=p39)
states: 260,256 (5)
abstracting: (p39<=1)
states: 348,510 (5)
abstracting: (1<=p46)
states: 2,400 (3)
abstracting: (p46<=1)
states: 348,510 (5)
............................................................................................................................
EG iterations: 124
abstracting: (1<=p105)
states: 17,259 (4)
abstracting: (p105<=1)
states: 348,510 (5)
abstracting: (1<=p129)
states: 2,816 (3)
abstracting: (p129<=1)
states: 348,510 (5)
abstracting: (1<=p104)
states: 319,745 (5)
abstracting: (p104<=1)
states: 348,510 (5)
abstracting: (1<=p53)
states: 99,031 (4)
abstracting: (p53<=1)
states: 348,510 (5)
abstracting: (1<=p92)
states: 14,650 (4)
abstracting: (p92<=1)
states: 348,510 (5)
abstracting: (1<=p170)
states: 1,360 (3)
abstracting: (p170<=1)
states: 348,510 (5)
abstracting: (1<=p53)
states: 99,031 (4)
abstracting: (p53<=1)
states: 348,510 (5)
abstracting: (1<=p53)
states: 99,031 (4)
abstracting: (p53<=1)
states: 348,510 (5)
.........................................................................................................................................................................................................................................................................................................
EG iterations: 297
abstracting: (1<=p90)
states: 316,547 (5)
abstracting: (p90<=1)
states: 348,510 (5)
abstracting: (1<=p91)
states: 176
abstracting: (p91<=1)
states: 348,510 (5)
....................
EG iterations: 20
.-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.642sec

checking: AF [EG [[E [EX [[[p33<=1 & 1<=p33] & [p50<=1 & 1<=p50]]] U [[AX [[[p150<=1 & 1<=p150] & [[p151<=1 & 1<=p151] & [p176<=1 & 1<=p176]]]] & [[p88<=1 & 1<=p88] & [p89<=1 & 1<=p89]]] & [[p167<=1 & 1<=p167] & [[p182<=1 & 1<=p182] & [p199<=1 & 1<=p199]]]]] | [EX [[[p96<=0 & 0<=p96] | [p162<=0 & 0<=p162]]] & [[p183<=0 & 0<=p183] | [p210<=0 & 0<=p210]]]]]]
normalized: ~ [EG [~ [EG [[[EX [[[p162<=0 & 0<=p162] | [p96<=0 & 0<=p96]]] & [[p210<=0 & 0<=p210] | [p183<=0 & 0<=p183]]] | E [EX [[[p50<=1 & 1<=p50] & [p33<=1 & 1<=p33]]] U [[[[p199<=1 & 1<=p199] & [p182<=1 & 1<=p182]] & [p167<=1 & 1<=p167]] & [[[p89<=1 & 1<=p89] & [p88<=1 & 1<=p88]] & ~ [EX [~ [[[[p176<=1 & 1<=p176] & [p151<=1 & 1<=p151]] & [p150<=1 & 1<=p150]]]]]]]]]]]]]

abstracting: (1<=p150)
states: 336,800 (5)
abstracting: (p150<=1)
states: 348,510 (5)
abstracting: (1<=p151)
states: 7,026 (3)
abstracting: (p151<=1)
states: 348,510 (5)
abstracting: (1<=p176)
states: 2,852 (3)
abstracting: (p176<=1)
states: 348,510 (5)
.abstracting: (1<=p88)
states: 38,472 (4)
abstracting: (p88<=1)
states: 348,510 (5)
abstracting: (1<=p89)
states: 17,313 (4)
abstracting: (p89<=1)
states: 348,510 (5)
abstracting: (1<=p167)
states: 2,852 (3)
abstracting: (p167<=1)
states: 348,510 (5)
abstracting: (1<=p182)
states: 33,310 (4)
abstracting: (p182<=1)
states: 348,510 (5)
abstracting: (1<=p199)
states: 13,324 (4)
abstracting: (p199<=1)
states: 348,510 (5)
abstracting: (1<=p33)
states: 116,382 (5)
abstracting: (p33<=1)
states: 348,510 (5)
abstracting: (1<=p50)
states: 4,800 (3)
abstracting: (p50<=1)
states: 348,510 (5)
.abstracting: (0<=p183)
states: 348,510 (5)
abstracting: (p183<=0)
states: 296,112 (5)
abstracting: (0<=p210)
states: 348,510 (5)
abstracting: (p210<=0)
states: 337,706 (5)
abstracting: (0<=p96)
states: 348,510 (5)
abstracting: (p96<=0)
states: 293,714 (5)
abstracting: (0<=p162)
states: 348,510 (5)
abstracting: (p162<=0)
states: 345,658 (5)
..............................................................................................................................................................................................................................................................................................................
EG iterations: 301

EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.698sec

checking: [AG [AX [[[[p90<=0 & 0<=p90] | [p91<=0 & 0<=p91]] & [[p95<=0 & 0<=p95] | [p139<=0 & 0<=p139]]]]] | [A [~ [A [AX [[[p34<=1 & 1<=p34] & [p49<=1 & 1<=p49]]] U [[p38<=1 & 1<=p38] & [p42<=1 & 1<=p42]]]] U [AG [~ [[[p87<=1 & 1<=p87] & [p139<=1 & 1<=p139]]]] & EF [AX [[[p92<=1 & 1<=p92] & [p120<=1 & 1<=p120]]]]]] | EX [[[p88<=1 & 1<=p88] & [p145<=1 & 1<=p145]]]]]
normalized: [~ [E [true U EX [~ [[[[p90<=0 & 0<=p90] | [p91<=0 & 0<=p91]] & [[p139<=0 & 0<=p139] | [p95<=0 & 0<=p95]]]]]]] | [EX [[[p88<=1 & 1<=p88] & [p145<=1 & 1<=p145]]] | [~ [EG [~ [[~ [E [true U [[p139<=1 & 1<=p139] & [p87<=1 & 1<=p87]]]] & E [true U ~ [EX [~ [[[p120<=1 & 1<=p120] & [p92<=1 & 1<=p92]]]]]]]]]] & ~ [E [~ [[~ [E [true U [[p139<=1 & 1<=p139] & [p87<=1 & 1<=p87]]]] & E [true U ~ [EX [~ [[[p120<=1 & 1<=p120] & [p92<=1 & 1<=p92]]]]]]]] U [~ [[~ [E [true U [[p139<=1 & 1<=p139] & [p87<=1 & 1<=p87]]]] & E [true U ~ [EX [~ [[[p120<=1 & 1<=p120] & [p92<=1 & 1<=p92]]]]]]]] & [~ [EG [~ [[[p42<=1 & 1<=p42] & [p38<=1 & 1<=p38]]]]] & ~ [E [~ [[[p42<=1 & 1<=p42] & [p38<=1 & 1<=p38]]] U [EX [~ [[[p34<=1 & 1<=p34] & [p49<=1 & 1<=p49]]]] & ~ [[[p42<=1 & 1<=p42] & [p38<=1 & 1<=p38]]]]]]]]]]]]]

abstracting: (1<=p38)
states: 88,254 (4)
abstracting: (p38<=1)
states: 348,510 (5)
abstracting: (1<=p42)
states: 27,018 (4)
abstracting: (p42<=1)
states: 348,510 (5)
abstracting: (1<=p49)
states: 2,400 (3)
abstracting: (p49<=1)
states: 348,510 (5)
abstracting: (1<=p34)
states: 88,254 (4)
abstracting: (p34<=1)
states: 348,510 (5)
.abstracting: (1<=p38)
states: 88,254 (4)
abstracting: (p38<=1)
states: 348,510 (5)
abstracting: (1<=p42)
states: 27,018 (4)
abstracting: (p42<=1)
states: 348,510 (5)
abstracting: (1<=p38)
states: 88,254 (4)
abstracting: (p38<=1)
states: 348,510 (5)
abstracting: (1<=p42)
states: 27,018 (4)
abstracting: (p42<=1)
states: 348,510 (5)
.....................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 357
abstracting: (1<=p92)
states: 14,650 (4)
abstracting: (p92<=1)
states: 348,510 (5)
abstracting: (1<=p120)
states: 44
abstracting: (p120<=1)
states: 348,510 (5)
.abstracting: (1<=p87)
states: 196,176 (5)
abstracting: (p87<=1)
states: 348,510 (5)
abstracting: (1<=p139)
states: 964
abstracting: (p139<=1)
states: 348,510 (5)
abstracting: (1<=p92)
states: 14,650 (4)
abstracting: (p92<=1)
states: 348,510 (5)
abstracting: (1<=p120)
states: 44
abstracting: (p120<=1)
states: 348,510 (5)
.abstracting: (1<=p87)
states: 196,176 (5)
abstracting: (p87<=1)
states: 348,510 (5)
abstracting: (1<=p139)
states: 964
abstracting: (p139<=1)
states: 348,510 (5)
abstracting: (1<=p92)
states: 14,650 (4)
abstracting: (p92<=1)
states: 348,510 (5)
abstracting: (1<=p120)
states: 44
abstracting: (p120<=1)
states: 348,510 (5)
.abstracting: (1<=p87)
states: 196,176 (5)
abstracting: (p87<=1)
states: 348,510 (5)
abstracting: (1<=p139)
states: 964
abstracting: (p139<=1)
states: 348,510 (5)

EG iterations: 0
abstracting: (1<=p145)
states: 96
abstracting: (p145<=1)
states: 348,510 (5)
abstracting: (1<=p88)
states: 38,472 (4)
abstracting: (p88<=1)
states: 348,510 (5)
.abstracting: (0<=p95)
states: 348,510 (5)
abstracting: (p95<=0)
states: 289,444 (5)
abstracting: (0<=p139)
states: 348,510 (5)
abstracting: (p139<=0)
states: 347,546 (5)
abstracting: (0<=p91)
states: 348,510 (5)
abstracting: (p91<=0)
states: 348,334 (5)
abstracting: (0<=p90)
states: 348,510 (5)
abstracting: (p90<=0)
states: 31,963 (4)
.-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.568sec

checking: [EG [EF [EX [A [[[p69<=1 & 1<=p69] & [p74<=1 & 1<=p74]] U [[p3<=1 & 1<=p3] & [p64<=1 & 1<=p64]]]]]] & AF [[~ [A [[[AF [[[p172<=1 & 1<=p172] & [p176<=1 & 1<=p176]]] & [p17<=1 & 1<=p17]] & [[p25<=1 & 1<=p25] & [[p34<=1 & 1<=p34] & [p40<=1 & 1<=p40]]]] U [[p73<=1 & 1<=p73] | AF [[[p56<=1 & 1<=p56] & [p60<=1 & 1<=p60]]]]]] & EF [[[p104<=1 & 1<=p104] & [[p105<=1 & 1<=p105] & [p129<=1 & 1<=p129]]]]]]]
normalized: [EG [E [true U EX [[~ [EG [~ [[[p64<=1 & 1<=p64] & [p3<=1 & 1<=p3]]]]] & ~ [E [~ [[[p64<=1 & 1<=p64] & [p3<=1 & 1<=p3]]] U [~ [[[p74<=1 & 1<=p74] & [p69<=1 & 1<=p69]]] & ~ [[[p64<=1 & 1<=p64] & [p3<=1 & 1<=p3]]]]]]]]]] & ~ [EG [~ [[~ [[~ [EG [~ [[[p73<=1 & 1<=p73] | ~ [EG [~ [[[p60<=1 & 1<=p60] & [p56<=1 & 1<=p56]]]]]]]]] & ~ [E [~ [[[p73<=1 & 1<=p73] | ~ [EG [~ [[[p60<=1 & 1<=p60] & [p56<=1 & 1<=p56]]]]]]] U [~ [[[p73<=1 & 1<=p73] | ~ [EG [~ [[[p60<=1 & 1<=p60] & [p56<=1 & 1<=p56]]]]]]] & ~ [[[[p17<=1 & 1<=p17] & ~ [EG [~ [[[p176<=1 & 1<=p176] & [p172<=1 & 1<=p172]]]]]] & [[[p34<=1 & 1<=p34] & [p40<=1 & 1<=p40]] & [p25<=1 & 1<=p25]]]]]]]]] & E [true U [[p104<=1 & 1<=p104] & [[p105<=1 & 1<=p105] & [p129<=1 & 1<=p129]]]]]]]]]

abstracting: (1<=p129)
states: 2,816 (3)
abstracting: (p129<=1)
states: 348,510 (5)
abstracting: (1<=p105)
states: 17,259 (4)
abstracting: (p105<=1)
states: 348,510 (5)
abstracting: (1<=p104)
states: 319,745 (5)
abstracting: (p104<=1)
states: 348,510 (5)
abstracting: (1<=p25)
states: 12,164 (4)
abstracting: (p25<=1)
states: 348,510 (5)
abstracting: (1<=p40)
states: 27,018 (4)
abstracting: (p40<=1)
states: 348,510 (5)
abstracting: (1<=p34)
states: 88,254 (4)
abstracting: (p34<=1)
states: 348,510 (5)
abstracting: (1<=p172)
states: 7,130 (3)
abstracting: (p172<=1)
states: 348,510 (5)
abstracting: (1<=p176)
states: 2,852 (3)
abstracting: (p176<=1)
states: 348,510 (5)
................................................................................................................................................................................................................................................................
EG iterations: 256
abstracting: (1<=p17)
states: 24,328 (4)
abstracting: (p17<=1)
states: 348,510 (5)
abstracting: (1<=p56)
states: 37,956 (4)
abstracting: (p56<=1)
states: 348,510 (5)
abstracting: (1<=p60)
states: 6,326 (3)
abstracting: (p60<=1)
states: 348,510 (5)
.........................................................................................................................................................................................................................................................................................................
EG iterations: 297
abstracting: (1<=p73)
states: 976
abstracting: (p73<=1)
states: 348,510 (5)
abstracting: (1<=p56)
states: 37,956 (4)
abstracting: (p56<=1)
states: 348,510 (5)
abstracting: (1<=p60)
states: 6,326 (3)
abstracting: (p60<=1)
states: 348,510 (5)
.........................................................................................................................................................................................................................................................................................................
EG iterations: 297
abstracting: (1<=p73)
states: 976
abstracting: (p73<=1)
states: 348,510 (5)
abstracting: (1<=p56)
states: 37,956 (4)
abstracting: (p56<=1)
states: 348,510 (5)
abstracting: (1<=p60)
states: 6,326 (3)
abstracting: (p60<=1)
states: 348,510 (5)
.........................................................................................................................................................................................................................................................................................................
EG iterations: 297
abstracting: (1<=p73)
states: 976
abstracting: (p73<=1)
states: 348,510 (5)
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p3)
states: 11,282 (4)
abstracting: (p3<=1)
states: 348,510 (5)
abstracting: (1<=p64)
states: 216,497 (5)
abstracting: (p64<=1)
states: 348,510 (5)
abstracting: (1<=p69)
states: 5,856 (3)
abstracting: (p69<=1)
states: 348,510 (5)
abstracting: (1<=p74)
states: 976
abstracting: (p74<=1)
states: 348,510 (5)
abstracting: (1<=p3)
states: 11,282 (4)
abstracting: (p3<=1)
states: 348,510 (5)
abstracting: (1<=p64)
states: 216,497 (5)
abstracting: (p64<=1)
states: 348,510 (5)
abstracting: (1<=p3)
states: 11,282 (4)
abstracting: (p3<=1)
states: 348,510 (5)
abstracting: (1<=p64)
states: 216,497 (5)
abstracting: (p64<=1)
states: 348,510 (5)
..................................................................................................................................................................................................................................................................................................
EG iterations: 290
.
EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.348sec

checking: AX [E [[~ [E [EG [[[p200<=1 & 1<=p200] & [p207<=1 & 1<=p207]]] U AF [[[p92<=1 & 1<=p92] & [p147<=1 & 1<=p147]]]]] | AF [[E [[[p90<=1 & 1<=p90] & [p164<=1 & 1<=p164]] U [p30<=1 & 1<=p30]] & AX [[[p88<=1 & 1<=p88] & [p145<=1 & 1<=p145]]]]]] U AF [[[EF [[[p90<=1 & 1<=p90] & [p94<=1 & 1<=p94]]] & ~ [[[[p92<=1 & 1<=p92] & [p170<=1 & 1<=p170]] | [[p90<=1 & 1<=p90] & [p119<=1 & 1<=p119]]]]] & [[p8<=1 & 1<=p8] & [p51<=1 & 1<=p51]]]]]]
normalized: ~ [EX [~ [E [[~ [E [EG [[[p207<=1 & 1<=p207] & [p200<=1 & 1<=p200]]] U ~ [EG [~ [[[p147<=1 & 1<=p147] & [p92<=1 & 1<=p92]]]]]]] | ~ [EG [~ [[E [[[p164<=1 & 1<=p164] & [p90<=1 & 1<=p90]] U [p30<=1 & 1<=p30]] & ~ [EX [~ [[[p145<=1 & 1<=p145] & [p88<=1 & 1<=p88]]]]]]]]]] U ~ [EG [~ [[[E [true U [[p94<=1 & 1<=p94] & [p90<=1 & 1<=p90]]] & ~ [[[[p170<=1 & 1<=p170] & [p92<=1 & 1<=p92]] | [[p119<=1 & 1<=p119] & [p90<=1 & 1<=p90]]]]] & [[p51<=1 & 1<=p51] & [p8<=1 & 1<=p8]]]]]]]]]]

abstracting: (1<=p8)
states: 10,946 (4)
abstracting: (p8<=1)
states: 348,510 (5)
abstracting: (1<=p51)
states: 181,599 (5)
abstracting: (p51<=1)
states: 348,510 (5)
abstracting: (1<=p90)
states: 316,547 (5)
abstracting: (p90<=1)
states: 348,510 (5)
abstracting: (1<=p119)
states: 1,364 (3)
abstracting: (p119<=1)
states: 348,510 (5)
abstracting: (1<=p92)
states: 14,650 (4)
abstracting: (p92<=1)
states: 348,510 (5)
abstracting: (1<=p170)
states: 1,360 (3)
abstracting: (p170<=1)
states: 348,510 (5)
abstracting: (1<=p90)
states: 316,547 (5)
abstracting: (p90<=1)
states: 348,510 (5)
abstracting: (1<=p94)
states: 4,103 (3)
abstracting: (p94<=1)
states: 348,510 (5)
...............................................................................................................................................................................................................................................................................................
EG iterations: 287
abstracting: (1<=p88)
states: 38,472 (4)
abstracting: (p88<=1)
states: 348,510 (5)
abstracting: (1<=p145)
states: 96
abstracting: (p145<=1)
states: 348,510 (5)
.abstracting: (1<=p30)
states: 27,018 (4)
abstracting: (p30<=1)
states: 348,510 (5)
abstracting: (1<=p90)
states: 316,547 (5)
abstracting: (p90<=1)
states: 348,510 (5)
abstracting: (1<=p164)
states: 66
abstracting: (p164<=1)
states: 348,510 (5)

EG iterations: 0
abstracting: (1<=p92)
states: 14,650 (4)
abstracting: (p92<=1)
states: 348,510 (5)
abstracting: (1<=p147)
states: 874
abstracting: (p147<=1)
states: 348,510 (5)
.......................................................................................................................................
EG iterations: 135
abstracting: (1<=p200)
states: 54,020 (4)
abstracting: (p200<=1)
states: 348,510 (5)
abstracting: (1<=p207)
states: 21,608 (4)
abstracting: (p207<=1)
states: 348,510 (5)
.............................................................................................................................................
EG iterations: 141
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.118sec

checking: [EX [[AG [[AF [[[p90<=1 & 1<=p90] & [p165<=1 & 1<=p165]]] | AF [[p116<=1 & 1<=p116]]]] | [[~ [E [[[p151<=1 & 1<=p151] & [p175<=1 & 1<=p175]] U [[p184<=1 & 1<=p184] & [p205<=1 & 1<=p205]]]] & [AG [[[p108<=0 & 0<=p108] | [[p125<=0 & 0<=p125] | [0<=p131 & p131<=0]]]] & [~ [E [[[p89<=1 & 1<=p89] & [p166<=1 & 1<=p166]] U [[p96<=1 & 1<=p96] & [p124<=1 & 1<=p124]]]] | [[p96<=1 & 1<=p96] & [p124<=1 & 1<=p124]]]]] & [[p154<=1 & 1<=p154] & [[p172<=1 & 1<=p172] & [p178<=1 & 1<=p178]]]]]] | [E [[[[p87<=1 & 1<=p87] & [p100<=1 & 1<=p100]] | [EG [EX [[[p108<=1 & 1<=p108] & [p112<=1 & 1<=p112]]]] & [AF [[[p13<=1 & 1<=p13] & [p78<=1 & 1<=p78]]] | [[EX [[p140<=1 & 1<=p140]] & [p14<=1 & 1<=p14]] & [[p137<=1 & 1<=p137] & [[p70<=1 & 1<=p70] & [p71<=1 & 1<=p71]]]]]]] U A [[[p193<=1 & 1<=p193] & [p206<=1 & 1<=p206]] U AF [EG [[[p9<=1 & 1<=p9] & [p80<=1 & 1<=p80]]]]]] | [AF [[[p108<=1 & 1<=p108] & [p112<=1 & 1<=p112]]] & AX [E [A [[[p12<=1 & 1<=p12] & [p15<=1 & 1<=p15]] U [[p21<=1 & 1<=p21] & [p29<=1 & 1<=p29]]] U [[[[p55<=1 & 1<=p55] & [[p56<=1 & 1<=p56] & [p61<=1 & 1<=p61]]] & [[p32<=1 & 1<=p32] & [[p34<=1 & 1<=p34] & [p50<=1 & 1<=p50]]]] | [[p73<=1 & 1<=p73] & [[p187<=1 & 1<=p187] & [p197<=1 & 1<=p197]]]]]]]]]
normalized: [[[~ [EX [~ [E [[~ [EG [~ [[[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]]]]] & ~ [E [~ [[[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]]] U [~ [[[p15<=1 & 1<=p15] & [p12<=1 & 1<=p12]]] & ~ [[[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]]]]]]] U [[[[p197<=1 & 1<=p197] & [p187<=1 & 1<=p187]] & [p73<=1 & 1<=p73]] | [[[[p50<=1 & 1<=p50] & [p34<=1 & 1<=p34]] & [p32<=1 & 1<=p32]] & [[[p61<=1 & 1<=p61] & [p56<=1 & 1<=p56]] & [p55<=1 & 1<=p55]]]]]]]] & ~ [EG [~ [[[p112<=1 & 1<=p112] & [p108<=1 & 1<=p108]]]]]] | E [[[[[[[[p71<=1 & 1<=p71] & [p70<=1 & 1<=p70]] & [p137<=1 & 1<=p137]] & [[p14<=1 & 1<=p14] & EX [[p140<=1 & 1<=p140]]]] | ~ [EG [~ [[[p78<=1 & 1<=p78] & [p13<=1 & 1<=p13]]]]]] & EG [EX [[[p112<=1 & 1<=p112] & [p108<=1 & 1<=p108]]]]] | [[p100<=1 & 1<=p100] & [p87<=1 & 1<=p87]]] U [~ [EG [EG [~ [EG [[[p80<=1 & 1<=p80] & [p9<=1 & 1<=p9]]]]]]] & ~ [E [EG [~ [EG [[[p80<=1 & 1<=p80] & [p9<=1 & 1<=p9]]]]] U [~ [[[p206<=1 & 1<=p206] & [p193<=1 & 1<=p193]]] & EG [~ [EG [[[p80<=1 & 1<=p80] & [p9<=1 & 1<=p9]]]]]]]]]]] | EX [[[[[[p178<=1 & 1<=p178] & [p172<=1 & 1<=p172]] & [p154<=1 & 1<=p154]] & [[[[[p124<=1 & 1<=p124] & [p96<=1 & 1<=p96]] | ~ [E [[[p166<=1 & 1<=p166] & [p89<=1 & 1<=p89]] U [[p124<=1 & 1<=p124] & [p96<=1 & 1<=p96]]]]] & ~ [E [true U ~ [[[[0<=p131 & p131<=0] | [p125<=0 & 0<=p125]] | [p108<=0 & 0<=p108]]]]]] & ~ [E [[[p175<=1 & 1<=p175] & [p151<=1 & 1<=p151]] U [[p205<=1 & 1<=p205] & [p184<=1 & 1<=p184]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[p116<=1 & 1<=p116]]]] | ~ [EG [~ [[[p165<=1 & 1<=p165] & [p90<=1 & 1<=p90]]]]]]]]]]]]

abstracting: (1<=p90)
states: 316,547 (5)
abstracting: (p90<=1)
states: 348,510 (5)
abstracting: (1<=p165)
states: 1,360 (3)
abstracting: (p165<=1)
states: 348,510 (5)
.....................................................................................................
EG iterations: 101
abstracting: (1<=p116)
states: 1,408 (3)
abstracting: (p116<=1)
states: 348,510 (5)
...........................................
before gc: list nodes free: 83675

after gc: idd nodes used:116513, unused:63883487; list nodes free:282602649
..............................................................................................................................................................................................................................
EG iterations: 265
abstracting: (1<=p184)
states: 243,714 (5)
abstracting: (p184<=1)
states: 348,510 (5)
abstracting: (1<=p205)
states: 10,804 (4)
abstracting: (p205<=1)
states: 348,510 (5)
abstracting: (1<=p151)
states: 7,026 (3)
abstracting: (p151<=1)
states: 348,510 (5)
abstracting: (1<=p175)
states: 1,426 (3)
abstracting: (p175<=1)
states: 348,510 (5)
abstracting: (0<=p108)
states: 348,510 (5)
abstracting: (p108<=0)
states: 331,251 (5)
abstracting: (0<=p125)
states: 348,510 (5)
abstracting: (p125<=0)
states: 341,470 (5)
abstracting: (p131<=0)
states: 345,694 (5)
abstracting: (0<=p131)
states: 348,510 (5)
abstracting: (1<=p96)
states: 54,796 (4)
abstracting: (p96<=1)
states: 348,510 (5)
abstracting: (1<=p124)
states: 2,728 (3)
abstracting: (p124<=1)
states: 348,510 (5)
abstracting: (1<=p89)
states: 17,313 (4)
abstracting: (p89<=1)
states: 348,510 (5)
abstracting: (1<=p166)
states: 1,426 (3)
abstracting: (p166<=1)
states: 348,510 (5)
abstracting: (1<=p96)
states: 54,796 (4)
abstracting: (p96<=1)
states: 348,510 (5)
abstracting: (1<=p124)
states: 2,728 (3)
abstracting: (p124<=1)
states: 348,510 (5)
abstracting: (1<=p154)
states: 7,026 (3)
abstracting: (p154<=1)
states: 348,510 (5)
abstracting: (1<=p172)
states: 7,130 (3)
abstracting: (p172<=1)
states: 348,510 (5)
abstracting: (1<=p178)
states: 2,852 (3)
abstracting: (p178<=1)
states: 348,510 (5)
.abstracting: (1<=p9)
states: 99,031 (4)
abstracting: (p9<=1)
states: 348,510 (5)
abstracting: (1<=p80)
states: 12,828 (4)
abstracting: (p80<=1)
states: 348,510 (5)
...............................................................................................................................
EG iterations: 127

EG iterations: 0
abstracting: (1<=p193)
states: 52,398 (4)
abstracting: (p193<=1)
states: 348,510 (5)
abstracting: (1<=p206)
states: 10,804 (4)
abstracting: (p206<=1)
states: 348,510 (5)
abstracting: (1<=p9)
states: 99,031 (4)
abstracting: (p9<=1)
states: 348,510 (5)
abstracting: (1<=p80)
states: 12,828 (4)
abstracting: (p80<=1)
states: 348,510 (5)
...............................................................................................................................
EG iterations: 127

EG iterations: 0
abstracting: (1<=p9)
states: 99,031 (4)
abstracting: (p9<=1)
states: 348,510 (5)
abstracting: (1<=p80)
states: 12,828 (4)
abstracting: (p80<=1)
states: 348,510 (5)
...............................................................................................................................
EG iterations: 127

EG iterations: 0

EG iterations: 0
abstracting: (1<=p87)
states: 196,176 (5)
abstracting: (p87<=1)
states: 348,510 (5)
abstracting: (1<=p100)
states: 484
abstracting: (p100<=1)
states: 348,510 (5)
abstracting: (1<=p108)
states: 17,259 (4)
abstracting: (p108<=1)
states: 348,510 (5)
abstracting: (1<=p112)
states: 4,345 (3)
abstracting: (p112<=1)
states: 348,510 (5)
.........................................................................
EG iterations: 72
abstracting: (1<=p13)
states: 6,082 (3)
abstracting: (p13<=1)
states: 348,510 (5)
abstracting: (1<=p78)
states: 157,565 (5)
abstracting: (p78<=1)
states: 348,510 (5)
..........................................................................................................................................................................................................................................................................
EG iterations: 266
abstracting: (1<=p140)
states: 916
abstracting: (p140<=1)
states: 348,510 (5)
.abstracting: (1<=p14)
states: 110,160 (5)
abstracting: (p14<=1)
states: 348,510 (5)
abstracting: (1<=p137)
states: 4,696 (3)
abstracting: (p137<=1)
states: 348,510 (5)
abstracting: (1<=p70)
states: 342,654 (5)
abstracting: (p70<=1)
states: 348,510 (5)
abstracting: (1<=p71)
states: 976
abstracting: (p71<=1)
states: 348,510 (5)
abstracting: (1<=p108)
states: 17,259 (4)
abstracting: (p108<=1)
states: 348,510 (5)
abstracting: (1<=p112)
states: 4,345 (3)
abstracting: (p112<=1)
states: 348,510 (5)
...............................................................................................................................................................................................................................................................................................
EG iterations: 287
abstracting: (1<=p55)
states: 323,206 (5)
abstracting: (p55<=1)
states: 348,510 (5)
abstracting: (1<=p56)
states: 37,956 (4)
abstracting: (p56<=1)
states: 348,510 (5)
abstracting: (1<=p61)
states: 12,652 (4)
abstracting: (p61<=1)
states: 348,510 (5)
abstracting: (1<=p32)
states: 232,128 (5)
abstracting: (p32<=1)
states: 348,510 (5)
abstracting: (1<=p34)
states: 88,254 (4)
abstracting: (p34<=1)
states: 348,510 (5)
abstracting: (1<=p50)
states: 4,800 (3)
abstracting: (p50<=1)
states: 348,510 (5)
abstracting: (1<=p73)
states: 976
abstracting: (p73<=1)
states: 348,510 (5)
abstracting: (1<=p187)
states: 228,624 (5)
abstracting: (p187<=1)
states: 348,510 (5)
abstracting: (1<=p197)
states: 13,324 (4)
abstracting: (p197<=1)
states: 348,510 (5)
abstracting: (1<=p21)
states: 175,782 (5)
abstracting: (p21<=1)
states: 348,510 (5)
abstracting: (1<=p29)
states: 62,160 (4)
abstracting: (p29<=1)
states: 348,510 (5)
abstracting: (1<=p12)
states: 31,080 (4)
abstracting: (p12<=1)
states: 348,510 (5)
abstracting: (1<=p15)
states: 67,994 (4)
abstracting: (p15<=1)
states: 348,510 (5)
abstracting: (1<=p21)
states: 175,782 (5)
abstracting: (p21<=1)
states: 348,510 (5)
abstracting: (1<=p29)
states: 62,160 (4)
abstracting: (p29<=1)
states: 348,510 (5)
abstracting: (1<=p21)
states: 175,782 (5)
abstracting: (p21<=1)
states: 348,510 (5)
abstracting: (1<=p29)
states: 62,160 (4)
abstracting: (p29<=1)
states: 348,510 (5)
............................................................................................................................................................................................................................................................................................................................................................
EG iterations: 348
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m59.682sec

totally nodes used: 101688703 (1.0e+08)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 56424532 292152987 348577519
used/not used/entry size/cache size: 60191986 6916878 16 1024MB
basic ops cache: hits/miss/sum: 1794852 9355504 11150356
used/not used/entry size/cache size: 5924794 10852422 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: 19361 166436 185797
used/not used/entry size/cache size: 74450 8314158 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 39984458
1 18892717
2 6241562
3 1603165
4 324512
5 54040
6 7388
7 887
8 121
9 13
>= 10 1

Total processing time: 2m30.071sec


BK_STOP 1679040249056

--------------------
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 CTLFireability -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:9310 (46), effective:607 (3)

initing FirstDep: 0m 0.000sec


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

iterations count:5605 (28), effective:355 (1)

iterations count:5478 (27), effective:366 (1)

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

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

iterations count:4655 (23), effective:273 (1)

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

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

iterations count:5557 (27), effective:338 (1)

iterations count:4715 (23), effective:277 (1)

iterations count:5699 (28), effective:360 (1)

iterations count:4715 (23), effective:277 (1)

iterations count:5699 (28), effective:360 (1)

iterations count:4715 (23), effective:277 (1)

iterations count:5699 (28), effective:360 (1)

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

iterations count:4767 (23), effective:292 (1)

iterations count:6864 (34), effective:469 (2)

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

iterations count:5842 (29), effective:349 (1)

iterations count:4946 (24), effective:297 (1)

iterations count:5842 (29), effective:349 (1)

iterations count:4946 (24), effective:297 (1)

iterations count:4651 (23), effective:273 (1)

iterations count:5842 (29), effective:349 (1)

iterations count:4946 (24), effective:297 (1)

iterations count:5542 (27), effective:348 (1)

iterations count:4999 (24), effective:316 (1)

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

iterations count:4575 (22), effective:279 (1)

iterations count:4744 (23), effective:283 (1)

iterations count:351 (1), effective:9 (0)

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

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

iterations count:542 (2), effective:17 (0)

iterations count:4964 (24), effective:311 (1)

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

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

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

iterations count:1469 (7), effective:87 (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-2"
export BK_EXAMINATION="CTLFireability"
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-2, examination is CTLFireability"
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-167863540800378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-2.tgz
mv ParamProductionCell-PT-2 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;