fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r266-smll-167863540800377
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
9886.575 122153.00 132660.00 773.90 FTTFFTFTTFFTTFFF 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-167863540800377.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540800377
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-2-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679039957817

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-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 07:59:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 07:59:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 07:59:20] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-17 07:59:20] [INFO ] Transformed 231 places.
[2023-03-17 07:59:20] [INFO ] Transformed 202 transitions.
[2023-03-17 07:59:20] [INFO ] Found NUPN structural information;
[2023-03-17 07:59:20] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 97 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 46 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2023-03-17 07:59:21] [INFO ] Computed 59 place invariants in 31 ms
[2023-03-17 07:59:21] [INFO ] Implicit Places using invariants in 572 ms returned [18, 19, 24, 31, 35, 41, 42, 46, 73, 79, 101, 163, 166, 191, 192]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 718 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 211/231 places, 197/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 211 /211 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 779 ms. Remains : 211/231 places, 197/202 transitions.
Support contains 97 out of 211 places after structural reductions.
[2023-03-17 07:59:22] [INFO ] Flatten gal took : 88 ms
[2023-03-17 07:59:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ParamProductionCell-PT-2-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 07:59:22] [INFO ] Flatten gal took : 43 ms
[2023-03-17 07:59:22] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 87 out of 211 places (down from 97) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 64) seen :62
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 211 cols
[2023-03-17 07:59:22] [INFO ] Computed 44 place invariants in 7 ms
[2023-03-17 07:59:23] [INFO ] [Real]Absence check using 29 positive place invariants in 15 ms returned sat
[2023-03-17 07:59:23] [INFO ] [Real]Absence check using 29 positive and 15 generalized place invariants in 12 ms returned sat
[2023-03-17 07:59:23] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 22 ms
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 25 ms
[2023-03-17 07:59:23] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 79 out of 211 places (down from 84) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 196
Applied a total of 2 rules in 33 ms. Remains 210 /211 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 210/211 places, 196/197 transitions.
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 19 ms
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 23 ms
[2023-03-17 07:59:23] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 196
Applied a total of 2 rules in 16 ms. Remains 210 /211 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 210/211 places, 196/197 transitions.
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 20 ms
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 23 ms
[2023-03-17 07:59:23] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 196
Applied a total of 2 rules in 13 ms. Remains 210 /211 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 210/211 places, 196/197 transitions.
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 17 ms
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 21 ms
[2023-03-17 07:59:23] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 211 transition count 189
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 203 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 202 transition count 188
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 18 place count 202 transition count 174
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 46 place count 188 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 187 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 187 transition count 173
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 92 place count 165 transition count 151
Applied a total of 92 rules in 69 ms. Remains 165 /211 variables (removed 46) and now considering 151/197 (removed 46) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 165/211 places, 151/197 transitions.
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 18 ms
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 15 ms
[2023-03-17 07:59:23] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 211 transition count 189
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 203 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 202 transition count 188
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 18 place count 202 transition count 172
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 50 place count 186 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 185 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 185 transition count 171
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 104 place count 159 transition count 145
Applied a total of 104 rules in 42 ms. Remains 159 /211 variables (removed 52) and now considering 145/197 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 159/211 places, 145/197 transitions.
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:59:23] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 196
Applied a total of 2 rules in 11 ms. Remains 210 /211 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 210/211 places, 196/197 transitions.
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 15 ms
[2023-03-17 07:59:23] [INFO ] Flatten gal took : 17 ms
[2023-03-17 07:59:23] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 196
Applied a total of 2 rules in 11 ms. Remains 210 /211 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 210/211 places, 196/197 transitions.
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 32 ms
[2023-03-17 07:59:24] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 196
Applied a total of 2 rules in 11 ms. Remains 210 /211 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 210/211 places, 196/197 transitions.
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:59:24] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 211 transition count 188
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 202 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 201 transition count 187
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 20 place count 201 transition count 173
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 48 place count 187 transition count 173
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 98 place count 162 transition count 148
Applied a total of 98 rules in 36 ms. Remains 162 /211 variables (removed 49) and now considering 148/197 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 162/211 places, 148/197 transitions.
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:59:24] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 211 transition count 189
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 203 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 202 transition count 188
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 18 place count 202 transition count 175
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 44 place count 189 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 188 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 188 transition count 174
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 82 place count 170 transition count 156
Applied a total of 82 rules in 36 ms. Remains 170 /211 variables (removed 41) and now considering 156/197 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 170/211 places, 156/197 transitions.
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 25 ms
[2023-03-17 07:59:24] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 211 transition count 189
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 203 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 202 transition count 188
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 18 place count 202 transition count 175
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 44 place count 189 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 188 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 188 transition count 174
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 94 place count 164 transition count 150
Applied a total of 94 rules in 36 ms. Remains 164 /211 variables (removed 47) and now considering 150/197 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 164/211 places, 150/197 transitions.
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:59:24] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 196
Applied a total of 2 rules in 10 ms. Remains 210 /211 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 210/211 places, 196/197 transitions.
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 13 ms
[2023-03-17 07:59:24] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 196
Applied a total of 2 rules in 10 ms. Remains 210 /211 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 210/211 places, 196/197 transitions.
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:59:24] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 196
Applied a total of 2 rules in 9 ms. Remains 210 /211 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 210/211 places, 196/197 transitions.
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:59:24] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 196
Applied a total of 2 rules in 9 ms. Remains 210 /211 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 210/211 places, 196/197 transitions.
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:59:24] [INFO ] Input system was already deterministic with 196 transitions.
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:59:24] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:59:24] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-17 07:59:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 211 places, 197 transitions and 738 arcs took 4 ms.
Total runtime 4259 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: 211 NrTr: 197 NrArc: 738)

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

net check time: 0m 0.000sec

