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.r234-tall-167856420000249.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 Kanban-PT-00020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:22 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 Kanban-PT-00020-CTLCardinality-00
FORMULA_NAME Kanban-PT-00020-CTLCardinality-01
FORMULA_NAME Kanban-PT-00020-CTLCardinality-02
FORMULA_NAME Kanban-PT-00020-CTLCardinality-03
FORMULA_NAME Kanban-PT-00020-CTLCardinality-04
FORMULA_NAME Kanban-PT-00020-CTLCardinality-05
FORMULA_NAME Kanban-PT-00020-CTLCardinality-06
FORMULA_NAME Kanban-PT-00020-CTLCardinality-07
FORMULA_NAME Kanban-PT-00020-CTLCardinality-08
FORMULA_NAME Kanban-PT-00020-CTLCardinality-09
FORMULA_NAME Kanban-PT-00020-CTLCardinality-10
FORMULA_NAME Kanban-PT-00020-CTLCardinality-11
FORMULA_NAME Kanban-PT-00020-CTLCardinality-12
FORMULA_NAME Kanban-PT-00020-CTLCardinality-13
FORMULA_NAME Kanban-PT-00020-CTLCardinality-14
FORMULA_NAME Kanban-PT-00020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679466487984

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=Kanban-PT-00020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 06:28:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:28:09] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-22 06:28:09] [INFO ] Transformed 16 places.
[2023-03-22 06:28:09] [INFO ] Transformed 16 transitions.
[2023-03-22 06:28:09] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Kanban-PT-00020-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 06:28:09] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-22 06:28:09] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-22 06:28:09] [INFO ] Invariant cache hit.
[2023-03-22 06:28:09] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-22 06:28:09] [INFO ] Invariant cache hit.
[2023-03-22 06:28:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 14 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 5 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 97) seen :95
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-22 06:28:10] [INFO ] Invariant cache hit.
[2023-03-22 06:28:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 06:28:10] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 06:28:10] [INFO ] After 30ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 3 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 13 transition count 14
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Applied a total of 3 rules in 7 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 13/16 places, 14/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/16 places, 15/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 3 place count 11 transition count 12
Applied a total of 3 rules in 3 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 11/16 places, 12/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 0 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
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 5 place count 10 transition count 11
Applied a total of 5 rules in 2 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:10] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:28:10] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 06:28:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 16 transitions and 40 arcs took 1 ms.
Total runtime 1120 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: 16 NrTr: 16 NrArc: 40)

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

net check time: 0m 0.000sec

init dd package: 0m 2.735sec


RS generation: 0m 0.011sec


-> reachability set: #nodes 696 (7.0e+02) #states 805,422,366,595 (11)



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

checking: AG [E [p2<=9 U p9<=16]]
normalized: ~ [E [true U ~ [E [p2<=9 U p9<=16]]]]

abstracting: (p9<=16)
states: 796,326,687,695 (11)
abstracting: (p2<=9)
states: 641,267,317,537 (11)
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: EG [AF [[p2<=p7 & 17<=p14]]]
normalized: EG [~ [EG [~ [[p2<=p7 & 17<=p14]]]]]

abstracting: (17<=p14)
states: 13,521,197,151 (10)
abstracting: (p2<=p7)
states: 402,700,653,817 (11)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EX [AG [[AX [AX [~ [p0<=14]]] | [EG [17<=p1] & p13<=p9]]]]
normalized: EX [~ [E [true U ~ [[[EG [17<=p1] & p13<=p9] | ~ [EX [EX [p0<=14]]]]]]]]

abstracting: (p0<=14)
states: 802,875,576,503 (11)
..abstracting: (p13<=p9)
states: 541,908,899,224 (11)
abstracting: (17<=p1)
states: 13,521,197,151 (10)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EX [AG [[~ [p0<=11] | [~ [p1<=p4] & ~ [9<=p2]]]]]
normalized: EX [~ [E [true U ~ [[[~ [9<=p2] & ~ [p1<=p4]] | ~ [p0<=11]]]]]]

abstracting: (p0<=11)
states: 790,000,486,198 (11)
abstracting: (p1<=p4)
states: 402,700,653,817 (11)
abstracting: (9<=p2)
states: 204,072,533,665 (11)
.-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[EX [~ [p9<=16]] & [AG [~ [p14<=15]] & EF [~ [p14<=p13]]]]]
normalized: E [true U [[E [true U ~ [p14<=p13]] & ~ [E [true U p14<=15]]] & EX [~ [p9<=16]]]]

