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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 55K 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 QuasiCertifProtocol-PT-02-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679685376967

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=QuasiCertifProtocol-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 19:16:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 19:16:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 19:16:18] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-24 19:16:18] [INFO ] Transformed 86 places.
[2023-03-24 19:16:18] [INFO ] Transformed 56 transitions.
[2023-03-24 19:16:18] [INFO ] Parsed PT model containing 86 places and 56 transitions and 223 arcs in 91 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 76 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 76 transition count 56
Applied a total of 10 rules in 10 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2023-03-24 19:16:18] [INFO ] Computed 22 place invariants in 19 ms
[2023-03-24 19:16:18] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-24 19:16:18] [INFO ] Invariant cache hit.
[2023-03-24 19:16:18] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-24 19:16:18] [INFO ] Invariant cache hit.
[2023-03-24 19:16:18] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 76/86 places, 56/56 transitions.
Support contains 76 out of 76 places after structural reductions.
[2023-03-24 19:16:19] [INFO ] Flatten gal took : 23 ms
[2023-03-24 19:16:19] [INFO ] Flatten gal took : 9 ms
[2023-03-24 19:16:19] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1643 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 57) seen :18
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 39) seen :8
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :25
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-24 19:16:19] [INFO ] Invariant cache hit.
[2023-03-24 19:16:19] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-24 19:16:19] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:2
[2023-03-24 19:16:19] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-24 19:16:19] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :1 real:2
[2023-03-24 19:16:19] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-24 19:16:19] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2023-03-24 19:16:19] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-24 19:16:19] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 19:16:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-24 19:16:19] [INFO ] Flatten gal took : 6 ms
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 19:16:19] [INFO ] Flatten gal took : 6 ms
[2023-03-24 19:16:19] [INFO ] Input system was already deterministic with 56 transitions.
Computed a total of 76 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 55
Applied a total of 2 rules in 12 ms. Remains 75 /76 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 75/76 places, 55/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 54
Applied a total of 2 rules in 6 ms. Remains 72 /76 variables (removed 4) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 72/76 places, 54/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 11 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 53
Applied a total of 2 rules in 15 ms. Remains 71 /76 variables (removed 5) and now considering 53/56 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 71/76 places, 53/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 5 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 4 ms. Remains 71 /76 variables (removed 5) and now considering 53/56 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 71/76 places, 53/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 54
Applied a total of 2 rules in 15 ms. Remains 72 /76 variables (removed 4) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 72/76 places, 54/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /76 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 75/76 places, 55/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 6 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 56
Applied a total of 1 rules in 6 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:20] [INFO ] Input system was already deterministic with 56 transitions.
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:20] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2023-03-24 19:16:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 76 places, 56 transitions and 190 arcs took 1 ms.
Total runtime 2104 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: 76 NrTr: 56 NrArc: 190)

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

net check time: 0m 0.000sec

init dd package: 0m 2.835sec


RS generation: 0m 0.027sec


-> reachability set: #nodes 1305 (1.3e+03) #states 1,029 (3)



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

checking: AX [EF [[[1<=p0 & 1<=p14] | [[1<=p0 & 1<=p16] | [1<=p0 & 1<=p13]]]]]
normalized: ~ [EX [~ [E [true U [[1<=p0 & 1<=p14] | [[1<=p0 & 1<=p16] | [1<=p0 & 1<=p13]]]]]]]

abstracting: (1<=p13)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p16)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p14)
states: 84
abstracting: (1<=p0)
states: 219
.-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: EG [[[p16<=0 | p72<=0] & [[p14<=0 | p65<=0] & [p13<=0 | p66<=0]]]]
normalized: EG [[[[p13<=0 | p66<=0] & [p14<=0 | p65<=0]] & [p16<=0 | p72<=0]]]

