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-167905978400042.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-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978400042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.8K Feb 26 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 18:24 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.3K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 18:26 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 36K 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-003B-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679338378518

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-003B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:53:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 18:53:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:53:00] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-20 18:53:00] [INFO ] Transformed 123 places.
[2023-03-20 18:53:00] [INFO ] Transformed 138 transitions.
[2023-03-20 18:53:00] [INFO ] Found NUPN structural information;
[2023-03-20 18:53:00] [INFO ] Parsed PT model containing 123 places and 138 transitions and 432 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 99 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 121 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 121 transition count 136
Applied a total of 4 rules in 22 ms. Remains 121 /123 variables (removed 2) and now considering 136/138 (removed 2) transitions.
// Phase 1: matrix 136 rows 121 cols
[2023-03-20 18:53:00] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-20 18:53:01] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-20 18:53:01] [INFO ] Invariant cache hit.
[2023-03-20 18:53:01] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-20 18:53:01] [INFO ] Invariant cache hit.
[2023-03-20 18:53:01] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 136/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 121/123 places, 136/138 transitions.
Support contains 99 out of 121 places after structural reductions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 47 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 16 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 96 out of 121 places (down from 99) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 80) seen :75
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 18:53:02] [INFO ] Invariant cache hit.
[2023-03-20 18:53:02] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-20 18:53:02] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 18:53:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 18:53:02] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 5 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 234 ms
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2023-03-20 18:53:02] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2023-03-20 18:53:03] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-20 18:53:03] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2023-03-20 18:53:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 244 ms
[2023-03-20 18:53:03] [INFO ] After 595ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-20 18:53:03] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 11 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 136/136 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 121 transition count 125
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 110 transition count 125
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 22 place count 110 transition count 110
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 52 place count 95 transition count 110
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 68 place count 79 transition count 94
Iterating global reduction 2 with 16 rules applied. Total rules applied 84 place count 79 transition count 94
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 84 place count 79 transition count 90
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 75 transition count 90
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 136 place count 53 transition count 68
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 53 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 52 transition count 67
Applied a total of 143 rules in 24 ms. Remains 52 /121 variables (removed 69) and now considering 67/136 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 52/121 places, 67/136 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 67 rows 52 cols
[2023-03-20 18:53:03] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-20 18:53:03] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-20 18:53:03] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:53:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-20 18:53:03] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 18:53:03] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-20 18:53:03] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2023-03-20 18:53:03] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2023-03-20 18:53:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 81 ms
[2023-03-20 18:53:03] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2023-03-20 18:53:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-20 18:53:03] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-20 18:53:03] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 67/67 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 65
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 65
Applied a total of 5 rules in 7 ms. Remains 50 /52 variables (removed 2) and now considering 65/67 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 50/52 places, 65/67 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1051368 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 1051368 steps, saw 181702 distinct states, run finished after 3004 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 65 rows 50 cols
[2023-03-20 18:53:06] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-20 18:53:06] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 18:53:06] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:53:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 18:53:06] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 18:53:06] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2023-03-20 18:53:07] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-20 18:53:07] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2023-03-20 18:53:07] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2023-03-20 18:53:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 140 ms
[2023-03-20 18:53:07] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 18:53:07] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 50/50 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-20 18:53:07] [INFO ] Invariant cache hit.
[2023-03-20 18:53:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 18:53:07] [INFO ] Invariant cache hit.
[2023-03-20 18:53:07] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-20 18:53:07] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-20 18:53:07] [INFO ] Invariant cache hit.
[2023-03-20 18:53:07] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 50/50 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 18:53:07] [INFO ] Invariant cache hit.
[2023-03-20 18:53:07] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 18:53:07] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:53:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 18:53:07] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 18:53:07] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2023-03-20 18:53:07] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2023-03-20 18:53:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2023-03-20 18:53:07] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2023-03-20 18:53:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-20 18:53:07] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 18:53:07] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-003B-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 12 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 12 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 136 transitions.
Computed a total of 34 stabilizing places and 34 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 121 transition count 124
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 109 transition count 124
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 24 place count 109 transition count 109
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 54 place count 94 transition count 109
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 72 place count 76 transition count 91
Iterating global reduction 2 with 18 rules applied. Total rules applied 90 place count 76 transition count 91
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 90 place count 76 transition count 84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 104 place count 69 transition count 84
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 144 place count 49 transition count 64
Applied a total of 144 rules in 20 ms. Remains 49 /121 variables (removed 72) and now considering 64/136 (removed 72) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 49/121 places, 64/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 105 transition count 120
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 105 transition count 120
Applied a total of 32 rules in 7 ms. Remains 105 /121 variables (removed 16) and now considering 120/136 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 105/121 places, 120/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 8 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 8 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 120 transition count 123
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 108 transition count 123
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 108 transition count 109
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 94 transition count 109
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 70 place count 76 transition count 91
Iterating global reduction 2 with 18 rules applied. Total rules applied 88 place count 76 transition count 91
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 88 place count 76 transition count 84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 102 place count 69 transition count 84
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 144 place count 48 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 46 transition count 61
Applied a total of 146 rules in 21 ms. Remains 46 /121 variables (removed 75) and now considering 61/136 (removed 75) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 46/121 places, 61/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Reduce places removed 1 places and 1 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 120 transition count 124
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 109 transition count 124
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 22 place count 109 transition count 108
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 93 transition count 108
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 72 place count 75 transition count 90
Iterating global reduction 2 with 18 rules applied. Total rules applied 90 place count 75 transition count 90
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 90 place count 75 transition count 86
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 71 transition count 86
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 136 place count 52 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 50 transition count 65
Applied a total of 138 rules in 21 ms. Remains 50 /121 variables (removed 71) and now considering 65/136 (removed 71) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 50/121 places, 65/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 103 transition count 118
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 103 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 102 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 102 transition count 117
Applied a total of 38 rules in 7 ms. Remains 102 /121 variables (removed 19) and now considering 117/136 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 102/121 places, 117/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 102 transition count 117
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 102 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 101 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 101 transition count 116
Applied a total of 40 rules in 5 ms. Remains 101 /121 variables (removed 20) and now considering 116/136 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 101/121 places, 116/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 105 transition count 120
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 105 transition count 120
Applied a total of 32 rules in 2 ms. Remains 105 /121 variables (removed 16) and now considering 120/136 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 105/121 places, 120/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 102 transition count 117
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 102 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 101 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 101 transition count 116
Applied a total of 40 rules in 4 ms. Remains 101 /121 variables (removed 20) and now considering 116/136 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 101/121 places, 116/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 105 transition count 120
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 105 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 104 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 104 transition count 119
Applied a total of 34 rules in 3 ms. Remains 104 /121 variables (removed 17) and now considering 119/136 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 104/121 places, 119/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 103 transition count 118
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 103 transition count 118
Applied a total of 36 rules in 3 ms. Remains 103 /121 variables (removed 18) and now considering 118/136 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 103/121 places, 118/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Reduce places removed 1 places and 1 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 120 transition count 124
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 109 transition count 124
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 22 place count 109 transition count 108
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 93 transition count 108
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 70 place count 77 transition count 92
Iterating global reduction 2 with 16 rules applied. Total rules applied 86 place count 77 transition count 92
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 86 place count 77 transition count 87
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 72 transition count 87
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 138 place count 51 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 49 transition count 64
Applied a total of 140 rules in 14 ms. Remains 49 /121 variables (removed 72) and now considering 64/136 (removed 72) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 49/121 places, 64/136 transitions.
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:53:07] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:53:07] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 107 transition count 122
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 107 transition count 122
Applied a total of 28 rules in 3 ms. Remains 107 /121 variables (removed 14) and now considering 122/136 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 107/121 places, 122/136 transitions.
[2023-03-20 18:53:08] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:08] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:08] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Reduce places removed 1 places and 1 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 120 transition count 124
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 109 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 108 transition count 123
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 24 place count 108 transition count 107
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 56 place count 92 transition count 107
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 73 place count 75 transition count 90
Iterating global reduction 3 with 17 rules applied. Total rules applied 90 place count 75 transition count 90
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 90 place count 75 transition count 84
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 102 place count 69 transition count 84
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 146 place count 47 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 46 transition count 61
Applied a total of 147 rules in 15 ms. Remains 46 /121 variables (removed 75) and now considering 61/136 (removed 75) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 46/121 places, 61/136 transitions.
[2023-03-20 18:53:08] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:53:08] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:53:08] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 121 transition count 126
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 111 transition count 126
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 20 place count 111 transition count 109
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 54 place count 94 transition count 109
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 67 place count 81 transition count 96
Iterating global reduction 2 with 13 rules applied. Total rules applied 80 place count 81 transition count 96
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 80 place count 81 transition count 93
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 78 transition count 93
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 122 place count 60 transition count 75
Applied a total of 122 rules in 11 ms. Remains 60 /121 variables (removed 61) and now considering 75/136 (removed 61) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 60/121 places, 75/136 transitions.
[2023-03-20 18:53:08] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:53:08] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:53:08] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 136/136 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 121 transition count 128
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 113 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 112 transition count 127
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 18 place count 112 transition count 113
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 46 place count 98 transition count 113
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 62 place count 82 transition count 97
Iterating global reduction 3 with 16 rules applied. Total rules applied 78 place count 82 transition count 97
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 78 place count 82 transition count 94
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 79 transition count 94
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 122 place count 60 transition count 75
Applied a total of 122 rules in 11 ms. Remains 60 /121 variables (removed 61) and now considering 75/136 (removed 61) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 60/121 places, 75/136 transitions.
[2023-03-20 18:53:08] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:53:08] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:53:08] [INFO ] Input system was already deterministic with 75 transitions.
[2023-03-20 18:53:08] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:08] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:08] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-20 18:53:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 136 transitions and 428 arcs took 1 ms.
Total runtime 7559 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: 121 NrTr: 136 NrArc: 428)

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