abstracting: (p9<=16)
states: 796,326,687,695 (11)
.abstracting: (p14<=15)
states: 782,303,659,984 (11)
abstracting: (p14<=p13)
states: 318,339,352,177 (11)
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [~ [E [p5<=14 U [EG [8<=p11] & [7<=p9 & [[p15<=19 & 9<=p14] | p3<=19]]]]]]
normalized: E [true U ~ [E [p5<=14 U [[[[p15<=19 & 9<=p14] | p3<=19] & 7<=p9] & EG [8<=p11]]]]]

abstracting: (8<=p11)
states: 206,926,694,975 (11)
.
EG iterations: 1
abstracting: (7<=p9)
states: 254,679,009,200 (11)
abstracting: (p3<=19)
states: 804,697,848,724 (11)
abstracting: (9<=p14)
states: 204,072,533,665 (11)
abstracting: (p15<=19)
states: 804,697,848,724 (11)
abstracting: (p5<=14)
states: 779,954,465,675 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.136sec

checking: E [[AG [p9<=p13] & ~ [AX [[18<=p14 & p3<=13]]]] U AX [E [p14<=p4 U 13<=p1]]]
normalized: E [[EX [~ [[18<=p14 & p3<=13]]] & ~ [E [true U ~ [p9<=p13]]]] U ~ [EX [~ [E [p14<=p4 U 13<=p1]]]]]

abstracting: (13<=p1)
states: 73,900,822,842 (10)
abstracting: (p14<=p4)
states: 402,700,653,817 (11)
.abstracting: (p9<=p13)
states: 341,941,966,828 (11)
abstracting: (p3<=13)
states: 752,466,696,751 (11)
abstracting: (18<=p14)
states: 6,918,988,846 (9)
.-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.343sec

checking: AG [[[EF [AG [14<=p12]] | EX [[~ [8<=p7] & ~ [5<=p14]]]] | [AG [AF [p3<=3]] | EG [E [~ [E [p13<=12 U 15<=p10]] U [EG [18<=p0] | EF [p4<=0]]]]]]]
normalized: ~ [E [true U ~ [[[EG [E [~ [E [p13<=12 U 15<=p10]] U [E [true U p4<=0] | EG [18<=p0]]]] | ~ [E [true U EG [~ [p3<=3]]]]] | [EX [[~ [5<=p14] & ~ [8<=p7]]] | E [true U ~ [E [true U ~ [14<=p12]]]]]]]]]

abstracting: (14<=p12)
states: 52,955,669,844 (10)
abstracting: (8<=p7)
states: 206,926,694,975 (11)
abstracting: (5<=p14)
states: 416,531,910,564 (11)
.abstracting: (p3<=3)
states: 322,187,765,284 (11)
.
EG iterations: 1
abstracting: (18<=p0)
states: 144,276,286 (8)
.
EG iterations: 1
abstracting: (p4<=0)
states: 105,055,091,295 (11)
abstracting: (15<=p10)
states: 25,467,900,920 (10)
abstracting: (p13<=12)
states: 796,351,779,223 (11)

EG iterations: 0
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: EX [~ [E [A [18<=p14 U E [6<=p2 U p9<=p13]] U ~ [[[18<=p8 | [p9<=p2 | [p14<=11 & 1<=p4]]] & [~ [p5<=0] | EX [p1<=p4]]]]]]]
normalized: EX [~ [E [[~ [EG [~ [E [6<=p2 U p9<=p13]]]] & ~ [E [~ [E [6<=p2 U p9<=p13]] U [~ [18<=p14] & ~ [E [6<=p2 U p9<=p13]]]]]] U ~ [[[EX [p1<=p4] | ~ [p5<=0]] & [18<=p8 | [p9<=p2 | [p14<=11 & 1<=p4]]]]]]]]