init dd package: 0m 3.667sec


RS generation: 0m 0.737sec


-> reachability set: #nodes 10116 (1.0e+04) #states 348,396 (5)



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

checking: AF [EG [EX [0<=0]]]
normalized: ~ [EG [~ [EG [EX [0<=0]]]]]

abstracting: (0<=0)
states: 348,396 (5)
.
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.321sec

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

abstracting: (p76<=0)
states: 346,444 (5)
abstracting: (0<=p76)
states: 348,396 (5)
.-> the formula is FALSE

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

MC time: 0m 0.752sec

checking: EF [[EG [[[p16<=1 & 1<=p16] | [p88<=1 & 1<=p88]]] & [p111<=0 & 0<=p111]]]
normalized: E [true U [EG [[[p16<=1 & 1<=p16] | [p88<=1 & 1<=p88]]] & [p111<=0 & 0<=p111]]]

abstracting: (0<=p111)
states: 348,396 (5)
abstracting: (p111<=0)
states: 339,706 (5)
abstracting: (1<=p88)
states: 17,247 (4)
abstracting: (p88<=1)
states: 348,396 (5)
abstracting: (1<=p16)
states: 67,986 (4)
abstracting: (p16<=1)
states: 348,396 (5)
.................................................................................................................................................................................................................................
EG iterations: 225
-> the formula is FALSE

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

MC time: 0m 6.070sec

checking: EG [[AX [AF [[[p107<=0 & 0<=p107] & [p128<=1 & 1<=p128]]]] & EG [EF [EX [[[p209<=0 & 0<=p209] | [p87<=1 & 1<=p87]]]]]]]
normalized: EG [[~ [EX [EG [~ [[[p128<=1 & 1<=p128] & [p107<=0 & 0<=p107]]]]]] & EG [E [true U EX [[[p87<=1 & 1<=p87] | [p209<=0 & 0<=p209]]]]]]]

abstracting: (0<=p209)
states: 348,396 (5)
abstracting: (p209<=0)
states: 337,592 (5)
abstracting: (1<=p87)
states: 38,424 (4)
abstracting: (p87<=1)
states: 348,396 (5)
.
EG iterations: 0
abstracting: (0<=p107)
states: 348,396 (5)
abstracting: (p107<=0)
states: 344,051 (5)
abstracting: (1<=p128)
states: 2,816 (3)
abstracting: (p128<=1)
states: 348,396 (5)
........................................................................................................................................................................................................................................................................
EG iterations: 264
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m10.726sec

checking: EG [~ [E [AX [[[p109<=0 & 0<=p109] & [p11<=0 & 0<=p11]]] U [[p116<=1 & 1<=p116] & ~ [[[p104<=0 & 0<=p104] | [p153<=1 & 1<=p153]]]]]]]
normalized: EG [~ [E [~ [EX [~ [[[p11<=0 & 0<=p11] & [p109<=0 & 0<=p109]]]]] U [[p116<=1 & 1<=p116] & ~ [[[p153<=1 & 1<=p153] | [p104<=0 & 0<=p104]]]]]]]

abstracting: (0<=p104)
states: 348,396 (5)
abstracting: (p104<=0)
states: 34,518 (4)
abstracting: (1<=p153)
states: 75,170 (4)
abstracting: (p153<=1)
states: 348,396 (5)
abstracting: (1<=p116)
states: 1,408 (3)
abstracting: (p116<=1)
states: 348,396 (5)
abstracting: (0<=p109)
states: 348,396 (5)
abstracting: (p109<=0)
states: 268,797 (5)
abstracting: (0<=p11)
states: 348,396 (5)
abstracting: (p11<=0)
states: 345,996 (5)
............................................................................................
EG iterations: 91
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.869sec

checking: ~ [E [EX [~ [EX [[p171<=1 & 1<=p171]]]] U ~ [EX [[[p172<=1 & 1<=p172] | E [[[p70<=0 & 0<=p70] | [p56<=1 & 1<=p56]] U [p200<=0 & 0<=p200]]]]]]]
normalized: ~ [E [EX [~ [EX [[p171<=1 & 1<=p171]]]] U ~ [EX [[E [[[p56<=1 & 1<=p56] | [p70<=0 & 0<=p70]] U [p200<=0 & 0<=p200]] | [p172<=1 & 1<=p172]]]]]]

abstracting: (1<=p172)
states: 1,426 (3)
abstracting: (p172<=1)
states: 348,396 (5)
abstracting: (0<=p200)
states: 348,396 (5)
abstracting: (p200<=0)
states: 337,592 (5)
abstracting: (0<=p70)
states: 348,396 (5)
abstracting: (p70<=0)
states: 347,420 (5)
abstracting: (1<=p56)
states: 37,956 (4)
abstracting: (p56<=1)
states: 348,396 (5)
.abstracting: (1<=p171)
states: 1,426 (3)
abstracting: (p171<=1)
states: 348,396 (5)
..-> the formula is TRUE

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

MC time: 0m 0.189sec

checking: EX [[AF [[[p86<=0 & 0<=p86] & [[p157<=1 & 1<=p157] & [p149<=0 & 0<=p149]]]] & [[p194<=1 & 1<=p194] & [p42<=0 & 0<=p42]]]]
normalized: EX [[[[p42<=0 & 0<=p42] & [p194<=1 & 1<=p194]] & ~ [EG [~ [[[[p149<=0 & 0<=p149] & [p157<=1 & 1<=p157]] & [p86<=0 & 0<=p86]]]]]]]

