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.r490-tall-167912708500337.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 SwimmingPool-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708500337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.6K Feb 26 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 26 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 03:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 03:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 03:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 03:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-03-CTLCardinality-00
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-01
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-02
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-03
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-04
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-05
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-06
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-07
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-08
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-09
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679241240586

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=SwimmingPool-PT-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 15:54:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 15:54:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 15:54:02] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-19 15:54:02] [INFO ] Transformed 9 places.
[2023-03-19 15:54:02] [INFO ] Transformed 7 transitions.
[2023-03-19 15:54:02] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 73 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 15:54:02] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-19 15:54:02] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-19 15:54:02] [INFO ] Invariant cache hit.
[2023-03-19 15:54:02] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-19 15:54:02] [INFO ] Invariant cache hit.
[2023-03-19 15:54:02] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 15:54:02] [INFO ] Flatten gal took : 11 ms
[2023-03-19 15:54:02] [INFO ] Flatten gal took : 3 ms
[2023-03-19 15:54:02] [INFO ] Input system was already deterministic with 7 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 52) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-19 15:54:04] [INFO ] Invariant cache hit.
[2023-03-19 15:54:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 15:54:04] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :10 sat :0 real:1
[2023-03-19 15:54:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 15:54:04] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2023-03-19 15:54:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 10 ms
FORMULA SwimmingPool-PT-03-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 2 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 5 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 7/9 places, 5/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 5 transitions.
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
FORMULA SwimmingPool-PT-03-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 6/9 places, 4/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 16 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 6/9 places, 4/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 4 transitions.
Finished random walk after 465 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=232 )
FORMULA SwimmingPool-PT-03-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 2 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 15 ms
[2023-03-19 15:54:04] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:04] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 10 ms.
[2023-03-19 15:54:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 7 transitions and 20 arcs took 1 ms.
Total runtime 2422 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: 9 NrTr: 7 NrArc: 20)

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

net check time: 0m 0.000sec

init dd package: 0m 2.847sec


RS generation: 0m15.668sec


-> reachability set: #nodes 141394 (1.4e+05) #states 32,209,356 (7)



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

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

abstracting: (1<=0)
states: 0
.abstracting: (p0<=23)
states: 27,339,876 (7)
.-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.078sec

checking: EG [EX [AX [p2<=p5]]]
normalized: EG [EX [~ [EX [~ [p2<=p5]]]]]

abstracting: (p2<=p5)
states: 17,494,428 (7)
...............................................................
EG iterations: 61
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.417sec

checking: AG [EX [AF [AX [~ [p8<=p5]]]]]
normalized: ~ [E [true U ~ [EX [~ [EG [EX [p8<=p5]]]]]]]

abstracting: (p8<=p5)
states: 2,139,144 (6)
...............................................
EG iterations: 46
.-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.838sec

checking: EG [p3<=p4]
normalized: EG [p3<=p4]

abstracting: (p3<=p4)
states: 10,041,086 (7)
........................................................................................................................................................
EG iterations: 152
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.732sec

checking: EF [AG [AX [EG [[p0<=p4 | p6<=36]]]]]
normalized: E [true U ~ [E [true U EX [~ [EG [[p0<=p4 | p6<=36]]]]]]]

abstracting: (p6<=36)
states: 31,734,336 (7)
abstracting: (p0<=p4)
states: 9,231,272 (6)
........................
EG iterations: 24
.-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.039sec

checking: EX [AG [EF [EG [[p0<=p5 & p5<=p2]]]]]
normalized: EX [~ [E [true U ~ [E [true U EG [[p0<=p5 & p5<=p2]]]]]]]

abstracting: (p5<=p2)
states: 16,886,916 (7)
abstracting: (p0<=p5)
states: 9,540,770 (6)
................................
EG iterations: 32
.-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.578sec

checking: AX [AF [E [p3<=p7 U EX [EF [p7<=p3]]]]]
normalized: ~ [EX [EG [~ [E [p3<=p7 U EX [E [true U p7<=p3]]]]]]]

abstracting: (p7<=p3)
states: 21,960,260 (7)
.abstracting: (p3<=p7)
states: 11,686,752 (7)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.331sec

checking: AF [[EF [[~ [41<=p6] & [~ [15<=p8] & ~ [48<=p3]]]] & p4<=0]]
normalized: ~ [EG [~ [[p4<=0 & E [true U [[~ [48<=p3] & ~ [15<=p8]] & ~ [41<=p6]]]]]]]

abstracting: (41<=p6)
states: 177,100 (5)
abstracting: (15<=p8)
states: 24,347,400 (7)
abstracting: (48<=p3)
states: 0
abstracting: (p4<=0)
states: 4,175,228 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.790sec

