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-167903717600186.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-001B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Feb 25 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 17:06 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.2K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 17:07 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 17K 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-001B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679497667324

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-001B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:07:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 15:07:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:07:49] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-22 15:07:49] [INFO ] Transformed 73 places.
[2023-03-22 15:07:49] [INFO ] Transformed 68 transitions.
[2023-03-22 15:07:49] [INFO ] Found NUPN structural information;
[2023-03-22 15:07:49] [INFO ] Parsed PT model containing 73 places and 68 transitions and 168 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 61 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Applied a total of 0 rules in 13 ms. Remains 73 /73 variables (removed 0) and now considering 68/68 (removed 0) transitions.
// Phase 1: matrix 68 rows 73 cols
[2023-03-22 15:07:49] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-22 15:07:50] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-22 15:07:50] [INFO ] Invariant cache hit.
[2023-03-22 15:07:50] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-22 15:07:50] [INFO ] Invariant cache hit.
[2023-03-22 15:07:50] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 614 ms. Remains : 73/73 places, 68/68 transitions.
Support contains 61 out of 73 places after structural reductions.
[2023-03-22 15:07:50] [INFO ] Flatten gal took : 24 ms
[2023-03-22 15:07:50] [INFO ] Flatten gal took : 14 ms
[2023-03-22 15:07:50] [INFO ] Input system was already deterministic with 68 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 73) seen :69
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 15:07:51] [INFO ] Invariant cache hit.
[2023-03-22 15:07:51] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 15:07:51] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-22 15:07:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-22 15:07:51] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-22 15:07:51] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 4 ms to minimize.
[2023-03-22 15:07:51] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2023-03-22 15:07:51] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2023-03-22 15:07:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 140 ms
[2023-03-22 15:07:51] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-22 15:07:51] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 68/68 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 73 transition count 54
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 59 transition count 52
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 58 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 56 transition count 50
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 35 place count 56 transition count 45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 45 place count 51 transition count 45
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 51 place count 45 transition count 39
Iterating global reduction 4 with 6 rules applied. Total rules applied 57 place count 45 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 57 place count 45 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 61 place count 43 transition count 37
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 87 place count 30 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 29 transition count 24
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 29 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 28 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 27 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 93 place count 27 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 26 transition count 22
Applied a total of 95 rules in 23 ms. Remains 26 /73 variables (removed 47) and now considering 22/68 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 26/73 places, 22/68 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 2311 states, properties seen :0
Probabilistic random walk after 10386 steps, saw 2311 distinct states, run finished after 33 ms. (steps per millisecond=314 ) properties seen :0
Explored full state space saw : 2311 states, properties seen :0
Exhaustive walk after 10386 steps, saw 2311 distinct states, run finished after 9 ms. (steps per millisecond=1154 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-22 15:07:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:07:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:07:51] [INFO ] Input system was already deterministic with 68 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 3 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/73 places, 59/68 transitions.
[2023-03-22 15:07:51] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:51] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:51] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 67 transition count 62
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 67 transition count 62
Applied a total of 12 rules in 3 ms. Remains 67 /73 variables (removed 6) and now considering 62/68 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 67/73 places, 62/68 transitions.
[2023-03-22 15:07:51] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:51] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:51] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 72 transition count 49
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 53 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 52 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 41 place count 52 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 51 place count 47 transition count 41
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 58 place count 40 transition count 34
Iterating global reduction 4 with 7 rules applied. Total rules applied 65 place count 40 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 65 place count 40 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 71 place count 37 transition count 31
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 99 place count 23 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 20 transition count 16
Applied a total of 102 rules in 9 ms. Remains 20 /73 variables (removed 53) and now considering 16/68 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 20/73 places, 16/68 transitions.
[2023-03-22 15:07:51] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:51] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:51] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
FORMULA ShieldIIPt-PT-001B-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Applied a total of 22 rules in 5 ms. Remains 62 /73 variables (removed 11) and now considering 57/68 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 62/73 places, 57/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 63 transition count 58
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Applied a total of 24 rules in 5 ms. Remains 61 /73 variables (removed 12) and now considering 56/68 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 61/73 places, 56/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 68 transition count 63
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 68 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 67 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 67 transition count 62
Applied a total of 12 rules in 3 ms. Remains 67 /73 variables (removed 6) and now considering 62/68 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 67/73 places, 62/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 73 transition count 51
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 55 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 53 transition count 47
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 41 place count 53 transition count 43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 49 place count 49 transition count 43
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 55 place count 43 transition count 37
Iterating global reduction 4 with 6 rules applied. Total rules applied 61 place count 43 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 61 place count 43 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 41 transition count 35
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 93 place count 27 transition count 21
Applied a total of 93 rules in 16 ms. Remains 27 /73 variables (removed 46) and now considering 21/68 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 27/73 places, 21/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 62 transition count 57
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 60 transition count 55
Applied a total of 26 rules in 6 ms. Remains 60 /73 variables (removed 13) and now considering 55/68 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 60/73 places, 55/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 63 transition count 58
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Applied a total of 24 rules in 5 ms. Remains 61 /73 variables (removed 12) and now considering 56/68 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 61/73 places, 56/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 72 transition count 53
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 57 transition count 51
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 31 place count 57 transition count 46
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 41 place count 52 transition count 46
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 48 place count 45 transition count 39
Iterating global reduction 3 with 7 rules applied. Total rules applied 55 place count 45 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 55 place count 45 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 43 transition count 37
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 81 place count 32 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 31 transition count 25
Applied a total of 82 rules in 6 ms. Remains 31 /73 variables (removed 42) and now considering 25/68 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 31/73 places, 25/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 66 transition count 61
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 2 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 64/73 places, 59/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 72 transition count 52
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 55 transition count 49
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 35 place count 55 transition count 43
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 47 place count 49 transition count 43
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 54 place count 42 transition count 36
Iterating global reduction 4 with 7 rules applied. Total rules applied 61 place count 42 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 61 place count 42 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 40 transition count 34
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 89 place count 28 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 27 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 25 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 25 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 24 transition count 20
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 95 place count 23 transition count 20
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 6 with 2 rules applied. Total rules applied 97 place count 22 transition count 19
Applied a total of 97 rules in 15 ms. Remains 22 /73 variables (removed 51) and now considering 19/68 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 22/73 places, 19/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Applied a total of 22 rules in 2 ms. Remains 62 /73 variables (removed 11) and now considering 57/68 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 62/73 places, 57/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 73 transition count 57
Reduce places removed 11 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 16 rules applied. Total rules applied 27 place count 62 transition count 52
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 33 place count 57 transition count 51
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 33 place count 57 transition count 45
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 45 place count 51 transition count 45
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 51 place count 45 transition count 39
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 45 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 57 place count 45 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 44 transition count 38
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 81 place count 33 transition count 27
Applied a total of 81 rules in 5 ms. Remains 33 /73 variables (removed 40) and now considering 27/68 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 33/73 places, 27/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 65 transition count 60
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Applied a total of 20 rules in 2 ms. Remains 63 /73 variables (removed 10) and now considering 58/68 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/73 places, 58/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 1 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 64/73 places, 59/68 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:52] [INFO ] Input system was already deterministic with 59 transitions.
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:52] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:52] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 15:07:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 68 transitions and 168 arcs took 0 ms.
Total runtime 2499 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: 73 NrTr: 68 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 2.864sec