net check time: 0m 0.000sec

init dd package: 0m 3.064sec


RS generation: 0m21.293sec


-> reachability set: #nodes 124391 (1.2e+05) #states 5,281,314,130 (9)



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

checking: AX [EF [[p76<=1 & 1<=p76]]]
normalized: ~ [EX [~ [E [true U [p76<=1 & 1<=p76]]]]]

abstracting: (1<=p76)
states: 797,081,362 (8)
abstracting: (p76<=1)
states: 5,281,314,130 (9)
.-> the formula is TRUE

FORMULA ShieldRVs-PT-003B-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.833sec

checking: EF [EX [EG [[p73<=1 & 1<=p73]]]]
normalized: E [true U EX [EG [[p73<=1 & 1<=p73]]]]

abstracting: (1<=p73)
states: 1,609,056 (6)
abstracting: (p73<=1)
states: 5,281,314,130 (9)
.....................................................
EG iterations: 53
.-> the formula is FALSE

FORMULA ShieldRVs-PT-003B-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.301sec

checking: A [[p13<=1 & 1<=p13] U EF [AG [~ [[p109<=1 & 1<=p109]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [true U [p109<=1 & 1<=p109]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [p109<=1 & 1<=p109]]]]] U [~ [[p13<=1 & 1<=p13]] & ~ [E [true U ~ [E [true U [p109<=1 & 1<=p109]]]]]]]]]

abstracting: (1<=p109)
states: 713,243,651 (8)
abstracting: (p109<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p13)
states: 577,320,145 (8)
abstracting: (p13<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p109)
states: 713,243,651 (8)
abstracting: (p109<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p109)
states: 713,243,651 (8)
abstracting: (p109<=1)
states: 5,281,314,130 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVs-PT-003B-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.549sec

checking: E [[p27<=1 & 1<=p27] U AF [[p110<=1 & 1<=p110]]]
normalized: E [[p27<=1 & 1<=p27] U ~ [EG [~ [[p110<=1 & 1<=p110]]]]]

abstracting: (1<=p110)
states: 838,087 (5)
abstracting: (p110<=1)
states: 5,281,314,130 (9)
..................................
EG iterations: 34
abstracting: (1<=p27)
states: 586,940,860 (8)
abstracting: (p27<=1)
states: 5,281,314,130 (9)
-> the formula is TRUE

FORMULA ShieldRVs-PT-003B-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.646sec

checking: [AF [~ [E [EG [[[p1<=1 & 1<=p1] | [p7<=1 & 1<=p7]]] U [AG [[p6<=1 & 1<=p6]] | AF [[p80<=1 & 1<=p80]]]]]] | AG [[p68<=1 & 1<=p68]]]
normalized: [~ [E [true U ~ [[p68<=1 & 1<=p68]]]] | ~ [EG [E [EG [[[p7<=1 & 1<=p7] | [p1<=1 & 1<=p1]]] U [~ [EG [~ [[p80<=1 & 1<=p80]]]] | ~ [E [true U ~ [[p6<=1 & 1<=p6]]]]]]]]]

abstracting: (1<=p6)
states: 128,826 (5)
abstracting: (p6<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p80)
states: 501,721,580 (8)
abstracting: (p80<=1)
states: 5,281,314,130 (9)
............................................................
EG iterations: 60
abstracting: (1<=p1)
states: 288
abstracting: (p1<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p7)
states: 128,826 (5)
abstracting: (p7<=1)
states: 5,281,314,130 (9)
................................................................................
EG iterations: 80
.................
before gc: list nodes free: 1893613

after gc: idd nodes used:805433, unused:63194567; list nodes free:289918797
.....................................................................................
EG iterations: 102
abstracting: (1<=p68)
states: 620,487,349 (8)
abstracting: (p68<=1)
states: 5,281,314,130 (9)
-> the formula is FALSE

FORMULA ShieldRVs-PT-003B-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m29.469sec