checking: ~ [E [EF [[~ [[EF [p6<=13] & p4<=19]] | AF [EX [12<=p8]]]] U EX [EG [AF [p7<=3]]]]]
normalized: ~ [E [E [true U [~ [EG [~ [EX [12<=p8]]]] | ~ [[p4<=19 & E [true U p6<=13]]]]] U EX [EG [~ [EG [~ [p7<=3]]]]]]]

abstracting: (p7<=3)
states: 9,969,915 (6)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (p6<=13)
states: 18,760,812 (7)
abstracting: (p4<=19)
states: 31,714,862 (7)
abstracting: (12<=p8)
states: 26,712,759 (7)
............................
EG iterations: 27
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.240sec

checking: EF [AX [[41<=p0 & [p5<=p8 & [~ [p1<=0] | [~ [p2<=0] | [~ [22<=p8] & ~ [p3<=p6]]]]]]]]
normalized: E [true U ~ [EX [~ [[41<=p0 & [p5<=p8 & [[[~ [p3<=p6] & ~ [22<=p8]] | ~ [p2<=0]] | ~ [p1<=0]]]]]]]]

abstracting: (p1<=0)
states: 3,983,264 (6)
abstracting: (p2<=0)
states: 4,175,228 (6)
abstracting: (22<=p8)
states: 17,325,490 (7)
abstracting: (p3<=p6)
states: 17,060,928 (7)
abstracting: (p5<=p8)
states: 30,542,540 (7)
abstracting: (41<=p0)
states: 177,100 (5)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.893sec

checking: E [AF [AX [AG [[p2<=p5 | p0<=23]]]] U AF [[~ [[p0<=p7 | ~ [p7<=p1]]] | 17<=p5]]]
normalized: E [~ [EG [EX [E [true U ~ [[p2<=p5 | p0<=23]]]]]] U ~ [EG [~ [[17<=p5 | ~ [[p0<=p7 | ~ [p7<=p1]]]]]]]]

abstracting: (p7<=p1)
states: 14,323,656 (7)
abstracting: (p0<=p7)
states: 10,854,432 (7)
abstracting: (17<=p5)
states: 1,390,872 (6)
.
EG iterations: 1
abstracting: (p0<=23)
states: 27,339,876 (7)
abstracting: (p2<=p5)
states: 17,494,428 (7)
.
EG iterations: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.950sec

checking: ~ [E [[EF [[AG [p6<=p2] | [p4<=19 | p0<=37]]] | [~ [[49<=p6 & p3<=54]] | EF [~ [26<=p5]]]] U ~ [[A [p8<=1 U p7<=p1] | [[p4<=51 & p5<=20] | p2<=p0]]]]]
normalized: ~ [E [[[E [true U ~ [26<=p5]] | ~ [[49<=p6 & p3<=54]]] | E [true U [[p4<=19 | p0<=37] | ~ [E [true U ~ [p6<=p2]]]]]] U ~ [[[p2<=p0 | [p4<=51 & p5<=20]] | [~ [EG [~ [p7<=p1]]] & ~ [E [~ [p7<=p1] U [~ [p8<=1] & ~ [p7<=p1]]]]]]]]]

abstracting: (p7<=p1)
states: 14,323,656 (7)
abstracting: (p8<=1)
states: 515,916 (5)
abstracting: (p7<=p1)
states: 14,323,656 (7)
abstracting: (p7<=p1)
states: 14,323,656 (7)
.
EG iterations: 1
abstracting: (p5<=20)
states: 31,811,816 (7)
abstracting: (p4<=51)
states: 32,209,356 (7)
abstracting: (p2<=p0)
states: 24,346,584 (7)
abstracting: (p6<=p2)
states: 9,231,272 (6)
abstracting: (p0<=37)
states: 31,832,616 (7)
abstracting: (p4<=19)
states: 31,714,862 (7)
abstracting: (p3<=54)
states: 32,209,356 (7)
abstracting: (49<=p6)
states: 12,376 (4)
abstracting: (26<=p5)
states: 36,540 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.591sec