RS generation: 0m 0.050sec


-> reachability set: #nodes 2360 (2.4e+03) #states 3,260,241 (6)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 3,260,241 (6)
.-> the formula is TRUE

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

MC time: 0m 0.027sec

checking: EG [AG [[[p53<=1 & 1<=p53] | AX [[p44<=0 & 0<=p44]]]]]
normalized: EG [~ [E [true U ~ [[[p53<=1 & 1<=p53] | ~ [EX [~ [[p44<=0 & 0<=p44]]]]]]]]]

abstracting: (0<=p44)
states: 3,260,241 (6)
abstracting: (p44<=0)
states: 2,818,083 (6)
.abstracting: (1<=p53)
states: 344,928 (5)
abstracting: (p53<=1)
states: 3,260,241 (6)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.089sec

checking: AF [E [[p72<=1 & 1<=p72] U [EF [AG [[[p20<=1 & 1<=p20] & [p59<=1 & 1<=p59]]]] & [p56<=1 & 1<=p56]]]]
normalized: ~ [EG [~ [E [[p72<=1 & 1<=p72] U [[p56<=1 & 1<=p56] & E [true U ~ [E [true U ~ [[[p59<=1 & 1<=p59] & [p20<=1 & 1<=p20]]]]]]]]]]]

abstracting: (1<=p20)
states: 871,008 (5)
abstracting: (p20<=1)
states: 3,260,241 (6)
abstracting: (1<=p59)
states: 372,168 (5)
abstracting: (p59<=1)
states: 3,260,241 (6)
abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
abstracting: (1<=p72)
states: 469
abstracting: (p72<=1)
states: 3,260,241 (6)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.012sec

checking: A [A [EF [[A [[p63<=1 & 1<=p63] U [p68<=1 & 1<=p68]] & [p9<=1 & 1<=p9]]] U [p0<=1 & 1<=p0]] U [p63<=1 & 1<=p63]]
normalized: [~ [EG [~ [[p63<=1 & 1<=p63]]]] & ~ [E [~ [[p63<=1 & 1<=p63]] U [~ [[~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [E [true U [[p9<=1 & 1<=p9] & [~ [EG [~ [[p68<=1 & 1<=p68]]]] & ~ [E [~ [[p68<=1 & 1<=p68]] U [~ [[p63<=1 & 1<=p63]] & ~ [[p68<=1 & 1<=p68]]]]]]]]] & ~ [[p0<=1 & 1<=p0]]]]]]] & ~ [[p63<=1 & 1<=p63]]]]]]

abstracting: (1<=p63)
states: 326,646 (5)
abstracting: (p63<=1)
states: 3,260,241 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,260,241 (6)
abstracting: (1<=p68)
states: 371,310 (5)
abstracting: (p68<=1)
states: 3,260,241 (6)
abstracting: (1<=p63)
states: 326,646 (5)
abstracting: (p63<=1)
states: 3,260,241 (6)
abstracting: (1<=p68)
states: 371,310 (5)
abstracting: (p68<=1)
states: 3,260,241 (6)
abstracting: (1<=p68)
states: 371,310 (5)
abstracting: (p68<=1)
states: 3,260,241 (6)
.....................................................................................................................
EG iterations: 117
abstracting: (1<=p9)
states: 192
abstracting: (p9<=1)
states: 3,260,241 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,260,241 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,260,241 (6)
.
EG iterations: 1
abstracting: (1<=p63)
states: 326,646 (5)
abstracting: (p63<=1)
states: 3,260,241 (6)
abstracting: (1<=p63)
states: 326,646 (5)
abstracting: (p63<=1)
states: 3,260,241 (6)
.................................................
EG iterations: 49
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.772sec

checking: AF [[AX [EX [EG [[p30<=1 & 1<=p30]]]] & AX [[[p51<=0 & 0<=p51] & [[[p30<=0 & 0<=p30] | [p53<=0 & 0<=p53]] & [p5<=0 & 0<=p5]]]]]]
normalized: ~ [EG [~ [[~ [EX [~ [[[p51<=0 & 0<=p51] & [[p5<=0 & 0<=p5] & [[p53<=0 & 0<=p53] | [p30<=0 & 0<=p30]]]]]]] & ~ [EX [~ [EX [EG [[p30<=1 & 1<=p30]]]]]]]]]]

abstracting: (1<=p30)
states: 335,700 (5)
abstracting: (p30<=1)
states: 3,260,241 (6)
.............................
EG iterations: 29
..abstracting: (0<=p30)
states: 3,260,241 (6)
abstracting: (p30<=0)
states: 2,924,541 (6)
abstracting: (0<=p53)
states: 3,260,241 (6)
abstracting: (p53<=0)
states: 2,915,313 (6)
abstracting: (0<=p5)
states: 3,260,241 (6)
abstracting: (p5<=0)
states: 3,260,240 (6)
abstracting: (0<=p51)
states: 3,260,241 (6)
abstracting: (p51<=0)
states: 2,939,898 (6)
.....................
EG iterations: 20
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.154sec

