fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r426-tajo-167905978300002
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldRVs-PT-001A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5449.220 9215.00 13705.00 65.50 TFTTTFFTFTFFFTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978300002.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-001A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978300002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 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.8K 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 ShieldRVs-PT-001A-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-001A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679338350606

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=ShieldRVs-PT-001A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:52:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 18:52:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:52:32] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-20 18:52:32] [INFO ] Transformed 17 places.
[2023-03-20 18:52:32] [INFO ] Transformed 22 transitions.
[2023-03-20 18:52:32] [INFO ] Found NUPN structural information;
[2023-03-20 18:52:32] [INFO ] Parsed PT model containing 17 places and 22 transitions and 92 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-001A-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001A-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 17 cols
[2023-03-20 18:52:32] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 18:52:32] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-20 18:52:32] [INFO ] Invariant cache hit.
[2023-03-20 18:52:32] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-20 18:52:32] [INFO ] Invariant cache hit.
[2023-03-20 18:52:32] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 17/17 places, 22/22 transitions.
Support contains 17 out of 17 places after structural reductions.
[2023-03-20 18:52:32] [INFO ] Flatten gal took : 17 ms
[2023-03-20 18:52:32] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:52:32] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 34) seen :30
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 18:52:33] [INFO ] Invariant cache hit.
[2023-03-20 18:52:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-20 18:52:33] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
FORMULA ShieldRVs-PT-001A-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001A-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 8 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA ShieldRVs-PT-001A-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17/17 places, 22/22 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 16 transition count 21
Applied a total of 2 rules in 3 ms. Remains 16 /17 variables (removed 1) and now considering 21/22 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 16/17 places, 21/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA ShieldRVs-PT-001A-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:33] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-20 18:52:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17 places, 22 transitions and 92 arcs took 0 ms.
Total runtime 1504 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: 17 NrTr: 22 NrArc: 92)

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

net check time: 0m 0.000sec

init dd package: 0m 3.465sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 186 (1.9e+02) #states 171



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