abstracting: (0<=p86)
states: 348,396 (5)
abstracting: (p86<=0)
states: 152,220 (5)
abstracting: (1<=p157)
states: 1,832 (3)
abstracting: (p157<=1)
states: 348,396 (5)
abstracting: (0<=p149)
states: 348,396 (5)
abstracting: (p149<=0)
states: 341,370 (5)
..................................................................................................................................................................................................................................................................
EG iterations: 258
abstracting: (1<=p194)
states: 6,662 (3)
abstracting: (p194<=1)
states: 348,396 (5)
abstracting: (0<=p42)
states: 348,396 (5)
abstracting: (p42<=0)
states: 321,384 (5)
.-> the formula is FALSE

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

MC time: 0m 9.943sec

checking: [~ [A [[[A [[p34<=1 & 1<=p34] U [p205<=0 & 0<=p205]] & EX [0<=0]] | [p153<=0 & 0<=p153]] U [p196<=0 & 0<=p196]]] | EF [[[p22<=0 & 0<=p22] | [p118<=1 & 1<=p118]]]]
normalized: [E [true U [[p118<=1 & 1<=p118] | [p22<=0 & 0<=p22]]] | ~ [[~ [EG [~ [[p196<=0 & 0<=p196]]]] & ~ [E [~ [[p196<=0 & 0<=p196]] U [~ [[[p153<=0 & 0<=p153] | [EX [0<=0] & [~ [EG [~ [[p205<=0 & 0<=p205]]]] & ~ [E [~ [[p205<=0 & 0<=p205]] U [~ [[p34<=1 & 1<=p34]] & ~ [[p205<=0 & 0<=p205]]]]]]]]] & ~ [[p196<=0 & 0<=p196]]]]]]]]

abstracting: (0<=p196)
states: 348,396 (5)
abstracting: (p196<=0)
states: 341,734 (5)
abstracting: (0<=p205)
states: 348,396 (5)
abstracting: (p205<=0)
states: 337,592 (5)
abstracting: (1<=p34)
states: 232,080 (5)
abstracting: (p34<=1)
states: 348,396 (5)
abstracting: (0<=p205)
states: 348,396 (5)
abstracting: (p205<=0)
states: 337,592 (5)
abstracting: (0<=p205)
states: 348,396 (5)
abstracting: (p205<=0)
states: 337,592 (5)
.............................................................................................................................................
EG iterations: 141
abstracting: (0<=0)
states: 348,396 (5)
.abstracting: (0<=p153)
states: 348,396 (5)
abstracting: (p153<=0)
states: 273,226 (5)
abstracting: (0<=p196)
states: 348,396 (5)
abstracting: (p196<=0)
states: 341,734 (5)
abstracting: (0<=p196)
states: 348,396 (5)
abstracting: (p196<=0)
states: 341,734 (5)
..................................................................................................................................
EG iterations: 130
abstracting: (0<=p22)
states: 348,396 (5)
abstracting: (p22<=0)
states: 172,692 (5)
abstracting: (1<=p118)
states: 1,364 (3)
abstracting: (p118<=1)
states: 348,396 (5)
-> the formula is TRUE

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

MC time: 0m 2.763sec

checking: A [[p40<=1 & 1<=p40] U [E [[p82<=1 & 1<=p82] U ~ [[~ [[p127<=1 & 1<=p127]] | [p11<=1 & 1<=p11]]]] | AG [AF [[[p150<=0 & 0<=p150] | [p107<=1 & 1<=p107]]]]]]
normalized: [~ [EG [~ [[~ [E [true U EG [~ [[[p107<=1 & 1<=p107] | [p150<=0 & 0<=p150]]]]]] | E [[p82<=1 & 1<=p82] U ~ [[[p11<=1 & 1<=p11] | ~ [[p127<=1 & 1<=p127]]]]]]]]] & ~ [E [~ [[~ [E [true U EG [~ [[[p107<=1 & 1<=p107] | [p150<=0 & 0<=p150]]]]]] | E [[p82<=1 & 1<=p82] U ~ [[[p11<=1 & 1<=p11] | ~ [[p127<=1 & 1<=p127]]]]]]] U [~ [[p40<=1 & 1<=p40]] & ~ [[~ [E [true U EG [~ [[[p107<=1 & 1<=p107] | [p150<=0 & 0<=p150]]]]]] | E [[p82<=1 & 1<=p82] U ~ [[[p11<=1 & 1<=p11] | ~ [[p127<=1 & 1<=p127]]]]]]]]]]]

abstracting: (1<=p127)
states: 1,408 (3)
abstracting: (p127<=1)
states: 348,396 (5)
abstracting: (1<=p11)
states: 2,400 (3)
abstracting: (p11<=1)
states: 348,396 (5)
abstracting: (1<=p82)
states: 5,545 (3)
abstracting: (p82<=1)
states: 348,396 (5)
abstracting: (0<=p150)
states: 348,396 (5)
abstracting: (p150<=0)
states: 14,052 (4)
abstracting: (1<=p107)
states: 4,345 (3)
abstracting: (p107<=1)
states: 348,396 (5)
................................................................................................................................
EG iterations: 128
abstracting: (1<=p40)
states: 27,012 (4)
abstracting: (p40<=1)
states: 348,396 (5)
abstracting: (1<=p127)
states: 1,408 (3)
abstracting: (p127<=1)
states: 348,396 (5)
abstracting: (1<=p11)
states: 2,400 (3)
abstracting: (p11<=1)
states: 348,396 (5)
abstracting: (1<=p82)
states: 5,545 (3)
abstracting: (p82<=1)
states: 348,396 (5)
abstracting: (0<=p150)
states: 348,396 (5)
abstracting: (p150<=0)
states: 14,052 (4)
abstracting: (1<=p107)
states: 4,345 (3)
abstracting: (p107<=1)
states: 348,396 (5)
................................................................................................................................
EG iterations: 128
abstracting: (1<=p127)
states: 1,408 (3)
abstracting: (p127<=1)
states: 348,396 (5)
abstracting: (1<=p11)
states: 2,400 (3)
abstracting: (p11<=1)
states: 348,396 (5)
abstracting: (1<=p82)
states: 5,545 (3)
abstracting: (p82<=1)
states: 348,396 (5)
abstracting: (0<=p150)
states: 348,396 (5)
abstracting: (p150<=0)
states: 14,052 (4)
abstracting: (1<=p107)
states: 4,345 (3)
abstracting: (p107<=1)
states: 348,396 (5)
................................................................................................................................
EG iterations: 128
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 7.625sec

