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.r106-tall-167814483300882.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 DNAwalker-PT-02track12Block2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483300882
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 16 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K 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 DNAwalker-PT-02track12Block2-CTLFireability-00
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-01
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-02
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-03
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-04
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-05
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-06
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-07
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-08
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-09
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-10
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-11
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-12
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-13
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-14
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678498491976

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-02track12Block2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 01:34:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 01:34:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:34:53] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-11 01:34:53] [INFO ] Transformed 14 places.
[2023-03-11 01:34:53] [INFO ] Transformed 84 transitions.
[2023-03-11 01:34:53] [INFO ] Parsed PT model containing 14 places and 84 transitions and 244 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 14 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:53] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 14 cols
[2023-03-11 01:34:53] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-11 01:34:54] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
[2023-03-11 01:34:54] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:54] [INFO ] Invariant cache hit.
[2023-03-11 01:34:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 01:34:54] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:54] [INFO ] Invariant cache hit.
[2023-03-11 01:34:54] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 01:34:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-11 01:34:54] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:54] [INFO ] Invariant cache hit.
[2023-03-11 01:34:54] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 14/14 places, 84/84 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-11 01:34:54] [INFO ] Flatten gal took : 22 ms
[2023-03-11 01:34:54] [INFO ] Flatten gal took : 9 ms
[2023-03-11 01:34:54] [INFO ] Input system was already deterministic with 84 transitions.
Incomplete random walk after 10000 steps, including 1123 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 78) seen :69
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 197 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 176 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 190 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 187 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-11 01:34:55] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:55] [INFO ] Invariant cache hit.
[2023-03-11 01:34:55] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 01:34:56] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:34:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:34:56] [INFO ] Input system was already deterministic with 84 transitions.
Computed a total of 14 stabilizing places and 82 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:56] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:56] [INFO ] Invariant cache hit.
[2023-03-11 01:34:56] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:56] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:56] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:56] [INFO ] Invariant cache hit.
[2023-03-11 01:34:56] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:56] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 14 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:56] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:56] [INFO ] Invariant cache hit.
[2023-03-11 01:34:56] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 297 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:56] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:56] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:56] [INFO ] Invariant cache hit.
[2023-03-11 01:34:56] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:56] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:56] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:56] [INFO ] Invariant cache hit.
[2023-03-11 01:34:56] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 9 ms
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:56] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:56] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:56] [INFO ] Invariant cache hit.
[2023-03-11 01:34:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:56] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:56] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:56] [INFO ] Invariant cache hit.
[2023-03-11 01:34:56] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:56] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:56] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:56] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:56] [INFO ] Invariant cache hit.
[2023-03-11 01:34:57] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:57] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:57] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:57] [INFO ] Invariant cache hit.
[2023-03-11 01:34:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 2 ms
[2023-03-11 01:34:57] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:57] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:57] [INFO ] Invariant cache hit.
[2023-03-11 01:34:57] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:57] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:57] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:57] [INFO ] Invariant cache hit.
[2023-03-11 01:34:57] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:57] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:57] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:57] [INFO ] Invariant cache hit.
[2023-03-11 01:34:57] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:34:57] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:34:57] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:34:57] [INFO ] Invariant cache hit.
[2023-03-11 01:34:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 2 ms
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:57] [INFO ] Input system was already deterministic with 84 transitions.
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:57] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:34:57] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-11 01:34:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 84 transitions and 244 arcs took 1 ms.
Total runtime 3843 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 14 NrTr: 84 NrArc: 244)

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

net check time: 0m 0.000sec

init dd package: 0m 2.761sec


RS generation: 0m 0.027sec


-> reachability set: #nodes 123 (1.2e+02) #states 5,459 (3)



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

checking: AF [[2<=p11 & 1<=p13]]
normalized: ~ [EG [~ [[2<=p11 & 1<=p13]]]]