checking: EX [A [~ [[[1<=p41 & p41<=1] & [A [[p31<=1 & 1<=p31] U [p39<=1 & 1<=p39]] & AX [[p62<=1 & 1<=p62]]]]] U EX [AX [[[p61<=1 & 1<=p61] | [p31<=1 & 1<=p31]]]]]]
normalized: EX [[~ [EG [~ [EX [~ [EX [~ [[[p31<=1 & 1<=p31] | [p61<=1 & 1<=p61]]]]]]]]] & ~ [E [~ [EX [~ [EX [~ [[[p31<=1 & 1<=p31] | [p61<=1 & 1<=p61]]]]]]] U [[[~ [EX [~ [[p62<=1 & 1<=p62]]]] & [~ [EG [~ [[p39<=1 & 1<=p39]]]] & ~ [E [~ [[p39<=1 & 1<=p39]] U [~ [[p31<=1 & 1<=p31]] & ~ [[p39<=1 & 1<=p39]]]]]]] & [1<=p41 & p41<=1]] & ~ [EX [~ [EX [~ [[[p31<=1 & 1<=p31] | [p61<=1 & 1<=p61]]]]]]]]]]]]

abstracting: (1<=p61)
states: 351
abstracting: (p61<=1)
states: 3,260,241 (6)
abstracting: (1<=p31)
states: 335,700 (5)
abstracting: (p31<=1)
states: 3,260,241 (6)
..abstracting: (p41<=1)
states: 3,260,241 (6)
abstracting: (1<=p41)
states: 442,158 (5)
abstracting: (1<=p39)
states: 88,419 (4)
abstracting: (p39<=1)
states: 3,260,241 (6)
abstracting: (1<=p31)
states: 335,700 (5)
abstracting: (p31<=1)
states: 3,260,241 (6)
abstracting: (1<=p39)
states: 88,419 (4)
abstracting: (p39<=1)
states: 3,260,241 (6)
abstracting: (1<=p39)
states: 88,419 (4)
abstracting: (p39<=1)
states: 3,260,241 (6)
...........................
EG iterations: 27
abstracting: (1<=p62)
states: 469
abstracting: (p62<=1)
states: 3,260,241 (6)
.abstracting: (1<=p61)
states: 351
abstracting: (p61<=1)
states: 3,260,241 (6)
abstracting: (1<=p31)
states: 335,700 (5)
abstracting: (p31<=1)
states: 3,260,241 (6)
..abstracting: (1<=p61)
states: 351
abstracting: (p61<=1)
states: 3,260,241 (6)
abstracting: (1<=p31)
states: 335,700 (5)
abstracting: (p31<=1)
states: 3,260,241 (6)
.....................
EG iterations: 19
.-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.209sec

checking: [EG [AG [[p58<=1 & 1<=p58]]] | AF [EX [[[EX [[p61<=0 & 0<=p61]] | EF [[p29<=0 & 0<=p29]]] & [[p35<=1 & 1<=p35] & [[p58<=0 & 0<=p58] | [p29<=0 & 0<=p29]]]]]]]
normalized: [~ [EG [~ [EX [[[[[p29<=0 & 0<=p29] | [p58<=0 & 0<=p58]] & [p35<=1 & 1<=p35]] & [E [true U [p29<=0 & 0<=p29]] | EX [[p61<=0 & 0<=p61]]]]]]]] | EG [~ [E [true U ~ [[p58<=1 & 1<=p58]]]]]]

abstracting: (1<=p58)
states: 365,493 (5)
abstracting: (p58<=1)
states: 3,260,241 (6)
.
EG iterations: 1
abstracting: (0<=p61)
states: 3,260,241 (6)
abstracting: (p61<=0)
states: 3,259,890 (6)
.abstracting: (0<=p29)
states: 3,260,241 (6)
abstracting: (p29<=0)
states: 2,949,705 (6)
abstracting: (1<=p35)
states: 335,700 (5)
abstracting: (p35<=1)
states: 3,260,241 (6)
abstracting: (0<=p58)
states: 3,260,241 (6)
abstracting: (p58<=0)
states: 2,894,748 (6)
abstracting: (0<=p29)
states: 3,260,241 (6)
abstracting: (p29<=0)
states: 2,949,705 (6)
..................................
EG iterations: 33
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.147sec

checking: [EG [EF [[[p24<=0 & 0<=p24] | [[p37<=0 & 0<=p37] | [p71<=0 & 0<=p71]]]]] & [A [EF [AX [AF [[p26<=1 & 1<=p26]]]] U EF [[p46<=1 & 1<=p46]]] | AX [[p63<=1 & 1<=p63]]]]
normalized: [[~ [EX [~ [[p63<=1 & 1<=p63]]]] | [~ [EG [~ [E [true U [p46<=1 & 1<=p46]]]]] & ~ [E [~ [E [true U [p46<=1 & 1<=p46]]] U [~ [E [true U ~ [EX [EG [~ [[p26<=1 & 1<=p26]]]]]]] & ~ [E [true U [p46<=1 & 1<=p46]]]]]]]] & EG [E [true U [[[p71<=0 & 0<=p71] | [p37<=0 & 0<=p37]] | [p24<=0 & 0<=p24]]]]]

abstracting: (0<=p24)
states: 3,260,241 (6)
abstracting: (p24<=0)
states: 2,102,247 (6)
abstracting: (0<=p37)
states: 3,260,241 (6)
abstracting: (p37<=0)
states: 2,922,969 (6)
abstracting: (0<=p71)
states: 3,260,241 (6)
abstracting: (p71<=0)
states: 2,887,808 (6)

EG iterations: 0
abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p26)
states: 1,086,309 (6)
abstracting: (p26<=1)
states: 3,260,241 (6)
........................
EG iterations: 24
.abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (p46<=1)
states: 3,260,241 (6)
.
EG iterations: 1
abstracting: (1<=p63)
states: 326,646 (5)
abstracting: (p63<=1)
states: 3,260,241 (6)
.-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.357sec

checking: EX [[EG [AF [[[p60<=1 & 1<=p60] | [p45<=1 & 1<=p45]]]] | [[p36<=1 & 1<=p36] & [AX [AF [[p16<=1 & 1<=p16]]] | [[p14<=1 & 1<=p14] & [p47<=1 & 1<=p47]]]]]]
normalized: EX [[[[p36<=1 & 1<=p36] & [~ [EX [EG [~ [[p16<=1 & 1<=p16]]]]] | [[p14<=1 & 1<=p14] & [p47<=1 & 1<=p47]]]] | EG [~ [EG [~ [[[p45<=1 & 1<=p45] | [p60<=1 & 1<=p60]]]]]]]]