checking: AX [EF [EX [[AF [[p0<=1 & 1<=p0]] | AX [[[p6<=1 & 1<=p6] & [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]]]]]]
normalized: ~ [EX [~ [E [true U EX [[~ [EX [~ [[[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] & [p6<=1 & 1<=p6]]]]] | ~ [EG [~ [[p0<=1 & 1<=p0]]]]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 171
.
EG iterations: 1
abstracting: (1<=p6)
states: 51
abstracting: (p6<=1)
states: 171
abstracting: (1<=p7)
states: 88
abstracting: (p7<=1)
states: 171
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
...-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [AX [[[1<=p12 & p12<=1] & [p14<=1 & 1<=p14]]] | EX [AX [[[p6<=1 & 1<=p6] & [[p7<=1 & 1<=p7] & [p11<=1 & 1<=p11]]]]]]
normalized: [~ [EX [~ [[[p14<=1 & 1<=p14] & [1<=p12 & p12<=1]]]]] | EX [~ [EX [~ [[[[p11<=1 & 1<=p11] & [p7<=1 & 1<=p7]] & [p6<=1 & 1<=p6]]]]]]]

abstracting: (1<=p6)
states: 51
abstracting: (p6<=1)
states: 171
abstracting: (1<=p7)
states: 88
abstracting: (p7<=1)
states: 171
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
..abstracting: (p12<=1)
states: 171
abstracting: (1<=p12)
states: 45
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
.-> the formula is FALSE

FORMULA ShieldRVs-PT-001A-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [E [~ [AG [[[p10<=1 & 1<=p10] & [p14<=1 & 1<=p14]]]] U E [[[p8<=1 & 1<=p8] & [p13<=1 & 1<=p13]] U [p14<=1 & 1<=p14]]]]
normalized: ~ [E [E [true U ~ [[[p14<=1 & 1<=p14] & [p10<=1 & 1<=p10]]]] U E [[[p13<=1 & 1<=p13] & [p8<=1 & 1<=p8]] U [p14<=1 & 1<=p14]]]]

abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
abstracting: (1<=p8)
states: 82
abstracting: (p8<=1)
states: 171
abstracting: (1<=p13)
states: 54
abstracting: (p13<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
-> the formula is FALSE

FORMULA ShieldRVs-PT-001A-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [[[p14<=1 & 1<=p14] & [EX [[[p10<=1 & 1<=p10] & [p16<=1 & 1<=p16]]] | EG [AG [[[p2<=0 & 0<=p2] | [[p6<=0 & 0<=p6] | [p15<=0 & 0<=p15]]]]]]]]
normalized: EX [[[EG [~ [E [true U ~ [[[[p15<=0 & 0<=p15] | [p6<=0 & 0<=p6]] | [p2<=0 & 0<=p2]]]]]] | EX [[[p16<=1 & 1<=p16] & [p10<=1 & 1<=p10]]]] & [p14<=1 & 1<=p14]]]

abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
.abstracting: (0<=p2)
states: 171
abstracting: (p2<=0)
states: 83
abstracting: (0<=p6)
states: 171
abstracting: (p6<=0)
states: 120
abstracting: (0<=p15)
states: 171
abstracting: (p15<=0)
states: 136
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ShieldRVs-PT-001A-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [EF [AG [[EG [[p10<=1 & 1<=p10]] | [[[p10<=1 & 1<=p10] & [p16<=1 & 1<=p16]] | [[p2<=1 & 1<=p2] & [[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]]]]]]] & AX [AG [EX [EF [[[p2<=0 & 0<=p2] | [[p6<=0 & 0<=p6] | [p15<=0 & 0<=p15]]]]]]]]
normalized: [~ [EX [E [true U ~ [EX [E [true U [[[p15<=0 & 0<=p15] | [p6<=0 & 0<=p6]] | [p2<=0 & 0<=p2]]]]]]]] & E [true U ~ [E [true U ~ [[[[[[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]] | [[p16<=1 & 1<=p16] & [p10<=1 & 1<=p10]]] | EG [[p10<=1 & 1<=p10]]]]]]]]

abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
..........
EG iterations: 10
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (0<=p2)
states: 171
abstracting: (p2<=0)
states: 83
abstracting: (0<=p6)
states: 171
abstracting: (p6<=0)
states: 120
abstracting: (0<=p15)
states: 171
abstracting: (p15<=0)
states: 136
..-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: E [[[p12<=1 & 1<=p12] & [p16<=1 & 1<=p16]] U EG [[~ [A [EG [[[p5<=1 & 1<=p5] & [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]] U [[p2<=1 & 1<=p2] & [[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]]]]] & AG [AX [[[p2<=1 & 1<=p2] & [[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]]]]]]]]
normalized: E [[[p16<=1 & 1<=p16] & [p12<=1 & 1<=p12]] U EG [[~ [E [true U EX [~ [[[[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]]]]] & ~ [[~ [EG [~ [[[[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]]]] & ~ [E [~ [[[[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]] U [~ [EG [[[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] & [p5<=1 & 1<=p5]]]] & ~ [[[[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]]]]]]]]]]

abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (1<=p5)
states: 35
abstracting: (p5<=1)
states: 171
abstracting: (1<=p7)
states: 88
abstracting: (p7<=1)
states: 171
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
...
EG iterations: 3
abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
.
EG iterations: 1
abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
..
EG iterations: 1
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[AX [[p5<=1 & 1<=p5]] | A [[AG [[[p2<=1 & 1<=p2] & [[p4<=1 & 1<=p4] & [p16<=1 & 1<=p16]]]] & [~ [[p4<=1 & 1<=p4]] & ~ [[[p2<=1 & 1<=p2] & [[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]]]]]] U [E [[p10<=1 & 1<=p10] U [p11<=1 & 1<=p11]] | [AF [[p14<=1 & 1<=p14]] | ~ [EF [[p10<=1 & 1<=p10]]]]]]]]
normalized: E [true U [[~ [EG [~ [[[~ [E [true U [p10<=1 & 1<=p10]]] | ~ [EG [~ [[p14<=1 & 1<=p14]]]]] | E [[p10<=1 & 1<=p10] U [p11<=1 & 1<=p11]]]]]] & ~ [E [~ [[[~ [E [true U [p10<=1 & 1<=p10]]] | ~ [EG [~ [[p14<=1 & 1<=p14]]]]] | E [[p10<=1 & 1<=p10] U [p11<=1 & 1<=p11]]]] U [~ [[[~ [E [true U [p10<=1 & 1<=p10]]] | ~ [EG [~ [[p14<=1 & 1<=p14]]]]] | E [[p10<=1 & 1<=p10] U [p11<=1 & 1<=p11]]]] & ~ [[[~ [[[[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]] & ~ [[p4<=1 & 1<=p4]]] & ~ [E [true U ~ [[[[p16<=1 & 1<=p16] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]]]]]]]]]] | ~ [EX [~ [[p5<=1 & 1<=p5]]]]]]

abstracting: (1<=p5)
states: 35
abstracting: (p5<=1)
states: 171
.abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
........
EG iterations: 8
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
........
EG iterations: 8
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
........
EG iterations: 8
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
.....
EG iterations: 5
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: ~ [A [A [~ [EG [AF [[[p5<=1 & 1<=p5] & [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]]]] U E [AG [[[p2<=1 & 1<=p2] & [[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]]]] U [[[p10<=1 & 1<=p10] & [p16<=1 & 1<=p16]] | AG [[p4<=1 & 1<=p4]]]]] U A [~ [[[[[p12<=1 & 1<=p12] & [p16<=1 & 1<=p16]] & [[p10<=1 & 1<=p10] & [p14<=1 & 1<=p14]]] | ~ [[p10<=1 & 1<=p10]]]] U [p3<=1 & 1<=p3]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [~ [[p3<=1 & 1<=p3]]]] & ~ [E [~ [[p3<=1 & 1<=p3]] U [[~ [[p10<=1 & 1<=p10]] | [[[p14<=1 & 1<=p14] & [p10<=1 & 1<=p10]] & [[p16<=1 & 1<=p16] & [p12<=1 & 1<=p12]]]] & ~ [[p3<=1 & 1<=p3]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p3<=1 & 1<=p3]]]] & ~ [E [~ [[p3<=1 & 1<=p3]] U [[~ [[p10<=1 & 1<=p10]] | [[[p14<=1 & 1<=p14] & [p10<=1 & 1<=p10]] & [[p16<=1 & 1<=p16] & [p12<=1 & 1<=p12]]]] & ~ [[p3<=1 & 1<=p3]]]]]]] U [~ [[~ [EG [~ [E [~ [E [true U ~ [[[[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]]]] U [~ [E [true U ~ [[p4<=1 & 1<=p4]]]] | [[p16<=1 & 1<=p16] & [p10<=1 & 1<=p10]]]]]]] & ~ [E [~ [E [~ [E [true U ~ [[[[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]]]] U [~ [E [true U ~ [[p4<=1 & 1<=p4]]]] | [[p16<=1 & 1<=p16] & [p10<=1 & 1<=p10]]]]] U [EG [~ [EG [~ [[[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] & [p5<=1 & 1<=p5]]]]]] & ~ [E [~ [E [true U ~ [[[[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]]]] U [~ [E [true U ~ [[p4<=1 & 1<=p4]]]] | [[p16<=1 & 1<=p16] & [p10<=1 & 1<=p10]]]]]]]]]] & ~ [[~ [EG [~ [[p3<=1 & 1<=p3]]]] & ~ [E [~ [[p3<=1 & 1<=p3]] U [[~ [[p10<=1 & 1<=p10]] | [[[p14<=1 & 1<=p14] & [p10<=1 & 1<=p10]] & [[p16<=1 & 1<=p16] & [p12<=1 & 1<=p12]]]] & ~ [[p3<=1 & 1<=p3]]]]]]]]]]]]

abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
...........
EG iterations: 11
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (1<=p5)
states: 35
abstracting: (p5<=1)
states: 171
abstracting: (1<=p7)
states: 88
abstracting: (p7<=1)
states: 171
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
.
EG iterations: 1
...
EG iterations: 3
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
.
EG iterations: 1
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
...........
EG iterations: 11
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
...........
EG iterations: 11
...........
EG iterations: 11
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[[[p14<=0 & 0<=p14] & [p4<=1 & 1<=p4]] & [[[EX [[p11<=0 & 0<=p11]] | EX [[[p6<=0 & 0<=p6] | [[p7<=0 & 0<=p7] | [p11<=0 & 0<=p11]]]]] | [EG [[[p2<=0 & 0<=p2] | [[p4<=0 & 0<=p4] | [p16<=0 & 0<=p16]]]] | [[p6<=1 & 1<=p6] & [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]]] & [[p11<=1 & 1<=p11] | [[p8<=1 & 1<=p8] & [p13<=1 & 1<=p13]]]]]]
normalized: E [true U [[[[[p13<=1 & 1<=p13] & [p8<=1 & 1<=p8]] | [p11<=1 & 1<=p11]] & [[[[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] & [p6<=1 & 1<=p6]] | EG [[[[p16<=0 & 0<=p16] | [p4<=0 & 0<=p4]] | [p2<=0 & 0<=p2]]]] | [EX [[[[p11<=0 & 0<=p11] | [p7<=0 & 0<=p7]] | [p6<=0 & 0<=p6]]] | EX [[p11<=0 & 0<=p11]]]]] & [[p4<=1 & 1<=p4] & [p14<=0 & 0<=p14]]]]

abstracting: (0<=p14)
states: 171
abstracting: (p14<=0)
states: 135
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (0<=p11)
states: 171
abstracting: (p11<=0)
states: 136
.abstracting: (0<=p6)
states: 171
abstracting: (p6<=0)
states: 120
abstracting: (0<=p7)
states: 171
abstracting: (p7<=0)
states: 83
abstracting: (0<=p11)
states: 171
abstracting: (p11<=0)
states: 136
.abstracting: (0<=p2)
states: 171
abstracting: (p2<=0)
states: 83
abstracting: (0<=p4)
states: 171
abstracting: (p4<=0)
states: 136
abstracting: (0<=p16)
states: 171
abstracting: (p16<=0)
states: 126
.
EG iterations: 1
abstracting: (1<=p6)
states: 51
abstracting: (p6<=1)
states: 171
abstracting: (1<=p7)
states: 88
abstracting: (p7<=1)
states: 171
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
abstracting: (1<=p8)
states: 82
abstracting: (p8<=1)
states: 171
abstracting: (1<=p13)
states: 54
abstracting: (p13<=1)
states: 171
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: ~ [E [[E [[AX [[[p2<=1 & 1<=p2] & [[p4<=1 & 1<=p4] & [p16<=1 & 1<=p16]]]] | AG [[p3<=1 & 1<=p3]]] U AX [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]]]] & EG [[AF [[[p10<=1 & 1<=p10] & [p16<=1 & 1<=p16]]] & ~ [[[p2<=1 & 1<=p2] & [[p6<=1 & 1<=p6] & [p15<=1 & 1<=p15]]]]]]] U [AX [~ [AF [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]]]]] | AX [[[~ [[[p2<=1 & 1<=p2] & [[p6<=1 & 1<=p6] & [p15<=1 & 1<=p15]]]] | [p5<=1 & 1<=p5]] | [[p4<=1 & 1<=p4] | [[p10<=1 & 1<=p10] & [p16<=1 & 1<=p16]]]]]]]]
normalized: ~ [E [[EG [[~ [[[[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]] & [p2<=1 & 1<=p2]]] & ~ [EG [~ [[[p16<=1 & 1<=p16] & [p10<=1 & 1<=p10]]]]]]] & E [[~ [E [true U ~ [[p3<=1 & 1<=p3]]]] | ~ [EX [~ [[[[p16<=1 & 1<=p16] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]]]]] U ~ [EX [~ [[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]] U [~ [EX [~ [[[[[p16<=1 & 1<=p16] & [p10<=1 & 1<=p10]] | [p4<=1 & 1<=p4]] | [[p5<=1 & 1<=p5] | ~ [[[[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]] & [p2<=1 & 1<=p2]]]]]]]] | ~ [EX [~ [EG [~ [[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]]]]]

abstracting: (1<=p1)
states: 82
abstracting: (p1<=1)
states: 171
abstracting: (1<=p9)
states: 54
abstracting: (p9<=1)
states: 171
............
EG iterations: 12
.abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p6)
states: 51
abstracting: (p6<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (1<=p5)
states: 35
abstracting: (p5<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
.abstracting: (1<=p1)
states: 82
abstracting: (p1<=1)
states: 171
abstracting: (1<=p9)
states: 54
abstracting: (p9<=1)
states: 171
.abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
.abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
.
EG iterations: 1
abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (1<=p6)
states: 51
abstracting: (p6<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
....
EG iterations: 4
-> the formula is FALSE

FORMULA ShieldRVs-PT-001A-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 13408 (1.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 19938 42752 62690
used/not used/entry size/cache size: 52348 67056516 16 1024MB
basic ops cache: hits/miss/sum: 9634 16193 25827
used/not used/entry size/cache size: 28509 16748707 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: 670 910 1580
used/not used/entry size/cache size: 910 8387698 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 67095511
1 13298
2 55
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.714sec


BK_STOP 1679338359821

--------------------
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:446 (20), effective:62 (2)

initing FirstDep: 0m 0.001sec


iterations count:188 (8), effective:29 (1)

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

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

iterations count:215 (9), effective:30 (1)

iterations count:253 (11), effective:35 (1)

iterations count:48 (2), effective:5 (0)

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

iterations count:403 (18), effective:58 (2)

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

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

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

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

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

iterations count:226 (10), effective:36 (1)

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

iterations count:226 (10), effective:36 (1)

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

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

iterations count:226 (10), effective:36 (1)

iterations count:156 (7), effective:20 (0)

iterations count:88 (4), effective:7 (0)

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

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

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

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

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

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

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

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

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

iterations count:88 (4), effective:7 (0)

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

iterations count:88 (4), effective:7 (0)

iterations count:332 (15), effective:49 (2)

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

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

iterations count:22 (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="ShieldRVs-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 ShieldRVs-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 r426-tajo-167905978300002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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