abstracting: (p72<=0)
states: 957
abstracting: (p16<=0)
states: 945
abstracting: (p65<=0)
states: 957
abstracting: (p14<=0)
states: 945
abstracting: (p66<=0)
states: 957
abstracting: (p13<=0)
states: 945
.
EG iterations: 1
-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AF [AG [[E [[1<=p22 & 1<=p55] U [1<=p14 & 1<=p65]] | [E [1<=p28 U 1<=p24] | [1<=p0 & 1<=p5]]]]]
normalized: ~ [EG [E [true U ~ [[[[1<=p0 & 1<=p5] | E [1<=p28 U 1<=p24]] | E [[1<=p22 & 1<=p55] U [1<=p14 & 1<=p65]]]]]]]

abstracting: (1<=p65)
states: 72
abstracting: (1<=p14)
states: 84
abstracting: (1<=p55)
states: 32
abstracting: (1<=p22)
states: 27
abstracting: (1<=p24)
states: 4
abstracting: (1<=p28)
states: 32
abstracting: (1<=p5)
states: 144
abstracting: (1<=p0)
states: 219

EG iterations: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: EG [[EF [[EG [[p0<=0 | p1<=0]] | EG [[p18<=0 | p68<=0]]]] | EG [AX [[p4<=0 & [[p21<=0 | p71<=0] | [p73<=0 | p74<=0]]]]]]]
normalized: EG [[EG [~ [EX [~ [[[[p73<=0 | p74<=0] | [p21<=0 | p71<=0]] & p4<=0]]]]] | E [true U [EG [[p18<=0 | p68<=0]] | EG [[p0<=0 | p1<=0]]]]]]

abstracting: (p1<=0)
states: 567
abstracting: (p0<=0)
states: 810
.
EG iterations: 1
abstracting: (p68<=0)
states: 997
abstracting: (p18<=0)
states: 975
.
EG iterations: 1
abstracting: (p4<=0)
states: 885
abstracting: (p71<=0)
states: 463
abstracting: (p21<=0)
states: 710
abstracting: (p74<=0)
states: 463
abstracting: (p73<=0)
states: 463
..........
EG iterations: 9

EG iterations: 0
-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: EG [[[[[p71<=0 | p21<=0] | [p73<=0 | p74<=0]] & [p17<=0 | p69<=0]] & [[p18<=0 | p68<=0] & [p67<=0 | p15<=0]]]]
normalized: EG [[[[p67<=0 | p15<=0] & [p18<=0 | p68<=0]] & [[p17<=0 | p69<=0] & [[p73<=0 | p74<=0] | [p71<=0 | p21<=0]]]]]

abstracting: (p21<=0)
states: 710
abstracting: (p71<=0)
states: 463
abstracting: (p74<=0)
states: 463
abstracting: (p73<=0)
states: 463
abstracting: (p69<=0)
states: 997
abstracting: (p17<=0)
states: 975
abstracting: (p68<=0)
states: 997
abstracting: (p18<=0)
states: 975
abstracting: (p15<=0)
states: 975
abstracting: (p67<=0)
states: 997
.
EG iterations: 1
-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EG [AX [[AF [[[p7<=0 | [p49<=0 | p51<=0]] | [p54<=0 | [p0<=0 | p9<=0]]]] | [[p20<=0 | p61<=0] & [1<=p10 | [1<=p0 & 1<=p9]]]]]]
normalized: EG [~ [EX [~ [[[[[1<=p0 & 1<=p9] | 1<=p10] & [p20<=0 | p61<=0]] | ~ [EG [~ [[[[p0<=0 | p9<=0] | p54<=0] | [[p49<=0 | p51<=0] | p7<=0]]]]]]]]]]