abstracting: (1<=p60)
states: 351
abstracting: (p60<=1)
states: 3,260,241 (6)
abstracting: (1<=p45)
states: 442,158 (5)
abstracting: (p45<=1)
states: 3,260,241 (6)
......................................
EG iterations: 38
.......................................
EG iterations: 39
abstracting: (1<=p47)
states: 462,351 (5)
abstracting: (p47<=1)
states: 3,260,241 (6)
abstracting: (1<=p14)
states: 1,076,406 (6)
abstracting: (p14<=1)
states: 3,260,241 (6)
abstracting: (1<=p16)
states: 409,398 (5)
abstracting: (p16<=1)
states: 3,260,241 (6)
.....................................
EG iterations: 37
.abstracting: (1<=p36)
states: 332,910 (5)
abstracting: (p36<=1)
states: 3,260,241 (6)
.-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.404sec

checking: AF [[[EF [EG [[p34<=1 & 1<=p34]]] & [p4<=0 & 0<=p4]] & [[p56<=0 & 0<=p56] & [[p11<=0 & 0<=p11] | [[p38<=0 & 0<=p38] | [[p12<=1 & 1<=p12] & [p66<=1 & 1<=p66]]]]]]]
normalized: ~ [EG [~ [[[[[[[p66<=1 & 1<=p66] & [p12<=1 & 1<=p12]] | [p38<=0 & 0<=p38]] | [p11<=0 & 0<=p11]] & [p56<=0 & 0<=p56]] & [[p4<=0 & 0<=p4] & E [true U EG [[p34<=1 & 1<=p34]]]]]]]]

abstracting: (1<=p34)
states: 335,700 (5)
abstracting: (p34<=1)
states: 3,260,241 (6)
.............................
EG iterations: 29
abstracting: (0<=p4)
states: 3,260,241 (6)
abstracting: (p4<=0)
states: 3,260,240 (6)
abstracting: (0<=p56)
states: 3,260,241 (6)
abstracting: (p56<=0)
states: 2,888,991 (6)
abstracting: (0<=p11)
states: 3,260,241 (6)
abstracting: (p11<=0)
states: 3,195,725 (6)
abstracting: (0<=p38)
states: 3,260,241 (6)
abstracting: (p38<=0)
states: 3,171,822 (6)
abstracting: (1<=p12)
states: 1,081,072 (6)
abstracting: (p12<=1)
states: 3,260,241 (6)
abstracting: (1<=p66)
states: 371,310 (5)
abstracting: (p66<=1)
states: 3,260,241 (6)
........................................................................................
EG iterations: 88
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.935sec

checking: EG [[EG [[[p40<=1 & 1<=p40] | [AF [[p69<=0 & 0<=p69]] | A [[[p60<=1 & 1<=p60] | [[p14<=1 & 1<=p14] & [p47<=1 & 1<=p47]]] U [p40<=1 & 1<=p40]]]]] | A [EG [AF [[p49<=1 & 1<=p49]]] U EF [[p17<=1 & 1<=p17]]]]]
normalized: EG [[[~ [EG [~ [E [true U [p17<=1 & 1<=p17]]]]] & ~ [E [~ [E [true U [p17<=1 & 1<=p17]]] U [~ [E [true U [p17<=1 & 1<=p17]]] & ~ [EG [~ [EG [~ [[p49<=1 & 1<=p49]]]]]]]]]] | EG [[[~ [EG [~ [[p69<=0 & 0<=p69]]]] | [~ [E [~ [[p40<=1 & 1<=p40]] U [~ [[[[p47<=1 & 1<=p47] & [p14<=1 & 1<=p14]] | [p60<=1 & 1<=p60]]] & ~ [[p40<=1 & 1<=p40]]]]] & ~ [EG [~ [[p40<=1 & 1<=p40]]]]]] | [p40<=1 & 1<=p40]]]]]

abstracting: (1<=p40)
states: 51,786 (4)
abstracting: (p40<=1)
states: 3,260,241 (6)
abstracting: (1<=p40)
states: 51,786 (4)
abstracting: (p40<=1)
states: 3,260,241 (6)
...........
EG iterations: 11
abstracting: (1<=p40)
states: 51,786 (4)
abstracting: (p40<=1)
states: 3,260,241 (6)
abstracting: (1<=p60)
states: 351
abstracting: (p60<=1)
states: 3,260,241 (6)
abstracting: (1<=p14)
states: 1,076,406 (6)
abstracting: (p14<=1)
states: 3,260,241 (6)
abstracting: (1<=p47)
states: 462,351 (5)
abstracting: (p47<=1)
states: 3,260,241 (6)
abstracting: (1<=p40)
states: 51,786 (4)
abstracting: (p40<=1)
states: 3,260,241 (6)
abstracting: (0<=p69)
states: 3,260,241 (6)
abstracting: (p69<=0)
states: 2,888,931 (6)
...............................................................................
EG iterations: 79

EG iterations: 0
abstracting: (1<=p49)
states: 51,786 (4)
abstracting: (p49<=1)
states: 3,260,241 (6)
.....................
EG iterations: 21
......................
EG iterations: 22
abstracting: (1<=p17)
states: 464,766 (5)
abstracting: (p17<=1)
states: 3,260,241 (6)
abstracting: (1<=p17)
states: 464,766 (5)
abstracting: (p17<=1)
states: 3,260,241 (6)
abstracting: (1<=p17)
states: 464,766 (5)
abstracting: (p17<=1)
states: 3,260,241 (6)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.559sec

checking: [EF [[AG [AX [[[p3<=1 & 1<=p3] & [[p22<=1 & 1<=p22] & [p56<=1 & 1<=p56]]]]] & E [~ [[[p34<=1 & 1<=p34] | [p63<=1 & 1<=p63]]] U AX [[[p41<=1 & 1<=p41] & [p65<=1 & 1<=p65]]]]]] & [A [~ [[[p0<=1 & 1<=p0] | [p34<=1 & 1<=p34]]] U [~ [[p17<=1 & 1<=p17]] & ~ [[p52<=1 & 1<=p52]]]] | EG [[EF [[p13<=0 & 0<=p13]] | [p23<=0 & 0<=p23]]]]]
normalized: [[EG [[[p23<=0 & 0<=p23] | E [true U [p13<=0 & 0<=p13]]]] | [~ [EG [~ [[~ [[p52<=1 & 1<=p52]] & ~ [[p17<=1 & 1<=p17]]]]]] & ~ [E [~ [[~ [[p52<=1 & 1<=p52]] & ~ [[p17<=1 & 1<=p17]]]] U [[[p34<=1 & 1<=p34] | [p0<=1 & 1<=p0]] & ~ [[~ [[p52<=1 & 1<=p52]] & ~ [[p17<=1 & 1<=p17]]]]]]]]] & E [true U [E [~ [[[p63<=1 & 1<=p63] | [p34<=1 & 1<=p34]]] U ~ [EX [~ [[[p65<=1 & 1<=p65] & [p41<=1 & 1<=p41]]]]]] & ~ [E [true U EX [~ [[[[p56<=1 & 1<=p56] & [p22<=1 & 1<=p22]] & [p3<=1 & 1<=p3]]]]]]]]]