abstracting: (1<=p4)
states: 700,367,275,300 (11)
abstracting: (p14<=11)
states: 706,163,418,268 (11)
abstracting: (p9<=p2)
states: 464,674,039,599 (11)
abstracting: (18<=p8)
states: 4,547,839,450 (9)
abstracting: (p5<=0)
states: 105,055,091,295 (11)
abstracting: (p1<=p4)
states: 402,700,653,817 (11)
.abstracting: (p9<=p13)
states: 341,941,966,828 (11)
abstracting: (6<=p2)
states: 355,321,128,008 (11)
abstracting: (18<=p14)
states: 6,918,988,846 (9)
abstracting: (p9<=p13)
states: 341,941,966,828 (11)
abstracting: (6<=p2)
states: 355,321,128,008 (11)
abstracting: (p9<=p13)
states: 341,941,966,828 (11)
abstracting: (6<=p2)
states: 355,321,128,008 (11)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.848sec

checking: [AG [EF [[10<=p12 & [~ [E [p7<=1 U p2<=8]] | [~ [4<=p13] | ~ [13<=p15]]]]]] & EG [AF [[p12<=p1 | [AX [8<=p6] & [AX [p8<=19] | [p11<=12 | p11<=p5]]]]]]]
normalized: [EG [~ [EG [~ [[p12<=p1 | [~ [EX [~ [8<=p6]]] & [~ [EX [~ [p8<=19]]] | [p11<=12 | p11<=p5]]]]]]]] & ~ [E [true U ~ [E [true U [10<=p12 & [[~ [13<=p15] | ~ [4<=p13]] | ~ [E [p7<=1 U p2<=8]]]]]]]]]

abstracting: (p2<=8)
states: 601,349,832,930 (11)
abstracting: (p7<=1)
states: 200,559,719,745 (11)
abstracting: (4<=p13)
states: 294,803,498,913 (11)
abstracting: (13<=p15)
states: 73,900,822,842 (10)
abstracting: (10<=p12)
states: 164,155,049,058 (11)
abstracting: (p11<=p5)
states: 435,683,019,310 (11)
abstracting: (p11<=12)
states: 750,848,293,195 (11)
abstracting: (p8<=19)
states: 804,967,582,650 (11)
.abstracting: (8<=p6)
states: 206,926,694,975 (11)
.abstracting: (p12<=p1)
states: 433,261,686,858 (11)
......................
EG iterations: 22
......................
EG iterations: 22
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.220sec

checking: E [~ [16<=p5] U [~ [[EF [17<=p10] | AX [[~ [p13<=19] & [p3<=p11 | p7<=p2]]]]] | AG [[[[~ [p14<=p6] & ~ [p12<=p0]] | p9<=p14] & ~ [[~ [p7<=17] | [p11<=p2 | 3<=p15]]]]]]]
normalized: E [~ [16<=p5] U [~ [E [true U ~ [[~ [[[p11<=p2 | 3<=p15] | ~ [p7<=17]]] & [p9<=p14 | [~ [p12<=p0] & ~ [p14<=p6]]]]]]] | ~ [[~ [EX [~ [[[p3<=p11 | p7<=p2] & ~ [p13<=19]]]]] | E [true U 17<=p10]]]]]

abstracting: (17<=p10)
states: 9,095,678,900 (9)
abstracting: (p13<=19)
states: 805,419,230,154 (11)
abstracting: (p7<=p2)
states: 464,674,039,599 (11)
abstracting: (p3<=p11)
states: 402,700,653,817 (11)
.abstracting: (p14<=p6)
states: 402,700,653,817 (11)
abstracting: (p12<=p0)
states: 318,339,352,177 (11)
abstracting: (p9<=p14)
states: 464,674,039,599 (11)
abstracting: (p7<=17)
states: 800,874,527,145 (11)
abstracting: (3<=p15)
states: 555,460,564,659 (11)
abstracting: (p11<=p2)
states: 464,674,039,599 (11)
abstracting: (16<=p5)
states: 15,917,438,075 (10)
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.110sec