checking: A [[p120<=1 & 1<=p120] U E [EF [[[p77<=1 & 1<=p77] | [p50<=1 & 1<=p50]]] U [[p47<=1 & 1<=p47] | [p78<=1 & 1<=p78]]]]
normalized: [~ [EG [~ [E [E [true U [[p50<=1 & 1<=p50] | [p77<=1 & 1<=p77]]] U [[p78<=1 & 1<=p78] | [p47<=1 & 1<=p47]]]]]] & ~ [E [~ [E [E [true U [[p50<=1 & 1<=p50] | [p77<=1 & 1<=p77]]] U [[p78<=1 & 1<=p78] | [p47<=1 & 1<=p47]]]] U [~ [[p120<=1 & 1<=p120]] & ~ [E [E [true U [[p50<=1 & 1<=p50] | [p77<=1 & 1<=p77]]] U [[p78<=1 & 1<=p78] | [p47<=1 & 1<=p47]]]]]]]]

abstracting: (1<=p47)
states: 173,952 (5)
abstracting: (p47<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p78)
states: 515,699,674 (8)
abstracting: (p78<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p77)
states: 525,308,618 (8)
abstracting: (p77<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p50)
states: 709,212,757 (8)
abstracting: (p50<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p120)
states: 838,087 (5)
abstracting: (p120<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p47)
states: 173,952 (5)
abstracting: (p47<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p78)
states: 515,699,674 (8)
abstracting: (p78<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p77)
states: 525,308,618 (8)
abstracting: (p77<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p50)
states: 709,212,757 (8)
abstracting: (p50<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p47)
states: 173,952 (5)
abstracting: (p47<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p78)
states: 515,699,674 (8)
abstracting: (p78<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p77)
states: 525,308,618 (8)
abstracting: (p77<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p50)
states: 709,212,757 (8)
abstracting: (p50<=1)
states: 5,281,314,130 (9)
.................................
EG iterations: 33
-> the formula is TRUE

FORMULA ShieldRVs-PT-003B-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.800sec

checking: [AX [AG [[[p3<=1 & 1<=p3] & [p26<=1 & 1<=p26]]]] | EG [[AG [[[[p56<=0 & 0<=p56] | [[p61<=0 & 0<=p61] | [p70<=0 & 0<=p70]]] & [p90<=0 & 0<=p90]]] & AF [[p46<=0 & 0<=p46]]]]]
normalized: [EG [[~ [EG [~ [[p46<=0 & 0<=p46]]]] & ~ [E [true U ~ [[[p90<=0 & 0<=p90] & [[[p70<=0 & 0<=p70] | [p61<=0 & 0<=p61]] | [p56<=0 & 0<=p56]]]]]]]] | ~ [EX [E [true U ~ [[[p26<=1 & 1<=p26] & [p3<=1 & 1<=p3]]]]]]]

abstracting: (1<=p3)
states: 1,680,138,358 (9)
abstracting: (p3<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p26)
states: 950,368,158 (8)
abstracting: (p26<=1)
states: 5,281,314,130 (9)
.abstracting: (0<=p56)
states: 5,281,314,130 (9)
abstracting: (p56<=0)
states: 4,563,642,387 (9)
abstracting: (0<=p61)
states: 5,281,314,130 (9)
abstracting: (p61<=0)
states: 3,409,509,187 (9)
abstracting: (0<=p70)
states: 5,281,314,130 (9)
abstracting: (p70<=0)
states: 4,566,923,242 (9)
abstracting: (0<=p90)
states: 5,281,314,130 (9)
abstracting: (p90<=0)
states: 4,765,905,710 (9)
abstracting: (0<=p46)
states: 5,281,314,130 (9)
abstracting: (p46<=0)
states: 5,281,270,642 (9)
............................................
EG iterations: 44
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldRVs-PT-003B-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.840sec

checking: EG [A [~ [E [[~ [[p16<=1 & 1<=p16]] & [[p96<=1 & 1<=p96] | [[p5<=1 & 1<=p5] & [[p14<=1 & 1<=p14] & [p41<=1 & 1<=p41]]]]] U EF [[[p31<=1 & 1<=p31] & [[p42<=1 & 1<=p42] & [p65<=1 & 1<=p65]]]]]] U [p73<=1 & 1<=p73]]]
normalized: EG [[~ [EG [~ [[p73<=1 & 1<=p73]]]] & ~ [E [~ [[p73<=1 & 1<=p73]] U [E [[[[[[p41<=1 & 1<=p41] & [p14<=1 & 1<=p14]] & [p5<=1 & 1<=p5]] | [p96<=1 & 1<=p96]] & ~ [[p16<=1 & 1<=p16]]] U E [true U [[[p65<=1 & 1<=p65] & [p42<=1 & 1<=p42]] & [p31<=1 & 1<=p31]]]] & ~ [[p73<=1 & 1<=p73]]]]]]]

abstracting: (1<=p73)
states: 1,609,056 (6)
abstracting: (p73<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p31)
states: 646,496,429 (8)
abstracting: (p31<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p42)
states: 515,282,755 (8)
abstracting: (p42<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p65)
states: 840,920,701 (8)
abstracting: (p65<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p16)
states: 555,299,338 (8)
abstracting: (p16<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p96)
states: 30,502,259 (7)
abstracting: (p96<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p5)
states: 1,967,170,117 (9)
abstracting: (p5<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p14)
states: 510,013,469 (8)
abstracting: (p14<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p41)
states: 439,909,612 (8)
abstracting: (p41<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p73)
states: 1,609,056 (6)
abstracting: (p73<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p73)
states: 1,609,056 (6)
abstracting: (p73<=1)
states: 5,281,314,130 (9)
...............................................
EG iterations: 47
.................................
before gc: list nodes free: 2345245

after gc: idd nodes used:604201, unused:63395799; list nodes free:290932757
....................
EG iterations: 53
-> the formula is FALSE

FORMULA ShieldRVs-PT-003B-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.302sec

checking: EG [[A [[[p67<=1 & 1<=p67] & [[p78<=1 & 1<=p78] & [p103<=1 & 1<=p103]]] U AX [[[p107<=1 & 1<=p107] & [p43<=1 & 1<=p43]]]] | ~ [A [[[p12<=1 & 1<=p12] & [[p53<=1 & 1<=p53] & [p80<=1 & 1<=p80]]] U [p96<=1 & 1<=p96]]]]]
normalized: EG [[~ [[~ [EG [~ [[p96<=1 & 1<=p96]]]] & ~ [E [~ [[p96<=1 & 1<=p96]] U [~ [[[[p80<=1 & 1<=p80] & [p53<=1 & 1<=p53]] & [p12<=1 & 1<=p12]]] & ~ [[p96<=1 & 1<=p96]]]]]]] | [~ [EG [EX [~ [[[p43<=1 & 1<=p43] & [p107<=1 & 1<=p107]]]]]] & ~ [E [EX [~ [[[p43<=1 & 1<=p43] & [p107<=1 & 1<=p107]]]] U [~ [[[[p103<=1 & 1<=p103] & [p78<=1 & 1<=p78]] & [p67<=1 & 1<=p67]]] & EX [~ [[[p43<=1 & 1<=p43] & [p107<=1 & 1<=p107]]]]]]]]]]