abstracting: (p7<=0)
states: 738
abstracting: (p51<=0)
states: 807
abstracting: (p49<=0)
states: 807
abstracting: (p54<=0)
states: 807
abstracting: (p9<=0)
states: 738
abstracting: (p0<=0)
states: 810
.....
EG iterations: 5
abstracting: (p61<=0)
states: 997
abstracting: (p20<=0)
states: 1,002 (3)
abstracting: (1<=p10)
states: 66
abstracting: (1<=p9)
states: 291
abstracting: (1<=p0)
states: 219
.
EG iterations: 0
-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EG [[AF [[1<=p19 & 1<=p62]] & [[p0<=0 | p7<=0] & [E [[[1<=p21 & 1<=p71] & [1<=p73 & 1<=p74]] U [1<=p0 & 1<=p12]] | [p22<=0 | p55<=0]]]]]
normalized: EG [[[[[p22<=0 | p55<=0] | E [[[1<=p73 & 1<=p74] & [1<=p21 & 1<=p71]] U [1<=p0 & 1<=p12]]] & [p0<=0 | p7<=0]] & ~ [EG [~ [[1<=p19 & 1<=p62]]]]]]

abstracting: (1<=p62)
states: 32
abstracting: (1<=p19)
states: 27
..
EG iterations: 2
abstracting: (p7<=0)
states: 738
abstracting: (p0<=0)
states: 810
abstracting: (1<=p12)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p71)
states: 566
abstracting: (1<=p21)
states: 319
abstracting: (1<=p74)
states: 566
abstracting: (1<=p73)
states: 566
abstracting: (p55<=0)
states: 997
abstracting: (p22<=0)
states: 1,002 (3)
.....
EG iterations: 5
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AF [EG [[E [[1<=p0 & 1<=p13] U [1<=p0 & 1<=p19]] | [EF [[[1<=p1 & 1<=p26] & [1<=p27 & 1<=p29]]] & A [[[1<=p40 & 1<=p41] & [1<=p42 & 1<=p43]] U [[1<=p9 & 1<=p47] & [1<=p52 & 1<=p60]]]]]]]
normalized: ~ [EG [~ [EG [[[[~ [EG [~ [[[1<=p52 & 1<=p60] & [1<=p9 & 1<=p47]]]]] & ~ [E [~ [[[1<=p52 & 1<=p60] & [1<=p9 & 1<=p47]]] U [~ [[[1<=p42 & 1<=p43] & [1<=p40 & 1<=p41]]] & ~ [[[1<=p52 & 1<=p60] & [1<=p9 & 1<=p47]]]]]]] & E [true U [[1<=p27 & 1<=p29] & [1<=p1 & 1<=p26]]]] | E [[1<=p0 & 1<=p13] U [1<=p0 & 1<=p19]]]]]]]

abstracting: (1<=p19)
states: 27
abstracting: (1<=p0)
states: 219
abstracting: (1<=p13)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p26)
states: 168
abstracting: (1<=p1)
states: 462
abstracting: (1<=p29)
states: 168
abstracting: (1<=p27)
states: 168
abstracting: (1<=p47)
states: 222
abstracting: (1<=p9)
states: 291
abstracting: (1<=p60)
states: 222
abstracting: (1<=p52)
states: 222
abstracting: (1<=p41)
states: 136
abstracting: (1<=p40)
states: 136
abstracting: (1<=p43)
states: 444
abstracting: (1<=p42)
states: 136
abstracting: (1<=p47)
states: 222
abstracting: (1<=p9)
states: 291
abstracting: (1<=p60)
states: 222
abstracting: (1<=p52)
states: 222
abstracting: (1<=p47)
states: 222
abstracting: (1<=p9)
states: 291
abstracting: (1<=p60)
states: 222
abstracting: (1<=p52)
states: 222
.........
EG iterations: 9
........
EG iterations: 8