checking: [AX [[[A [AG [8<=p4] U ~ [2<=p15]] | [13<=p5 | AX [p7<=3]]] | [AF [p1<=p5] | [EG [AG [20<=p7]] | A [[p15<=6 & 16<=p4] U AG [~ [13<=p10]]]]]]] & [AX [EX [8<=p1]] | ~ [E [[[EG [p7<=p2] | E [9<=p1 U 20<=p11]] & AG [p8<=4]] U [~ [[p10<=9 | 20<=p11]] & EF [11<=p14]]]]]]
normalized: [[~ [E [[~ [E [true U ~ [p8<=4]]] & [E [9<=p1 U 20<=p11] | EG [p7<=p2]]] U [E [true U 11<=p14] & ~ [[p10<=9 | 20<=p11]]]]] | ~ [EX [~ [EX [8<=p1]]]]] & ~ [EX [~ [[[[[~ [EG [E [true U 13<=p10]]] & ~ [E [E [true U 13<=p10] U [~ [[p15<=6 & 16<=p4]] & E [true U 13<=p10]]]]] | EG [~ [E [true U ~ [20<=p7]]]]] | ~ [EG [~ [p1<=p5]]]] | [[13<=p5 | ~ [EX [~ [p7<=3]]]] | [~ [EG [2<=p15]] & ~ [E [2<=p15 U [2<=p15 & E [true U ~ [8<=p4]]]]]]]]]]]]

abstracting: (8<=p4)
states: 206,926,694,975 (11)
abstracting: (2<=p15)
states: 633,228,619,254 (11)
abstracting: (2<=p15)
states: 633,228,619,254 (11)
abstracting: (2<=p15)
states: 633,228,619,254 (11)
.
EG iterations: 1
abstracting: (p7<=3)
states: 364,736,723,890 (11)
.abstracting: (13<=p5)
states: 54,574,073,400 (10)
abstracting: (p1<=p5)
states: 402,700,653,817 (11)
......................
EG iterations: 22
abstracting: (20<=p7)
states: 454,783,945 (8)
.
EG iterations: 1
abstracting: (13<=p10)
states: 54,574,073,400 (10)
abstracting: (16<=p4)
states: 15,917,438,075 (10)
abstracting: (p15<=6)
states: 505,867,159,567 (11)
abstracting: (13<=p10)
states: 54,574,073,400 (10)
abstracting: (13<=p10)
states: 54,574,073,400 (10)

EG iterations: 0
.abstracting: (8<=p1)
states: 249,168,282,363 (11)
..abstracting: (20<=p11)
states: 454,783,945 (8)
abstracting: (p10<=9)
states: 675,354,158,325 (11)
abstracting: (11<=p14)
states: 129,274,688,697 (11)
abstracting: (p7<=p2)
states: 464,674,039,599 (11)
......................
EG iterations: 22
abstracting: (20<=p11)
states: 454,783,945 (8)
abstracting: (9<=p1)
states: 204,072,533,665 (11)
abstracting: (p8<=4)
states: 434,318,667,475 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.154sec

checking: AG [[[[EG [8<=p10] | EF [[[AF [p10<=p13] | 8<=p14] | [p1<=p6 | ~ [p15<=15]]]]] | [AG [~ [5<=p13]] | E [AG [p9<=p8] U [~ [p8<=13] & ~ [19<=p8]]]]] | [[p1<=p15 | 12<=p2] | [8<=p7 | [EG [[15<=p8 | 14<=p6]] & [EG [6<=p4] | EG [p7<=p0]]]]]]]
normalized: ~ [E [true U ~ [[[[8<=p7 | [[EG [p7<=p0] | EG [6<=p4]] & EG [[15<=p8 | 14<=p6]]]] | [p1<=p15 | 12<=p2]] | [[E [~ [E [true U ~ [p9<=p8]]] U [~ [19<=p8] & ~ [p8<=13]]] | ~ [E [true U 5<=p13]]] | [E [true U [[p1<=p6 | ~ [p15<=15]] | [8<=p14 | ~ [EG [~ [p10<=p13]]]]]] | EG [8<=p10]]]]]]]

