About the Execution of Marcie+red for PhaseVariation-PT-D02CS010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.688 | 10156.00 | 14293.00 | 470.10 | FTTFFTTTTFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r298-tall-167873951100002.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 PhaseVariation-PT-D02CS010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951100002
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Feb 26 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 73K 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 PhaseVariation-PT-D02CS010-CTLFireability-00
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-01
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-02
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-03
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-04
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-05
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-06
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-07
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-08
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-09
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-10
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-11
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-12
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-13
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-14
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679432721417
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=PhaseVariation-PT-D02CS010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 21:05:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 21:05:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:05:23] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-21 21:05:23] [INFO ] Transformed 14 places.
[2023-03-21 21:05:23] [INFO ] Transformed 65 transitions.
[2023-03-21 21:05:23] [INFO ] Parsed PT model containing 14 places and 65 transitions and 443 arcs in 106 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, 65/65 transitions.
Applied a total of 0 rules in 10 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:23] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 21:05:23] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-21 21:05:23] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
[2023-03-21 21:05:23] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:23] [INFO ] Invariant cache hit.
[2023-03-21 21:05:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-21 21:05:23] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:23] [INFO ] Invariant cache hit.
[2023-03-21 21:05:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 21:05:23] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-21 21:05:23] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:23] [INFO ] Invariant cache hit.
[2023-03-21 21:05:23] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 14/14 places, 65/65 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-21 21:05:23] [INFO ] Flatten gal took : 29 ms
[2023-03-21 21:05:23] [INFO ] Flatten gal took : 13 ms
[2023-03-21 21:05:23] [INFO ] Input system was already deterministic with 65 transitions.
Incomplete random walk after 10002 steps, including 598 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 55) seen :54
Finished Best-First random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 8 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 15 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Computed a total of 14 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 65
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:24] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:24] [INFO ] Invariant cache hit.
[2023-03-21 21:05:24] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 7 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:24] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:24] [INFO ] Invariant cache hit.
[2023-03-21 21:05:24] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:24] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:24] [INFO ] Invariant cache hit.
[2023-03-21 21:05:24] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:24] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:24] [INFO ] Invariant cache hit.
[2023-03-21 21:05:24] [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, 65/65 transitions.
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:24] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:24] [INFO ] Invariant cache hit.
[2023-03-21 21:05:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:24] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:24] [INFO ] Invariant cache hit.
[2023-03-21 21:05:24] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:24] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:24] [INFO ] Invariant cache hit.
[2023-03-21 21:05:24] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:24] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:24] [INFO ] Invariant cache hit.
[2023-03-21 21:05:24] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 9 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:24] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:24] [INFO ] Invariant cache hit.
[2023-03-21 21:05:24] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:24] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:24] [INFO ] Invariant cache hit.
[2023-03-21 21:05:24] [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, 65/65 transitions.
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:24] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:25] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:25] [INFO ] Invariant cache hit.
[2023-03-21 21:05:25] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:25] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:25] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:25] [INFO ] Invariant cache hit.
[2023-03-21 21:05:25] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:25] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:25] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:25] [INFO ] Invariant cache hit.
[2023-03-21 21:05:25] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:25] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:25] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:25] [INFO ] Invariant cache hit.
[2023-03-21 21:05:25] [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, 65/65 transitions.
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:25] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:25] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:25] [INFO ] Invariant cache hit.
[2023-03-21 21:05:25] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:25] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:05:25] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 21:05:25] [INFO ] Invariant cache hit.
[2023-03-21 21:05:25] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 14/14 places, 65/65 transitions.
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 5 ms
[2023-03-21 21:05:25] [INFO ] Input system was already deterministic with 65 transitions.
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 5 ms
[2023-03-21 21:05:25] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:05:25] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-21 21:05:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 65 transitions and 443 arcs took 1 ms.
Total runtime 2287 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: 65 NrArc: 443)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.754sec
RS generation: 0m 0.005sec
-> reachability set: #nodes 187 (1.9e+02) #states 7,716 (3)
starting MCC model checker
--------------------------
checking: AX [[EF [EG [[p0<=0 | [p8<=0 | p12<=0]]]] & EX [EF [[[p5<=0 | [p11<=0 | p12<=0]] & [p6<=0 | [p10<=0 | p12<=0]]]]]]]
normalized: ~ [EX [~ [[EX [E [true U [[[p11<=0 | p12<=0] | p5<=0] & [[p10<=0 | p12<=0] | p6<=0]]]] & E [true U EG [[[p8<=0 | p12<=0] | p0<=0]]]]]]]
abstracting: (p0<=0)
states: 0
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p8<=0)
states: 4,236 (3)
.
EG iterations: 1
abstracting: (p6<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p10<=0)
states: 3,564 (3)
abstracting: (p5<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p11<=0)
states: 3,564 (3)
..-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: EF [EG [[E [[1<=p7 & [1<=p10 & 1<=p12]] U [1<=p5 & [1<=p11 & 1<=p12]]] & EF [[1<=p7 & [1<=p11 & 1<=p12]]]]]]
normalized: E [true U EG [[E [[[1<=p10 & 1<=p12] & 1<=p7] U [[1<=p11 & 1<=p12] & 1<=p5]] & E [true U [[1<=p11 & 1<=p12] & 1<=p7]]]]]
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
...........
EG iterations: 11
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: [EF [~ [A [~ [AG [[1<=p4 & [1<=p9 & 1<=p12]]]] U [A [[1<=p3 & [1<=p9 & 1<=p12]] U [1<=p7 & [1<=p11 & 1<=p12]]] | EG [[1<=p0 & [1<=p10 & 1<=p12]]]]]]] | EG [[p6<=0 | [p8<=0 | p12<=0]]]]
normalized: [EG [[[p8<=0 | p12<=0] | p6<=0]] | E [true U ~ [[~ [EG [~ [[[~ [EG [~ [[[1<=p11 & 1<=p12] & 1<=p7]]]] & ~ [E [~ [[[1<=p11 & 1<=p12] & 1<=p7]] U [~ [[[1<=p9 & 1<=p12] & 1<=p3]] & ~ [[[1<=p11 & 1<=p12] & 1<=p7]]]]]] | EG [[[1<=p10 & 1<=p12] & 1<=p0]]]]]] & ~ [E [~ [[[~ [EG [~ [[[1<=p11 & 1<=p12] & 1<=p7]]]] & ~ [E [~ [[[1<=p11 & 1<=p12] & 1<=p7]] U [~ [[[1<=p9 & 1<=p12] & 1<=p3]] & ~ [[[1<=p11 & 1<=p12] & 1<=p7]]]]]] | EG [[[1<=p10 & 1<=p12] & 1<=p0]]]] U [~ [[[~ [EG [~ [[[1<=p11 & 1<=p12] & 1<=p7]]]] & ~ [E [~ [[[1<=p11 & 1<=p12] & 1<=p7]] U [~ [[[1<=p9 & 1<=p12] & 1<=p3]] & ~ [[[1<=p11 & 1<=p12] & 1<=p7]]]]]] | EG [[[1<=p10 & 1<=p12] & 1<=p0]]]] & ~ [E [true U ~ [[[1<=p9 & 1<=p12] & 1<=p4]]]]]]]]]]]
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
............
EG iterations: 12
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
............
EG iterations: 12
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
............
EG iterations: 12
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p6<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p8<=0)
states: 4,236 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: AF [[AX [AX [[1<=p7 & [1<=p11 & 1<=p12]]]] | [AG [[AX [[p7<=0 | [p11<=0 | p12<=0]]] | [[p0<=0 | [p9<=0 | p12<=0]] & [p7<=0 | [p11<=0 | p12<=0]]]]] & EF [AG [[p7<=0 | [p9<=0 | p12<=0]]]]]]]
normalized: ~ [EG [~ [[~ [EX [EX [~ [[[1<=p11 & 1<=p12] & 1<=p7]]]]] | [~ [E [true U ~ [[[[[p11<=0 | p12<=0] | p7<=0] & [[p9<=0 | p12<=0] | p0<=0]] | ~ [EX [~ [[[p11<=0 | p12<=0] | p7<=0]]]]]]]] & E [true U ~ [E [true U ~ [[[p9<=0 | p12<=0] | p7<=0]]]]]]]]]]
abstracting: (p7<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p9<=0)
states: 3,564 (3)
abstracting: (p7<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p11<=0)
states: 3,564 (3)
.abstracting: (p0<=0)
states: 0
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p9<=0)
states: 3,564 (3)
abstracting: (p7<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p11<=0)
states: 3,564 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.............
EG iterations: 11
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: [AX [EX [AX [[1<=p7 & [1<=p9 & 1<=p12]]]]] & A [EF [[[1<=p5 & [1<=p10 & 1<=p12]] | [E [[1<=p5 & [1<=p9 & 1<=p12]] U [1<=p5 & [1<=p9 & 1<=p12]]] | AF [[1<=p7 & [1<=p9 & 1<=p12]]]]]] U ~ [[1<=p0 & [1<=p8 & 1<=p12]]]]]
normalized: [[~ [EG [[[1<=p8 & 1<=p12] & 1<=p0]]] & ~ [E [[[1<=p8 & 1<=p12] & 1<=p0] U [~ [E [true U [[~ [EG [~ [[[1<=p9 & 1<=p12] & 1<=p7]]]] | E [[[1<=p9 & 1<=p12] & 1<=p5] U [[1<=p9 & 1<=p12] & 1<=p5]]] | [[1<=p10 & 1<=p12] & 1<=p5]]]] & [[1<=p8 & 1<=p12] & 1<=p0]]]]] & ~ [EX [~ [EX [~ [EX [~ [[[1<=p9 & 1<=p12] & 1<=p7]]]]]]]]]
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
...abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
............
EG iterations: 12
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: EG [[[1<=p0 & 1<=p9] & [1<=p12 & [A [AX [[1<=p2 & [1<=p10 & 1<=p12]]] U [1<=p1 & [1<=p8 & 1<=p12]]] | [EX [[1<=p2 & [1<=p8 & 1<=p12]]] & [[p1<=0 | [p10<=0 | p12<=0]] & [p2<=0 | [p9<=0 | p12<=0]]]]]]]]
normalized: EG [[[[[~ [EG [~ [[[1<=p8 & 1<=p12] & 1<=p1]]]] & ~ [E [~ [[[1<=p8 & 1<=p12] & 1<=p1]] U [EX [~ [[[1<=p10 & 1<=p12] & 1<=p2]]] & ~ [[[1<=p8 & 1<=p12] & 1<=p1]]]]]] | [EX [[[1<=p8 & 1<=p12] & 1<=p2]] & [[[p9<=0 | p12<=0] | p2<=0] & [[p10<=0 | p12<=0] | p1<=0]]]] & 1<=p12] & [1<=p0 & 1<=p9]]]
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (p1<=0)
states: 3,684 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p10<=0)
states: 3,564 (3)
abstracting: (p2<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p9<=0)
states: 3,564 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
.abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.
EG iterations: 1
...........
EG iterations: 11
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: AG [[E [EF [[1<=p1 & [1<=p11 & 1<=p12]]] U ~ [A [EF [[1<=p1 & [1<=p10 & 1<=p12]]] U AX [[1<=p4 & [1<=p10 & 1<=p12]]]]]] | EX [[~ [A [[1<=p4 & [1<=p10 & 1<=p12]] U [1<=p0 & [1<=p9 & 1<=p12]]]] & [[1<=p1 & [1<=p8 & 1<=p12]] | EG [[p0<=0 | [p8<=0 | p12<=0]]]]]]]]
normalized: ~ [E [true U ~ [[EX [[~ [[~ [EG [~ [[[1<=p9 & 1<=p12] & 1<=p0]]]] & ~ [E [~ [[[1<=p9 & 1<=p12] & 1<=p0]] U [~ [[[1<=p9 & 1<=p12] & 1<=p0]] & ~ [[[1<=p10 & 1<=p12] & 1<=p4]]]]]]] & [EG [[[p8<=0 | p12<=0] | p0<=0]] | [[1<=p8 & 1<=p12] & 1<=p1]]]] | E [E [true U [[1<=p11 & 1<=p12] & 1<=p1]] U ~ [[~ [EG [EX [~ [[[1<=p10 & 1<=p12] & 1<=p4]]]]] & ~ [E [EX [~ [[[1<=p10 & 1<=p12] & 1<=p4]]] U [~ [E [true U [[1<=p10 & 1<=p12] & 1<=p1]]] & EX [~ [[[1<=p10 & 1<=p12] & 1<=p4]]]]]]]]]]]]]
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
.abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
.abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
..............
EG iterations: 13
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (p0<=0)
states: 0
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p8<=0)
states: 4,236 (3)
.
EG iterations: 1
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.028sec
checking: EX [EG [[[[~ [A [[1<=p5 & [1<=p11 & 1<=p12]] U [1<=p3 & [1<=p11 & 1<=p12]]]] | p6<=0] | [p9<=0 | p12<=0]] | [[p1<=0 | p10<=0] | [[1<=p7 & [1<=p8 & 1<=p12]] | [~ [E [[1<=p2 & [1<=p8 & 1<=p12]] U [1<=p0 & [1<=p11 & 1<=p12]]]] & [p5<=0 | [p11<=0 | p12<=0]]]]]]]]
normalized: EX [EG [[[[~ [[~ [EG [~ [[[1<=p11 & 1<=p12] & 1<=p3]]]] & ~ [E [~ [[[1<=p11 & 1<=p12] & 1<=p3]] U [~ [[[1<=p11 & 1<=p12] & 1<=p5]] & ~ [[[1<=p11 & 1<=p12] & 1<=p3]]]]]]] | p6<=0] | [p9<=0 | p12<=0]] | [[[[[p11<=0 | p12<=0] | p5<=0] & ~ [E [[[1<=p8 & 1<=p12] & 1<=p2] U [[1<=p11 & 1<=p12] & 1<=p0]]]] | [[1<=p8 & 1<=p12] & 1<=p7]] | [p1<=0 | p10<=0]]]]]
abstracting: (p10<=0)
states: 3,564 (3)
abstracting: (p1<=0)
states: 3,684 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (p5<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p11<=0)
states: 3,564 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p9<=0)
states: 3,564 (3)
abstracting: (p6<=0)
states: 2,891 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: A [A [A [E [EF [[1<=p4 & [1<=p8 & 1<=p12]]] U [[1<=p0 & 1<=p11] & [1<=p12 & [1<=p2 & 1<=p10]]]] U EG [A [[1<=p4 & [1<=p10 & 1<=p12]] U [1<=p7 & [1<=p9 & 1<=p12]]]]] U ~ [[AG [~ [[1<=p3 & [1<=p11 & 1<=p12]]]] | [1<=p6 & [1<=p8 & 1<=p12]]]]] U AF [[1<=p7 & [1<=p9 & 1<=p12]]]]
normalized: [~ [EG [EG [~ [[[1<=p9 & 1<=p12] & 1<=p7]]]]] & ~ [E [EG [~ [[[1<=p9 & 1<=p12] & 1<=p7]]] U [~ [[~ [EG [[[[1<=p8 & 1<=p12] & 1<=p6] | ~ [E [true U [[1<=p11 & 1<=p12] & 1<=p3]]]]]] & ~ [E [[[[1<=p8 & 1<=p12] & 1<=p6] | ~ [E [true U [[1<=p11 & 1<=p12] & 1<=p3]]]] U [~ [[~ [EG [~ [EG [[~ [EG [~ [[[1<=p9 & 1<=p12] & 1<=p7]]]] & ~ [E [~ [[[1<=p9 & 1<=p12] & 1<=p7]] U [~ [[[1<=p10 & 1<=p12] & 1<=p4]] & ~ [[[1<=p9 & 1<=p12] & 1<=p7]]]]]]]]]] & ~ [E [~ [EG [[~ [EG [~ [[[1<=p9 & 1<=p12] & 1<=p7]]]] & ~ [E [~ [[[1<=p9 & 1<=p12] & 1<=p7]] U [~ [[[1<=p10 & 1<=p12] & 1<=p4]] & ~ [[[1<=p9 & 1<=p12] & 1<=p7]]]]]]]] U [~ [E [E [true U [[1<=p8 & 1<=p12] & 1<=p4]] U [[[1<=p2 & 1<=p10] & 1<=p12] & [1<=p0 & 1<=p11]]]] & ~ [EG [[~ [EG [~ [[[1<=p9 & 1<=p12] & 1<=p7]]]] & ~ [E [~ [[[1<=p9 & 1<=p12] & 1<=p7]] U [~ [[[1<=p10 & 1<=p12] & 1<=p4]] & ~ [[[1<=p9 & 1<=p12] & 1<=p7]]]]]]]]]]]]] & [[[1<=p8 & 1<=p12] & 1<=p6] | ~ [E [true U [[1<=p11 & 1<=p12] & 1<=p3]]]]]]]]] & EG [~ [[[1<=p9 & 1<=p12] & 1<=p7]]]]]]]
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
.
EG iterations: 1
...........
EG iterations: 11
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
.
EG iterations: 1
...........
EG iterations: 11
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
.
EG iterations: 1
...........
EG iterations: 11
EG iterations: 0
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.
EG iterations: 1
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: [EG [[[[1<=p12 & 1<=p10] & 1<=p0] & [[~ [A [[1<=p1 & [1<=p11 & 1<=p12]] U [1<=p7 & [1<=p10 & 1<=p12]]]] | [1<=p6 & [1<=p9 & 1<=p12]]] & [AF [[p4<=0 | [p9<=0 | p12<=0]]] & EF [[p0<=0 | [p11<=0 | p12<=0]]]]]]] | A [EF [EX [E [[1<=p3 & [1<=p10 & 1<=p12]] U [1<=p7 & [1<=p9 & 1<=p12]]]]] U [1<=p3 & [1<=p8 & 1<=p12]]]]
normalized: [EG [[[[1<=p12 & 1<=p10] & 1<=p0] & [[E [true U [[p11<=0 | p12<=0] | p0<=0]] & ~ [EG [~ [[[p9<=0 | p12<=0] | p4<=0]]]]] & [[[1<=p9 & 1<=p12] & 1<=p6] | ~ [[~ [EG [~ [[1<=p7 & [1<=p10 & 1<=p12]]]]] & ~ [E [~ [[1<=p7 & [1<=p10 & 1<=p12]]] U [~ [[1<=p1 & [1<=p11 & 1<=p12]]] & ~ [[1<=p7 & [1<=p10 & 1<=p12]]]]]]]]]]]] | [~ [EG [~ [[[1<=p8 & 1<=p12] & 1<=p3]]]] & ~ [E [~ [[[1<=p8 & 1<=p12] & 1<=p3]] U [~ [E [true U EX [E [[[1<=p10 & 1<=p12] & 1<=p3] U [[1<=p9 & 1<=p12] & 1<=p7]]]]] & ~ [[[1<=p8 & 1<=p12] & 1<=p3]]]]]]]
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
.abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.
EG iterations: 1
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (p4<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p9<=0)
states: 3,564 (3)
...........
EG iterations: 11
abstracting: (p0<=0)
states: 0
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p11<=0)
states: 3,564 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p12)
states: 6,000 (3)
............
EG iterations: 12
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: [~ [E [EX [[A [[1<=p4 & [1<=p10 & 1<=p12]] U [1<=p6 & [1<=p8 & 1<=p12]]] | AX [[1<=p0 & [1<=p10 & 1<=p12]]]]] U AG [AX [AF [[1<=p2 & [1<=p8 & 1<=p12]]]]]]] & EF [[[1<=p6 & [1<=p8 & 1<=p12]] | [AG [[p7<=0 | [p11<=0 | p12<=0]]] | [[[[1<=p4 & [1<=p10 & 1<=p12]] | [1<=p2 & [1<=p11 & 1<=p12]]] & [1<=p0 & 1<=p9]] & [[1<=p12 & 1<=p2] & [1<=p10 & 1<=p12]]]]]]]
normalized: [E [true U [[[[[1<=p10 & 1<=p12] & [1<=p12 & 1<=p2]] & [[1<=p0 & 1<=p9] & [[[1<=p11 & 1<=p12] & 1<=p2] | [[1<=p10 & 1<=p12] & 1<=p4]]]] | ~ [E [true U ~ [[[p11<=0 | p12<=0] | p7<=0]]]]] | [[1<=p8 & 1<=p12] & 1<=p6]]] & ~ [E [EX [[~ [EX [~ [[[1<=p10 & 1<=p12] & 1<=p0]]]] | [~ [EG [~ [[[1<=p8 & 1<=p12] & 1<=p6]]]] & ~ [E [~ [[[1<=p8 & 1<=p12] & 1<=p6]] U [~ [[[1<=p10 & 1<=p12] & 1<=p4]] & ~ [[[1<=p8 & 1<=p12] & 1<=p6]]]]]]]] U ~ [E [true U EX [EG [~ [[[1<=p8 & 1<=p12] & 1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.
EG iterations: 1
.abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
..abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (p7<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p11<=0)
states: 3,564 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: [AX [AF [[~ [E [[1<=p2 & [1<=p9 & 1<=p12]] U [1<=p5 & [1<=p11 & 1<=p12]]]] | [E [[1<=p6 & [1<=p9 & 1<=p12]] U [1<=p3 & [1<=p10 & 1<=p12]]] | [[1<=p6 & 1<=p9] & [1<=p12 & [p1<=0 | [p8<=0 | p12<=0]]]]]]]] & [AX [[1<=p6 & [1<=p10 & 1<=p12]]] | EF [[[EX [[p4<=0 | [p9<=0 | p12<=0]]] | EG [[p1<=0 | [p9<=0 | p12<=0]]]] & [p0<=0 | [p8<=0 | p12<=0]]]]]]
normalized: [[E [true U [[[p8<=0 | p12<=0] | p0<=0] & [EG [[[p9<=0 | p12<=0] | p1<=0]] | EX [[[p9<=0 | p12<=0] | p4<=0]]]]] | ~ [EX [~ [[[1<=p10 & 1<=p12] & 1<=p6]]]]] & ~ [EX [EG [~ [[[[[[[p8<=0 | p12<=0] | p1<=0] & 1<=p12] & [1<=p6 & 1<=p9]] | E [[[1<=p9 & 1<=p12] & 1<=p6] U [[1<=p10 & 1<=p12] & 1<=p3]]] | ~ [E [[[1<=p9 & 1<=p12] & 1<=p2] U [[1<=p11 & 1<=p12] & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (p1<=0)
states: 3,684 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p8<=0)
states: 4,236 (3)
...........
EG iterations: 11
.abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
.abstracting: (p4<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p9<=0)
states: 3,564 (3)
.abstracting: (p1<=0)
states: 3,684 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p9<=0)
states: 3,564 (3)
.
EG iterations: 1
abstracting: (p0<=0)
states: 0
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p8<=0)
states: 4,236 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: EG [[EX [[[~ [A [[1<=p6 & [1<=p11 & 1<=p12]] U [1<=p2 & [1<=p11 & 1<=p12]]]] & [[p6<=0 | [p10<=0 | p12<=0]] | [p7<=0 | [p10<=0 | p12<=0]]]] | [[1<=p0 & [1<=p11 & 1<=p12]] | [1<=p7 & [1<=p11 & 1<=p12]]]]] | AG [[[A [[1<=p3 & [1<=p11 & 1<=p12]] U [1<=p0 & [1<=p10 & 1<=p12]]] | [[[1<=p12 & 10<=p13] & [1<=p3 & [1<=p8 & 1<=p12]]] | [1<=p2 & [1<=p10 & 1<=p12]]]] | [[p7<=0 | p9<=0] | [p12<=0 | AX [[p2<=0 | [p9<=0 | p12<=0]]]]]]]]]
normalized: EG [[~ [E [true U ~ [[[[~ [EX [~ [[[p9<=0 | p12<=0] | p2<=0]]]] | p12<=0] | [p7<=0 | p9<=0]] | [[[[1<=p10 & 1<=p12] & 1<=p2] | [[[1<=p8 & 1<=p12] & 1<=p3] & [1<=p12 & 10<=p13]]] | [~ [EG [~ [[[1<=p10 & 1<=p12] & 1<=p0]]]] & ~ [E [~ [[[1<=p10 & 1<=p12] & 1<=p0]] U [~ [[[1<=p11 & 1<=p12] & 1<=p3]] & ~ [[[1<=p10 & 1<=p12] & 1<=p0]]]]]]]]]]] | EX [[[[[1<=p11 & 1<=p12] & 1<=p7] | [[1<=p11 & 1<=p12] & 1<=p0]] | [[[[p10<=0 | p12<=0] | p7<=0] | [[p10<=0 | p12<=0] | p6<=0]] & ~ [[~ [EG [~ [[[1<=p11 & 1<=p12] & 1<=p2]]]] & ~ [E [~ [[[1<=p11 & 1<=p12] & 1<=p2]] U [~ [[[1<=p11 & 1<=p12] & 1<=p6]] & ~ [[[1<=p11 & 1<=p12] & 1<=p2]]]]]]]]]]]]
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (p6<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p10<=0)
states: 3,564 (3)
abstracting: (p7<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p10<=0)
states: 3,564 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (10<=p13)
states: 3,432 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (p9<=0)
states: 3,564 (3)
abstracting: (p7<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p2<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p9<=0)
states: 3,564 (3)
..
EG iterations: 1
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: [~ [A [[E [AX [[1<=p2 & [1<=p8 & 1<=p12]]] U [E [[1<=p4 & [1<=p9 & 1<=p12]] U [1<=p5 & [1<=p8 & 1<=p12]]] | ~ [[1<=p1 & [1<=p9 & 1<=p12]]]]] | EF [[AG [[1<=p3 & [1<=p11 & 1<=p12]]] & ~ [[1<=p2 & [1<=p11 & 1<=p12]]]]]] U [1<=p4 & [1<=p8 & 1<=p12]]]] | [EG [~ [A [[[1<=p5 & [1<=p8 & 1<=p12]] & [1<=p1 & [1<=p8 & 1<=p12]]] U E [[1<=p6 & [1<=p8 & 1<=p12]] U [1<=p6 & [1<=p8 & 1<=p12]]]]]] & EG [[[p1<=0 | [p8<=0 | p12<=0]] | [p4<=0 | [p11<=0 | p12<=0]]]]]]
normalized: [[EG [[[[p11<=0 | p12<=0] | p4<=0] | [[p8<=0 | p12<=0] | p1<=0]]] & EG [~ [[~ [EG [~ [E [[[1<=p8 & 1<=p12] & 1<=p6] U [[1<=p8 & 1<=p12] & 1<=p6]]]]] & ~ [E [~ [E [[[1<=p8 & 1<=p12] & 1<=p6] U [[1<=p8 & 1<=p12] & 1<=p6]]] U [~ [[[[1<=p8 & 1<=p12] & 1<=p1] & [[1<=p8 & 1<=p12] & 1<=p5]]] & ~ [E [[[1<=p8 & 1<=p12] & 1<=p6] U [[1<=p8 & 1<=p12] & 1<=p6]]]]]]]]]] | ~ [[~ [EG [~ [[[1<=p8 & 1<=p12] & 1<=p4]]]] & ~ [E [~ [[[1<=p8 & 1<=p12] & 1<=p4]] U [~ [[E [true U [~ [[[1<=p11 & 1<=p12] & 1<=p2]] & ~ [E [true U ~ [[[1<=p11 & 1<=p12] & 1<=p3]]]]]] | E [~ [EX [~ [[[1<=p8 & 1<=p12] & 1<=p2]]]] U [~ [[[1<=p9 & 1<=p12] & 1<=p1]] | E [[[1<=p9 & 1<=p12] & 1<=p4] U [[1<=p8 & 1<=p12] & 1<=p5]]]]]] & ~ [[[1<=p8 & 1<=p12] & 1<=p4]]]]]]]]
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p1<=0)
states: 3,684 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p8<=0)
states: 4,236 (3)
abstracting: (p4<=0)
states: 2,891 (3)
abstracting: (p12<=0)
states: 1,716 (3)
abstracting: (p11<=0)
states: 3,564 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: [A [[[[[~ [[1<=p2 & [1<=p9 & 1<=p12]]] & [1<=p7 & 1<=p9]] & [[1<=p12 & 1<=p5] & [1<=p11 & 1<=p12]]] | EG [[1<=p4 & [1<=p8 & 1<=p12]]]] & [[[E [[1<=p0 & [1<=p9 & 1<=p12]] U [1<=p4 & [1<=p9 & 1<=p12]]] & ~ [[1<=p2 & [1<=p8 & 1<=p12]]]] | AF [[1<=p7 & [1<=p10 & 1<=p12]]]] | [[1<=p3 & [1<=p11 & 1<=p12]] | [1<=p1 & [1<=p8 & 1<=p12]]]]] U [EG [~ [[1<=p4 & [1<=p10 & 1<=p12]]]] & E [E [[1<=p2 & [1<=p11 & 1<=p12]] U [1<=p5 & [1<=p9 & 1<=p12]]] U EX [[1<=p1 & [1<=p11 & 1<=p12]]]]]] | ~ [A [A [[[EF [[1<=p3 & [1<=p9 & 1<=p12]]] & 1<=p2] & [1<=p11 & 1<=p12]] U ~ [[[~ [[1<=p4 & [1<=p11 & 1<=p12]]] & 1<=p2] & [1<=p11 & 1<=p12]]]] U EG [[1<=p2 & [1<=p11 & 1<=p12]]]]]]
normalized: [[~ [EG [~ [[EG [~ [[[1<=p10 & 1<=p12] & 1<=p4]]] & E [E [[[1<=p11 & 1<=p12] & 1<=p2] U [[1<=p9 & 1<=p12] & 1<=p5]] U EX [[[1<=p11 & 1<=p12] & 1<=p1]]]]]]] & ~ [E [~ [[EG [~ [[[1<=p10 & 1<=p12] & 1<=p4]]] & E [E [[[1<=p11 & 1<=p12] & 1<=p2] U [[1<=p9 & 1<=p12] & 1<=p5]] U EX [[[1<=p11 & 1<=p12] & 1<=p1]]]]] U [~ [[EG [~ [[[1<=p10 & 1<=p12] & 1<=p4]]] & E [E [[[1<=p11 & 1<=p12] & 1<=p2] U [[1<=p9 & 1<=p12] & 1<=p5]] U EX [[[1<=p11 & 1<=p12] & 1<=p1]]]]] & ~ [[[[[[1<=p8 & 1<=p12] & 1<=p1] | [[1<=p11 & 1<=p12] & 1<=p3]] | [~ [EG [~ [[[1<=p10 & 1<=p12] & 1<=p7]]]] | [~ [[[1<=p8 & 1<=p12] & 1<=p2]] & E [[[1<=p9 & 1<=p12] & 1<=p0] U [[1<=p9 & 1<=p12] & 1<=p4]]]]] & [EG [[[1<=p8 & 1<=p12] & 1<=p4]] | [[[1<=p11 & 1<=p12] & [1<=p12 & 1<=p5]] & [[1<=p7 & 1<=p9] & ~ [[[1<=p9 & 1<=p12] & 1<=p2]]]]]]]]]]] | ~ [[~ [EG [~ [EG [[[1<=p11 & 1<=p12] & 1<=p2]]]]] & ~ [E [~ [EG [[[1<=p11 & 1<=p12] & 1<=p2]]] U [~ [[~ [EG [[[1<=p11 & 1<=p12] & [~ [[[1<=p11 & 1<=p12] & 1<=p4]] & 1<=p2]]]] & ~ [E [[[1<=p11 & 1<=p12] & [~ [[[1<=p11 & 1<=p12] & 1<=p4]] & 1<=p2]] U [~ [[[1<=p11 & 1<=p12] & [E [true U [[1<=p9 & 1<=p12] & 1<=p3]] & 1<=p2]]] & [[1<=p11 & 1<=p12] & [~ [[[1<=p11 & 1<=p12] & 1<=p4]] & 1<=p2]]]]]]] & ~ [EG [[[1<=p11 & 1<=p12] & 1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
...........
EG iterations: 11
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
...........
EG iterations: 11
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
...........
EG iterations: 11
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
...........
EG iterations: 11
EG iterations: 0
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
...........
EG iterations: 11
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: [E [E [EG [~ [[1<=p0 & [1<=p9 & 1<=p12]]]] U AG [[AF [[1<=p0 & [1<=p8 & 1<=p12]]] | [[1<=p1 & [1<=p10 & 1<=p12]] | [1<=p0 & [1<=p8 & 1<=p12]]]]]] U [AF [[[[A [[1<=p6 & [1<=p11 & 1<=p12]] U [1<=p1 & [1<=p11 & 1<=p12]]] & 1<=p4] & [1<=p9 & 1<=p12]] & [[1<=p5 & 1<=p11] & [1<=p12 & AX [[1<=p2 & [1<=p8 & 1<=p12]]]]]]] | [[1<=p2 & 1<=p10] & [1<=p12 & AG [~ [[[1<=p0 & [1<=p9 & 1<=p12]] | [1<=p3 & [1<=p10 & 1<=p12]]]]]]]]] | [E [[AG [A [[1<=p1 & [1<=p10 & 1<=p12]] U [1<=p1 & [1<=p8 & 1<=p12]]]] & ~ [EG [[[1<=p6 & [1<=p8 & 1<=p12]] & [1<=p6 & [1<=p10 & 1<=p12]]]]]] U [1<=p1 & [1<=p10 & 1<=p12]]] & EG [E [[1<=p4 & [1<=p9 & 1<=p12]] U A [[1<=p7 & [1<=p10 & 1<=p12]] U [[1<=p4 & [1<=p11 & 1<=p12]] | [1<=p6 & [1<=p9 & 1<=p12]]]]]]]]
normalized: [[EG [E [[[1<=p9 & 1<=p12] & 1<=p4] U [~ [EG [~ [[[[1<=p9 & 1<=p12] & 1<=p6] | [[1<=p11 & 1<=p12] & 1<=p4]]]]] & ~ [E [~ [[[[1<=p9 & 1<=p12] & 1<=p6] | [[1<=p11 & 1<=p12] & 1<=p4]]] U [~ [[[1<=p10 & 1<=p12] & 1<=p7]] & ~ [[[[1<=p9 & 1<=p12] & 1<=p6] | [[1<=p11 & 1<=p12] & 1<=p4]]]]]]]]] & E [[~ [EG [[[[1<=p10 & 1<=p12] & 1<=p6] & [[1<=p8 & 1<=p12] & 1<=p6]]]] & ~ [E [true U ~ [[~ [EG [~ [[[1<=p8 & 1<=p12] & 1<=p1]]]] & ~ [E [~ [[[1<=p8 & 1<=p12] & 1<=p1]] U [~ [[[1<=p10 & 1<=p12] & 1<=p1]] & ~ [[[1<=p8 & 1<=p12] & 1<=p1]]]]]]]]]] U [[1<=p10 & 1<=p12] & 1<=p1]]] | E [E [EG [~ [[[1<=p9 & 1<=p12] & 1<=p0]]] U ~ [E [true U ~ [[[[[1<=p8 & 1<=p12] & 1<=p0] | [[1<=p10 & 1<=p12] & 1<=p1]] | ~ [EG [~ [[[1<=p8 & 1<=p12] & 1<=p0]]]]]]]]] U [[[~ [E [true U [[[1<=p10 & 1<=p12] & 1<=p3] | [[1<=p9 & 1<=p12] & 1<=p0]]]] & 1<=p12] & [1<=p2 & 1<=p10]] | ~ [EG [~ [[[[~ [EX [~ [[[1<=p8 & 1<=p12] & 1<=p2]]]] & 1<=p12] & [1<=p5 & 1<=p11]] & [[1<=p9 & 1<=p12] & [[~ [EG [~ [[[1<=p11 & 1<=p12] & 1<=p1]]]] & ~ [E [~ [[[1<=p11 & 1<=p12] & 1<=p1]] U [~ [[[1<=p11 & 1<=p12] & 1<=p6]] & ~ [[[1<=p11 & 1<=p12] & 1<=p1]]]]]] & 1<=p4]]]]]]]]]
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p5)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.
EG iterations: 0
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p2)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p3)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.
EG iterations: 1
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p0)
states: 7,716 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p1)
states: 4,032 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p8)
states: 3,480 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
..........
EG iterations: 10
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p7)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p10)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p11)
states: 4,152 (3)
abstracting: (1<=p6)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (1<=p4)
states: 4,825 (3)
abstracting: (1<=p12)
states: 6,000 (3)
abstracting: (1<=p9)
states: 4,152 (3)
...........
EG iterations: 11
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
totally nodes used: 85698 (8.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 522611 664197 1186808
used/not used/entry size/cache size: 695011 66413853 16 1024MB
basic ops cache: hits/miss/sum: 77673 77877 155550
used/not used/entry size/cache size: 139109 16638107 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: 1967 1557 3524
used/not used/entry size/cache size: 1557 8387051 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 67030752
1 73704
2 3195
3 625
4 235
5 121
6 75
7 48
8 27
9 17
>= 10 65
Total processing time: 0m 4.668sec
BK_STOP 1679432731573
--------------------
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 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:592 (9), effective:28 (0)
initing FirstDep: 0m 0.000sec
iterations count:67 (1), effective:2 (0)
iterations count:203 (3), effective:10 (0)
iterations count:118 (1), effective:1 (0)
iterations count:94 (1), effective:1 (0)
iterations count:93 (1), effective:6 (0)
iterations count:85 (1), effective:5 (0)
iterations count:85 (1), effective:5 (0)
iterations count:85 (1), effective:5 (0)
iterations count:159 (2), effective:9 (0)
iterations count:118 (1), effective:1 (0)
iterations count:93 (1), effective:6 (0)
iterations count:118 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:147 (2), effective:2 (0)
iterations count:133 (2), effective:5 (0)
iterations count:127 (1), effective:6 (0)
iterations count:68 (1), effective:1 (0)
iterations count:187 (2), effective:10 (0)
iterations count:68 (1), effective:1 (0)
iterations count:87 (1), effective:1 (0)
iterations count:113 (1), effective:5 (0)
iterations count:205 (3), effective:12 (0)
iterations count:65 (1), effective:0 (0)
iterations count:181 (2), effective:9 (0)
iterations count:78 (1), effective:1 (0)
iterations count:137 (2), effective:8 (0)
iterations count:87 (1), effective:1 (0)
iterations count:73 (1), effective:1 (0)
iterations count:137 (2), effective:8 (0)
iterations count:153 (2), effective:10 (0)
iterations count:137 (2), effective:8 (0)
iterations count:78 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:78 (1), effective:1 (0)
iterations count:203 (3), effective:10 (0)
iterations count:118 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:95 (1), effective:8 (0)
iterations count:202 (3), effective:9 (0)
iterations count:203 (3), effective:10 (0)
iterations count:66 (1), effective:1 (0)
iterations count:137 (2), effective:8 (0)
iterations count:203 (3), effective:10 (0)
iterations count:118 (1), effective:1 (0)
iterations count:203 (3), effective:10 (0)
iterations count:94 (1), effective:1 (0)
iterations count:78 (1), effective:1 (0)
iterations count:83 (1), effective:4 (0)
iterations count:174 (2), effective:9 (0)
iterations count:129 (1), effective:6 (0)
iterations count:184 (2), effective:4 (0)
iterations count:94 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:195 (3), effective:9 (0)
iterations count:69 (1), effective:2 (0)
iterations count:65 (1), effective:0 (0)
iterations count:65 (1), effective:0 (0)
iterations count:66 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:78 (1), effective:1 (0)
iterations count:73 (1), effective:1 (0)
iterations count:73 (1), effective:1 (0)
iterations count:87 (1), effective:1 (0)
iterations count:94 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:94 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:75 (1), effective:2 (0)
iterations count:94 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:159 (2), effective:9 (0)
iterations count:65 (1), effective:0 (0)
iterations count:160 (2), effective:10 (0)
iterations count:65 (1), effective:0 (0)
iterations count:157 (2), effective:7 (0)
iterations count:66 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:202 (3), effective:10 (0)
iterations count:65 (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="PhaseVariation-PT-D02CS010"
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 PhaseVariation-PT-D02CS010, 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 r298-tall-167873951100002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhaseVariation-PT-D02CS010.tgz
mv PhaseVariation-PT-D02CS010 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 '
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 ;