checking: AG [E [~ [[~ [[p95<=1 & 1<=p95]] | A [AG [[[p85<=0 & 0<=p85] | [p73<=1 & 1<=p73]]] U [p116<=1 & 1<=p116]]]] U E [[[p199<=0 & 0<=p199] | [p95<=1 & 1<=p95]] U [p108<=1 & 1<=p108]]]]
normalized: ~ [E [true U ~ [E [~ [[[~ [EG [~ [[p116<=1 & 1<=p116]]]] & ~ [E [~ [[p116<=1 & 1<=p116]] U [E [true U ~ [[[p73<=1 & 1<=p73] | [p85<=0 & 0<=p85]]]] & ~ [[p116<=1 & 1<=p116]]]]]] | ~ [[p95<=1 & 1<=p95]]]] U E [[[p95<=1 & 1<=p95] | [p199<=0 & 0<=p199]] U [p108<=1 & 1<=p108]]]]]]

abstracting: (1<=p108)
states: 268,797 (5)
abstracting: (p108<=1)
states: 348,396 (5)
abstracting: (0<=p199)
states: 348,396 (5)
abstracting: (p199<=0)
states: 337,592 (5)
abstracting: (1<=p95)
states: 176
abstracting: (p95<=1)
states: 348,396 (5)
abstracting: (1<=p95)
states: 176
abstracting: (p95<=1)
states: 348,396 (5)
abstracting: (1<=p116)
states: 1,408 (3)
abstracting: (p116<=1)
states: 348,396 (5)
abstracting: (0<=p85)
states: 348,396 (5)
abstracting: (p85<=0)
states: 344,051 (5)
abstracting: (1<=p73)
states: 976
abstracting: (p73<=1)
states: 348,396 (5)
abstracting: (1<=p116)
states: 1,408 (3)
abstracting: (p116<=1)
states: 348,396 (5)
abstracting: (1<=p116)
states: 1,408 (3)
abstracting: (p116<=1)
states: 348,396 (5)
.........................................................................................................................................................................................................................................................................
EG iterations: 265
-> the formula is FALSE

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

MC time: 0m10.683sec

checking: A [AG [[[p60<=0 & 0<=p60] | [p103<=1 & 1<=p103]]] U ~ [[EX [~ [[p80<=0 & 0<=p80]]] | EG [[[[p130<=1 & 1<=p130] | [p158<=0 & 0<=p158]] | [[p187<=0 & 0<=p187] | [p172<=1 & 1<=p172]]]]]]]
normalized: [~ [E [[EX [~ [[p80<=0 & 0<=p80]]] | EG [[[[p130<=1 & 1<=p130] | [p158<=0 & 0<=p158]] | [[p172<=1 & 1<=p172] | [p187<=0 & 0<=p187]]]]] U [[EX [~ [[p80<=0 & 0<=p80]]] | EG [[[[p130<=1 & 1<=p130] | [p158<=0 & 0<=p158]] | [[p172<=1 & 1<=p172] | [p187<=0 & 0<=p187]]]]] & E [true U ~ [[[p60<=0 & 0<=p60] | [p103<=1 & 1<=p103]]]]]]] & ~ [EG [[EX [~ [[p80<=0 & 0<=p80]]] | EG [[[[p130<=1 & 1<=p130] | [p158<=0 & 0<=p158]] | [[p172<=1 & 1<=p172] | [p187<=0 & 0<=p187]]]]]]]]

abstracting: (0<=p187)
states: 348,396 (5)
abstracting: (p187<=0)
states: 52,398 (4)
abstracting: (1<=p172)
states: 1,426 (3)
abstracting: (p172<=1)
states: 348,396 (5)
abstracting: (0<=p158)
states: 348,396 (5)
abstracting: (p158<=0)
states: 346,970 (5)
abstracting: (1<=p130)
states: 2,816 (3)
abstracting: (p130<=1)
states: 348,396 (5)
.............................................................................
EG iterations: 77
abstracting: (0<=p80)
states: 348,396 (5)
abstracting: (p80<=0)
states: 282,633 (5)
...........................................
EG iterations: 42
abstracting: (1<=p103)
states: 17,259 (4)
abstracting: (p103<=1)
states: 348,396 (5)
abstracting: (0<=p60)
states: 348,396 (5)
abstracting: (p60<=0)
states: 342,070 (5)
abstracting: (0<=p187)
states: 348,396 (5)
abstracting: (p187<=0)
states: 52,398 (4)
abstracting: (1<=p172)
states: 1,426 (3)
abstracting: (p172<=1)
states: 348,396 (5)
abstracting: (0<=p158)
states: 348,396 (5)
abstracting: (p158<=0)
states: 346,970 (5)
abstracting: (1<=p130)
states: 2,816 (3)
abstracting: (p130<=1)
states: 348,396 (5)
.............................................................................
EG iterations: 77
abstracting: (0<=p80)
states: 348,396 (5)
abstracting: (p80<=0)
states: 282,633 (5)
.abstracting: (0<=p187)
states: 348,396 (5)
abstracting: (p187<=0)
states: 52,398 (4)
abstracting: (1<=p172)
states: 1,426 (3)
abstracting: (p172<=1)
states: 348,396 (5)
abstracting: (0<=p158)
states: 348,396 (5)
abstracting: (p158<=0)
states: 346,970 (5)
abstracting: (1<=p130)
states: 2,816 (3)
abstracting: (p130<=1)
states: 348,396 (5)
.............................................................................
EG iterations: 77
abstracting: (0<=p80)
states: 348,396 (5)
abstracting: (p80<=0)
states: 282,633 (5)
.-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.888sec