EG iterations: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: ~ [A [~ [[[[EG [1<=p25] & [1<=p0 & 1<=p19]] | ~ [[1<=p0 & 1<=p7]]] | [[[[1<=p40 & 1<=p41] & [1<=p42 & 1<=p43]] & [[1<=p21 & 1<=p71] & [1<=p73 & 1<=p74]]] | [[1<=p0 & 1<=p14] | 1<=p11]]]] U AF [[AG [E [[[1<=p3 & 1<=p31] & [1<=p34 & 1<=p35]] U 1<=p21]] | [1<=p14 & 1<=p65]]]]]
normalized: ~ [[~ [EG [EG [~ [[[1<=p14 & 1<=p65] | ~ [E [true U ~ [E [[[1<=p34 & 1<=p35] & [1<=p3 & 1<=p31]] U 1<=p21]]]]]]]]] & ~ [E [EG [~ [[[1<=p14 & 1<=p65] | ~ [E [true U ~ [E [[[1<=p34 & 1<=p35] & [1<=p3 & 1<=p31]] U 1<=p21]]]]]]] U [[[[1<=p11 | [1<=p0 & 1<=p14]] | [[[1<=p73 & 1<=p74] & [1<=p21 & 1<=p71]] & [[1<=p42 & 1<=p43] & [1<=p40 & 1<=p41]]]] | [~ [[1<=p0 & 1<=p7]] | [[1<=p0 & 1<=p19] & EG [1<=p25]]]] & EG [~ [[[1<=p14 & 1<=p65] | ~ [E [true U ~ [E [[[1<=p34 & 1<=p35] & [1<=p3 & 1<=p31]] U 1<=p21]]]]]]]]]]]]

abstracting: (1<=p21)
states: 319
abstracting: (1<=p31)
states: 168
abstracting: (1<=p3)
states: 462
abstracting: (1<=p35)
states: 168
abstracting: (1<=p34)
states: 168
abstracting: (1<=p65)
states: 72
abstracting: (1<=p14)
states: 84
.
EG iterations: 1
abstracting: (1<=p25)
states: 4
...
EG iterations: 3
abstracting: (1<=p19)
states: 27
abstracting: (1<=p0)
states: 219
abstracting: (1<=p7)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p41)
states: 136
abstracting: (1<=p40)
states: 136
abstracting: (1<=p43)
states: 444
abstracting: (1<=p42)
states: 136
abstracting: (1<=p71)
states: 566
abstracting: (1<=p21)
states: 319
abstracting: (1<=p74)
states: 566
abstracting: (1<=p73)
states: 566
abstracting: (1<=p14)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p11)
states: 66
abstracting: (1<=p21)
states: 319
abstracting: (1<=p31)
states: 168
abstracting: (1<=p3)
states: 462
abstracting: (1<=p35)
states: 168
abstracting: (1<=p34)
states: 168
abstracting: (1<=p65)
states: 72
abstracting: (1<=p14)
states: 84
.
EG iterations: 1
abstracting: (1<=p21)
states: 319
abstracting: (1<=p31)
states: 168
abstracting: (1<=p3)
states: 462
abstracting: (1<=p35)
states: 168
abstracting: (1<=p34)
states: 168
abstracting: (1<=p65)
states: 72
abstracting: (1<=p14)
states: 84
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: AF [AG [[[1<=p28 & 1<=p56] & [1<=p57 & [1<=p58 & [E [AG [[[1<=p16 & 1<=p72] | [[1<=p14 & 1<=p65] | [1<=p13 & 1<=p66]]]] U ~ [[[[1<=p9 & 1<=p47] & [1<=p52 & 1<=p60]] | [[[1<=p8 & 1<=p48] & [1<=p53 & 1<=p59]] | [[1<=p7 & 1<=p49] & [1<=p51 & 1<=p54]]]]]] | [[p0<=0 | p1<=0] & [[p0<=0 | p3<=0] & [p0<=0 | p2<=0]]]]]]]]]
normalized: ~ [EG [E [true U ~ [[[1<=p57 & [1<=p58 & [[[[p0<=0 | p2<=0] & [p0<=0 | p3<=0]] & [p0<=0 | p1<=0]] | E [~ [E [true U ~ [[[[1<=p13 & 1<=p66] | [1<=p14 & 1<=p65]] | [1<=p16 & 1<=p72]]]]] U ~ [[[[[1<=p51 & 1<=p54] & [1<=p7 & 1<=p49]] | [[1<=p53 & 1<=p59] & [1<=p8 & 1<=p48]]] | [[1<=p52 & 1<=p60] & [1<=p9 & 1<=p47]]]]]]]] & [1<=p28 & 1<=p56]]]]]]

