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.r394-oct2-167903717600178.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-001A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.1K 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 ShieldIIPt-PT-001A-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-001A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679497581313

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=ShieldIIPt-PT-001A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:06:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 15:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:06:23] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-22 15:06:23] [INFO ] Transformed 22 places.
[2023-03-22 15:06:23] [INFO ] Transformed 17 transitions.
[2023-03-22 15:06:23] [INFO ] Found NUPN structural information;
[2023-03-22 15:06:23] [INFO ] Parsed PT model containing 22 places and 17 transitions and 66 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-001A-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 14 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2023-03-22 15:06:23] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-22 15:06:24] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-22 15:06:24] [INFO ] Invariant cache hit.
[2023-03-22 15:06:24] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-22 15:06:24] [INFO ] Invariant cache hit.
[2023-03-22 15:06: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 460 ms. Remains : 22/22 places, 16/16 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-22 15:06:24] [INFO ] Flatten gal took : 16 ms
[2023-03-22 15:06:24] [INFO ] Flatten gal took : 7 ms
[2023-03-22 15:06:24] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 37) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 15:06:24] [INFO ] Invariant cache hit.
[2023-03-22 15:06:24] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-22 15:06:24] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2023-03-22 15:06:24] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:06:24] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:06:24] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
Applied a total of 4 rules in 7 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 20/22 places, 14/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 21/22 places, 15/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 16/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 20/22 places, 14/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 20/22 places, 14/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
Applied a total of 4 rules in 1 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 20/22 places, 14/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 14 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
FORMULA ShieldIIPt-PT-001A-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 16/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 11 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 16/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Applied a total of 2 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 21/22 places, 15/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 16/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 16/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 16/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 16/16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:06:25] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:06:25] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 15:06:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 16 transitions and 64 arcs took 0 ms.
Total runtime 1660 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: 22 NrTr: 16 NrArc: 64)

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

net check time: 0m 0.000sec

init dd package: 0m 2.883sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 52 (5.2e+01) #states 1,281 (3)



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

checking: AF [~ [E [[p20<=1 & 1<=p20] U [p0<=1 & 1<=p0]]]]
normalized: ~ [EG [E [[p20<=1 & 1<=p20] U [p0<=1 & 1<=p0]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,281 (3)
abstracting: (1<=p20)
states: 640
abstracting: (p20<=1)
states: 1,281 (3)
..
EG iterations: 2
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001A-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [AF [EX [EG [[[p20<=1 & 1<=p20] | [p18<=1 & 1<=p18]]]]]]
normalized: EG [~ [EG [~ [EX [EG [[[p20<=1 & 1<=p20] | [p18<=1 & 1<=p18]]]]]]]]

abstracting: (1<=p18)
states: 640
abstracting: (p18<=1)
states: 1,281 (3)
abstracting: (1<=p20)
states: 640
abstracting: (p20<=1)
states: 1,281 (3)
..................
EG iterations: 18
.........
EG iterations: 8
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EG [[~ [A [[[p4<=1 & 1<=p4] & [p17<=1 & 1<=p17]] U [[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]]] & [[p7<=0 & 0<=p7] | [p9<=0 & 0<=p9]]]]
normalized: EG [[[[p9<=0 & 0<=p9] | [p7<=0 & 0<=p7]] & ~ [[~ [EG [~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]]]] & ~ [E [~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]] U [~ [[[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]]] & ~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]]]]]]]]]

abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p4)
states: 640
abstracting: (p4<=1)
states: 1,281 (3)
abstracting: (1<=p17)
states: 640
abstracting: (p17<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
.
EG iterations: 1
abstracting: (0<=p7)
states: 1,281 (3)
abstracting: (p7<=0)
states: 769
abstracting: (0<=p9)
states: 1,281 (3)
abstracting: (p9<=0)
states: 769
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001A-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EF [[[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]]] & EF [AG [[AX [EF [[[p13<=1 & 1<=p13] & [[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]]] | [p12<=1 & 1<=p12]]]]]
normalized: [E [true U ~ [E [true U ~ [[[p12<=1 & 1<=p12] | ~ [EX [~ [E [true U [[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]]]]]]]]]] & E [true U [[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]]]]

abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p13)
states: 640
abstracting: (p13<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p21)
states: 640
abstracting: (p21<=1)
states: 1,281 (3)
.abstracting: (1<=p12)
states: 640
abstracting: (p12<=1)
states: 1,281 (3)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001A-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [[EF [AG [~ [A [[p16<=1 & 1<=p16] U [[p13<=1 & 1<=p13] & [[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]]]]] | [EG [[p12<=0 & 0<=p12]] & [p12<=0 & 0<=p12]]]]
normalized: ~ [EX [~ [[[[p12<=0 & 0<=p12] & EG [[p12<=0 & 0<=p12]]] | E [true U ~ [E [true U [~ [EG [~ [[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]] U [~ [[p16<=1 & 1<=p16]] & ~ [[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]]]]]]]]]]]]]

abstracting: (1<=p13)
states: 640
abstracting: (p13<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p21)
states: 640
abstracting: (p21<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p13)
states: 640
abstracting: (p13<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p21)
states: 640
abstracting: (p21<=1)
states: 1,281 (3)
abstracting: (1<=p13)
states: 640
abstracting: (p13<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p21)
states: 640
abstracting: (p21<=1)
states: 1,281 (3)
.................
EG iterations: 17
abstracting: (0<=p12)
states: 1,281 (3)
abstracting: (p12<=0)
states: 641
......
EG iterations: 6
abstracting: (0<=p12)
states: 1,281 (3)
abstracting: (p12<=0)
states: 641
.-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EG [AF [[~ [E [[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]] U [[p4<=1 & 1<=p4] & [p17<=1 & 1<=p17]]]] & [[p20<=0 & 0<=p20] & [[[p8<=0 & 0<=p8] | [p19<=0 & 0<=p19]] | [[p4<=0 & 0<=p4] | [p17<=0 & 0<=p17]]]]]]]
normalized: EG [~ [EG [~ [[[[[[p17<=0 & 0<=p17] | [p4<=0 & 0<=p4]] | [[p19<=0 & 0<=p19] | [p8<=0 & 0<=p8]]] & [p20<=0 & 0<=p20]] & ~ [E [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]] U [[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]]]]]]]]]

abstracting: (1<=p4)
states: 640
abstracting: (p4<=1)
states: 1,281 (3)
abstracting: (1<=p17)
states: 640
abstracting: (p17<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (0<=p20)
states: 1,281 (3)
abstracting: (p20<=0)
states: 641
abstracting: (0<=p8)
states: 1,281 (3)
abstracting: (p8<=0)
states: 769
abstracting: (0<=p19)
states: 1,281 (3)
abstracting: (p19<=0)
states: 641
abstracting: (0<=p4)
states: 1,281 (3)
abstracting: (p4<=0)
states: 641
abstracting: (0<=p17)
states: 1,281 (3)
abstracting: (p17<=0)
states: 641
.
EG iterations: 1
................
EG iterations: 16
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AX [[EX [[[[p7<=0 & 0<=p7] | [p9<=0 & 0<=p9]] & AF [[[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]]]]] | [[p12<=1 & 1<=p12] & [EX [[A [[p0<=1 & 1<=p0] U [p16<=1 & 1<=p16]] & [p14<=1 & 1<=p14]]] & AX [EF [[[p11<=0 & 0<=p11] | [[p15<=0 & 0<=p15] | [p21<=0 & 0<=p21]]]]]]]]]
normalized: ~ [EX [~ [[[[~ [EX [~ [E [true U [[[p21<=0 & 0<=p21] | [p15<=0 & 0<=p15]] | [p11<=0 & 0<=p11]]]]]] & EX [[[p14<=1 & 1<=p14] & [~ [EG [~ [[p16<=1 & 1<=p16]]]] & ~ [E [~ [[p16<=1 & 1<=p16]] U [~ [[p0<=1 & 1<=p0]] & ~ [[p16<=1 & 1<=p16]]]]]]]]] & [p12<=1 & 1<=p12]] | EX [[~ [EG [~ [[[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]]]]] & [[p9<=0 & 0<=p9] | [p7<=0 & 0<=p7]]]]]]]]

abstracting: (0<=p7)
states: 1,281 (3)
abstracting: (p7<=0)
states: 769
abstracting: (0<=p9)
states: 1,281 (3)
abstracting: (p9<=0)
states: 769
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
.......................
EG iterations: 23
.abstracting: (1<=p12)
states: 640
abstracting: (p12<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
.
EG iterations: 1
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
.abstracting: (0<=p11)
states: 1,281 (3)
abstracting: (p11<=0)
states: 641
abstracting: (0<=p15)
states: 1,281 (3)
abstracting: (p15<=0)
states: 641
abstracting: (0<=p21)
states: 1,281 (3)
abstracting: (p21<=0)
states: 641
..-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[EG [AG [AF [[[p3<=0 & 0<=p3] | [p20<=0 & 0<=p20]]]]] | [AG [[EF [[[p7<=0 & 0<=p7] | [p9<=0 & 0<=p9]]] | E [[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]] U [[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]]]] & [[EF [[[p8<=0 & 0<=p8] | [p19<=0 & 0<=p19]]] | [p20<=0 & 0<=p20]] | [[[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]] | [[p12<=0 & 0<=p12] & [[p2<=0 & 0<=p2] | [p10<=0 & 0<=p10]]]]]]]]
normalized: E [true U [[[[[[[p10<=0 & 0<=p10] | [p2<=0 & 0<=p2]] & [p12<=0 & 0<=p12]] | [[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]]] | [[p20<=0 & 0<=p20] | E [true U [[p19<=0 & 0<=p19] | [p8<=0 & 0<=p8]]]]] & ~ [E [true U ~ [[E [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]] U [[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]] | E [true U [[p9<=0 & 0<=p9] | [p7<=0 & 0<=p7]]]]]]]] | EG [~ [E [true U EG [~ [[[p20<=0 & 0<=p20] | [p3<=0 & 0<=p3]]]]]]]]]

abstracting: (0<=p3)
states: 1,281 (3)
abstracting: (p3<=0)
states: 641
abstracting: (0<=p20)
states: 1,281 (3)
abstracting: (p20<=0)
states: 641
.................
EG iterations: 17

EG iterations: 0
abstracting: (0<=p7)
states: 1,281 (3)
abstracting: (p7<=0)
states: 769
abstracting: (0<=p9)
states: 1,281 (3)
abstracting: (p9<=0)
states: 769
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (0<=p8)
states: 1,281 (3)
abstracting: (p8<=0)
states: 769
abstracting: (0<=p19)
states: 1,281 (3)
abstracting: (p19<=0)
states: 641
abstracting: (0<=p20)
states: 1,281 (3)
abstracting: (p20<=0)
states: 641
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (0<=p12)
states: 1,281 (3)
abstracting: (p12<=0)
states: 641
abstracting: (0<=p2)
states: 1,281 (3)
abstracting: (p2<=0)
states: 641
abstracting: (0<=p10)
states: 1,281 (3)
abstracting: (p10<=0)
states: 641
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001A-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[AG [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]]] | [EF [[[[[AG [[[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]]] & [p11<=1 & 1<=p11]] & [[p15<=1 & 1<=p15] & [[p21<=1 & 1<=p21] & [p12<=1 & 1<=p12]]]] | [p14<=0 & 0<=p14]] | [[p7<=0 & 0<=p7] | [p9<=0 & 0<=p9]]]] | [E [[[p4<=1 & 1<=p4] & [p17<=1 & 1<=p17]] U [p12<=1 & 1<=p12]] & [[p0<=1 & 1<=p0] & [[p3<=0 & 0<=p3] | [p20<=0 & 0<=p20]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p20<=0 & 0<=p20] | [p3<=0 & 0<=p3]] & [p0<=1 & 1<=p0]] & E [[[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]] U [p12<=1 & 1<=p12]]] | E [true U [[[p9<=0 & 0<=p9] | [p7<=0 & 0<=p7]] | [[p14<=0 & 0<=p14] | [[[[p12<=1 & 1<=p12] & [p21<=1 & 1<=p21]] & [p15<=1 & 1<=p15]] & [[p11<=1 & 1<=p11] & ~ [E [true U ~ [[[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]]]]]]]]]]] | ~ [E [true U ~ [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]]]]]]

abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,281 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,281 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p11)
states: 640
abstracting: (p11<=1)
states: 1,281 (3)
abstracting: (1<=p15)
states: 640
abstracting: (p15<=1)
states: 1,281 (3)
abstracting: (1<=p21)
states: 640
abstracting: (p21<=1)
states: 1,281 (3)
abstracting: (1<=p12)
states: 640
abstracting: (p12<=1)
states: 1,281 (3)
abstracting: (0<=p14)
states: 1,281 (3)
abstracting: (p14<=0)
states: 641
abstracting: (0<=p7)
states: 1,281 (3)
abstracting: (p7<=0)
states: 769
abstracting: (0<=p9)
states: 1,281 (3)
abstracting: (p9<=0)
states: 769
abstracting: (1<=p12)
states: 640
abstracting: (p12<=1)
states: 1,281 (3)
abstracting: (1<=p4)
states: 640
abstracting: (p4<=1)
states: 1,281 (3)
abstracting: (1<=p17)
states: 640
abstracting: (p17<=1)
states: 1,281 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,281 (3)
abstracting: (0<=p3)
states: 1,281 (3)
abstracting: (p3<=0)
states: 641
abstracting: (0<=p20)
states: 1,281 (3)
abstracting: (p20<=0)
states: 641
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001A-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [[[p11<=1 & 1<=p11] & [[p15<=1 & 1<=p15] & [p21<=1 & 1<=p21]]] U ~ [E [~ [[[[[p4<=1 & 1<=p4] & [p17<=1 & 1<=p17]] | [[[p1<=1 & 1<=p1] & [p18<=1 & 1<=p18]] | ~ [[[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]]]]] & [[[p14<=1 & 1<=p14] & [[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]]] | A [[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]] U [p14<=1 & 1<=p14]]]]] U [[p16<=1 & 1<=p16] & ~ [[[p5<=1 & 1<=p5] & [p16<=1 & 1<=p16]]]]]]]
normalized: [~ [EG [E [~ [[[[~ [EG [~ [[p14<=1 & 1<=p14]]]] & ~ [E [~ [[p14<=1 & 1<=p14]] U [~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]] & ~ [[p14<=1 & 1<=p14]]]]]] | [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]] & [p14<=1 & 1<=p14]]] & [[~ [[[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]]] | [[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]]] | [[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]]]]] U [~ [[[p16<=1 & 1<=p16] & [p5<=1 & 1<=p5]]] & [p16<=1 & 1<=p16]]]]] & ~ [E [E [~ [[[[~ [EG [~ [[p14<=1 & 1<=p14]]]] & ~ [E [~ [[p14<=1 & 1<=p14]] U [~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]] & ~ [[p14<=1 & 1<=p14]]]]]] | [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]] & [p14<=1 & 1<=p14]]] & [[~ [[[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]]] | [[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]]] | [[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]]]]] U [~ [[[p16<=1 & 1<=p16] & [p5<=1 & 1<=p5]]] & [p16<=1 & 1<=p16]]] U [~ [[[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]] & [p11<=1 & 1<=p11]]] & E [~ [[[[~ [EG [~ [[p14<=1 & 1<=p14]]]] & ~ [E [~ [[p14<=1 & 1<=p14]] U [~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]] & ~ [[p14<=1 & 1<=p14]]]]]] | [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]] & [p14<=1 & 1<=p14]]] & [[~ [[[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]]] | [[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]]] | [[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]]]]] U [~ [[[p16<=1 & 1<=p16] & [p5<=1 & 1<=p5]]] & [p16<=1 & 1<=p16]]]]]]]

abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p4)
states: 640
abstracting: (p4<=1)
states: 1,281 (3)
abstracting: (1<=p17)
states: 640
abstracting: (p17<=1)
states: 1,281 (3)
abstracting: (1<=p1)
states: 640
abstracting: (p1<=1)
states: 1,281 (3)
abstracting: (1<=p18)
states: 640
abstracting: (p18<=1)
states: 1,281 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,281 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
.
EG iterations: 1
abstracting: (1<=p11)
states: 640
abstracting: (p11<=1)
states: 1,281 (3)
abstracting: (1<=p15)
states: 640
abstracting: (p15<=1)
states: 1,281 (3)
abstracting: (1<=p21)
states: 640
abstracting: (p21<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p4)
states: 640
abstracting: (p4<=1)
states: 1,281 (3)
abstracting: (1<=p17)
states: 640
abstracting: (p17<=1)
states: 1,281 (3)
abstracting: (1<=p1)
states: 640
abstracting: (p1<=1)
states: 1,281 (3)
abstracting: (1<=p18)
states: 640
abstracting: (p18<=1)
states: 1,281 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,281 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
.
EG iterations: 1
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p4)
states: 640
abstracting: (p4<=1)
states: 1,281 (3)
abstracting: (1<=p17)
states: 640
abstracting: (p17<=1)
states: 1,281 (3)
abstracting: (1<=p1)
states: 640
abstracting: (p1<=1)
states: 1,281 (3)
abstracting: (1<=p18)
states: 640
abstracting: (p18<=1)
states: 1,281 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,281 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [EF [[[p0<=1 & 1<=p0] & [EG [E [[[p4<=1 & 1<=p4] & [p17<=1 & 1<=p17]] U [p14<=1 & 1<=p14]]] & E [[EX [[[p13<=1 & 1<=p13] & [[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]] & AX [[[p13<=1 & 1<=p13] & [[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]]] U EX [[[p20<=1 & 1<=p20] | [[p6<=1 & 1<=p6] & [p15<=1 & 1<=p15]]]]]]]] & AX [[[~ [A [[~ [[p14<=1 & 1<=p14]] | EF [[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]]] U [p12<=1 & 1<=p12]]] | [p14<=1 & 1<=p14]] | [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]] | AX [[p16<=1 & 1<=p16]]]]]]
normalized: [~ [EX [~ [[[~ [EX [~ [[p16<=1 & 1<=p16]]]] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | [[p14<=1 & 1<=p14] | ~ [[~ [EG [~ [[p12<=1 & 1<=p12]]]] & ~ [E [~ [[p12<=1 & 1<=p12]] U [~ [[E [true U [[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]] | ~ [[p14<=1 & 1<=p14]]]] & ~ [[p12<=1 & 1<=p12]]]]]]]]]]]] & E [true U [[E [[~ [EX [~ [[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]]]] & EX [[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]]] U EX [[[[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]] | [p20<=1 & 1<=p20]]]] & EG [E [[[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]] U [p14<=1 & 1<=p14]]]] & [p0<=1 & 1<=p0]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p4)
states: 640
abstracting: (p4<=1)
states: 1,281 (3)
abstracting: (1<=p17)
states: 640
abstracting: (p17<=1)
states: 1,281 (3)
.
EG iterations: 1
abstracting: (1<=p20)
states: 640
abstracting: (p20<=1)
states: 1,281 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,281 (3)
abstracting: (1<=p15)
states: 640
abstracting: (p15<=1)
states: 1,281 (3)
.abstracting: (1<=p13)
states: 640
abstracting: (p13<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p21)
states: 640
abstracting: (p21<=1)
states: 1,281 (3)
.abstracting: (1<=p13)
states: 640
abstracting: (p13<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p21)
states: 640
abstracting: (p21<=1)
states: 1,281 (3)
.abstracting: (1<=p12)
states: 640
abstracting: (p12<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p12)
states: 640
abstracting: (p12<=1)
states: 1,281 (3)
abstracting: (1<=p12)
states: 640
abstracting: (p12<=1)
states: 1,281 (3)
......
EG iterations: 6
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,281 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
..-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [E [[[AG [AX [[p18<=1 & 1<=p18]]] & A [[~ [[[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]] | [[p4<=1 & 1<=p4] & [p17<=1 & 1<=p17]]]] & [[[p20<=1 & 1<=p20] & [[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]] | [[p14<=1 & 1<=p14] | [[p13<=1 & 1<=p13] & [[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]]]] U [[[p6<=1 & 1<=p6] & [p15<=1 & 1<=p15]] | ~ [[[p1<=1 & 1<=p1] & [p18<=1 & 1<=p18]]]]]] & [[p5<=1 & 1<=p5] & [p16<=1 & 1<=p16]]] U EX [[[EF [[[p13<=1 & 1<=p13] & [[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]] & [p14<=1 & 1<=p14]] & [[p5<=1 & 1<=p5] & [p16<=1 & 1<=p16]]]]] | [EG [~ [A [~ [AX [[p0<=1 & 1<=p0]]] U [[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]]]] & [~ [E [~ [[~ [[p16<=1 & 1<=p16]] | [[[p5<=1 & 1<=p5] & [p16<=1 & 1<=p16]] | [[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]]]]] U [[AF [[p16<=1 & 1<=p16]] | [[[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]] & [[p3<=1 & 1<=p3] & [p20<=1 & 1<=p20]]]] | [[[p4<=1 & 1<=p4] & [p17<=1 & 1<=p17]] | [[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]]]]]] & EX [[[[p11<=0 & 0<=p11] | [[p15<=0 & 0<=p15] | [p21<=0 & 0<=p21]]] & [p14<=1 & 1<=p14]]]]]]
normalized: [[EG [~ [[~ [EG [~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]]]] & ~ [E [~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]] U [~ [EX [~ [[p0<=1 & 1<=p0]]]] & ~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]]]]]]]] & [EX [[[p14<=1 & 1<=p14] & [[[p21<=0 & 0<=p21] | [p15<=0 & 0<=p15]] | [p11<=0 & 0<=p11]]]] & ~ [E [~ [[[[[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]] | [[p16<=1 & 1<=p16] & [p5<=1 & 1<=p5]]] | ~ [[p16<=1 & 1<=p16]]]] U [[[[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]] | [[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]]] | [[[[p20<=1 & 1<=p20] & [p3<=1 & 1<=p3]] & [[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]]] | ~ [EG [~ [[p16<=1 & 1<=p16]]]]]]]]]] | E [[[[p16<=1 & 1<=p16] & [p5<=1 & 1<=p5]] & [[~ [EG [~ [[~ [[[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]]] | [[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]]]]]] & ~ [E [~ [[~ [[[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]]] | [[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]]]] U [~ [[[[[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]] | [p14<=1 & 1<=p14]] | [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]] & [p20<=1 & 1<=p20]]] & ~ [[[[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]] | [[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]]]]] & ~ [[~ [[[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]]] | [[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]]]]]]]] & ~ [E [true U EX [~ [[p18<=1 & 1<=p18]]]]]]] U EX [[[[p16<=1 & 1<=p16] & [p5<=1 & 1<=p5]] & [[p14<=1 & 1<=p14] & E [true U [[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]]]]]]]

abstracting: (1<=p13)
states: 640
abstracting: (p13<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p21)
states: 640
abstracting: (p21<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
.abstracting: (1<=p18)
states: 640
abstracting: (p18<=1)
states: 1,281 (3)
.abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,281 (3)
abstracting: (1<=p15)
states: 640
abstracting: (p15<=1)
states: 1,281 (3)
abstracting: (1<=p1)
states: 640
abstracting: (p1<=1)
states: 1,281 (3)
abstracting: (1<=p18)
states: 640
abstracting: (p18<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p4)
states: 640
abstracting: (p4<=1)
states: 1,281 (3)
abstracting: (1<=p17)
states: 640
abstracting: (p17<=1)
states: 1,281 (3)
abstracting: (1<=p20)
states: 640
abstracting: (p20<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
abstracting: (1<=p13)
states: 640
abstracting: (p13<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p21)
states: 640
abstracting: (p21<=1)
states: 1,281 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,281 (3)
abstracting: (1<=p15)
states: 640
abstracting: (p15<=1)
states: 1,281 (3)
abstracting: (1<=p1)
states: 640
abstracting: (p1<=1)
states: 1,281 (3)
abstracting: (1<=p18)
states: 640
abstracting: (p18<=1)
states: 1,281 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,281 (3)
abstracting: (1<=p15)
states: 640
abstracting: (p15<=1)
states: 1,281 (3)
abstracting: (1<=p1)
states: 640
abstracting: (p1<=1)
states: 1,281 (3)
abstracting: (1<=p18)
states: 640
abstracting: (p18<=1)
states: 1,281 (3)
................
EG iterations: 16
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p3)
states: 640
abstracting: (p3<=1)
states: 1,281 (3)
abstracting: (1<=p20)
states: 640
abstracting: (p20<=1)
states: 1,281 (3)
abstracting: (1<=p4)
states: 640
abstracting: (p4<=1)
states: 1,281 (3)
abstracting: (1<=p17)
states: 640
abstracting: (p17<=1)
states: 1,281 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
abstracting: (p16<=1)
states: 1,281 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,281 (3)
abstracting: (1<=p19)
states: 640
abstracting: (p19<=1)
states: 1,281 (3)
abstracting: (0<=p11)
states: 1,281 (3)
abstracting: (p11<=0)
states: 641
abstracting: (0<=p15)
states: 1,281 (3)
abstracting: (p15<=0)
states: 641
abstracting: (0<=p21)
states: 1,281 (3)
abstracting: (p21<=0)
states: 641
abstracting: (1<=p14)
states: 640
abstracting: (p14<=1)
states: 1,281 (3)
.abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,281 (3)
.abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
abstracting: (1<=p2)
states: 640
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (1<=p10)
states: 640
abstracting: (p10<=1)
states: 1,281 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 21439 (2.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 13539 42039 55578
used/not used/entry size/cache size: 60215 67048649 16 1024MB
basic ops cache: hits/miss/sum: 6498 15265 21763
used/not used/entry size/cache size: 30291 16746925 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: 598 482 1080
used/not used/entry size/cache size: 482 8388126 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 67087691
1 20911
2 258
3 4
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.640sec


BK_STOP 1679497590001

--------------------
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:147 (9), effective:41 (2)

initing FirstDep: 0m 0.000sec


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

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

iterations count:61 (3), effective:11 (0)

iterations count:32 (2), effective:4 (0)

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

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

iterations count:32 (2), effective:4 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:65 (4), effective:13 (0)

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

iterations count:65 (4), effective:13 (0)

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

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

iterations count:65 (4), effective:13 (0)

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

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

iterations count:47 (2), effective:8 (0)

iterations count:32 (2), effective:4 (0)

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

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

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-001A"
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 ShieldIIPt-PT-001A, 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 r394-oct2-167903717600178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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