abstracting: (8<=p10)
states: 206,926,694,975 (11)
.
EG iterations: 1
abstracting: (p10<=p13)
states: 341,941,966,828 (11)
..
EG iterations: 2
abstracting: (8<=p14)
states: 249,168,282,363 (11)
abstracting: (p15<=15)
states: 782,303,659,984 (11)
abstracting: (p1<=p6)
states: 402,700,653,817 (11)
abstracting: (5<=p13)
states: 221,382,551,544 (11)
abstracting: (p8<=13)
states: 767,220,515,215 (11)
abstracting: (19<=p8)
states: 1,819,135,780 (9)
abstracting: (p9<=p8)
states: 430,225,611,970 (11)
abstracting: (12<=p2)
states: 99,258,948,327 (10)
abstracting: (p1<=p15)
states: 433,261,686,858 (11)
abstracting: (14<=p6)
states: 38,201,851,380 (10)
abstracting: (15<=p8)
states: 25,467,900,920 (10)
.
EG iterations: 1
abstracting: (6<=p4)
states: 309,253,082,600 (11)
.
EG iterations: 1
abstracting: (p7<=p0)
states: 341,941,966,828 (11)
.
EG iterations: 1
abstracting: (8<=p7)
states: 206,926,694,975 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.703sec

checking: A [[~ [[AF [[~ [p6<=7] | [3<=p12 & p4<=13]]] & ~ [1<=p6]]] & [EX [E [p4<=10 U p11<=p6]] | [[AF [E [p10<=p12 U 2<=p15]] & [AG [p5<=19] | EF [14<=p8]]] | [AG [~ [[18<=p10 | 9<=p14]]] & [14<=p5 & AF [[18<=p8 & 16<=p4]]]]]]] U EF [[EG [AG [p3<=12]] | [AG [~ [p10<=8]] & E [E [7<=p6 U p3<=p15] U [19<=p2 & 13<=p11]]]]]]
normalized: [~ [EG [~ [E [true U [[E [E [7<=p6 U p3<=p15] U [19<=p2 & 13<=p11]] & ~ [E [true U p10<=8]]] | EG [~ [E [true U ~ [p3<=12]]]]]]]]] & ~ [E [~ [E [true U [[E [E [7<=p6 U p3<=p15] U [19<=p2 & 13<=p11]] & ~ [E [true U p10<=8]]] | EG [~ [E [true U ~ [p3<=12]]]]]]] U [~ [[[[[[14<=p5 & ~ [EG [~ [[18<=p8 & 16<=p4]]]]] & ~ [E [true U [18<=p10 | 9<=p14]]]] | [[E [true U 14<=p8] | ~ [E [true U ~ [p5<=19]]]] & ~ [EG [~ [E [p10<=p12 U 2<=p15]]]]]] | EX [E [p4<=10 U p11<=p6]]] & ~ [[~ [1<=p6] & ~ [EG [~ [[[3<=p12 & p4<=13] | ~ [p6<=7]]]]]]]]] & ~ [E [true U [[E [E [7<=p6 U p3<=p15] U [19<=p2 & 13<=p11]] & ~ [E [true U p10<=8]]] | EG [~ [E [true U ~ [p3<=12]]]]]]]]]]]

abstracting: (p3<=12)
states: 731,521,543,753 (11)
.
EG iterations: 1
abstracting: (p10<=8)
states: 639,881,010,615 (11)
abstracting: (13<=p11)
states: 54,574,073,400 (10)
abstracting: (19<=p2)
states: 2,832,206,223 (9)
abstracting: (p3<=p15)
states: 433,261,686,858 (11)
abstracting: (7<=p6)
states: 254,679,009,200 (11)
abstracting: (p6<=7)
states: 598,495,671,620 (11)
abstracting: (p4<=13)
states: 767,220,515,215 (11)
abstracting: (3<=p12)
states: 555,460,564,659 (11)
.
EG iterations: 1
abstracting: (1<=p6)
states: 700,367,275,300 (11)
abstracting: (p11<=p6)
states: 435,683,019,310 (11)
abstracting: (p4<=10)
states: 705,369,898,695 (11)
.abstracting: (2<=p15)
states: 633,228,619,254 (11)
abstracting: (p10<=p12)
states: 464,674,039,599 (11)
..
EG iterations: 2
abstracting: (p5<=19)
states: 804,967,582,650 (11)
abstracting: (14<=p8)
states: 38,201,851,380 (10)
abstracting: (9<=p14)
states: 204,072,533,665 (11)
abstracting: (18<=p10)
states: 4,547,839,450 (9)
abstracting: (16<=p4)
states: 15,917,438,075 (10)
abstracting: (18<=p8)
states: 4,547,839,450 (9)
.
EG iterations: 1
abstracting: (14<=p5)
states: 38,201,851,380 (10)
abstracting: (p3<=12)
states: 731,521,543,753 (11)
.
EG iterations: 1
abstracting: (p10<=8)
states: 639,881,010,615 (11)
abstracting: (13<=p11)
states: 54,574,073,400 (10)
abstracting: (19<=p2)
states: 2,832,206,223 (9)
abstracting: (p3<=p15)
states: 433,261,686,858 (11)
abstracting: (7<=p6)
states: 254,679,009,200 (11)
abstracting: (p3<=12)
states: 731,521,543,753 (11)
.
EG iterations: 1
abstracting: (p10<=8)
states: 639,881,010,615 (11)
abstracting: (13<=p11)
states: 54,574,073,400 (10)
abstracting: (19<=p2)
states: 2,832,206,223 (9)
abstracting: (p3<=p15)
states: 433,261,686,858 (11)
abstracting: (7<=p6)
states: 254,679,009,200 (11)