abstracting: (1<=p56)
states: 32
abstracting: (1<=p28)
states: 32
abstracting: (1<=p47)
states: 222
abstracting: (1<=p9)
states: 291
abstracting: (1<=p60)
states: 222
abstracting: (1<=p52)
states: 222
abstracting: (1<=p48)
states: 222
abstracting: (1<=p8)
states: 291
abstracting: (1<=p59)
states: 222
abstracting: (1<=p53)
states: 222
abstracting: (1<=p49)
states: 222
abstracting: (1<=p7)
states: 291
abstracting: (1<=p54)
states: 222
abstracting: (1<=p51)
states: 222
abstracting: (1<=p72)
states: 72
abstracting: (1<=p16)
states: 84
abstracting: (1<=p65)
states: 72
abstracting: (1<=p14)
states: 84
abstracting: (1<=p66)
states: 72
abstracting: (1<=p13)
states: 84
abstracting: (p1<=0)
states: 567
abstracting: (p0<=0)
states: 810
abstracting: (p3<=0)
states: 567
abstracting: (p0<=0)
states: 810
abstracting: (p2<=0)
states: 567
abstracting: (p0<=0)
states: 810
abstracting: (1<=p58)
states: 32
abstracting: (1<=p57)
states: 32

EG iterations: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: [AF [[[~ [E [~ [[[1<=p16 & 1<=p72] | [[1<=p14 & 1<=p65] | [1<=p13 & 1<=p66]]]] U 1<=p21]] & [[1<=p20 & 1<=p61] | [[1<=p19 & 1<=p62] | [1<=p22 & 1<=p55]]]] & [p4<=0 & [p5<=0 & p6<=0]]]] | ~ [A [~ [[[1<=p0 & 1<=p18] | [[1<=p0 & 1<=p15] | [1<=p0 & 1<=p17]]]] U [[~ [[EX [[[[1<=p9 & 1<=p47] & [1<=p52 & 1<=p60]] | [[[1<=p8 & 1<=p48] & [1<=p53 & 1<=p59]] | [[1<=p7 & 1<=p49] & [1<=p51 & 1<=p54]]]]] & E [1<=p24 U [[1<=p21 & 1<=p71] & [1<=p73 & 1<=p74]]]]] | [1<=p0 & 1<=p4]] | [[1<=p0 & 1<=p6] | [1<=p0 & 1<=p5]]]]]]
normalized: [~ [[~ [EG [~ [[[[1<=p0 & 1<=p5] | [1<=p0 & 1<=p6]] | [[1<=p0 & 1<=p4] | ~ [[E [1<=p24 U [[1<=p73 & 1<=p74] & [1<=p21 & 1<=p71]]] & EX [[[[[1<=p51 & 1<=p54] & [1<=p7 & 1<=p49]] | [[1<=p53 & 1<=p59] & [1<=p8 & 1<=p48]]] | [[1<=p52 & 1<=p60] & [1<=p9 & 1<=p47]]]]]]]]]]] & ~ [E [~ [[[[1<=p0 & 1<=p5] | [1<=p0 & 1<=p6]] | [[1<=p0 & 1<=p4] | ~ [[E [1<=p24 U [[1<=p73 & 1<=p74] & [1<=p21 & 1<=p71]]] & EX [[[[[1<=p51 & 1<=p54] & [1<=p7 & 1<=p49]] | [[1<=p53 & 1<=p59] & [1<=p8 & 1<=p48]]] | [[1<=p52 & 1<=p60] & [1<=p9 & 1<=p47]]]]]]]]] U [[[[1<=p0 & 1<=p17] | [1<=p0 & 1<=p15]] | [1<=p0 & 1<=p18]] & ~ [[[[1<=p0 & 1<=p5] | [1<=p0 & 1<=p6]] | [[1<=p0 & 1<=p4] | ~ [[E [1<=p24 U [[1<=p73 & 1<=p74] & [1<=p21 & 1<=p71]]] & EX [[[[[1<=p51 & 1<=p54] & [1<=p7 & 1<=p49]] | [[1<=p53 & 1<=p59] & [1<=p8 & 1<=p48]]] | [[1<=p52 & 1<=p60] & [1<=p9 & 1<=p47]]]]]]]]]]]]]] | ~ [EG [~ [[[p4<=0 & [p5<=0 & p6<=0]] & [[[[1<=p22 & 1<=p55] | [1<=p19 & 1<=p62]] | [1<=p20 & 1<=p61]] & ~ [E [~ [[[[1<=p13 & 1<=p66] | [1<=p14 & 1<=p65]] | [1<=p16 & 1<=p72]]] U 1<=p21]]]]]]]]