abstracting: (1<=p13)
states: 5,459 (3)
abstracting: (2<=p11)
states: 471
....
EG iterations: 4
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EX [E [[2<=p4 & 1<=p8] U AF [EX [[1<=p4 & 2<=p6]]]]]
normalized: EX [E [[2<=p4 & 1<=p8] U ~ [EG [~ [EX [[1<=p4 & 2<=p6]]]]]]]

abstracting: (2<=p6)
states: 314
abstracting: (1<=p4)
states: 1,850 (3)
..
EG iterations: 1
abstracting: (1<=p8)
states: 3,164 (3)
abstracting: (2<=p4)
states: 323
.-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [AG [EF [[[1<=p4 & 2<=p6] | [2<=p6 & 1<=p8]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U [[2<=p6 & 1<=p8] | [1<=p4 & 2<=p6]]]]]]]

abstracting: (2<=p6)
states: 314
abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (1<=p8)
states: 3,164 (3)
abstracting: (2<=p6)
states: 314
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EG [AX [[[AF [[p4<=0 | p10<=1]] | EG [[p3<=1 | p10<=0]]] | [p4<=1 | [p8<=0 | [2<=p4 & 1<=p10]]]]]]
normalized: EG [~ [EX [~ [[[[[2<=p4 & 1<=p10] | p8<=0] | p4<=1] | [EG [[p3<=1 | p10<=0]] | ~ [EG [~ [[p4<=0 | p10<=1]]]]]]]]]]

abstracting: (p10<=1)
states: 4,996 (3)
abstracting: (p4<=0)
states: 3,609 (3)
...
EG iterations: 3
abstracting: (p10<=0)
states: 2,927 (3)
abstracting: (p3<=1)
states: 4,996 (3)
.
EG iterations: 1
abstracting: (p4<=1)
states: 5,136 (3)
abstracting: (p8<=0)
states: 2,295 (3)
abstracting: (1<=p10)
states: 2,532 (3)
abstracting: (2<=p4)
states: 323
.
EG iterations: 0
-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [EX [[EG [[2<=p3 & 1<=p11]] & AF [[p10<=1 | p3<=0]]]] | EF [EG [[p7<=0 & [[p0<=1 | p1<=0] | [p3<=1 | p10<=0]]]]]]
normalized: [E [true U EG [[[[p3<=1 | p10<=0] | [p0<=1 | p1<=0]] & p7<=0]]] | EX [[~ [EG [~ [[p10<=1 | p3<=0]]]] & EG [[2<=p3 & 1<=p11]]]]]

abstracting: (1<=p11)
states: 2,849 (3)
abstracting: (2<=p3)
states: 463
....
EG iterations: 4
abstracting: (p3<=0)
states: 2,865 (3)
abstracting: (p10<=1)
states: 4,996 (3)
....
EG iterations: 4
.abstracting: (p7<=0)
states: 3,848 (3)
abstracting: (p1<=0)
states: 2,654 (3)
abstracting: (p0<=1)
states: 5,450 (3)
abstracting: (p10<=0)
states: 2,927 (3)
abstracting: (p3<=1)
states: 4,996 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: E [[1<=p6 & 2<=p8] U EG [A [[AX [[2<=p11 & 1<=p13]] & E [[1<=p6 & 2<=p8] U [2<=p10 & 1<=p12]]] U ~ [[1<=p4 & 2<=p6]]]]]
normalized: E [[1<=p6 & 2<=p8] U EG [[~ [E [[1<=p4 & 2<=p6] U [~ [[E [[1<=p6 & 2<=p8] U [2<=p10 & 1<=p12]] & ~ [EX [~ [[2<=p11 & 1<=p13]]]]]] & [1<=p4 & 2<=p6]]]] & ~ [EG [[1<=p4 & 2<=p6]]]]]]