abstracting: (1<=p107)
states: 517,768,737 (8)
abstracting: (p107<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p43)
states: 515,282,755 (8)
abstracting: (p43<=1)
states: 5,281,314,130 (9)
.abstracting: (1<=p67)
states: 597,834,774 (8)
abstracting: (p67<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p78)
states: 515,699,674 (8)
abstracting: (p78<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p103)
states: 799,186,689 (8)
abstracting: (p103<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p107)
states: 517,768,737 (8)
abstracting: (p107<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p43)
states: 515,282,755 (8)
abstracting: (p43<=1)
states: 5,281,314,130 (9)
.abstracting: (1<=p107)
states: 517,768,737 (8)
abstracting: (p107<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p43)
states: 515,282,755 (8)
abstracting: (p43<=1)
states: 5,281,314,130 (9)
...............................................................................................
EG iterations: 94
abstracting: (1<=p96)
states: 30,502,259 (7)
abstracting: (p96<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p12)
states: 860,155,002 (8)
abstracting: (p12<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p53)
states: 579,857,134 (8)
abstracting: (p53<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p80)
states: 501,721,580 (8)
abstracting: (p80<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p96)
states: 30,502,259 (7)
abstracting: (p96<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p96)
states: 30,502,259 (7)
abstracting: (p96<=1)
states: 5,281,314,130 (9)
..............................
before gc: list nodes free: 1048763

after gc: idd nodes used:846881, unused:63153119; list nodes free:294010506
.....................................................................................................
EG iterations: 131
...................................................................................................................................
EG iterations: 131
-> the formula is FALSE

FORMULA ShieldRVs-PT-003B-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m55.679sec

checking: E [[EG [[[[AX [[p9<=1 & 1<=p9]] | [[p59<=1 & 1<=p59] & [p63<=1 & 1<=p63]]] | [[p109<=1 & 1<=p109] | [p1<=1 & 1<=p1]]] & EG [~ [[p52<=1 & 1<=p52]]]]] & EG [~ [AX [[[p25<=1 & 1<=p25] | [p88<=1 & 1<=p88]]]]]] U AG [EF [AG [[[p72<=1 & 1<=p72] & [p93<=1 & 1<=p93]]]]]]
normalized: E [[EG [EX [~ [[[p88<=1 & 1<=p88] | [p25<=1 & 1<=p25]]]]] & EG [[EG [~ [[p52<=1 & 1<=p52]]] & [[[p1<=1 & 1<=p1] | [p109<=1 & 1<=p109]] | [[[p63<=1 & 1<=p63] & [p59<=1 & 1<=p59]] | ~ [EX [~ [[p9<=1 & 1<=p9]]]]]]]]] U ~ [E [true U ~ [E [true U ~ [E [true U ~ [[[p93<=1 & 1<=p93] & [p72<=1 & 1<=p72]]]]]]]]]]

abstracting: (1<=p72)
states: 1,565,568 (6)
abstracting: (p72<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p93)
states: 530,278,301 (8)
abstracting: (p93<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p9)
states: 8,385,516 (6)
abstracting: (p9<=1)
states: 5,281,314,130 (9)
.abstracting: (1<=p59)
states: 63,284,766 (7)
abstracting: (p59<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p63)
states: 1,565,568 (6)
abstracting: (p63<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p109)
states: 713,243,651 (8)
abstracting: (p109<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p1)
states: 288
abstracting: (p1<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p52)
states: 553,801,326 (8)
abstracting: (p52<=1)
states: 5,281,314,130 (9)
.
EG iterations: 1
............................................................................................................................................................................
EG iterations: 172
abstracting: (1<=p25)
states: 641,858,693 (8)
abstracting: (p25<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p88)
states: 753,993,389 (8)
abstracting: (p88<=1)
states: 5,281,314,130 (9)
........
before gc: list nodes free: 5952154

after gc: idd nodes used:1327940, unused:62672060; list nodes free:291765551
.................................................
before gc: list nodes free: 314875

after gc: idd nodes used:1249976, unused:62750024; list nodes free:292184978
......................................
EG iterations: 94
-> the formula is FALSE

FORMULA ShieldRVs-PT-003B-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m54.838sec

checking: E [[[AF [[[p94<=1 & 1<=p94] & [[p99<=1 & 1<=p99] & [p108<=1 & 1<=p108]]]] & ~ [[[p51<=1 & 1<=p51] & [[p94<=1 & 1<=p94] & [p118<=1 & 1<=p118]]]]] | [A [AF [[[p57<=1 & 1<=p57] & [p2<=1 & 1<=p2]]] U [[p89<=1 & 1<=p89] | [[p91<=1 & 1<=p91] & [p0<=1 & 1<=p0]]]] & EF [[[p71<=1 & 1<=p71] & [p111<=1 & 1<=p111]]]]] U [[p8<=1 & 1<=p8] | EF [[EG [[p93<=1 & 1<=p93]] & [p38<=1 & 1<=p38]]]]]
normalized: E [[[E [true U [[p111<=1 & 1<=p111] & [p71<=1 & 1<=p71]]] & [~ [EG [~ [[[[p0<=1 & 1<=p0] & [p91<=1 & 1<=p91]] | [p89<=1 & 1<=p89]]]]] & ~ [E [~ [[[[p0<=1 & 1<=p0] & [p91<=1 & 1<=p91]] | [p89<=1 & 1<=p89]]] U [EG [~ [[[p2<=1 & 1<=p2] & [p57<=1 & 1<=p57]]]] & ~ [[[[p0<=1 & 1<=p0] & [p91<=1 & 1<=p91]] | [p89<=1 & 1<=p89]]]]]]]] | [~ [[[[p118<=1 & 1<=p118] & [p94<=1 & 1<=p94]] & [p51<=1 & 1<=p51]]] & ~ [EG [~ [[[[p108<=1 & 1<=p108] & [p99<=1 & 1<=p99]] & [p94<=1 & 1<=p94]]]]]]] U [E [true U [[p38<=1 & 1<=p38] & EG [[p93<=1 & 1<=p93]]]] | [p8<=1 & 1<=p8]]]

abstracting: (1<=p8)
states: 515,304 (5)
abstracting: (p8<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p93)
states: 530,278,301 (8)
abstracting: (p93<=1)
states: 5,281,314,130 (9)
.............................................................................
before gc: list nodes free: 3025458