abstracting: (1<=p21)
states: 319
abstracting: (1<=p72)
states: 72
abstracting: (1<=p16)
states: 84
abstracting: (1<=p65)
states: 72
abstracting: (1<=p14)
states: 84
abstracting: (1<=p66)
states: 72
abstracting: (1<=p13)
states: 84
abstracting: (1<=p61)
states: 32
abstracting: (1<=p20)
states: 27
abstracting: (1<=p62)
states: 32
abstracting: (1<=p19)
states: 27
abstracting: (1<=p55)
states: 32
abstracting: (1<=p22)
states: 27
abstracting: (p6<=0)
states: 885
abstracting: (p5<=0)
states: 885
abstracting: (p4<=0)
states: 885
..
EG iterations: 2
abstracting: (1<=p47)
states: 222
abstracting: (1<=p9)
states: 291
abstracting: (1<=p60)
states: 222
abstracting: (1<=p52)
states: 222
abstracting: (1<=p48)
states: 222
abstracting: (1<=p8)
states: 291
abstracting: (1<=p59)
states: 222
abstracting: (1<=p53)
states: 222
abstracting: (1<=p49)
states: 222
abstracting: (1<=p7)
states: 291
abstracting: (1<=p54)
states: 222
abstracting: (1<=p51)
states: 222
.abstracting: (1<=p71)
states: 566
abstracting: (1<=p21)
states: 319
abstracting: (1<=p74)
states: 566
abstracting: (1<=p73)
states: 566
abstracting: (1<=p24)
states: 4
abstracting: (1<=p4)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p6)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p5)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p18)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p15)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p17)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p47)
states: 222
abstracting: (1<=p9)
states: 291
abstracting: (1<=p60)
states: 222
abstracting: (1<=p52)
states: 222
abstracting: (1<=p48)
states: 222
abstracting: (1<=p8)
states: 291
abstracting: (1<=p59)
states: 222
abstracting: (1<=p53)
states: 222
abstracting: (1<=p49)
states: 222
abstracting: (1<=p7)
states: 291
abstracting: (1<=p54)
states: 222
abstracting: (1<=p51)
states: 222
.abstracting: (1<=p71)
states: 566
abstracting: (1<=p21)
states: 319
abstracting: (1<=p74)
states: 566
abstracting: (1<=p73)
states: 566
abstracting: (1<=p24)
states: 4
abstracting: (1<=p4)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p6)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p5)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p47)
states: 222
abstracting: (1<=p9)
states: 291
abstracting: (1<=p60)
states: 222
abstracting: (1<=p52)
states: 222
abstracting: (1<=p48)
states: 222
abstracting: (1<=p8)
states: 291
abstracting: (1<=p59)
states: 222
abstracting: (1<=p53)
states: 222
abstracting: (1<=p49)
states: 222
abstracting: (1<=p7)
states: 291
abstracting: (1<=p54)
states: 222
abstracting: (1<=p51)
states: 222
.abstracting: (1<=p71)
states: 566
abstracting: (1<=p21)
states: 319
abstracting: (1<=p74)
states: 566
abstracting: (1<=p73)
states: 566
abstracting: (1<=p24)
states: 4
abstracting: (1<=p4)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p6)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p5)
states: 144
abstracting: (1<=p0)
states: 219
........
EG iterations: 8
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: [AG [[[p28<=0 | p56<=0] | [p57<=0 | p58<=0]]] | [EX [A [[[[1<=p3 & 1<=p31] & [1<=p34 & 1<=p35]] | [[[1<=p1 & 1<=p26] & [1<=p27 & 1<=p29]] | [[1<=p2 & 1<=p30] & [1<=p32 & 1<=p33]]]] U 1<=p25]] | EG [[E [[[1<=p0 & 1<=p14] | [[1<=p0 & 1<=p16] | [1<=p0 & 1<=p13]]] U [[1<=p23 & 1<=p63] & [1<=p64 & 1<=p70]]] | [~ [E [1<=p28 U ~ [[[p0<=0 | p4<=0] & [[p0<=0 | p6<=0] & [p0<=0 | p5<=0]]]]]] | ~ [A [E [1<=p23 U [[[1<=p9 & 1<=p47] & [1<=p52 & 1<=p60]] | [[[1<=p8 & 1<=p48] & [1<=p53 & 1<=p59]] | [[1<=p7 & 1<=p49] & [1<=p51 & 1<=p54]]]]] U [[[1<=p0 & 1<=p11] | [1<=p0 & 1<=p10]] | [[1<=p0 & 1<=p12] | [[1<=p21 & 1<=p71] & [1<=p73 & 1<=p74]]]]]]]]]]]
normalized: [[EG [[[~ [[~ [EG [~ [[[[[1<=p73 & 1<=p74] & [1<=p21 & 1<=p71]] | [1<=p0 & 1<=p12]] | [[1<=p0 & 1<=p10] | [1<=p0 & 1<=p11]]]]]] & ~ [E [~ [[[[[1<=p73 & 1<=p74] & [1<=p21 & 1<=p71]] | [1<=p0 & 1<=p12]] | [[1<=p0 & 1<=p10] | [1<=p0 & 1<=p11]]]] U [~ [E [1<=p23 U [[[[1<=p51 & 1<=p54] & [1<=p7 & 1<=p49]] | [[1<=p53 & 1<=p59] & [1<=p8 & 1<=p48]]] | [[1<=p52 & 1<=p60] & [1<=p9 & 1<=p47]]]]] & ~ [[[[[1<=p73 & 1<=p74] & [1<=p21 & 1<=p71]] | [1<=p0 & 1<=p12]] | [[1<=p0 & 1<=p10] | [1<=p0 & 1<=p11]]]]]]]]] | ~ [E [1<=p28 U ~ [[[[p0<=0 | p5<=0] & [p0<=0 | p6<=0]] & [p0<=0 | p4<=0]]]]]] | E [[[[1<=p0 & 1<=p13] | [1<=p0 & 1<=p16]] | [1<=p0 & 1<=p14]] U [[1<=p64 & 1<=p70] & [1<=p23 & 1<=p63]]]]] | EX [[~ [EG [~ [1<=p25]]] & ~ [E [~ [1<=p25] U [~ [[[[[1<=p32 & 1<=p33] & [1<=p2 & 1<=p30]] | [[1<=p27 & 1<=p29] & [1<=p1 & 1<=p26]]] | [[1<=p34 & 1<=p35] & [1<=p3 & 1<=p31]]]] & ~ [1<=p25]]]]]]] | ~ [E [true U ~ [[[p57<=0 | p58<=0] | [p28<=0 | p56<=0]]]]]]