checking: A [EF [AG [[p175<=1 & 1<=p175]]] U [E [[EX [[p19<=1 & 1<=p19]] | [[p188<=1 & 1<=p188] | [[p122<=0 & 0<=p122] & [p186<=1 & 1<=p186]]]] U ~ [EG [EX [0<=0]]]] | ~ [[~ [E [[[p108<=0 & 0<=p108] | [p64<=1 & 1<=p64]] U [p127<=1 & 1<=p127]]] & [[p124<=0 & 0<=p124] & [[p206<=0 & 0<=p206] | [p128<=1 & 1<=p128]]]]]]]
normalized: [~ [EG [~ [[~ [[[[[p128<=1 & 1<=p128] | [p206<=0 & 0<=p206]] & [p124<=0 & 0<=p124]] & ~ [E [[[p64<=1 & 1<=p64] | [p108<=0 & 0<=p108]] U [p127<=1 & 1<=p127]]]]] | E [[[[[p186<=1 & 1<=p186] & [p122<=0 & 0<=p122]] | [p188<=1 & 1<=p188]] | EX [[p19<=1 & 1<=p19]]] U ~ [EG [EX [0<=0]]]]]]]] & ~ [E [~ [[~ [[[[[p128<=1 & 1<=p128] | [p206<=0 & 0<=p206]] & [p124<=0 & 0<=p124]] & ~ [E [[[p64<=1 & 1<=p64] | [p108<=0 & 0<=p108]] U [p127<=1 & 1<=p127]]]]] | E [[[[[p186<=1 & 1<=p186] & [p122<=0 & 0<=p122]] | [p188<=1 & 1<=p188]] | EX [[p19<=1 & 1<=p19]]] U ~ [EG [EX [0<=0]]]]]] U [~ [[~ [[[[[p128<=1 & 1<=p128] | [p206<=0 & 0<=p206]] & [p124<=0 & 0<=p124]] & ~ [E [[[p64<=1 & 1<=p64] | [p108<=0 & 0<=p108]] U [p127<=1 & 1<=p127]]]]] | E [[[[[p186<=1 & 1<=p186] & [p122<=0 & 0<=p122]] | [p188<=1 & 1<=p188]] | EX [[p19<=1 & 1<=p19]]] U ~ [EG [EX [0<=0]]]]]] & ~ [E [true U ~ [E [true U ~ [[p175<=1 & 1<=p175]]]]]]]]]]

abstracting: (1<=p175)
states: 2,852 (3)
abstracting: (p175<=1)
states: 348,396 (5)
abstracting: (0<=0)
states: 348,396 (5)
.
EG iterations: 0
abstracting: (1<=p19)
states: 148,380 (5)
abstracting: (p19<=1)
states: 348,396 (5)
.abstracting: (1<=p188)
states: 6,662 (3)
abstracting: (p188<=1)
states: 348,396 (5)
abstracting: (0<=p122)
states: 348,396 (5)
abstracting: (p122<=0)
states: 345,668 (5)
abstracting: (1<=p186)
states: 19,986 (4)
abstracting: (p186<=1)
states: 348,396 (5)
abstracting: (1<=p127)
states: 1,408 (3)
abstracting: (p127<=1)
states: 348,396 (5)
abstracting: (0<=p108)
states: 348,396 (5)
abstracting: (p108<=0)
states: 79,599 (4)
abstracting: (1<=p64)
states: 12,652 (4)
abstracting: (p64<=1)
states: 348,396 (5)
abstracting: (0<=p124)
states: 348,396 (5)
abstracting: (p124<=0)
states: 341,356 (5)
abstracting: (0<=p206)
states: 348,396 (5)
abstracting: (p206<=0)
states: 326,788 (5)
abstracting: (1<=p128)
states: 2,816 (3)
abstracting: (p128<=1)
states: 348,396 (5)
abstracting: (0<=0)
states: 348,396 (5)
.
EG iterations: 0
abstracting: (1<=p19)
states: 148,380 (5)
abstracting: (p19<=1)
states: 348,396 (5)
.abstracting: (1<=p188)
states: 6,662 (3)
abstracting: (p188<=1)
states: 348,396 (5)
abstracting: (0<=p122)
states: 348,396 (5)
abstracting: (p122<=0)
states: 345,668 (5)
abstracting: (1<=p186)
states: 19,986 (4)
abstracting: (p186<=1)
states: 348,396 (5)
abstracting: (1<=p127)
states: 1,408 (3)
abstracting: (p127<=1)
states: 348,396 (5)
abstracting: (0<=p108)
states: 348,396 (5)
abstracting: (p108<=0)
states: 79,599 (4)
abstracting: (1<=p64)
states: 12,652 (4)
abstracting: (p64<=1)
states: 348,396 (5)
abstracting: (0<=p124)
states: 348,396 (5)
abstracting: (p124<=0)
states: 341,356 (5)
abstracting: (0<=p206)
states: 348,396 (5)
abstracting: (p206<=0)
states: 326,788 (5)
abstracting: (1<=p128)
states: 2,816 (3)
abstracting: (p128<=1)
states: 348,396 (5)
abstracting: (0<=0)
states: 348,396 (5)
.
EG iterations: 0
abstracting: (1<=p19)
states: 148,380 (5)
abstracting: (p19<=1)
states: 348,396 (5)
.abstracting: (1<=p188)
states: 6,662 (3)
abstracting: (p188<=1)
states: 348,396 (5)
abstracting: (0<=p122)
states: 348,396 (5)
abstracting: (p122<=0)
states: 345,668 (5)
abstracting: (1<=p186)
states: 19,986 (4)
abstracting: (p186<=1)
states: 348,396 (5)
abstracting: (1<=p127)
states: 1,408 (3)
abstracting: (p127<=1)
states: 348,396 (5)
abstracting: (0<=p108)
states: 348,396 (5)
abstracting: (p108<=0)
states: 79,599 (4)
abstracting: (1<=p64)
states: 12,652 (4)
abstracting: (p64<=1)
states: 348,396 (5)
abstracting: (0<=p124)
states: 348,396 (5)
abstracting: (p124<=0)
states: 341,356 (5)
abstracting: (0<=p206)
states: 348,396 (5)
abstracting: (p206<=0)
states: 326,788 (5)
abstracting: (1<=p128)
states: 2,816 (3)
abstracting: (p128<=1)
states: 348,396 (5)
......................................................................................................................................................................................
EG iterations: 182
-> the formula is FALSE

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