checking: [EG [A [[p5<=7 & AX [EX [p3<=2]]] U [AX [1<=0] | [AF [p8<=5] | AX [p3<=p5]]]]] & E [[[EG [p0<=9] & p8<=p5] | [[AG [p0<=0] & ~ [[5<=p5 & p2<=p8]]] | [[EG [p0<=28] & [[EF [2<=p1] | [p5<=9 | p5<=p6]] & [~ [AG [p3<=2]] | AX [EX [p5<=7]]]]] & [[36<=p6 & p0<=p2] & [p4<=40 & p1<=p3]]]]] U ~ [[p7<=p4 | [~ [p8<=p2] & p6<=15]]]]]
normalized: [E [[[[[[p4<=40 & p1<=p3] & [36<=p6 & p0<=p2]] & [[[~ [EX [~ [EX [p5<=7]]]] | E [true U ~ [p3<=2]]] & [[p5<=9 | p5<=p6] | E [true U 2<=p1]]] & EG [p0<=28]]] | [~ [[5<=p5 & p2<=p8]] & ~ [E [true U ~ [p0<=0]]]]] | [p8<=p5 & EG [p0<=9]]] U ~ [[p7<=p4 | [p6<=15 & ~ [p8<=p2]]]]] & EG [[~ [EG [~ [[[~ [EX [~ [p3<=p5]]] | ~ [EG [~ [p8<=5]]]] | ~ [EX [~ [1<=0]]]]]]] & ~ [E [~ [[[~ [EX [~ [p3<=p5]]] | ~ [EG [~ [p8<=5]]]] | ~ [EX [~ [1<=0]]]]] U [~ [[p5<=7 & ~ [EX [~ [EX [p3<=2]]]]]] & ~ [[[~ [EX [~ [p3<=p5]]] | ~ [EG [~ [p8<=5]]]] | ~ [EX [~ [1<=0]]]]]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p8<=5)
states: 1,996,800 (6)
.
EG iterations: 1
abstracting: (p3<=p5)
states: 10,063,592 (7)
.abstracting: (p3<=2)
states: 5,008,608 (6)
..abstracting: (p5<=7)
states: 22,505,964 (7)
abstracting: (1<=0)
states: 0
.abstracting: (p8<=5)
states: 1,996,800 (6)
.
EG iterations: 1
abstracting: (p3<=p5)
states: 10,063,592 (7)
.abstracting: (1<=0)
states: 0
.abstracting: (p8<=5)
states: 1,996,800 (6)
.
EG iterations: 1
abstracting: (p3<=p5)
states: 10,063,592 (7)
..
EG iterations: 1
........................................................................................................................
EG iterations: 120
abstracting: (p8<=p2)
states: 3,609,280 (6)
abstracting: (p6<=15)
states: 20,847,236 (7)
abstracting: (p7<=p4)
states: 14,034,660 (7)
abstracting: (p0<=9)
states: 14,061,296 (7)
.
EG iterations: 1
abstracting: (p8<=p5)
states: 2,139,144 (6)
abstracting: (p0<=0)
states: 1,507,628 (6)
abstracting: (p2<=p8)
states: 29,077,132 (7)
abstracting: (5<=p5)
states: 15,866,487 (7)
abstracting: (p0<=28)
states: 29,890,556 (7)
.
EG iterations: 1
abstracting: (2<=p1)
states: 24,624,004 (7)
abstracting: (p5<=p6)
states: 23,975,868 (7)
abstracting: (p5<=9)
states: 25,458,038 (7)
abstracting: (p3<=2)
states: 5,008,608 (6)
abstracting: (p5<=7)
states: 22,505,964 (7)
..abstracting: (p0<=p2)
states: 9,231,272 (6)
abstracting: (36<=p6)
states: 593,775 (5)
abstracting: (p1<=p3)
states: 23,583,420 (7)
abstracting: (p4<=40)
states: 32,209,356 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.324sec

totally nodes used: 13772893 (1.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 519648589 53216497 572865086
used/not used/entry size/cache size: 39529408 27579456 16 1024MB
basic ops cache: hits/miss/sum: 194097506 38953558 233051064
used/not used/entry size/cache size: 15467338 1309878 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: 24825943 2669985 27495928
used/not used/entry size/cache size: 2123100 6265508 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 57910941
1 7236929
2 1237959
3 383666
4 140924
5 54894
6 31624
7 18110
8 13298
9 10503
>= 10 70016

Total processing time: 3m36.730sec


BK_STOP 1679241462464

--------------------
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:1507 (215), effective:360 (51)

initing FirstDep: 0m 0.000sec


iterations count:856 (122), effective:184 (26)

iterations count:844 (120), effective:277 (39)

iterations count:803 (114), effective:227 (32)

iterations count:397 (56), effective:60 (8)

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

iterations count:542 (77), effective:127 (18)

iterations count:289 (41), effective:47 (6)

iterations count:237 (33), effective:104 (14)

iterations count:403 (57), effective:79 (11)

iterations count:949 (135), effective:294 (42)

iterations count:514 (73), effective:179 (25)

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

iterations count:27 (3), effective:8 (1)

iterations count:131 (18), effective:50 (7)

iterations count:19 (2), effective:3 (0)

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

iterations count:1194 (170), effective:320 (45)

iterations count:89 (12), effective:20 (2)

iterations count:26 (3), effective:6 (0)

iterations count:51 (7), effective:12 (1)

iterations count:85 (12), effective:20 (2)

iterations count:418 (59), effective:130 (18)

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="SwimmingPool-PT-03"
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 SwimmingPool-PT-03, 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 r490-tall-167912708500337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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