abstracting: (1<=p3)
states: 1,107,276 (6)
abstracting: (p3<=1)
states: 3,260,241 (6)
abstracting: (1<=p22)
states: 1,098,812 (6)
abstracting: (p22<=1)
states: 3,260,241 (6)
abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
.abstracting: (1<=p41)
states: 442,158 (5)
abstracting: (p41<=1)
states: 3,260,241 (6)
abstracting: (1<=p65)
states: 352,209 (5)
abstracting: (p65<=1)
states: 3,260,241 (6)
.abstracting: (1<=p34)
states: 335,700 (5)
abstracting: (p34<=1)
states: 3,260,241 (6)
abstracting: (1<=p63)
states: 326,646 (5)
abstracting: (p63<=1)
states: 3,260,241 (6)
abstracting: (1<=p17)
states: 464,766 (5)
abstracting: (p17<=1)
states: 3,260,241 (6)
abstracting: (1<=p52)
states: 371,250 (5)
abstracting: (p52<=1)
states: 3,260,241 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,260,241 (6)
abstracting: (1<=p34)
states: 335,700 (5)
abstracting: (p34<=1)
states: 3,260,241 (6)
abstracting: (1<=p17)
states: 464,766 (5)
abstracting: (p17<=1)
states: 3,260,241 (6)
abstracting: (1<=p52)
states: 371,250 (5)
abstracting: (p52<=1)
states: 3,260,241 (6)
abstracting: (1<=p17)
states: 464,766 (5)
abstracting: (p17<=1)
states: 3,260,241 (6)
abstracting: (1<=p52)
states: 371,250 (5)
abstracting: (p52<=1)
states: 3,260,241 (6)
............................................................................
EG iterations: 76
abstracting: (0<=p13)
states: 3,260,241 (6)
abstracting: (p13<=0)
states: 2,227,644 (6)
abstracting: (0<=p23)
states: 3,260,241 (6)
abstracting: (p23<=0)
states: 2,262,456 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.540sec

checking: [EG [A [[E [~ [[p5<=1 & 1<=p5]] U [[p51<=1 & 1<=p51] & [p23<=1 & 1<=p23]]] | EF [AX [[[p12<=1 & 1<=p12] & [p66<=1 & 1<=p66]]]]] U [[~ [[[[p36<=1 & 1<=p36] & [p45<=1 & 1<=p45]] | EX [[p52<=1 & 1<=p52]]]] & AG [[p56<=1 & 1<=p56]]] & [EF [[p58<=1 & 1<=p58]] & [p38<=1 & 1<=p38]]]]] & EG [AF [[AG [[p0<=0 & 0<=p0]] & [A [[p53<=1 & 1<=p53] U [p23<=1 & 1<=p23]] | [p26<=1 & 1<=p26]]]]]]
normalized: [EG [~ [EG [~ [[[[p26<=1 & 1<=p26] | [~ [EG [~ [[p23<=1 & 1<=p23]]]] & ~ [E [~ [[p23<=1 & 1<=p23]] U [~ [[p53<=1 & 1<=p53]] & ~ [[p23<=1 & 1<=p23]]]]]]] & ~ [E [true U ~ [[p0<=0 & 0<=p0]]]]]]]]] & EG [[~ [EG [~ [[[[p38<=1 & 1<=p38] & E [true U [p58<=1 & 1<=p58]]] & [~ [E [true U ~ [[p56<=1 & 1<=p56]]]] & ~ [[EX [[p52<=1 & 1<=p52]] | [[p45<=1 & 1<=p45] & [p36<=1 & 1<=p36]]]]]]]]] & ~ [E [~ [[[[p38<=1 & 1<=p38] & E [true U [p58<=1 & 1<=p58]]] & [~ [E [true U ~ [[p56<=1 & 1<=p56]]]] & ~ [[EX [[p52<=1 & 1<=p52]] | [[p45<=1 & 1<=p45] & [p36<=1 & 1<=p36]]]]]]] U [~ [[E [true U ~ [EX [~ [[[p66<=1 & 1<=p66] & [p12<=1 & 1<=p12]]]]]] | E [~ [[p5<=1 & 1<=p5]] U [[p23<=1 & 1<=p23] & [p51<=1 & 1<=p51]]]]] & ~ [[[[p38<=1 & 1<=p38] & E [true U [p58<=1 & 1<=p58]]] & [~ [E [true U ~ [[p56<=1 & 1<=p56]]]] & ~ [[EX [[p52<=1 & 1<=p52]] | [[p45<=1 & 1<=p45] & [p36<=1 & 1<=p36]]]]]]]]]]]]]