MC time: 0m 8.190sec

checking: A [~ [EF [[EF [[p55<=1 & 1<=p55]] | [[[p141<=0 & 0<=p141] | [p128<=1 & 1<=p128]] & [p147<=0 & 0<=p147]]]]] U EF [~ [[E [[[p75<=0 & 0<=p75] & [[p38<=0 & 0<=p38] | [p57<=1 & 1<=p57]]] U AF [[[p51<=0 & 0<=p51] | [p33<=1 & 1<=p33]]]] | [E [[p89<=0 & 0<=p89] U [p97<=0 & 0<=p97]] & AG [[p137<=1 & 1<=p137]]]]]]]
normalized: [~ [EG [~ [E [true U ~ [[E [[[[p57<=1 & 1<=p57] | [p38<=0 & 0<=p38]] & [p75<=0 & 0<=p75]] U ~ [EG [~ [[[p33<=1 & 1<=p33] | [p51<=0 & 0<=p51]]]]]] | [~ [E [true U ~ [[p137<=1 & 1<=p137]]]] & E [[p89<=0 & 0<=p89] U [p97<=0 & 0<=p97]]]]]]]]] & ~ [E [~ [E [true U ~ [[E [[[[p57<=1 & 1<=p57] | [p38<=0 & 0<=p38]] & [p75<=0 & 0<=p75]] U ~ [EG [~ [[[p33<=1 & 1<=p33] | [p51<=0 & 0<=p51]]]]]] | [~ [E [true U ~ [[p137<=1 & 1<=p137]]]] & E [[p89<=0 & 0<=p89] U [p97<=0 & 0<=p97]]]]]]] U [E [true U [[[p147<=0 & 0<=p147] & [[p128<=1 & 1<=p128] | [p141<=0 & 0<=p141]]] | E [true U [p55<=1 & 1<=p55]]]] & ~ [E [true U ~ [[E [[[[p57<=1 & 1<=p57] | [p38<=0 & 0<=p38]] & [p75<=0 & 0<=p75]] U ~ [EG [~ [[[p33<=1 & 1<=p33] | [p51<=0 & 0<=p51]]]]]] | [~ [E [true U ~ [[p137<=1 & 1<=p137]]]] & E [[p89<=0 & 0<=p89] U [p97<=0 & 0<=p97]]]]]]]]]]]

abstracting: (0<=p97)
states: 348,396 (5)
abstracting: (p97<=0)
states: 348,154 (5)
abstracting: (0<=p89)
states: 348,396 (5)
abstracting: (p89<=0)
states: 31,849 (4)
abstracting: (1<=p137)
states: 916
abstracting: (p137<=1)
states: 348,396 (5)
abstracting: (0<=p51)
states: 348,396 (5)
abstracting: (p51<=0)
states: 166,865 (5)
abstracting: (1<=p33)
states: 27,012 (4)
abstracting: (p33<=1)
states: 348,396 (5)
..................................................................................................................................................................................................................
EG iterations: 210
abstracting: (0<=p75)
states: 348,396 (5)
abstracting: (p75<=0)
states: 347,420 (5)
abstracting: (0<=p38)
states: 348,396 (5)
abstracting: (p38<=0)
states: 133,632 (5)
abstracting: (1<=p57)
states: 310,440 (5)
abstracting: (p57<=1)
states: 348,396 (5)
abstracting: (1<=p55)
states: 323,092 (5)
abstracting: (p55<=1)
states: 348,396 (5)
abstracting: (0<=p141)
states: 348,396 (5)
abstracting: (p141<=0)
states: 348,354 (5)
abstracting: (1<=p128)
states: 2,816 (3)
abstracting: (p128<=1)
states: 348,396 (5)
abstracting: (0<=p147)
states: 348,396 (5)
abstracting: (p147<=0)
states: 343,816 (5)
abstracting: (0<=p97)
states: 348,396 (5)
abstracting: (p97<=0)
states: 348,154 (5)
abstracting: (0<=p89)
states: 348,396 (5)
abstracting: (p89<=0)
states: 31,849 (4)
abstracting: (1<=p137)
states: 916
abstracting: (p137<=1)
states: 348,396 (5)
abstracting: (0<=p51)
states: 348,396 (5)
abstracting: (p51<=0)
states: 166,865 (5)
abstracting: (1<=p33)
states: 27,012 (4)
abstracting: (p33<=1)
states: 348,396 (5)
..................................................................................................................................................................................................................
EG iterations: 210
abstracting: (0<=p75)
states: 348,396 (5)
abstracting: (p75<=0)
states: 347,420 (5)
abstracting: (0<=p38)
states: 348,396 (5)
abstracting: (p38<=0)
states: 133,632 (5)
abstracting: (1<=p57)
states: 310,440 (5)
abstracting: (p57<=1)
states: 348,396 (5)
abstracting: (0<=p97)
states: 348,396 (5)
abstracting: (p97<=0)
states: 348,154 (5)
abstracting: (0<=p89)
states: 348,396 (5)
abstracting: (p89<=0)
states: 31,849 (4)
abstracting: (1<=p137)
states: 916
abstracting: (p137<=1)
states: 348,396 (5)
abstracting: (0<=p51)
states: 348,396 (5)
abstracting: (p51<=0)
states: 166,865 (5)
abstracting: (1<=p33)
states: 27,012 (4)
abstracting: (p33<=1)
states: 348,396 (5)
..................................................................................................................................................................................................................
EG iterations: 210
abstracting: (0<=p75)
states: 348,396 (5)
abstracting: (p75<=0)
states: 347,420 (5)
abstracting: (0<=p38)
states: 348,396 (5)
abstracting: (p38<=0)
states: 133,632 (5)
abstracting: (1<=p57)
states: 310,440 (5)
abstracting: (p57<=1)
states: 348,396 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.744sec