abstracting: (2<=p6)
states: 314
abstracting: (1<=p4)
states: 1,850 (3)
..
EG iterations: 2
abstracting: (2<=p6)
states: 314
abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (1<=p13)
states: 5,459 (3)
abstracting: (2<=p11)
states: 471
.abstracting: (1<=p12)
states: 3,104 (3)
abstracting: (2<=p10)
states: 463
abstracting: (2<=p8)
states: 462
abstracting: (1<=p6)
states: 1,925 (3)
abstracting: (2<=p6)
states: 314
abstracting: (1<=p4)
states: 1,850 (3)
.
EG iterations: 1
abstracting: (2<=p8)
states: 462
abstracting: (1<=p6)
states: 1,925 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: A [AG [[AG [[[1<=p7 & 2<=p10] & [1<=p13 & [1<=p3 & 2<=p10]]]] & 2<=p9]] U [EF [AX [[2<=p2 & 1<=p4]]] | [2<=p4 & 1<=p9]]]
normalized: [~ [EG [~ [[[2<=p4 & 1<=p9] | E [true U ~ [EX [~ [[2<=p2 & 1<=p4]]]]]]]]] & ~ [E [~ [[[2<=p4 & 1<=p9] | E [true U ~ [EX [~ [[2<=p2 & 1<=p4]]]]]]] U [E [true U ~ [[~ [E [true U ~ [[[[1<=p3 & 2<=p10] & 1<=p13] & [1<=p7 & 2<=p10]]]]] & 2<=p9]]] & ~ [[[2<=p4 & 1<=p9] | E [true U ~ [EX [~ [[2<=p2 & 1<=p4]]]]]]]]]]]

abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (2<=p2)
states: 463
.abstracting: (1<=p9)
states: 5,459 (3)
abstracting: (2<=p4)
states: 323
abstracting: (2<=p9)
states: 748
abstracting: (2<=p10)
states: 463
abstracting: (1<=p7)
states: 1,611 (3)
abstracting: (1<=p13)
states: 5,459 (3)
abstracting: (2<=p10)
states: 463
abstracting: (1<=p3)
states: 2,594 (3)
abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (2<=p2)
states: 463
.abstracting: (1<=p9)
states: 5,459 (3)
abstracting: (2<=p4)
states: 323
abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (2<=p2)
states: 463
.abstracting: (1<=p9)
states: 5,459 (3)
abstracting: (2<=p4)
states: 323
..
EG iterations: 2
-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.166sec

checking: E [[~ [EG [EF [1<=p5]]] | [~ [A [AX [[2<=p0 & 1<=p4]] U AG [~ [[p3<=1 | p6<=0]]]]] | AX [~ [E [[2<=p3 & 1<=p12] U [2<=p0 & 1<=p10]]]]]] U ~ [EX [EF [[2<=p8 & 1<=p9]]]]]
normalized: E [[[~ [EX [E [[2<=p3 & 1<=p12] U [2<=p0 & 1<=p10]]]] | ~ [[~ [EG [E [true U [p3<=1 | p6<=0]]]] & ~ [E [E [true U [p3<=1 | p6<=0]] U [EX [~ [[2<=p0 & 1<=p4]]] & E [true U [p3<=1 | p6<=0]]]]]]]] | ~ [EG [E [true U 1<=p5]]]] U ~ [EX [E [true U [2<=p8 & 1<=p9]]]]]

abstracting: (1<=p9)
states: 5,459 (3)
abstracting: (2<=p8)
states: 462
.abstracting: (1<=p5)
states: 1,527 (3)
....
EG iterations: 4
abstracting: (p6<=0)
states: 3,534 (3)
abstracting: (p3<=1)
states: 4,996 (3)
abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (2<=p0)
states: 9
.abstracting: (p6<=0)
states: 3,534 (3)
abstracting: (p3<=1)
states: 4,996 (3)
abstracting: (p6<=0)
states: 3,534 (3)
abstracting: (p3<=1)
states: 4,996 (3)