abstracting: (p56<=0)
states: 997
abstracting: (p28<=0)
states: 997
abstracting: (p58<=0)
states: 997
abstracting: (p57<=0)
states: 997
abstracting: (1<=p25)
states: 4
abstracting: (1<=p31)
states: 168
abstracting: (1<=p3)
states: 462
abstracting: (1<=p35)
states: 168
abstracting: (1<=p34)
states: 168
abstracting: (1<=p26)
states: 168
abstracting: (1<=p1)
states: 462
abstracting: (1<=p29)
states: 168
abstracting: (1<=p27)
states: 168
abstracting: (1<=p30)
states: 168
abstracting: (1<=p2)
states: 462
abstracting: (1<=p33)
states: 168
abstracting: (1<=p32)
states: 168
abstracting: (1<=p25)
states: 4
abstracting: (1<=p25)
states: 4
.
EG iterations: 1
.abstracting: (1<=p63)
states: 32
abstracting: (1<=p23)
states: 32
abstracting: (1<=p70)
states: 32
abstracting: (1<=p64)
states: 32
abstracting: (1<=p14)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p16)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p13)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (p4<=0)
states: 885
abstracting: (p0<=0)
states: 810
abstracting: (p6<=0)
states: 885
abstracting: (p0<=0)
states: 810
abstracting: (p5<=0)
states: 885
abstracting: (p0<=0)
states: 810
abstracting: (1<=p28)
states: 32
abstracting: (1<=p11)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p10)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p12)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p71)
states: 566
abstracting: (1<=p21)
states: 319
abstracting: (1<=p74)
states: 566
abstracting: (1<=p73)
states: 566
abstracting: (1<=p47)
states: 222
abstracting: (1<=p9)
states: 291
abstracting: (1<=p60)
states: 222
abstracting: (1<=p52)
states: 222
abstracting: (1<=p48)
states: 222
abstracting: (1<=p8)
states: 291
abstracting: (1<=p59)
states: 222
abstracting: (1<=p53)
states: 222
abstracting: (1<=p49)
states: 222
abstracting: (1<=p7)
states: 291
abstracting: (1<=p54)
states: 222
abstracting: (1<=p51)
states: 222
abstracting: (1<=p23)
states: 32
abstracting: (1<=p11)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p10)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p12)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p71)
states: 566
abstracting: (1<=p21)
states: 319
abstracting: (1<=p74)
states: 566
abstracting: (1<=p73)
states: 566
abstracting: (1<=p11)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p10)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p12)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p71)
states: 566
abstracting: (1<=p21)
states: 319
abstracting: (1<=p74)
states: 566
abstracting: (1<=p73)
states: 566
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

totally nodes used: 381885 (3.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 132607 638696 771303
used/not used/entry size/cache size: 931341 66177523 16 1024MB
basic ops cache: hits/miss/sum: 38552 230238 268790
used/not used/entry size/cache size: 349238 16427978 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: 3907 14832 18739
used/not used/entry size/cache size: 14827 8373781 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 66748879
1 340100
2 18170
3 1596
4 100
5 8
6 0
7 1
8 0
9 0
>= 10 10

Total processing time: 0m 5.170sec


BK_STOP 1679685386735

--------------------
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:875 (15), effective:56 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:110 (1), effective:9 (0)

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

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

iterations count:81 (1), effective:3 (0)

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

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

iterations count:112 (2), effective:11 (0)

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

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

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

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

iterations count:83 (1), effective:3 (0)

iterations count:74 (1), effective:3 (0)

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

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

iterations count:80 (1), effective:3 (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="QuasiCertifProtocol-PT-02"
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 QuasiCertifProtocol-PT-02, 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-167873952300858"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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