checking: [AG [EF [EX [[p70<=0 & 0<=p70]]]] | ~ [E [[[EG [[[p31<=0 & 0<=p31] | [p67<=1 & 1<=p67]]] | [EX [[p128<=1 & 1<=p128]] | A [[[p91<=0 & 0<=p91] | [p142<=1 & 1<=p142]] U [p104<=0 & 0<=p104]]]] | [[p70<=0 & 0<=p70] | [[p87<=1 & 1<=p87] | ~ [[p174<=0 & 0<=p174]]]]] U ~ [AX [[[[p90<=0 & 0<=p90] | [p191<=1 & 1<=p191]] & [[p33<=0 & 0<=p33] | [p196<=1 & 1<=p196]]]]]]]]
normalized: [~ [E [true U ~ [E [true U EX [[p70<=0 & 0<=p70]]]]]] | ~ [E [[[[~ [[p174<=0 & 0<=p174]] | [p87<=1 & 1<=p87]] | [p70<=0 & 0<=p70]] | [[[~ [EG [~ [[p104<=0 & 0<=p104]]]] & ~ [E [~ [[p104<=0 & 0<=p104]] U [~ [[[p142<=1 & 1<=p142] | [p91<=0 & 0<=p91]]] & ~ [[p104<=0 & 0<=p104]]]]]] | EX [[p128<=1 & 1<=p128]]] | EG [[[p67<=1 & 1<=p67] | [p31<=0 & 0<=p31]]]]] U EX [~ [[[[p191<=1 & 1<=p191] | [p90<=0 & 0<=p90]] & [[p196<=1 & 1<=p196] | [p33<=0 & 0<=p33]]]]]]]]

abstracting: (0<=p33)
states: 348,396 (5)
abstracting: (p33<=0)
states: 321,384 (5)
abstracting: (1<=p196)
states: 6,662 (3)
abstracting: (p196<=1)
states: 348,396 (5)
abstracting: (0<=p90)
states: 348,396 (5)
abstracting: (p90<=0)
states: 348,220 (5)
abstracting: (1<=p191)
states: 52,398 (4)
abstracting: (p191<=1)
states: 348,396 (5)
.abstracting: (0<=p31)
states: 348,396 (5)
abstracting: (p31<=0)
states: 302,904 (5)
abstracting: (1<=p67)
states: 3,904 (3)
abstracting: (p67<=1)
states: 348,396 (5)
..................................................................................................................................................................................................................................................
EG iterations: 242
abstracting: (1<=p128)
states: 2,816 (3)
abstracting: (p128<=1)
states: 348,396 (5)
.abstracting: (0<=p104)
states: 348,396 (5)
abstracting: (p104<=0)
states: 34,518 (4)
abstracting: (0<=p91)
states: 348,396 (5)
abstracting: (p91<=0)
states: 348,154 (5)
abstracting: (1<=p142)
states: 874
abstracting: (p142<=1)
states: 348,396 (5)
abstracting: (0<=p104)
states: 348,396 (5)
abstracting: (p104<=0)
states: 34,518 (4)
abstracting: (0<=p104)
states: 348,396 (5)
abstracting: (p104<=0)
states: 34,518 (4)
....................................................................................................................................................................................................................................
EG iterations: 228
abstracting: (0<=p70)
states: 348,396 (5)
abstracting: (p70<=0)
states: 347,420 (5)
abstracting: (1<=p87)
states: 38,424 (4)
abstracting: (p87<=1)
states: 348,396 (5)
abstracting: (0<=p174)
states: 348,396 (5)
abstracting: (p174<=0)
states: 346,970 (5)
abstracting: (0<=p70)
states: 348,396 (5)
abstracting: (p70<=0)
states: 347,420 (5)
.-> the formula is TRUE

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

MC time: 0m15.734sec