EG iterations: 0
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.506sec

checking: [[E [EF [p2<=3] U 8<=p8] & EF [AX [[~ [11<=p0] | p9<=p13]]]] & [EF [[EF [2<=p5] & A [AX [p11<=p0] U E [p9<=p15 U 10<=p11]]]] & [AF [[[~ [p15<=18] | ~ [20<=p15]] & [p8<=p12 | [p10<=7 & p3<=p7]]]] | E [[EG [[p7<=p5 & 7<=p4]] & [[EX [3<=p12] & [p7<=19 & AF [p12<=p13]]] | AG [~ [p11<=p0]]]] U [AG [[15<=p6 | ~ [p6<=p14]]] | EF [[EX [p2<=9] & E [p8<=p11 U p3<=p5]]]]]]]]
normalized: [[[E [[[~ [E [true U p11<=p0]] | [[p7<=19 & ~ [EG [~ [p12<=p13]]]] & EX [3<=p12]]] & EG [[p7<=p5 & 7<=p4]]] U [~ [E [true U ~ [[15<=p6 | ~ [p6<=p14]]]]] | E [true U [E [p8<=p11 U p3<=p5] & EX [p2<=9]]]]] | ~ [EG [~ [[[p8<=p12 | [p10<=7 & p3<=p7]] & [~ [20<=p15] | ~ [p15<=18]]]]]]] & E [true U [[~ [EG [~ [E [p9<=p15 U 10<=p11]]]] & ~ [E [~ [E [p9<=p15 U 10<=p11]] U [EX [~ [p11<=p0]] & ~ [E [p9<=p15 U 10<=p11]]]]]] & E [true U 2<=p5]]]] & [E [true U ~ [EX [~ [[p9<=p13 | ~ [11<=p0]]]]]] & E [E [true U p2<=3] U 8<=p8]]]

abstracting: (8<=p8)
states: 206,926,694,975 (11)
abstracting: (p2<=3)
states: 322,187,765,284 (11)
abstracting: (11<=p0)
states: 24,909,614,422 (10)
abstracting: (p9<=p13)
states: 341,941,966,828 (11)
.abstracting: (2<=p5)
states: 604,862,646,850 (11)
abstracting: (10<=p11)
states: 130,068,208,270 (11)
abstracting: (p9<=p15)
states: 464,674,039,599 (11)
abstracting: (p11<=p0)
states: 341,941,966,828 (11)
.abstracting: (10<=p11)
states: 130,068,208,270 (11)
abstracting: (p9<=p15)
states: 464,674,039,599 (11)
abstracting: (10<=p11)
states: 130,068,208,270 (11)
abstracting: (p9<=p15)
states: 464,674,039,599 (11)
.
EG iterations: 1
abstracting: (p15<=18)
states: 802,590,160,372 (11)
abstracting: (20<=p15)
states: 724,517,871 (8)
abstracting: (p3<=p7)
states: 402,700,653,817 (11)
abstracting: (p10<=7)
states: 598,495,671,620 (11)
abstracting: (p8<=p12)
states: 464,674,039,599 (11)
.............
EG iterations: 13
abstracting: (p2<=9)
states: 641,267,317,537 (11)
.abstracting: (p3<=p5)
states: 402,700,653,817 (11)
abstracting: (p8<=p11)
states: 430,225,611,970 (11)
abstracting: (p6<=p14)
states: 464,674,039,599 (11)
abstracting: (15<=p6)
states: 25,467,900,920 (10)
abstracting: (7<=p4)
states: 254,679,009,200 (11)
abstracting: (p7<=p5)
states: 430,225,611,970 (11)
.
EG iterations: 1
abstracting: (3<=p12)
states: 555,460,564,659 (11)
.abstracting: (p12<=p13)
states: 318,339,352,177 (11)
......................
EG iterations: 22
abstracting: (p7<=19)
states: 804,967,582,650 (11)
abstracting: (p11<=p0)
states: 341,941,966,828 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.348sec