EG iterations: 0
abstracting: (1<=p10)
states: 2,532 (3)
abstracting: (2<=p0)
states: 9
abstracting: (1<=p12)
states: 3,104 (3)
abstracting: (2<=p3)
states: 463
.-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: AX [[[1<=p1 & [2<=p10 & [EF [EX [[2<=p1 & 1<=p11]]] | [2<=p0 & 1<=p2]]]] | [AF [[AF [p5<=0] | 1<=p7]] & EX [[[p3<=0 | p6<=1] & p7<=0]]]]]
normalized: ~ [EX [~ [[[EX [[[p3<=0 | p6<=1] & p7<=0]] & ~ [EG [~ [[~ [EG [~ [p5<=0]]] | 1<=p7]]]]] | [[[[2<=p0 & 1<=p2] | E [true U EX [[2<=p1 & 1<=p11]]]] & 2<=p10] & 1<=p1]]]]]

abstracting: (1<=p1)
states: 2,805 (3)
abstracting: (2<=p10)
states: 463
abstracting: (1<=p11)
states: 2,849 (3)
abstracting: (2<=p1)
states: 425
.abstracting: (1<=p2)
states: 2,594 (3)
abstracting: (2<=p0)
states: 9
abstracting: (1<=p7)
states: 1,611 (3)
abstracting: (p5<=0)
states: 3,932 (3)
....
EG iterations: 4
.
EG iterations: 1
abstracting: (p7<=0)
states: 3,848 (3)
abstracting: (p6<=1)
states: 5,145 (3)
abstracting: (p3<=0)
states: 2,865 (3)
..-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: E [[[AF [[2<=p0 & 1<=p1]] & AX [[AX [1<=0] | ~ [[AX [[1<=p6 & 2<=p8]] & ~ [[1<=p3 & 2<=p4]]]]]]] & [2<=p6 & 1<=p9]] U A [AX [AX [[[1<=p2 & 2<=p12] | [2<=p0 & 1<=p10]]]] U ~ [AG [~ [AG [[1<=p1 & 2<=p2]]]]]]]
normalized: E [[[2<=p6 & 1<=p9] & [~ [EX [~ [[~ [[~ [[1<=p3 & 2<=p4]] & ~ [EX [~ [[1<=p6 & 2<=p8]]]]]] | ~ [EX [~ [1<=0]]]]]]] & ~ [EG [~ [[2<=p0 & 1<=p1]]]]]] U [~ [EG [~ [E [true U ~ [E [true U ~ [[1<=p1 & 2<=p2]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [[1<=p1 & 2<=p2]]]]]] U [EX [EX [~ [[[2<=p0 & 1<=p10] | [1<=p2 & 2<=p12]]]]] & ~ [E [true U ~ [E [true U ~ [[1<=p1 & 2<=p2]]]]]]]]]]]

abstracting: (2<=p2)
states: 463
abstracting: (1<=p1)
states: 2,805 (3)
abstracting: (2<=p12)
states: 471
abstracting: (1<=p2)
states: 2,594 (3)
abstracting: (1<=p10)
states: 2,532 (3)
abstracting: (2<=p0)
states: 9
..abstracting: (2<=p2)
states: 463
abstracting: (1<=p1)
states: 2,805 (3)
abstracting: (2<=p2)
states: 463
abstracting: (1<=p1)
states: 2,805 (3)

EG iterations: 0
abstracting: (1<=p1)
states: 2,805 (3)
abstracting: (2<=p0)
states: 9
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (2<=p8)
states: 462
abstracting: (1<=p6)
states: 1,925 (3)
.abstracting: (2<=p4)
states: 323
abstracting: (1<=p3)
states: 2,594 (3)
.abstracting: (1<=p9)
states: 5,459 (3)
abstracting: (2<=p6)
states: 314
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: [E [[1<=p4 & 2<=p8] U AF [E [[[[2<=p0 & 1<=p3] | [1<=p1 & 2<=p10]] & AG [2<=p9]] U [EF [[2<=p2 & 1<=p4]] | A [[1<=p3 & 2<=p8] U [1<=p10 & 2<=p11]]]]]] & EX [EG [1<=p7]]]
normalized: [EX [EG [1<=p7]] & E [[1<=p4 & 2<=p8] U ~ [EG [~ [E [[~ [E [true U ~ [2<=p9]]] & [[1<=p1 & 2<=p10] | [2<=p0 & 1<=p3]]] U [[~ [EG [~ [[1<=p10 & 2<=p11]]]] & ~ [E [~ [[1<=p10 & 2<=p11]] U [~ [[1<=p3 & 2<=p8]] & ~ [[1<=p10 & 2<=p11]]]]]] | E [true U [2<=p2 & 1<=p4]]]]]]]]]

abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (2<=p2)
states: 463
abstracting: (2<=p11)
states: 471
abstracting: (1<=p10)
states: 2,532 (3)
abstracting: (2<=p8)
states: 462
abstracting: (1<=p3)
states: 2,594 (3)
abstracting: (2<=p11)
states: 471
abstracting: (1<=p10)
states: 2,532 (3)
abstracting: (2<=p11)
states: 471
abstracting: (1<=p10)
states: 2,532 (3)
.
EG iterations: 1
abstracting: (1<=p3)
states: 2,594 (3)
abstracting: (2<=p0)
states: 9
abstracting: (2<=p10)
states: 463
abstracting: (1<=p1)
states: 2,805 (3)
abstracting: (2<=p9)
states: 748
.
EG iterations: 1
abstracting: (2<=p8)
states: 462
abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (1<=p7)
states: 1,611 (3)
....
EG iterations: 4
.-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: EX [[[AG [EF [[p3<=0 | p10<=1]]] | [AX [[E [[1<=p1 & 2<=p4] U [1<=p2 & 2<=p10]] | AG [[1<=p3 & 2<=p11]]]] | [1<=p4 & [2<=p12 & [[EG [[2<=p0 & 1<=p4]] | EG [[2<=p1 & 1<=p2]]] | [p13<=1 | A [EG [[1<=p2 & 2<=p11]] U [[1<=p4 & 2<=p10] | [1<=p1 & 2<=p11]]]]]]]]] & [[2<=p3 & 1<=p8] | [AF [AX [[p2<=0 | p11<=1]]] & [2<=p4 & 1<=p6]]]]]
normalized: EX [[[[[2<=p4 & 1<=p6] & ~ [EG [EX [~ [[p2<=0 | p11<=1]]]]]] | [2<=p3 & 1<=p8]] & [[[[[[[~ [EG [~ [[[1<=p1 & 2<=p11] | [1<=p4 & 2<=p10]]]]] & ~ [E [~ [[[1<=p1 & 2<=p11] | [1<=p4 & 2<=p10]]] U [~ [EG [[1<=p2 & 2<=p11]]] & ~ [[[1<=p1 & 2<=p11] | [1<=p4 & 2<=p10]]]]]]] | p13<=1] | [EG [[2<=p1 & 1<=p2]] | EG [[2<=p0 & 1<=p4]]]] & 2<=p12] & 1<=p4] | ~ [EX [~ [[~ [E [true U ~ [[1<=p3 & 2<=p11]]]] | E [[1<=p1 & 2<=p4] U [1<=p2 & 2<=p10]]]]]]] | ~ [E [true U ~ [E [true U [p3<=0 | p10<=1]]]]]]]]

abstracting: (p10<=1)
states: 4,996 (3)
abstracting: (p3<=0)
states: 2,865 (3)
abstracting: (2<=p10)
states: 463
abstracting: (1<=p2)
states: 2,594 (3)
abstracting: (2<=p4)
states: 323
abstracting: (1<=p1)
states: 2,805 (3)
abstracting: (2<=p11)
states: 471
abstracting: (1<=p3)
states: 2,594 (3)
.abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (2<=p12)
states: 471
abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (2<=p0)
states: 9
...
EG iterations: 3
abstracting: (1<=p2)
states: 2,594 (3)
abstracting: (2<=p1)
states: 425
....
EG iterations: 4
abstracting: (p13<=1)
states: 4,612 (3)
abstracting: (2<=p10)
states: 463
abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (2<=p11)
states: 471
abstracting: (1<=p1)
states: 2,805 (3)
abstracting: (2<=p11)
states: 471
abstracting: (1<=p2)
states: 2,594 (3)
....
EG iterations: 4
abstracting: (2<=p10)
states: 463
abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (2<=p11)
states: 471
abstracting: (1<=p1)
states: 2,805 (3)
abstracting: (2<=p10)
states: 463
abstracting: (1<=p4)
states: 1,850 (3)
abstracting: (2<=p11)
states: 471
abstracting: (1<=p1)
states: 2,805 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 3,164 (3)
abstracting: (2<=p3)
states: 463
abstracting: (p11<=1)
states: 4,988 (3)
abstracting: (p2<=0)
states: 2,865 (3)
..........
EG iterations: 9
abstracting: (1<=p6)
states: 1,925 (3)
abstracting: (2<=p4)
states: 323
.-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: E [[AF [[[EF [[2<=p3 & 1<=p12]] | ~ [AX [[1<=p3 & 2<=p8]]]] & [~ [EG [[2<=p4 & 1<=p6]]] & EX [[1<=p1 & 2<=p6]]]]] | 2<=p9] U [E [[~ [[[1<=p1 & 2<=p3] | [1<=p2 & 2<=p6]]] & [AG [[2<=p11 & 1<=p13]] & [[2<=p12 & 1<=p2] | EG [[1<=p2 & 2<=p6]]]]] U [[[[[1<=p3 & 2<=p11] | [1<=p2 & 2<=p6]] & EG [[1<=p3 & 2<=p4]]] | [~ [[1<=p3 & 2<=p11]] & [2<=p4 & 1<=p9]]] & AX [1<=0]]] & AX [~ [[[E [[2<=p11 & 1<=p12] U [1<=p2 & 2<=p11]] & A [[1<=p2 & 2<=p12] U [2<=p4 & 1<=p9]]] & [1<=p1 & 2<=p11]]]]]]
normalized: E [[~ [EG [~ [[[EX [[1<=p1 & 2<=p6]] & ~ [EG [[2<=p4 & 1<=p6]]]] & [EX [~ [[1<=p3 & 2<=p8]]] | E [true U [2<=p3 & 1<=p12]]]]]]] | 2<=p9] U [~ [EX [[[1<=p1 & 2<=p11] & [[~ [EG [~ [[2<=p4 & 1<=p9]]]] & ~ [E [~ [[2<=p4 & 1<=p9]] U [~ [[1<=p2 & 2<=p12]] & ~ [[2<=p4 & 1<=p9]]]]]] & E [[2<=p11 & 1<=p12] U [1<=p2 & 2<=p11]]]]]] & E [[[[EG [[1<=p2 & 2<=p6]] | [2<=p12 & 1<=p2]] & ~ [E [true U ~ [[2<=p11 & 1<=p13]]]]] & ~ [[[1<=p2 & 2<=p6] | [1<=p1 & 2<=p3]]]] U [~ [EX [~ [1<=0]]] & [[[2<=p4 & 1<=p9] & ~ [[1<=p3 & 2<=p11]]] | [EG [[1<=p3 & 2<=p4]] & [[1<=p2 & 2<=p6] | [1<=p3 & 2<=p11]]]]]]]]

abstracting: (2<=p11)
states: 471
abstracting: (1<=p3)
states: 2,594 (3)
abstracting: (2<=p6)
states: 314
abstracting: (1<=p2)
states: 2,594 (3)
abstracting: (2<=p4)
states: 323
abstracting: (1<=p3)
states: 2,594 (3)
...
EG iterations: 3
abstracting: (2<=p11)
states: 471
abstracting: (1<=p3)
states: 2,594 (3)
abstracting: (1<=p9)
states: 5,459 (3)
abstracting: (2<=p4)
states: 323
abstracting: (1<=0)
states: 0
.abstracting: (2<=p3)
states: 463
abstracting: (1<=p1)
states: 2,805 (3)
abstracting: (2<=p6)
states: 314
abstracting: (1<=p2)
states: 2,594 (3)
abstracting: (1<=p13)
states: 5,459 (3)
abstracting: (2<=p11)
states: 471
abstracting: (1<=p2)
states: 2,594 (3)
abstracting: (2<=p12)
states: 471
abstracting: (2<=p6)
states: 314
abstracting: (1<=p2)
states: 2,594 (3)
...
EG iterations: 3
abstracting: (2<=p11)
states: 471
abstracting: (1<=p2)
states: 2,594 (3)
abstracting: (1<=p12)
states: 3,104 (3)
abstracting: (2<=p11)
states: 471
abstracting: (1<=p9)
states: 5,459 (3)
abstracting: (2<=p4)
states: 323
abstracting: (2<=p12)
states: 471
abstracting: (1<=p2)
states: 2,594 (3)
abstracting: (1<=p9)
states: 5,459 (3)
abstracting: (2<=p4)
states: 323
abstracting: (1<=p9)
states: 5,459 (3)
abstracting: (2<=p4)
states: 323
....
EG iterations: 4
abstracting: (2<=p11)
states: 471
abstracting: (1<=p1)
states: 2,805 (3)
.abstracting: (2<=p9)
states: 748
abstracting: (1<=p12)
states: 3,104 (3)
abstracting: (2<=p3)
states: 463
abstracting: (2<=p8)
states: 462
abstracting: (1<=p3)
states: 2,594 (3)
.abstracting: (1<=p6)
states: 1,925 (3)
abstracting: (2<=p4)
states: 323
..
EG iterations: 2
abstracting: (2<=p6)
states: 314
abstracting: (1<=p1)
states: 2,805 (3)
..
EG iterations: 1
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

totally nodes used: 215763 (2.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 406920 547000 953920
used/not used/entry size/cache size: 713710 66395154 16 1024MB
basic ops cache: hits/miss/sum: 233721 173551 407272
used/not used/entry size/cache size: 332885 16444331 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: 1652 1591 3243
used/not used/entry size/cache size: 1591 8387017 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 66922723
1 170242
2 10943
3 2391
4 897
5 526
6 345
7 239
8 201
9 48
>= 10 309

Total processing time: 0m 4.747sec


BK_STOP 1678498503123

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:11678 (139), effective:561 (6)

initing FirstDep: 0m 0.000sec


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

iterations count:581 (6), effective:24 (0)

iterations count:555 (6), effective:19 (0)

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

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

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

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

iterations count:12650 (150), effective:554 (6)

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

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

iterations count:12650 (150), effective:554 (6)

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

iterations count:12650 (150), effective:554 (6)

iterations count:975 (11), effective:37 (0)

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

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

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

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

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

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

iterations count:965 (11), effective:37 (0)

iterations count:407 (4), effective:12 (0)

iterations count:170 (2), effective:7 (0)

iterations count:170 (2), effective:7 (0)

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

iterations count:170 (2), effective:7 (0)

iterations count:554 (6), effective:21 (0)

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

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

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

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

iterations count:296 (3), effective:7 (0)

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

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

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

iterations count:408 (4), effective:10 (0)

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

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

iterations count:824 (9), effective:36 (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="DNAwalker-PT-02track12Block2"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DNAwalker-PT-02track12Block2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814483300882"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-02track12Block2.tgz
mv DNAwalker-PT-02track12Block2 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;