abstracting: (1<=p36)
states: 332,910 (5)
abstracting: (p36<=1)
states: 3,260,241 (6)
abstracting: (1<=p45)
states: 442,158 (5)
abstracting: (p45<=1)
states: 3,260,241 (6)
abstracting: (1<=p52)
states: 371,250 (5)
abstracting: (p52<=1)
states: 3,260,241 (6)
.abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
abstracting: (1<=p58)
states: 365,493 (5)
abstracting: (p58<=1)
states: 3,260,241 (6)
abstracting: (1<=p38)
states: 88,419 (4)
abstracting: (p38<=1)
states: 3,260,241 (6)
abstracting: (1<=p51)
states: 320,343 (5)
abstracting: (p51<=1)
states: 3,260,241 (6)
abstracting: (1<=p23)
states: 997,785 (5)
abstracting: (p23<=1)
states: 3,260,241 (6)
abstracting: (1<=p5)
states: 1
abstracting: (p5<=1)
states: 3,260,241 (6)
abstracting: (1<=p12)
states: 1,081,072 (6)
abstracting: (p12<=1)
states: 3,260,241 (6)
abstracting: (1<=p66)
states: 371,310 (5)
abstracting: (p66<=1)
states: 3,260,241 (6)
.abstracting: (1<=p36)
states: 332,910 (5)
abstracting: (p36<=1)
states: 3,260,241 (6)
abstracting: (1<=p45)
states: 442,158 (5)
abstracting: (p45<=1)
states: 3,260,241 (6)
abstracting: (1<=p52)
states: 371,250 (5)
abstracting: (p52<=1)
states: 3,260,241 (6)
.abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
abstracting: (1<=p58)
states: 365,493 (5)
abstracting: (p58<=1)
states: 3,260,241 (6)
abstracting: (1<=p38)
states: 88,419 (4)
abstracting: (p38<=1)
states: 3,260,241 (6)
abstracting: (1<=p36)
states: 332,910 (5)
abstracting: (p36<=1)
states: 3,260,241 (6)
abstracting: (1<=p45)
states: 442,158 (5)
abstracting: (p45<=1)
states: 3,260,241 (6)
abstracting: (1<=p52)
states: 371,250 (5)
abstracting: (p52<=1)
states: 3,260,241 (6)
.abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
abstracting: (1<=p58)
states: 365,493 (5)
abstracting: (p58<=1)
states: 3,260,241 (6)
abstracting: (1<=p38)
states: 88,419 (4)
abstracting: (p38<=1)
states: 3,260,241 (6)

EG iterations: 0
.
EG iterations: 1
abstracting: (0<=p0)
states: 3,260,241 (6)
abstracting: (p0<=0)
states: 3,260,240 (6)
abstracting: (1<=p23)
states: 997,785 (5)
abstracting: (p23<=1)
states: 3,260,241 (6)
abstracting: (1<=p53)
states: 344,928 (5)
abstracting: (p53<=1)
states: 3,260,241 (6)
abstracting: (1<=p23)
states: 997,785 (5)
abstracting: (p23<=1)
states: 3,260,241 (6)
abstracting: (1<=p23)
states: 997,785 (5)
abstracting: (p23<=1)
states: 3,260,241 (6)
.................................................
EG iterations: 49
abstracting: (1<=p26)
states: 1,086,309 (6)
abstracting: (p26<=1)
states: 3,260,241 (6)
.........................................................................................................
EG iterations: 105
...................
EG iterations: 19
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.865sec

checking: A [[EX [[~ [EF [[p56<=1 & 1<=p56]]] | ~ [[p42<=1 & 1<=p42]]]] & [[p34<=1 & 1<=p34] & [[A [[p60<=1 & 1<=p60] U [p10<=1 & 1<=p10]] | [~ [E [[p17<=1 & 1<=p17] U [p28<=1 & 1<=p28]]] | AG [[p26<=1 & 1<=p26]]]] | [[p30<=1 & 1<=p30] | [EG [[p36<=1 & 1<=p36]] | [[EF [[p25<=1 & 1<=p25]] & [p56<=1 & 1<=p56]] & [[p26<=1 & 1<=p26] & [p70<=1 & 1<=p70]]]]]]]] U [EG [[~ [[[p53<=1 & 1<=p53] | [p69<=1 & 1<=p69]]] | A [AF [[p61<=1 & 1<=p61]] U [1<=p46 & p46<=1]]]] | ~ [EF [[[p53<=1 & 1<=p53] | [~ [[[p18<=1 & 1<=p18] & [p37<=1 & 1<=p37]]] & EG [[p4<=1 & 1<=p4]]]]]]]]
normalized: [~ [EG [~ [[~ [E [true U [[EG [[p4<=1 & 1<=p4]] & ~ [[[p37<=1 & 1<=p37] & [p18<=1 & 1<=p18]]]] | [p53<=1 & 1<=p53]]]] | EG [[[~ [EG [~ [[1<=p46 & p46<=1]]]] & ~ [E [~ [[1<=p46 & p46<=1]] U [EG [~ [[p61<=1 & 1<=p61]]] & ~ [[1<=p46 & p46<=1]]]]]] | ~ [[[p69<=1 & 1<=p69] | [p53<=1 & 1<=p53]]]]]]]]] & ~ [E [~ [[~ [E [true U [[EG [[p4<=1 & 1<=p4]] & ~ [[[p37<=1 & 1<=p37] & [p18<=1 & 1<=p18]]]] | [p53<=1 & 1<=p53]]]] | EG [[[~ [EG [~ [[1<=p46 & p46<=1]]]] & ~ [E [~ [[1<=p46 & p46<=1]] U [EG [~ [[p61<=1 & 1<=p61]]] & ~ [[1<=p46 & p46<=1]]]]]] | ~ [[[p69<=1 & 1<=p69] | [p53<=1 & 1<=p53]]]]]]] U [~ [[EX [[~ [[p42<=1 & 1<=p42]] | ~ [E [true U [p56<=1 & 1<=p56]]]]] & [[[[[[[p56<=1 & 1<=p56] & E [true U [p25<=1 & 1<=p25]]] & [[p70<=1 & 1<=p70] & [p26<=1 & 1<=p26]]] | EG [[p36<=1 & 1<=p36]]] | [p30<=1 & 1<=p30]] | [[~ [EG [~ [[p10<=1 & 1<=p10]]]] & ~ [E [~ [[p10<=1 & 1<=p10]] U [~ [[p60<=1 & 1<=p60]] & ~ [[p10<=1 & 1<=p10]]]]]] | [~ [E [true U ~ [[p26<=1 & 1<=p26]]]] | ~ [E [[p17<=1 & 1<=p17] U [p28<=1 & 1<=p28]]]]]] & [p34<=1 & 1<=p34]]]] & ~ [[~ [E [true U [[EG [[p4<=1 & 1<=p4]] & ~ [[[p37<=1 & 1<=p37] & [p18<=1 & 1<=p18]]]] | [p53<=1 & 1<=p53]]]] | EG [[[~ [EG [~ [[1<=p46 & p46<=1]]]] & ~ [E [~ [[1<=p46 & p46<=1]] U [EG [~ [[p61<=1 & 1<=p61]]] & ~ [[1<=p46 & p46<=1]]]]]] | ~ [[[p69<=1 & 1<=p69] | [p53<=1 & 1<=p53]]]]]]]]]]]