checking: E [[~ [EF [[AF [[p59<=1 & 1<=p59]] | [[p106<=0 & 0<=p106] | [[p42<=1 & 1<=p42] & [p97<=1 & 1<=p97]]]]]] | EF [[[~ [[[p181<=0 & 0<=p181] | [p51<=1 & 1<=p51]]] | [~ [[p43<=0 & 0<=p43]] & [p158<=1 & 1<=p158]]] & [p149<=0 & 0<=p149]]]] U ~ [[~ [[[p195<=0 & 0<=p195] | [p34<=1 & 1<=p34]]] | [AG [~ [A [[p80<=1 & 1<=p80] U [p171<=0 & 0<=p171]]]] | ~ [[~ [[AF [[[p55<=0 & 0<=p55] | [p20<=1 & 1<=p20]]] | [[[p173<=0 & 0<=p173] | [p90<=1 & 1<=p90]] & [[p39<=0 & 0<=p39] | [p138<=1 & 1<=p138]]]]] & [[p108<=0 & 0<=p108] | [p12<=1 & 1<=p12]]]]]]]]
normalized: E [[~ [E [true U [~ [EG [~ [[p59<=1 & 1<=p59]]]] | [[[p97<=1 & 1<=p97] & [p42<=1 & 1<=p42]] | [p106<=0 & 0<=p106]]]]] | E [true U [[p149<=0 & 0<=p149] & [[[p158<=1 & 1<=p158] & ~ [[p43<=0 & 0<=p43]]] | ~ [[[p51<=1 & 1<=p51] | [p181<=0 & 0<=p181]]]]]]] U ~ [[[~ [[[[p12<=1 & 1<=p12] | [p108<=0 & 0<=p108]] & ~ [[[[[p138<=1 & 1<=p138] | [p39<=0 & 0<=p39]] & [[p90<=1 & 1<=p90] | [p173<=0 & 0<=p173]]] | ~ [EG [~ [[[p20<=1 & 1<=p20] | [p55<=0 & 0<=p55]]]]]]]]] | ~ [E [true U [~ [EG [~ [[p171<=0 & 0<=p171]]]] & ~ [E [~ [[p171<=0 & 0<=p171]] U [~ [[p80<=1 & 1<=p80]] & ~ [[p171<=0 & 0<=p171]]]]]]]]] | ~ [[[p34<=1 & 1<=p34] | [p195<=0 & 0<=p195]]]]]]

abstracting: (0<=p195)
states: 348,396 (5)
abstracting: (p195<=0)
states: 335,072 (5)
abstracting: (1<=p34)
states: 232,080 (5)
abstracting: (p34<=1)
states: 348,396 (5)
abstracting: (0<=p171)
states: 348,396 (5)
abstracting: (p171<=0)
states: 346,970 (5)
abstracting: (1<=p80)
states: 65,763 (4)
abstracting: (p80<=1)
states: 348,396 (5)
abstracting: (0<=p171)
states: 348,396 (5)
abstracting: (p171<=0)
states: 346,970 (5)
abstracting: (0<=p171)
states: 348,396 (5)
abstracting: (p171<=0)
states: 346,970 (5)
.............................................................................
EG iterations: 77
abstracting: (0<=p55)
states: 348,396 (5)
abstracting: (p55<=0)
states: 25,304 (4)
abstracting: (1<=p20)
states: 6,078 (3)
abstracting: (p20<=1)
states: 348,396 (5)
...............................................................................................................................................................................................
EG iterations: 191
abstracting: (0<=p173)
states: 348,396 (5)
abstracting: (p173<=0)
states: 345,544 (5)
abstracting: (1<=p90)
states: 176
abstracting: (p90<=1)
states: 348,396 (5)
abstracting: (0<=p39)
states: 348,396 (5)
abstracting: (p39<=0)
states: 88,236 (4)
abstracting: (1<=p138)
states: 964
abstracting: (p138<=1)
states: 348,396 (5)
abstracting: (0<=p108)
states: 348,396 (5)
abstracting: (p108<=0)
states: 79,599 (4)
abstracting: (1<=p12)
states: 31,080 (4)
abstracting: (p12<=1)
states: 348,396 (5)
abstracting: (0<=p181)
states: 348,396 (5)
abstracting: (p181<=0)
states: 104,796 (5)
abstracting: (1<=p51)
states: 181,531 (5)
abstracting: (p51<=1)
states: 348,396 (5)
abstracting: (0<=p43)
states: 348,396 (5)
abstracting: (p43<=0)
states: 294,372 (5)
abstracting: (1<=p158)
states: 1,426 (3)
abstracting: (p158<=1)
states: 348,396 (5)
abstracting: (0<=p149)
states: 348,396 (5)
abstracting: (p149<=0)
states: 341,370 (5)
abstracting: (0<=p106)
states: 348,396 (5)
abstracting: (p106<=0)
states: 331,137 (5)
abstracting: (1<=p42)
states: 27,012 (4)
abstracting: (p42<=1)
states: 348,396 (5)
abstracting: (1<=p97)
states: 242
abstracting: (p97<=1)
states: 348,396 (5)
abstracting: (1<=p59)
states: 6,326 (3)
abstracting: (p59<=1)
states: 348,396 (5)
............................................................................................................................................................................................................................................................................
before gc: list nodes free: 826216

after gc: idd nodes used:105942, unused:63894058; list nodes free:284745737
.............................
EG iterations: 297
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.562sec

totally nodes used: 64122768 (6.4e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 39333451 195832469 235165920
used/not used/entry size/cache size: 2089473 65019391 16 1024MB
basic ops cache: hits/miss/sum: 1313816 6371680 7685496
used/not used/entry size/cache size: 99727 16677489 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: 14123 96318 110441
used/not used/entry size/cache size: 0 8388608 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 66884294
1 220502
2 3996
3 72
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 1m54.160sec


BK_STOP 1679040079970

--------------------
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:8790 (44), effective:572 (2)

initing FirstDep: 0m 0.000sec


iterations count:5229 (26), effective:325 (1)

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

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

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

iterations count:316 (1), effective:21 (0)

iterations count:2811 (14), effective:184 (0)

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

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

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

iterations count:1746 (8), effective:82 (0)

iterations count:5232 (26), effective:327 (1)

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

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

iterations count:7095 (36), effective:455 (2)

iterations count:5233 (26), effective:329 (1)

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

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

iterations count:2101 (10), effective:141 (0)

iterations count:2101 (10), effective:141 (0)

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

iterations count:2101 (10), effective:141 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:2073 (10), effective:135 (0)

iterations count:4847 (24), effective:288 (1)

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

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

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

iterations count:6975 (35), effective:427 (2)

iterations count:197 (1), effective:0 (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="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-2, 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-167863540800377"
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 [ "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 ;