totally nodes used: 2948318 (2.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 22535871 6345151 28881022
used/not used/entry size/cache size: 8300454 58808410 16 1024MB
basic ops cache: hits/miss/sum: 8335217 3100796 11436013
used/not used/entry size/cache size: 4243028 12534188 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: 181185 72171 253356
used/not used/entry size/cache size: 71936 8316672 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 64520262
1 2478308
2 82332
3 8557
4 3966
5 3134
6 2037
7 1691
8 1534
9 1232
>= 10 5811

Total processing time: 0m18.134sec


BK_STOP 1679466509650

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:1436 (89), effective:440 (27)

initing FirstDep: 0m 0.000sec


iterations count:148 (9), effective:36 (2)

iterations count:727 (45), effective:211 (13)

iterations count:107 (6), effective:28 (1)

iterations count:169 (10), effective:45 (2)

iterations count:143 (8), effective:42 (2)

iterations count:323 (20), effective:82 (5)

iterations count:431 (26), effective:127 (7)

iterations count:1233 (77), effective:367 (22)

iterations count:987 (61), effective:271 (16)

iterations count:324 (20), effective:83 (5)

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

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

iterations count:92 (5), effective:24 (1)

iterations count:76 (4), effective:20 (1)

iterations count:841 (52), effective:225 (14)

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

iterations count:436 (27), effective:114 (7)

iterations count:436 (27), effective:114 (7)

iterations count:156 (9), effective:42 (2)

iterations count:436 (27), effective:114 (7)

iterations count:500 (31), effective:189 (11)

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

iterations count:458 (28), effective:137 (8)

iterations count:696 (43), effective:187 (11)

iterations count:250 (15), effective:90 (5)

iterations count:55 (3), effective:13 (0)

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

iterations count:48 (3), effective:9 (0)

iterations count:536 (33), effective:143 (8)

iterations count:536 (33), effective:143 (8)

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

iterations count:536 (33), effective:143 (8)

iterations count:258 (16), effective:66 (4)

iterations count:1056 (66), effective:300 (18)

iterations count:206 (12), effective:55 (3)

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

iterations count:136 (8), effective:60 (3)

iterations count:206 (12), effective:60 (3)

iterations count:63 (3), effective:22 (1)

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

iterations count:263 (16), effective:78 (4)

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

iterations count:392 (24), effective:109 (6)

iterations count:2287 (142), effective:753 (47)

iterations count:998 (62), effective:285 (17)

iterations count:81 (5), effective:20 (1)

iterations count:1263 (78), effective:352 (22)

iterations count:548 (34), effective:154 (9)

iterations count:214 (13), effective:54 (3)

iterations count:263 (16), effective:78 (4)

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

iterations count:392 (24), effective:109 (6)

iterations count:2287 (142), effective:753 (47)

iterations count:262 (16), effective:82 (5)

iterations count:263 (16), effective:78 (4)

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

iterations count:392 (24), effective:109 (6)

iterations count:2287 (142), effective:753 (47)

iterations count:33 (2), effective:17 (1)

iterations count:320 (20), effective:88 (5)

iterations count:166 (10), effective:40 (2)

iterations count:111 (6), effective:28 (1)

iterations count:539 (33), effective:155 (9)

iterations count:539 (33), effective:155 (9)

iterations count:363 (22), effective:95 (5)

iterations count:539 (33), effective:155 (9)

iterations count:472 (29), effective:132 (8)

iterations count:746 (46), effective:201 (12)

iterations count:420 (26), effective:119 (7)

iterations count:56 (3), effective:20 (1)

iterations count:609 (38), effective:188 (11)

iterations count:16 (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="Kanban-PT-00020"
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 Kanban-PT-00020, 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 r234-tall-167856420000249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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