abstracting: (1<=p53)
states: 344,928 (5)
abstracting: (p53<=1)
states: 3,260,241 (6)
abstracting: (1<=p69)
states: 371,310 (5)
abstracting: (p69<=1)
states: 3,260,241 (6)
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (1<=p61)
states: 351
abstracting: (p61<=1)
states: 3,260,241 (6)
....................
EG iterations: 20
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p46)
states: 442,158 (5)
.........................................................
EG iterations: 57
.............................................................
EG iterations: 61
abstracting: (1<=p53)
states: 344,928 (5)
abstracting: (p53<=1)
states: 3,260,241 (6)
abstracting: (1<=p18)
states: 937,494 (5)
abstracting: (p18<=1)
states: 3,260,241 (6)
abstracting: (1<=p37)
states: 337,272 (5)
abstracting: (p37<=1)
states: 3,260,241 (6)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 3,260,241 (6)
..
EG iterations: 2
abstracting: (1<=p34)
states: 335,700 (5)
abstracting: (p34<=1)
states: 3,260,241 (6)
abstracting: (1<=p28)
states: 88,419 (4)
abstracting: (p28<=1)
states: 3,260,241 (6)
abstracting: (1<=p17)
states: 464,766 (5)
abstracting: (p17<=1)
states: 3,260,241 (6)
abstracting: (1<=p26)
states: 1,086,309 (6)
abstracting: (p26<=1)
states: 3,260,241 (6)
abstracting: (1<=p10)
states: 5,392 (3)
abstracting: (p10<=1)
states: 3,260,241 (6)
abstracting: (1<=p60)
states: 351
abstracting: (p60<=1)
states: 3,260,241 (6)
abstracting: (1<=p10)
states: 5,392 (3)
abstracting: (p10<=1)
states: 3,260,241 (6)
abstracting: (1<=p10)
states: 5,392 (3)
abstracting: (p10<=1)
states: 3,260,241 (6)
...................
EG iterations: 19
abstracting: (1<=p30)
states: 335,700 (5)
abstracting: (p30<=1)
states: 3,260,241 (6)
abstracting: (1<=p36)
states: 332,910 (5)
abstracting: (p36<=1)
states: 3,260,241 (6)
.............................
EG iterations: 29
abstracting: (1<=p26)
states: 1,086,309 (6)
abstracting: (p26<=1)
states: 3,260,241 (6)
abstracting: (1<=p70)
states: 351,462 (5)
abstracting: (p70<=1)
states: 3,260,241 (6)
abstracting: (1<=p25)
states: 1,086,837 (6)
abstracting: (p25<=1)
states: 3,260,241 (6)
abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
abstracting: (1<=p42)
states: 431,724 (5)
abstracting: (p42<=1)
states: 3,260,241 (6)
.abstracting: (1<=p53)
states: 344,928 (5)
abstracting: (p53<=1)
states: 3,260,241 (6)
abstracting: (1<=p69)
states: 371,310 (5)
abstracting: (p69<=1)
states: 3,260,241 (6)
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (1<=p61)
states: 351
abstracting: (p61<=1)
states: 3,260,241 (6)
....................
EG iterations: 20
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p46)
states: 442,158 (5)
.........................................................
EG iterations: 57
.............................................................
EG iterations: 61
abstracting: (1<=p53)
states: 344,928 (5)
abstracting: (p53<=1)
states: 3,260,241 (6)
abstracting: (1<=p18)
states: 937,494 (5)
abstracting: (p18<=1)
states: 3,260,241 (6)
abstracting: (1<=p37)
states: 337,272 (5)
abstracting: (p37<=1)
states: 3,260,241 (6)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 3,260,241 (6)
..
EG iterations: 2
abstracting: (1<=p53)
states: 344,928 (5)
abstracting: (p53<=1)
states: 3,260,241 (6)
abstracting: (1<=p69)
states: 371,310 (5)
abstracting: (p69<=1)
states: 3,260,241 (6)
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (1<=p61)
states: 351
abstracting: (p61<=1)
states: 3,260,241 (6)
....................
EG iterations: 20
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p46)
states: 442,158 (5)
.........................................................
EG iterations: 57
.............................................................
EG iterations: 61
abstracting: (1<=p53)
states: 344,928 (5)
abstracting: (p53<=1)
states: 3,260,241 (6)
abstracting: (1<=p18)
states: 937,494 (5)
abstracting: (p18<=1)
states: 3,260,241 (6)
abstracting: (1<=p37)
states: 337,272 (5)
abstracting: (p37<=1)
states: 3,260,241 (6)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 3,260,241 (6)
..
EG iterations: 2
.........................................................................................................................
EG iterations: 121
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.184sec

checking: [E [[[~ [EG [~ [[p68<=1 & 1<=p68]]]] & EG [[p6<=1 & 1<=p6]]] & [~ [AX [[[p27<=1 & 1<=p27] & [[p59<=1 & 1<=p59] & [p71<=1 & 1<=p71]]]]] & [[p46<=1 & 1<=p46] & [p26<=1 & 1<=p26]]]] U [[AX [[[p38<=1 & 1<=p38] & [[p57<=1 & 1<=p57] | [[p24<=1 & 1<=p24] & [[p37<=1 & 1<=p37] & [p71<=1 & 1<=p71]]]]]] | [p56<=1 & 1<=p56]] | [~ [EF [AG [[[p27<=1 & 1<=p27] & [[p59<=1 & 1<=p59] & [p71<=1 & 1<=p71]]]]]] | [[AG [[[p18<=1 & 1<=p18] & [p37<=1 & 1<=p37]]] & ~ [EF [[[p20<=1 & 1<=p20] & [p59<=1 & 1<=p59]]]]] & [[p18<=1 & 1<=p18] & [p37<=1 & 1<=p37]]]]]] | AX [~ [E [AF [[[p25<=1 & 1<=p25] & [p53<=1 & 1<=p53]]] U [[AX [[p68<=1 & 1<=p68]] | AX [[p56<=1 & 1<=p56]]] & ~ [[p44<=1 & 1<=p44]]]]]]]
normalized: [~ [EX [E [~ [EG [~ [[[p53<=1 & 1<=p53] & [p25<=1 & 1<=p25]]]]] U [~ [[p44<=1 & 1<=p44]] & [~ [EX [~ [[p56<=1 & 1<=p56]]]] | ~ [EX [~ [[p68<=1 & 1<=p68]]]]]]]]] | E [[[[[p26<=1 & 1<=p26] & [p46<=1 & 1<=p46]] & EX [~ [[[[p71<=1 & 1<=p71] & [p59<=1 & 1<=p59]] & [p27<=1 & 1<=p27]]]]] & [EG [[p6<=1 & 1<=p6]] & ~ [EG [~ [[p68<=1 & 1<=p68]]]]]] U [[[[[p37<=1 & 1<=p37] & [p18<=1 & 1<=p18]] & [~ [E [true U [[p59<=1 & 1<=p59] & [p20<=1 & 1<=p20]]]] & ~ [E [true U ~ [[[p37<=1 & 1<=p37] & [p18<=1 & 1<=p18]]]]]]] | ~ [E [true U ~ [E [true U ~ [[[[p71<=1 & 1<=p71] & [p59<=1 & 1<=p59]] & [p27<=1 & 1<=p27]]]]]]]] | [[p56<=1 & 1<=p56] | ~ [EX [~ [[[[[[p71<=1 & 1<=p71] & [p37<=1 & 1<=p37]] & [p24<=1 & 1<=p24]] | [p57<=1 & 1<=p57]] & [p38<=1 & 1<=p38]]]]]]]]]