after gc: idd nodes used:917573, unused:63082427; list nodes free:293702205
..........................................
EG iterations: 119
abstracting: (1<=p38)
states: 476,720,254 (8)
abstracting: (p38<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p94)
states: 760,844,665 (8)
abstracting: (p94<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p99)
states: 1,848,078,717 (9)
abstracting: (p99<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p108)
states: 713,243,651 (8)
abstracting: (p108<=1)
states: 5,281,314,130 (9)
................................................................................................................
EG iterations: 112
abstracting: (1<=p51)
states: 831,272,830 (8)
abstracting: (p51<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p94)
states: 760,844,665 (8)
abstracting: (p94<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p118)
states: 516,185,859 (8)
abstracting: (p118<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p89)
states: 753,993,389 (8)
abstracting: (p89<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p91)
states: 576,095,646 (8)
abstracting: (p91<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p57)
states: 717,671,743 (8)
abstracting: (p57<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p2)
states: 128,826 (5)
abstracting: (p2<=1)
states: 5,281,314,130 (9)
.
EG iterations: 1
abstracting: (1<=p89)
states: 753,993,389 (8)
abstracting: (p89<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p91)
states: 576,095,646 (8)
abstracting: (p91<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p89)
states: 753,993,389 (8)
abstracting: (p89<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p91)
states: 576,095,646 (8)
abstracting: (p91<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 5,281,314,130 (9)
.......................
before gc: list nodes free: 3109512

after gc: idd nodes used:1436096, unused:62563904; list nodes free:291343558
....................................
before gc: list nodes free: 3347030

after gc: idd nodes used:2438495, unused:61561505; list nodes free:286676721
....................................
before gc: list nodes free: 4045565

after gc: idd nodes used:2693082, unused:61306918; list nodes free:285490670
...................................................................
EG iterations: 162
abstracting: (1<=p71)
states: 714,390,888 (8)
abstracting: (p71<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p111)
states: 515,347,772 (8)
abstracting: (p111<=1)
states: 5,281,314,130 (9)
-> the formula is FALSE

FORMULA ShieldRVs-PT-003B-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 8m21.298sec

checking: EG [[[AF [[p47<=1 & 1<=p47]] | AF [[p44<=1 & 1<=p44]]] | [[p53<=0 & 0<=p53] | [[[EX [EX [[[p67<=0 & 0<=p67] | [[p81<=0 & 0<=p81] | [p103<=0 & 0<=p103]]]]] & [p109<=0 & 0<=p109]] & [[p98<=0 & 0<=p98] & [[p93<=1 & 1<=p93] | [p52<=0 & 0<=p52]]]] | [[EF [[[p51<=1 & 1<=p51] & [[p94<=1 & 1<=p94] & [p117<=1 & 1<=p117]]]] & [EF [[p89<=1 & 1<=p89]] & [p5<=1 & 1<=p5]]] & [[p17<=1 & 1<=p17] & [[p41<=1 & 1<=p41] & [p76<=1 & 1<=p76]]]]]]]]
normalized: EG [[[[[[[[p76<=1 & 1<=p76] & [p41<=1 & 1<=p41]] & [p17<=1 & 1<=p17]] & [[[p5<=1 & 1<=p5] & E [true U [p89<=1 & 1<=p89]]] & E [true U [[[p117<=1 & 1<=p117] & [p94<=1 & 1<=p94]] & [p51<=1 & 1<=p51]]]]] | [[[[p52<=0 & 0<=p52] | [p93<=1 & 1<=p93]] & [p98<=0 & 0<=p98]] & [[p109<=0 & 0<=p109] & EX [EX [[[[p103<=0 & 0<=p103] | [p81<=0 & 0<=p81]] | [p67<=0 & 0<=p67]]]]]]] | [p53<=0 & 0<=p53]] | [~ [EG [~ [[p44<=1 & 1<=p44]]]] | ~ [EG [~ [[p47<=1 & 1<=p47]]]]]]]

abstracting: (1<=p47)
states: 173,952 (5)
abstracting: (p47<=1)
states: 5,281,314,130 (9)
...............................................
EG iterations: 47
abstracting: (1<=p44)
states: 4,766,562 (6)
abstracting: (p44<=1)
states: 5,281,314,130 (9)
..................................................................
before gc: list nodes free: 3377534

after gc: idd nodes used:1343915, unused:62656085; list nodes free:291775436
............................
EG iterations: 94
abstracting: (0<=p53)
states: 5,281,314,130 (9)
abstracting: (p53<=0)
states: 4,701,456,996 (9)
abstracting: (0<=p67)
states: 5,281,314,130 (9)
abstracting: (p67<=0)
states: 4,683,479,356 (9)
abstracting: (0<=p81)
states: 5,281,314,130 (9)
abstracting: (p81<=0)
states: 4,754,059,085 (9)
abstracting: (0<=p103)
states: 5,281,314,130 (9)
abstracting: (p103<=0)
states: 4,482,127,441 (9)
..abstracting: (0<=p109)
states: 5,281,314,130 (9)
abstracting: (p109<=0)
states: 4,568,070,479 (9)
abstracting: (0<=p98)
states: 5,281,314,130 (9)
abstracting: (p98<=0)
states: 3,619,152,070 (9)
abstracting: (1<=p93)
states: 530,278,301 (8)
abstracting: (p93<=1)
states: 5,281,314,130 (9)
abstracting: (0<=p52)
states: 5,281,314,130 (9)
abstracting: (p52<=0)
states: 4,727,512,804 (9)
abstracting: (1<=p51)
states: 831,272,830 (8)
abstracting: (p51<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p94)
states: 760,844,665 (8)
abstracting: (p94<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p117)
states: 510,856,108 (8)
abstracting: (p117<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p89)
states: 753,993,389 (8)
abstracting: (p89<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p5)
states: 1,967,170,117 (9)
abstracting: (p5<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p17)
states: 729,726,422 (8)
abstracting: (p17<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p41)
states: 439,909,612 (8)
abstracting: (p41<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p76)
states: 797,081,362 (8)
abstracting: (p76<=1)
states: 5,281,314,130 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVs-PT-003B-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.523sec

checking: E [[~ [[E [~ [[p27<=1 & 1<=p27]] U ~ [AF [[[p51<=1 & 1<=p51] & [[p94<=1 & 1<=p94] & [p118<=1 & 1<=p118]]]]]] & [p48<=1 & 1<=p48]]] | [~ [EF [[[p53<=1 & 1<=p53] | [p95<=1 & 1<=p95]]]] | [p114<=1 & 1<=p114]]] U [[p64<=1 & 1<=p64] & [E [E [[p35<=1 & 1<=p35] U AG [[p1<=1 & 1<=p1]]] U E [[[p85<=1 & 1<=p85] | [p93<=1 & 1<=p93]] U [[p116<=1 & 1<=p116] | [p92<=1 & 1<=p92]]]] | ~ [AF [[AG [[[p51<=1 & 1<=p51] & [[p94<=1 & 1<=p94] & [p117<=1 & 1<=p117]]]] & ~ [[p38<=1 & 1<=p38]]]]]]]]
normalized: E [[[[p114<=1 & 1<=p114] | ~ [E [true U [[p95<=1 & 1<=p95] | [p53<=1 & 1<=p53]]]]] | ~ [[[p48<=1 & 1<=p48] & E [~ [[p27<=1 & 1<=p27]] U EG [~ [[[[p118<=1 & 1<=p118] & [p94<=1 & 1<=p94]] & [p51<=1 & 1<=p51]]]]]]]] U [[EG [~ [[~ [[p38<=1 & 1<=p38]] & ~ [E [true U ~ [[[[p117<=1 & 1<=p117] & [p94<=1 & 1<=p94]] & [p51<=1 & 1<=p51]]]]]]]] | E [E [[p35<=1 & 1<=p35] U ~ [E [true U ~ [[p1<=1 & 1<=p1]]]]] U E [[[p93<=1 & 1<=p93] | [p85<=1 & 1<=p85]] U [[p92<=1 & 1<=p92] | [p116<=1 & 1<=p116]]]]] & [p64<=1 & 1<=p64]]]

abstracting: (1<=p64)
states: 712,825,320 (8)
abstracting: (p64<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p116)
states: 603,138,330 (8)
abstracting: (p116<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p92)
states: 562,630,338 (8)
abstracting: (p92<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p85)
states: 90,604 (4)
abstracting: (p85<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p93)
states: 530,278,301 (8)
abstracting: (p93<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p1)
states: 288
abstracting: (p1<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p35)
states: 510,516,193 (8)
abstracting: (p35<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p51)
states: 831,272,830 (8)
abstracting: (p51<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p94)
states: 760,844,665 (8)
abstracting: (p94<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p117)
states: 510,856,108 (8)
abstracting: (p117<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p38)
states: 476,720,254 (8)
abstracting: (p38<=1)
states: 5,281,314,130 (9)

EG iterations: 0
abstracting: (1<=p51)
states: 831,272,830 (8)
abstracting: (p51<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p94)
states: 760,844,665 (8)
abstracting: (p94<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p118)
states: 516,185,859 (8)
abstracting: (p118<=1)
states: 5,281,314,130 (9)
...................................................................
EG iterations: 67
abstracting: (1<=p27)
states: 586,940,860 (8)
abstracting: (p27<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p48)
states: 4,531,464 (6)
abstracting: (p48<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p53)
states: 579,857,134 (8)
abstracting: (p53<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p95)
states: 760,844,665 (8)
abstracting: (p95<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p114)
states: 527,990,591 (8)
abstracting: (p114<=1)
states: 5,281,314,130 (9)
-> the formula is FALSE

FORMULA ShieldRVs-PT-003B-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.927sec

checking: EG [[EF [[EX [[[p93<=1 & 1<=p93] & [[p99<=1 & 1<=p99] & [p108<=1 & 1<=p108]]]] | [[[p56<=1 & 1<=p56] & [[p61<=1 & 1<=p61] & [p69<=1 & 1<=p69]]] | [[p55<=1 & 1<=p55] & [[p61<=1 & 1<=p61] & [p70<=1 & 1<=p70]]]]]] & [[E [[p54<=1 & 1<=p54] U [p106<=1 & 1<=p106]] | [[p17<=0 & 0<=p17] | [p22<=0 & 0<=p22]]] | [[p30<=0 & 0<=p30] | [[AF [[[p94<=1 & 1<=p94] & [[p99<=1 & 1<=p99] & [p107<=1 & 1<=p107]]]] & [[p117<=1 & 1<=p117] | [[p17<=1 & 1<=p17] & [[p22<=1 & 1<=p22] & [p30<=1 & 1<=p30]]]]] | [[A [[p4<=1 & 1<=p4] U [p109<=1 & 1<=p109]] & [[p28<=1 & 1<=p28] & [p42<=1 & 1<=p42]]] & [[p65<=1 & 1<=p65] & [[p4<=1 & 1<=p4] & [p58<=1 & 1<=p58]]]]]]]]]
normalized: EG [[E [true U [[[[p56<=1 & 1<=p56] & [[p69<=1 & 1<=p69] & [p61<=1 & 1<=p61]]] | [[[p70<=1 & 1<=p70] & [p61<=1 & 1<=p61]] & [p55<=1 & 1<=p55]]] | EX [[[p93<=1 & 1<=p93] & [[p99<=1 & 1<=p99] & [p108<=1 & 1<=p108]]]]]] & [[[[[[[p58<=1 & 1<=p58] & [p4<=1 & 1<=p4]] & [p65<=1 & 1<=p65]] & [[[p42<=1 & 1<=p42] & [p28<=1 & 1<=p28]] & [~ [EG [~ [[p109<=1 & 1<=p109]]]] & ~ [E [~ [[p109<=1 & 1<=p109]] U [~ [[p4<=1 & 1<=p4]] & ~ [[p109<=1 & 1<=p109]]]]]]]] | [[[[[p30<=1 & 1<=p30] & [p22<=1 & 1<=p22]] & [p17<=1 & 1<=p17]] | [p117<=1 & 1<=p117]] & ~ [EG [~ [[[[p107<=1 & 1<=p107] & [p99<=1 & 1<=p99]] & [p94<=1 & 1<=p94]]]]]]] | [p30<=0 & 0<=p30]] | [[[p22<=0 & 0<=p22] | [p17<=0 & 0<=p17]] | E [[p54<=1 & 1<=p54] U [p106<=1 & 1<=p106]]]]]]

abstracting: (1<=p106)
states: 654,097,380 (8)
abstracting: (p106<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p54)
states: 596,467,294 (8)
abstracting: (p54<=1)
states: 5,281,314,130 (9)
abstracting: (0<=p17)
states: 5,281,314,130 (9)
abstracting: (p17<=0)
states: 4,551,587,708 (9)
abstracting: (0<=p22)
states: 5,281,314,130 (9)
abstracting: (p22<=0)
states: 3,367,371,877 (9)
abstracting: (0<=p30)
states: 5,281,314,130 (9)
abstracting: (p30<=0)
states: 4,741,927,452 (9)
abstracting: (1<=p94)
states: 760,844,665 (8)
abstracting: (p94<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p99)
states: 1,848,078,717 (9)
abstracting: (p99<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p107)
states: 517,768,737 (8)
abstracting: (p107<=1)
states: 5,281,314,130 (9)
.
EG iterations: 1
abstracting: (1<=p117)
states: 510,856,108 (8)
abstracting: (p117<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p17)
states: 729,726,422 (8)
abstracting: (p17<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p22)
states: 1,913,942,253 (9)
abstracting: (p22<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p30)
states: 539,386,678 (8)
abstracting: (p30<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p109)
states: 713,243,651 (8)
abstracting: (p109<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p4)
states: 1,633,876,540 (9)
abstracting: (p4<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p109)
states: 713,243,651 (8)
abstracting: (p109<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p109)
states: 713,243,651 (8)
abstracting: (p109<=1)
states: 5,281,314,130 (9)
........................
before gc: list nodes free: 5517631

after gc: idd nodes used:1642756, unused:62357244; list nodes free:290415460
.............................................................................................................................................................................
EG iterations: 197
abstracting: (1<=p28)
states: 614,420,021 (8)
abstracting: (p28<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p42)
states: 515,282,755 (8)
abstracting: (p42<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p65)
states: 840,920,701 (8)
abstracting: (p65<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p4)
states: 1,633,876,540 (9)
abstracting: (p4<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p58)
states: 19,666,863 (7)
abstracting: (p58<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p108)
states: 713,243,651 (8)
abstracting: (p108<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p99)
states: 1,848,078,717 (9)
abstracting: (p99<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p93)
states: 530,278,301 (8)
abstracting: (p93<=1)
states: 5,281,314,130 (9)
.abstracting: (1<=p55)
states: 531,232,896 (8)
abstracting: (p55<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p61)
states: 1,871,804,943 (9)
abstracting: (p61<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p70)
states: 714,390,888 (8)
abstracting: (p70<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p61)
states: 1,871,804,943 (9)
abstracting: (p61<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p69)
states: 526,660,697 (8)
abstracting: (p69<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p56)
states: 717,671,743 (8)
abstracting: (p56<=1)
states: 5,281,314,130 (9)

before gc: list nodes free: 1804094

after gc: idd nodes used:1221077, unused:62778923; list nodes free:292361275
...................................................
before gc: list nodes free: 1268217

after gc: idd nodes used:1896446, unused:62103554; list nodes free:289207534
..............................
EG iterations: 81
-> the formula is TRUE

FORMULA ShieldRVs-PT-003B-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m32.128sec

checking: E [[EX [~ [[~ [[p18<=1 & 1<=p18]] | AX [[p41<=1 & 1<=p41]]]]] | ~ [[[p24<=1 & 1<=p24] & [[p93<=1 & 1<=p93] | [~ [[[p108<=1 & 1<=p108] & [[p115<=1 & 1<=p115] & [p11<=1 & 1<=p11]]]] | [[~ [[p60<=1 & 1<=p60]] & [p12<=1 & 1<=p12]] & [[p53<=1 & 1<=p53] & [p81<=1 & 1<=p81]]]]]]]] U [[~ [A [[p24<=1 & 1<=p24] U [AF [[p10<=1 & 1<=p10]] | [[p16<=1 & 1<=p16] & [[p22<=1 & 1<=p22] & [p31<=1 & 1<=p31]]]]]] | [[p62<=1 & 1<=p62] & [p75<=1 & 1<=p75]]] & [[AF [[p41<=1 & 1<=p41]] | AF [[[[p82<=1 & 1<=p82] & [p93<=1 & 1<=p93]] & [[p99<=1 & 1<=p99] & [p108<=1 & 1<=p108]]]]] | [A [~ [A [[p21<=1 & 1<=p21] U [p89<=1 & 1<=p89]]] U E [[[p105<=1 & 1<=p105] & [p118<=1 & 1<=p118]] U [[p51<=1 & 1<=p51] & [[p94<=1 & 1<=p94] & [p118<=1 & 1<=p118]]]]] | [AF [[p101<=1 & 1<=p101]] & [p59<=1 & 1<=p59]]]]]]
normalized: E [[~ [[[[[[[p81<=1 & 1<=p81] & [p53<=1 & 1<=p53]] & [[p12<=1 & 1<=p12] & ~ [[p60<=1 & 1<=p60]]]] | ~ [[[[p11<=1 & 1<=p11] & [p115<=1 & 1<=p115]] & [p108<=1 & 1<=p108]]]] | [p93<=1 & 1<=p93]] & [p24<=1 & 1<=p24]]] | EX [~ [[~ [EX [~ [[p41<=1 & 1<=p41]]]] | ~ [[p18<=1 & 1<=p18]]]]]] U [[[[~ [E [~ [E [[[p118<=1 & 1<=p118] & [p105<=1 & 1<=p105]] U [[[p118<=1 & 1<=p118] & [p94<=1 & 1<=p94]] & [p51<=1 & 1<=p51]]]] U [[~ [EG [~ [[p89<=1 & 1<=p89]]]] & ~ [E [~ [[p89<=1 & 1<=p89]] U [~ [[p21<=1 & 1<=p21]] & ~ [[p89<=1 & 1<=p89]]]]]] & ~ [E [[[p118<=1 & 1<=p118] & [p105<=1 & 1<=p105]] U [[[p118<=1 & 1<=p118] & [p94<=1 & 1<=p94]] & [p51<=1 & 1<=p51]]]]]]] & ~ [EG [~ [E [[[p118<=1 & 1<=p118] & [p105<=1 & 1<=p105]] U [[[p118<=1 & 1<=p118] & [p94<=1 & 1<=p94]] & [p51<=1 & 1<=p51]]]]]]] | [[p59<=1 & 1<=p59] & ~ [EG [~ [[p101<=1 & 1<=p101]]]]]] | [~ [EG [~ [[[[p82<=1 & 1<=p82] & [p93<=1 & 1<=p93]] & [[p108<=1 & 1<=p108] & [p99<=1 & 1<=p99]]]]]] | ~ [EG [~ [[p41<=1 & 1<=p41]]]]]] & [~ [[~ [EG [~ [[[[[p31<=1 & 1<=p31] & [p22<=1 & 1<=p22]] & [p16<=1 & 1<=p16]] | ~ [EG [~ [[p10<=1 & 1<=p10]]]]]]]] & ~ [E [~ [[[[[p31<=1 & 1<=p31] & [p22<=1 & 1<=p22]] & [p16<=1 & 1<=p16]] | ~ [EG [~ [[p10<=1 & 1<=p10]]]]]] U [~ [[p24<=1 & 1<=p24]] & ~ [[[[[p31<=1 & 1<=p31] & [p22<=1 & 1<=p22]] & [p16<=1 & 1<=p16]] | ~ [EG [~ [[p10<=1 & 1<=p10]]]]]]]]]]] | [[p75<=1 & 1<=p75] & [p62<=1 & 1<=p62]]]]]

abstracting: (1<=p62)
states: 1,678,903,089 (9)
abstracting: (p62<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p75)
states: 797,081,362 (8)
abstracting: (p75<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p10)
states: 27,304,470 (7)
abstracting: (p10<=1)
states: 5,281,314,130 (9)
.......................................................................................................................................
EG iterations: 135
abstracting: (1<=p16)
states: 555,299,338 (8)
abstracting: (p16<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p22)
states: 1,913,942,253 (9)
abstracting: (p22<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p31)
states: 646,496,429 (8)
abstracting: (p31<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p24)
states: 4,637,736 (6)
abstracting: (p24<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p10)
states: 27,304,470 (7)
abstracting: (p10<=1)
states: 5,281,314,130 (9)
.......................................................................................................................................
EG iterations: 135
abstracting: (1<=p16)
states: 555,299,338 (8)
abstracting: (p16<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p22)
states: 1,913,942,253 (9)
abstracting: (p22<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p31)
states: 646,496,429 (8)
abstracting: (p31<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p10)
states: 27,304,470 (7)
abstracting: (p10<=1)
states: 5,281,314,130 (9)
.......................................................................................................................................
EG iterations: 135
abstracting: (1<=p16)
states: 555,299,338 (8)
abstracting: (p16<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p22)
states: 1,913,942,253 (9)
abstracting: (p22<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p31)
states: 646,496,429 (8)
abstracting: (p31<=1)
states: 5,281,314,130 (9)
.
EG iterations: 1
abstracting: (1<=p41)
states: 439,909,612 (8)
abstracting: (p41<=1)
states: 5,281,314,130 (9)
.....................
before gc: list nodes free: 1571370

after gc: idd nodes used:1543431, unused:62456569; list nodes free:290924069
............................................................................
EG iterations: 97
abstracting: (1<=p99)
states: 1,848,078,717 (9)
abstracting: (p99<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p108)
states: 713,243,651 (8)
abstracting: (p108<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p93)
states: 530,278,301 (8)
abstracting: (p93<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p82)
states: 527,255,045 (8)
abstracting: (p82<=1)
states: 5,281,314,130 (9)
.
EG iterations: 1
abstracting: (1<=p101)
states: 815,436 (5)
abstracting: (p101<=1)
states: 5,281,314,130 (9)
......................................
EG iterations: 38
abstracting: (1<=p59)
states: 63,284,766 (7)
abstracting: (p59<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p51)
states: 831,272,830 (8)
abstracting: (p51<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p94)
states: 760,844,665 (8)
abstracting: (p94<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p118)
states: 516,185,859 (8)
abstracting: (p118<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p105)
states: 629,603,532 (8)
abstracting: (p105<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p118)
states: 516,185,859 (8)
abstracting: (p118<=1)
states: 5,281,314,130 (9)
....................................................................
EG iterations: 68
abstracting: (1<=p51)
states: 831,272,830 (8)
abstracting: (p51<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p94)
states: 760,844,665 (8)
abstracting: (p94<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p118)
states: 516,185,859 (8)
abstracting: (p118<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p105)
states: 629,603,532 (8)
abstracting: (p105<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p118)
states: 516,185,859 (8)
abstracting: (p118<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p89)
states: 753,993,389 (8)
abstracting: (p89<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p21)
states: 1,613,918,280 (9)
abstracting: (p21<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p89)
states: 753,993,389 (8)
abstracting: (p89<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p89)
states: 753,993,389 (8)
abstracting: (p89<=1)
states: 5,281,314,130 (9)
.....................
before gc: list nodes free: 2225691

after gc: idd nodes used:2410297, unused:61589703; list nodes free:286901476
.....................................
before gc: list nodes free: 3341533

after gc: idd nodes used:2009628, unused:61990372; list nodes free:288786418
...................................
before gc: list nodes free: 4134144

after gc: idd nodes used:3156303, unused:60843697; list nodes free:283469508
.....................................................................
EG iterations: 162
abstracting: (1<=p51)
states: 831,272,830 (8)
abstracting: (p51<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p94)
states: 760,844,665 (8)
abstracting: (p94<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p118)
states: 516,185,859 (8)
abstracting: (p118<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p105)
states: 629,603,532 (8)
abstracting: (p105<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p118)
states: 516,185,859 (8)
abstracting: (p118<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p18)
states: 729,726,422 (8)
abstracting: (p18<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p41)
states: 439,909,612 (8)
abstracting: (p41<=1)
states: 5,281,314,130 (9)
..abstracting: (1<=p24)
states: 4,637,736 (6)
abstracting: (p24<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p93)
states: 530,278,301 (8)
abstracting: (p93<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p108)
states: 713,243,651 (8)
abstracting: (p108<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p115)
states: 542,037,078 (8)
abstracting: (p115<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p11)
states: 717,246,779 (8)
abstracting: (p11<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p60)
states: 1,662,528,651 (9)
abstracting: (p60<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p12)
states: 860,155,002 (8)
abstracting: (p12<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p53)
states: 579,857,134 (8)
abstracting: (p53<=1)
states: 5,281,314,130 (9)
abstracting: (1<=p81)
states: 527,255,045 (8)
abstracting: (p81<=1)
states: 5,281,314,130 (9)

before gc: list nodes free: 4503297

after gc: idd nodes used:1576374, unused:62423626; list nodes free:290790281
-> the formula is TRUE

FORMULA ShieldRVs-PT-003B-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 10m41.204sec

totally nodes used: 1129784063 (1.1e+09)
number of garbage collections: 18
fire ops cache: hits/miss/sum: 926095087 2535974448 3462069535
used/not used/entry size/cache size: 19429266 47679598 16 1024MB
basic ops cache: hits/miss/sum: 184848817 424229194 609078011
used/not used/entry size/cache size: 7845824 8931392 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: 844479 3124080 3968559
used/not used/entry size/cache size: 0 8388608 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 60993326
1 5437716
2 581688
3 83242
4 11469
5 1274
6 140
7 9
8 0
9 0
>= 10 0

Total processing time: 36m44.265sec


BK_STOP 1679340592696

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

122618 137215 149181 149701 135176
iterations count:505357 (3715), effective:48431 (356)

initing FirstDep: 0m 0.000sec


iterations count:15136 (111), effective:1314 (9)

iterations count:12861 (94), effective:1075 (7)

iterations count:32056 (235), effective:2569 (18)

iterations count:12861 (94), effective:1075 (7)

iterations count:32056 (235), effective:2569 (18)

iterations count:12861 (94), effective:1075 (7)

iterations count:32056 (235), effective:2569 (18)

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

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

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

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

iterations count:39356 (289), effective:3380 (24)

iterations count:23689 (174), effective:1994 (14)

iterations count:39356 (289), effective:3380 (24)

iterations count:23689 (174), effective:1994 (14)

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

iterations count:39356 (289), effective:3380 (24)

iterations count:23689 (174), effective:1994 (14)

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

iterations count:52273 (384), effective:4708 (34)

iterations count:11793 (86), effective:842 (6)

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

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

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

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

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

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

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

iterations count:67990 (499), effective:6193 (45)

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

iterations count:41365 (304), effective:3821 (28)

iterations count:59708 (439), effective:5430 (39)

iterations count:13554 (99), effective:1285 (9)

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

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

iterations count:3290 (24), effective:318 (2)

iterations count:7082 (52), effective:592 (4)

iterations count:35945 (264), effective:3104 (22)

iterations count:11694 (85), effective:823 (6)

iterations count:18861 (138), effective:1912 (14)

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

iterations count:63437 (466), effective:5826 (42)

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

iterations count:7864 (57), effective:674 (4)

iterations count:7864 (57), effective:674 (4)

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

iterations count:7864 (57), effective:674 (4)

iterations count:83661 (615), effective:7859 (57)

iterations count:26440 (194), effective:1833 (13)

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-003B"
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-003B, 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-167905978400042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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