abstracting: (1<=p38)
states: 88,419 (4)
abstracting: (p38<=1)
states: 3,260,241 (6)
abstracting: (1<=p57)
states: 371,250 (5)
abstracting: (p57<=1)
states: 3,260,241 (6)
abstracting: (1<=p24)
states: 1,157,994 (6)
abstracting: (p24<=1)
states: 3,260,241 (6)
abstracting: (1<=p37)
states: 337,272 (5)
abstracting: (p37<=1)
states: 3,260,241 (6)
abstracting: (1<=p71)
states: 372,433 (5)
abstracting: (p71<=1)
states: 3,260,241 (6)
.abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
abstracting: (1<=p27)
states: 1,086,837 (6)
abstracting: (p27<=1)
states: 3,260,241 (6)
abstracting: (1<=p59)
states: 372,168 (5)
abstracting: (p59<=1)
states: 3,260,241 (6)
abstracting: (1<=p71)
states: 372,433 (5)
abstracting: (p71<=1)
states: 3,260,241 (6)
abstracting: (1<=p18)
states: 937,494 (5)
abstracting: (p18<=1)
states: 3,260,241 (6)
abstracting: (1<=p37)
states: 337,272 (5)
abstracting: (p37<=1)
states: 3,260,241 (6)
abstracting: (1<=p20)
states: 871,008 (5)
abstracting: (p20<=1)
states: 3,260,241 (6)
abstracting: (1<=p59)
states: 372,168 (5)
abstracting: (p59<=1)
states: 3,260,241 (6)
abstracting: (1<=p18)
states: 937,494 (5)
abstracting: (p18<=1)
states: 3,260,241 (6)
abstracting: (1<=p37)
states: 337,272 (5)
abstracting: (p37<=1)
states: 3,260,241 (6)
abstracting: (1<=p68)
states: 371,310 (5)
abstracting: (p68<=1)
states: 3,260,241 (6)
.....................................................................................................................
EG iterations: 117
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 3,260,241 (6)
....
EG iterations: 4
abstracting: (1<=p27)
states: 1,086,837 (6)
abstracting: (p27<=1)
states: 3,260,241 (6)
abstracting: (1<=p59)
states: 372,168 (5)
abstracting: (p59<=1)
states: 3,260,241 (6)
abstracting: (1<=p71)
states: 372,433 (5)
abstracting: (p71<=1)
states: 3,260,241 (6)
.abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (p46<=1)
states: 3,260,241 (6)
abstracting: (1<=p26)
states: 1,086,309 (6)
abstracting: (p26<=1)
states: 3,260,241 (6)
abstracting: (1<=p68)
states: 371,310 (5)
abstracting: (p68<=1)
states: 3,260,241 (6)
.abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
.abstracting: (1<=p44)
states: 442,158 (5)
abstracting: (p44<=1)
states: 3,260,241 (6)
abstracting: (1<=p25)
states: 1,086,837 (6)
abstracting: (p25<=1)
states: 3,260,241 (6)
abstracting: (1<=p53)
states: 344,928 (5)
abstracting: (p53<=1)
states: 3,260,241 (6)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.156sec

totally nodes used: 10946191 (1.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9169633 23587224 32756857
used/not used/entry size/cache size: 26593553 40515311 16 1024MB
basic ops cache: hits/miss/sum: 1484955 3317901 4802856
used/not used/entry size/cache size: 5701928 11075288 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: 13134 36460 49594
used/not used/entry size/cache size: 36384 8352224 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 57734482
1 8029042
2 1146075
3 174751
4 22026
5 2299
6 177
7 11
8 1
9 0
>= 10 0

Total processing time: 0m16.072sec


BK_STOP 1679497688512

--------------------
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:2494 (36), effective:451 (6)

initing FirstDep: 0m 0.000sec


iterations count:877 (12), effective:120 (1)

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

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

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

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

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

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

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

iterations count:162 (2), effective:17 (0)

iterations count:869 (12), effective:119 (1)

iterations count:2226 (32), effective:349 (5)

iterations count:869 (12), effective:119 (1)

iterations count:869 (12), effective:119 (1)

iterations count:749 (11), effective:101 (1)

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

iterations count:882 (12), effective:129 (1)

iterations count:882 (12), effective:129 (1)

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

iterations count:882 (12), effective:129 (1)

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

iterations count:564 (8), effective:124 (1)

iterations count:1482 (21), effective:259 (3)

iterations count:656 (9), effective:84 (1)

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

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

iterations count:932 (13), effective:122 (1)

iterations count:1554 (22), effective:228 (3)

iterations count:1508 (22), effective:252 (3)

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

iterations count:932 (13), effective:122 (1)

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

iterations count:932 (13), effective:122 (1)

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

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

iterations count:91 (1), effective:6 (0)

iterations count:924 (13), effective:113 (1)

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

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

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

iterations count:941 (13), effective:125 (1)

iterations count:905 (13), effective:113 (1)

iterations count:91 (1), effective:6 (0)

iterations count:924 (13), effective:113 (1)

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

iterations count:91 (1), effective:6 (0)

iterations count:924 (13), effective:113 (1)

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

iterations count:263 (3), effective:38 (0)

iterations count:1105 (16), effective:149 (2)

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

iterations count:68 (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-001B"
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-001B, 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-167903717600186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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