Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r394-oct2-167903717400026.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPs-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717400026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 33K 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 ShieldIIPs-PT-002B-CTLFireability-00
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-01
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-02
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-03
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-04
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-05
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-06
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-07
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-08
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-09
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-10
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-11
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-12
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-13
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-14
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679484483130

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=ShieldIIPs-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 11:28:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 11:28:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:28:05] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-22 11:28:05] [INFO ] Transformed 123 places.
[2023-03-22 11:28:05] [INFO ] Transformed 121 transitions.
[2023-03-22 11:28:05] [INFO ] Found NUPN structural information;
[2023-03-22 11:28:05] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 98 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 120
Applied a total of 2 rules in 18 ms. Remains 122 /123 variables (removed 1) and now considering 120/121 (removed 1) transitions.
// Phase 1: matrix 120 rows 122 cols
[2023-03-22 11:28:05] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-22 11:28:05] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-22 11:28:05] [INFO ] Invariant cache hit.
[2023-03-22 11:28:05] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-22 11:28:05] [INFO ] Invariant cache hit.
[2023-03-22 11:28:06] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 120/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 122/123 places, 120/121 transitions.
Support contains 98 out of 122 places after structural reductions.
[2023-03-22 11:28:06] [INFO ] Flatten gal took : 44 ms
[2023-03-22 11:28:06] [INFO ] Flatten gal took : 12 ms
[2023-03-22 11:28:06] [INFO ] Input system was already deterministic with 120 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 90) seen :88
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 11:28:06] [INFO ] Invariant cache hit.
[2023-03-22 11:28:06] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2023-03-22 11:28:06] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 11:28:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 11:28:07] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 11:28:07] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 4 ms to minimize.
[2023-03-22 11:28:07] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2023-03-22 11:28:07] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2023-03-22 11:28:07] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2023-03-22 11:28:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 558 ms
[2023-03-22 11:28:07] [INFO ] After 615ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 11:28:07] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 120/120 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 122 transition count 110
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 112 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 111 transition count 109
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 22 place count 111 transition count 98
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 44 place count 100 transition count 98
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 54 place count 90 transition count 88
Iterating global reduction 3 with 10 rules applied. Total rules applied 64 place count 90 transition count 88
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 64 place count 90 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 74 place count 85 transition count 83
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 132 place count 56 transition count 54
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 143 place count 56 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 55 transition count 53
Applied a total of 144 rules in 87 ms. Remains 55 /122 variables (removed 67) and now considering 53/120 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 55/122 places, 53/120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2535015 steps, run timeout after 3001 ms. (steps per millisecond=844 ) properties seen :{}
Probabilistic random walk after 2535015 steps, saw 457193 distinct states, run finished after 3006 ms. (steps per millisecond=843 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 55 cols
[2023-03-22 11:28:10] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-22 11:28:10] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-22 11:28:10] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 11:28:10] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:28:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-22 11:28:10] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 11:28:10] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:28:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 11:28:10] [INFO ] After 12ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 11:28:10] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 11:28:10] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 53/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 55/55 places, 53/53 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 53/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2023-03-22 11:28:10] [INFO ] Invariant cache hit.
[2023-03-22 11:28:11] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-22 11:28:11] [INFO ] Invariant cache hit.
[2023-03-22 11:28:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 11:28:11] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-22 11:28:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 11:28:11] [INFO ] Invariant cache hit.
[2023-03-22 11:28:11] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 55/55 places, 53/53 transitions.
Graph (complete) has 183 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 54 /55 variables (removed 1) and now considering 53/53 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 54 cols
[2023-03-22 11:28:11] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-22 11:28:11] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 11:28:11] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 11:28:11] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:28:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-22 11:28:11] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 11:28:11] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:28:11] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 11:28:11] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 7 ms
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 8 ms
[2023-03-22 11:28:11] [INFO ] Input system was already deterministic with 120 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 114 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 114 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 111
Applied a total of 18 rules in 10 ms. Remains 113 /122 variables (removed 9) and now considering 111/120 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 113/122 places, 111/120 transitions.
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:11] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 7 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 110/122 places, 108/120 transitions.
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:11] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Applied a total of 22 rules in 3 ms. Remains 111 /122 variables (removed 11) and now considering 109/120 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/122 places, 109/120 transitions.
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 20 ms
[2023-03-22 11:28:11] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 108 transition count 106
Applied a total of 28 rules in 30 ms. Remains 108 /122 variables (removed 14) and now considering 106/120 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 108/122 places, 106/120 transitions.
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 16 ms
[2023-03-22 11:28:11] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 112 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 112 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 109
Applied a total of 22 rules in 7 ms. Remains 111 /122 variables (removed 11) and now considering 109/120 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 111/122 places, 109/120 transitions.
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 13 ms
[2023-03-22 11:28:11] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 110 transition count 108
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 3 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 110/122 places, 108/120 transitions.
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:11] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 112 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 112 transition count 110
Applied a total of 20 rules in 3 ms. Remains 112 /122 variables (removed 10) and now considering 110/120 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 112/122 places, 110/120 transitions.
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:11] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 112 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 112 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 109
Applied a total of 22 rules in 3 ms. Remains 111 /122 variables (removed 11) and now considering 109/120 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/122 places, 109/120 transitions.
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:12] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 110 transition count 108
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 109 transition count 107
Applied a total of 26 rules in 4 ms. Remains 109 /122 variables (removed 13) and now considering 107/120 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 109/122 places, 107/120 transitions.
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 110 transition count 108
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 2 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 110/122 places, 108/120 transitions.
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 3 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 110/122 places, 108/120 transitions.
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 110 transition count 108
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 109 transition count 107
Applied a total of 26 rules in 4 ms. Remains 109 /122 variables (removed 13) and now considering 107/120 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 109/122 places, 107/120 transitions.
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 3 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 110/122 places, 108/120 transitions.
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:12] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Applied a total of 26 rules in 2 ms. Remains 109 /122 variables (removed 13) and now considering 107/120 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 109/122 places, 107/120 transitions.
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 108 transition count 106
Applied a total of 28 rules in 3 ms. Remains 108 /122 variables (removed 14) and now considering 106/120 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 108/122 places, 106/120 transitions.
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 4 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/122 places, 108/120 transitions.
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:12] [INFO ] Input system was already deterministic with 108 transitions.
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 6 ms
[2023-03-22 11:28:12] [INFO ] Flatten gal took : 7 ms
[2023-03-22 11:28:12] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2023-03-22 11:28:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 120 transitions and 360 arcs took 3 ms.
Total runtime 6910 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: 122 NrTr: 120 NrArc: 360)

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

net check time: 0m 0.000sec

init dd package: 0m 2.967sec


RS generation: 0m11.746sec


-> reachability set: #nodes 145788 (1.5e+05) #states 258,292,953,085 (11)



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

checking: EF [EX [AF [[[p28<=1 & 1<=p28] & [[p49<=1 & 1<=p49] & [p60<=1 & 1<=p60]]]]]]
normalized: E [true U EX [~ [EG [~ [[[p28<=1 & 1<=p28] & [[p49<=1 & 1<=p49] & [p60<=1 & 1<=p60]]]]]]]]

abstracting: (1<=p60)
states: 28,329,447,996 (10)
abstracting: (p60<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p49)
states: 31,132,922,806 (10)
abstracting: (p49<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p28)
states: 86,854,244,886 (10)
abstracting: (p28<=1)
states: 258,292,953,085 (11)
.........................................................................................................................
EG iterations: 121
.-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56.951sec

checking: [EG [EX [[[p38<=0 & 0<=p38] | AG [[[p2<=1 & 1<=p2] & [p44<=1 & 1<=p44]]]]]] & AG [[p59<=0 & 0<=p59]]]
normalized: [~ [E [true U ~ [[p59<=0 & 0<=p59]]]] & EG [EX [[~ [E [true U ~ [[[p44<=1 & 1<=p44] & [p2<=1 & 1<=p2]]]]] | [p38<=0 & 0<=p38]]]]]

abstracting: (0<=p38)
states: 258,292,953,085 (11)
abstracting: (p38<=0)
states: 258,114,957,726 (11)
abstracting: (1<=p2)
states: 83,682,550,786 (10)
abstracting: (p2<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p44)
states: 36,379,535,976 (10)
abstracting: (p44<=1)
states: 258,292,953,085 (11)
.....................................................
before gc: list nodes free: 2019561

after gc: idd nodes used:601800, unused:63398200; list nodes free:292960512
.........................................................................
EG iterations: 125
abstracting: (0<=p59)
states: 258,292,953,085 (11)
abstracting: (p59<=0)
states: 234,656,157,115 (11)
-> the formula is FALSE

FORMULA ShieldIIPs-PT-002B-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.058sec

checking: AG [EX [E [AF [E [[p111<=1 & 1<=p111] U [p34<=1 & 1<=p34]]] U AX [[[p37<=1 & 1<=p37] & [p70<=1 & 1<=p70]]]]]]
normalized: ~ [E [true U ~ [EX [E [~ [EG [~ [E [[p111<=1 & 1<=p111] U [p34<=1 & 1<=p34]]]]] U ~ [EX [~ [[[p70<=1 & 1<=p70] & [p37<=1 & 1<=p37]]]]]]]]]]

abstracting: (1<=p37)
states: 32,851,293,508 (10)
abstracting: (p37<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p70)
states: 105,874,704 (8)
abstracting: (p70<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p34)
states: 32,513,110,866 (10)
abstracting: (p34<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p111)
states: 134,379 (5)
abstracting: (p111<=1)
states: 258,292,953,085 (11)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ShieldIIPs-PT-002B-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.331sec

checking: EX [~ [E [EF [[p76<=1 & 1<=p76]] U [AF [[[p28<=1 & 1<=p28] & [[p49<=1 & 1<=p49] & [p57<=1 & 1<=p57]]]] & [~ [[[p107<=1 & 1<=p107] | [p5<=1 & 1<=p5]]] & [p18<=1 & 1<=p18]]]]]]
normalized: EX [~ [E [E [true U [p76<=1 & 1<=p76]] U [[[p18<=1 & 1<=p18] & ~ [[[p5<=1 & 1<=p5] | [p107<=1 & 1<=p107]]]] & ~ [EG [~ [[[[p57<=1 & 1<=p57] & [p49<=1 & 1<=p49]] & [p28<=1 & 1<=p28]]]]]]]]]

abstracting: (1<=p28)
states: 86,854,244,886 (10)
abstracting: (p28<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p49)
states: 31,132,922,806 (10)
abstracting: (p49<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p57)
states: 28,547,765,724 (10)
abstracting: (p57<=1)
states: 258,292,953,085 (11)
.
EG iterations: 1
abstracting: (1<=p107)
states: 30,096,891,462 (10)
abstracting: (p107<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p5)
states: 3,974 (3)
abstracting: (p5<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p18)
states: 39,510,743,802 (10)
abstracting: (p18<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p76)
states: 38,871,030,462 (10)
abstracting: (p76<=1)
states: 258,292,953,085 (11)
.-> the formula is FALSE

FORMULA ShieldIIPs-PT-002B-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.355sec

checking: EF [[[EG [[p110<=1 & 1<=p110]] & EF [[p115<=0 & 0<=p115]]] & [[p78<=1 & 1<=p78] & [[p80<=1 & 1<=p80] & [AF [AX [[p109<=1 & 1<=p109]]] | ~ [E [[p106<=1 & 1<=p106] U [[p2<=1 & 1<=p2] & [p44<=1 & 1<=p44]]]]]]]]]
normalized: E [true U [[[[~ [E [[p106<=1 & 1<=p106] U [[p44<=1 & 1<=p44] & [p2<=1 & 1<=p2]]]] | ~ [EG [EX [~ [[p109<=1 & 1<=p109]]]]]] & [p80<=1 & 1<=p80]] & [p78<=1 & 1<=p78]] & [E [true U [p115<=0 & 0<=p115]] & EG [[p110<=1 & 1<=p110]]]]]

abstracting: (1<=p110)
states: 133,812 (5)
abstracting: (p110<=1)
states: 258,292,953,085 (11)
..................................
EG iterations: 34
abstracting: (0<=p115)
states: 258,292,953,085 (11)
abstracting: (p115<=0)
states: 229,881,521,233 (11)
abstracting: (1<=p78)
states: 71,809,801,662 (10)
abstracting: (p78<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p80)
states: 72,527,382,444 (10)
abstracting: (p80<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p109)
states: 33,164,281,632 (10)
abstracting: (p109<=1)
states: 258,292,953,085 (11)
..............................................................................................................................
EG iterations: 125
abstracting: (1<=p2)
states: 83,682,550,786 (10)
abstracting: (p2<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p44)
states: 36,379,535,976 (10)
abstracting: (p44<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p106)
states: 32,739,944,670 (10)
abstracting: (p106<=1)
states: 258,292,953,085 (11)
-> the formula is FALSE

FORMULA ShieldIIPs-PT-002B-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.300sec

checking: AG [[[EX [[[p21<=1 & 1<=p21] & [p48<=1 & 1<=p48]]] | AF [AG [[p62<=1 & 1<=p62]]]] | [EF [[[p51<=0 & 0<=p51] & [p69<=0 & 0<=p69]]] | [[p61<=1 & 1<=p61] | [[p50<=1 & 1<=p50] & [p68<=1 & 1<=p68]]]]]]
normalized: ~ [E [true U ~ [[[[[[p68<=1 & 1<=p68] & [p50<=1 & 1<=p50]] | [p61<=1 & 1<=p61]] | E [true U [[p69<=0 & 0<=p69] & [p51<=0 & 0<=p51]]]] | [~ [EG [E [true U ~ [[p62<=1 & 1<=p62]]]]] | EX [[[p48<=1 & 1<=p48] & [p21<=1 & 1<=p21]]]]]]]]

abstracting: (1<=p21)
states: 76,337,759,508 (10)
abstracting: (p21<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p48)
states: 31,099,122,048 (10)
abstracting: (p48<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p62)
states: 2,153,550 (6)
abstracting: (p62<=1)
states: 258,292,953,085 (11)

EG iterations: 0
abstracting: (0<=p51)
states: 258,292,953,085 (11)
abstracting: (p51<=0)
states: 258,290,803,509 (11)
abstracting: (0<=p69)
states: 258,292,953,085 (11)
abstracting: (p69<=0)
states: 258,283,389,901 (11)
abstracting: (1<=p61)
states: 28,329,447,996 (10)
abstracting: (p61<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p50)
states: 31,132,922,806 (10)
abstracting: (p50<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p68)
states: 72,576 (4)
abstracting: (p68<=1)
states: 258,292,953,085 (11)
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.412sec

checking: EX [EG [[[~ [A [[p75<=1 & 1<=p75] U [[p83<=1 & 1<=p83] & [[p91<=1 & 1<=p91] & [p118<=1 & 1<=p118]]]]] | [~ [A [[p109<=1 & 1<=p109] U [p89<=1 & 1<=p89]]] | EG [[p95<=0 & 0<=p95]]]] & [AX [[p89<=0 & 0<=p89]] | [p67<=1 & 1<=p67]]]]]
normalized: EX [EG [[[[p67<=1 & 1<=p67] | ~ [EX [~ [[p89<=0 & 0<=p89]]]]] & [[EG [[p95<=0 & 0<=p95]] | ~ [[~ [EG [~ [[p89<=1 & 1<=p89]]]] & ~ [E [~ [[p89<=1 & 1<=p89]] U [~ [[p109<=1 & 1<=p109]] & ~ [[p89<=1 & 1<=p89]]]]]]]] | ~ [[~ [EG [~ [[[[p118<=1 & 1<=p118] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]]]]] & ~ [E [~ [[[[p118<=1 & 1<=p118] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]]] U [~ [[p75<=1 & 1<=p75]] & ~ [[[[p118<=1 & 1<=p118] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]]]]]]]]]]]]

abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p118)
states: 27,482,944,746 (10)
abstracting: (p118<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p75)
states: 35,395,122,576 (10)
abstracting: (p75<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p118)
states: 27,482,944,746 (10)
abstracting: (p118<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p118)
states: 27,482,944,746 (10)
abstracting: (p118<=1)
states: 258,292,953,085 (11)
.
EG iterations: 1
abstracting: (1<=p89)
states: 33,086,932,005 (10)
abstracting: (p89<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p109)
states: 33,164,281,632 (10)
abstracting: (p109<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p89)
states: 33,086,932,005 (10)
abstracting: (p89<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p89)
states: 33,086,932,005 (10)
abstracting: (p89<=1)
states: 258,292,953,085 (11)
...................................
before gc: list nodes free: 1789098

after gc: idd nodes used:1571567, unused:62428433; list nodes free:288517185
.................................................
before gc: list nodes free: 1661133

after gc: idd nodes used:5285539, unused:58714461; list nodes free:273683388
.....................
before gc: list nodes free: 945624

after gc: idd nodes used:4055533, unused:59944467; list nodes free:279216939
.MC time: 5m44.878sec

checking: EF [~ [E [AF [AX [[p98<=1 & 1<=p98]]] U E [[[[[p74<=1 & 1<=p74] & [p99<=1 & 1<=p99]] | [[p25<=1 & 1<=p25] & [[p36<=1 & 1<=p36] & [p60<=1 & 1<=p60]]]] & [[p97<=1 & 1<=p97] | [p51<=1 & 1<=p51]]] U ~ [EX [[[p77<=1 & 1<=p77] & [p94<=1 & 1<=p94]]]]]]]]
normalized: E [true U ~ [E [~ [EG [EX [~ [[p98<=1 & 1<=p98]]]]] U E [[[[p51<=1 & 1<=p51] | [p97<=1 & 1<=p97]] & [[[p25<=1 & 1<=p25] & [[p60<=1 & 1<=p60] & [p36<=1 & 1<=p36]]] | [[p99<=1 & 1<=p99] & [p74<=1 & 1<=p74]]]] U ~ [EX [[[p94<=1 & 1<=p94] & [p77<=1 & 1<=p77]]]]]]]]

abstracting: (1<=p77)
states: 76,003,290,330 (10)
abstracting: (p77<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p94)
states: 33,108,318,939 (10)
abstracting: (p94<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p74)
states: 36,098,166,972 (10)
abstracting: (p74<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p99)
states: 89,663,783,574 (10)
abstracting: (p99<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p36)
states: 32,851,293,508 (10)
abstracting: (p36<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p60)
states: 28,329,447,996 (10)
abstracting: (p60<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p25)
states: 91,059,044,538 (10)
abstracting: (p25<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p97)
states: 551,119,068 (8)
abstracting: (p97<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p51)
states: 2,149,576 (6)
abstracting: (p51<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p98)
states: 83,985,487,632 (10)
abstracting: (p98<=1)
states: 258,292,953,085 (11)
..............................................................................................................................
EG iterations: 125
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43.980sec

checking: [EG [[E [EF [[[p77<=1 & 1<=p77] & [p93<=1 & 1<=p93]]] U AF [[[p86<=1 & 1<=p86] & [[p105<=1 & 1<=p105] & [p116<=1 & 1<=p116]]]]] | E [~ [[p88<=1 & 1<=p88]] U [p82<=1 & 1<=p82]]]] | [EF [AG [EX [[[p2<=1 & 1<=p2] & [p44<=1 & 1<=p44]]]]] | AG [~ [A [~ [[p91<=1 & 1<=p91]] U [AX [[p8<=1 & 1<=p8]] | EX [[p65<=1 & 1<=p65]]]]]]]]
normalized: [[~ [E [true U [~ [EG [~ [[~ [EX [~ [[p8<=1 & 1<=p8]]]] | EX [[p65<=1 & 1<=p65]]]]]] & ~ [E [~ [[~ [EX [~ [[p8<=1 & 1<=p8]]]] | EX [[p65<=1 & 1<=p65]]]] U [~ [[~ [EX [~ [[p8<=1 & 1<=p8]]]] | EX [[p65<=1 & 1<=p65]]]] & [p91<=1 & 1<=p91]]]]]]] | E [true U ~ [E [true U ~ [EX [[[p44<=1 & 1<=p44] & [p2<=1 & 1<=p2]]]]]]]] | EG [[E [~ [[p88<=1 & 1<=p88]] U [p82<=1 & 1<=p82]] | E [E [true U [[p93<=1 & 1<=p93] & [p77<=1 & 1<=p77]]] U ~ [EG [~ [[[[p116<=1 & 1<=p116] & [p105<=1 & 1<=p105]] & [p86<=1 & 1<=p86]]]]]]]]]

abstracting: (1<=p86)
states: 86,097,689,206 (10)
abstracting: (p86<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p105)
states: 32,179,020,408 (10)
abstracting: (p105<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p116)
states: 28,142,550,630 (10)
abstracting: (p116<=1)
states: 258,292,953,085 (11)
.
EG iterations: 1
abstracting: (1<=p77)
states: 76,003,290,330 (10)
abstracting: (p77<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p93)
states: 29,620,123,227 (10)
abstracting: (p93<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p82)
states: 84,553,097,010 (10)
abstracting: (p82<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p88)
states: 33,086,932,005 (10)
abstracting: (p88<=1)
states: 258,292,953,085 (11)
.............................................................................................................................
EG iterations: 125
abstracting: (1<=p2)
states: 83,682,550,786 (10)
abstracting: (p2<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p44)
states: 36,379,535,976 (10)
abstracting: (p44<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p65)
states: 2,268 (3)
abstracting: (p65<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p8)
states: 63,584 (4)
abstracting: (p8<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p65)
states: 2,268 (3)
abstracting: (p65<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p8)
states: 63,584 (4)
abstracting: (p8<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p65)
states: 2,268 (3)
abstracting: (p65<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p8)
states: 63,584 (4)
abstracting: (p8<=1)
states: 258,292,953,085 (11)
..............................................................................................................................
EG iterations: 125

before gc: list nodes free: 3100201

after gc: idd nodes used:696078, unused:63303922; list nodes free:294617744
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 9.532sec

checking: [EF [[EX [[p116<=1 & 1<=p116]] & E [~ [[p112<=1 & 1<=p112]] U [[p13<=1 & 1<=p13] & [p54<=1 & 1<=p54]]]]] & [EG [[[AG [[p75<=0 & 0<=p75]] | [p25<=0 & 0<=p25]] | [[p33<=0 & 0<=p33] | [p59<=0 & 0<=p59]]]] & EF [[[EG [EX [[p53<=1 & 1<=p53]]] & [p1<=1 & 1<=p1]] | AX [AX [[[p15<=0 & 0<=p15] | [p41<=0 & 0<=p41]]]]]]]]
normalized: [[E [true U [~ [EX [EX [~ [[[p41<=0 & 0<=p41] | [p15<=0 & 0<=p15]]]]]] | [[p1<=1 & 1<=p1] & EG [EX [[p53<=1 & 1<=p53]]]]]] & EG [[[[p59<=0 & 0<=p59] | [p33<=0 & 0<=p33]] | [[p25<=0 & 0<=p25] | ~ [E [true U ~ [[p75<=0 & 0<=p75]]]]]]]] & E [true U [E [~ [[p112<=1 & 1<=p112]] U [[p54<=1 & 1<=p54] & [p13<=1 & 1<=p13]]] & EX [[p116<=1 & 1<=p116]]]]]

abstracting: (1<=p116)
states: 28,142,550,630 (10)
abstracting: (p116<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p13)
states: 83,804,121,520 (10)
abstracting: (p13<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p54)
states: 33,053,702,154 (10)
abstracting: (p54<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p112)
states: 27,331,543,980 (10)
abstracting: (p112<=1)
states: 258,292,953,085 (11)
abstracting: (0<=p75)
states: 258,292,953,085 (11)
abstracting: (p75<=0)
states: 222,897,830,509 (11)
abstracting: (0<=p25)
states: 258,292,953,085 (11)
abstracting: (p25<=0)
states: 167,233,908,547 (11)
abstracting: (0<=p33)
states: 258,292,953,085 (11)
abstracting: (p33<=0)
states: 226,698,507,505 (11)
abstracting: (0<=p59)
states: 258,292,953,085 (11)
abstracting: (p59<=0)
states: 234,656,157,115 (11)
.
EG iterations: 1
abstracting: (1<=p53)
states: 28,327,294,446 (10)
abstracting: (p53<=1)
states: 258,292,953,085 (11)
....................................................................................................
before gc: list nodes free: 7137940

after gc: idd nodes used:2374777, unused:61625223; list nodes free:286938304
.................................................................................
EG iterations: 180
abstracting: (1<=p1)
states: 3,974 (3)
abstracting: (p1<=1)
states: 258,292,953,085 (11)
abstracting: (0<=p15)
states: 258,292,953,085 (11)
abstracting: (p15<=0)
states: 167,731,325,419 (11)
abstracting: (0<=p41)
states: 258,292,953,085 (11)
abstracting: (p41<=0)
states: 174,427,336,077 (11)
..-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m14.725sec

checking: AG [E [A [EF [[p47<=1 & 1<=p47]] U EX [[[p42<=1 & 1<=p42] | [p46<=1 & 1<=p46]]]] U [AX [AF [[p90<=1 & 1<=p90]]] & [[AX [[[p83<=1 & 1<=p83] & [[p94<=1 & 1<=p94] & [p118<=1 & 1<=p118]]]] | EG [[[p15<=1 & 1<=p15] & [p41<=1 & 1<=p41]]]] | [[AX [[p72<=1 & 1<=p72]] & [EG [[[p20<=1 & 1<=p20] & [p22<=1 & 1<=p22]]] | AF [[p50<=1 & 1<=p50]]]] | [EF [[[p26<=1 & 1<=p26] & [p103<=1 & 1<=p103]]] & ~ [[p24<=1 & 1<=p24]]]]]]]]
normalized: ~ [E [true U ~ [E [[~ [EG [~ [EX [[[p46<=1 & 1<=p46] | [p42<=1 & 1<=p42]]]]]] & ~ [E [~ [EX [[[p46<=1 & 1<=p46] | [p42<=1 & 1<=p42]]]] U [~ [E [true U [p47<=1 & 1<=p47]]] & ~ [EX [[[p46<=1 & 1<=p46] | [p42<=1 & 1<=p42]]]]]]]] U [[[[~ [[p24<=1 & 1<=p24]] & E [true U [[p103<=1 & 1<=p103] & [p26<=1 & 1<=p26]]]] | [[~ [EG [~ [[p50<=1 & 1<=p50]]]] | EG [[[p22<=1 & 1<=p22] & [p20<=1 & 1<=p20]]]] & ~ [EX [~ [[p72<=1 & 1<=p72]]]]]] | [EG [[[p41<=1 & 1<=p41] & [p15<=1 & 1<=p15]]] | ~ [EX [~ [[[[p118<=1 & 1<=p118] & [p94<=1 & 1<=p94]] & [p83<=1 & 1<=p83]]]]]]] & ~ [EX [EG [~ [[p90<=1 & 1<=p90]]]]]]]]]]

abstracting: (1<=p90)
states: 29,513,022,255 (10)
abstracting: (p90<=1)
states: 258,292,953,085 (11)
.
EG iterations: 1
.abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p94)
states: 33,108,318,939 (10)
abstracting: (p94<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p118)
states: 27,482,944,746 (10)
abstracting: (p118<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p15)
states: 90,561,627,666 (10)
abstracting: (p15<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p41)
states: 83,865,617,008 (10)
abstracting: (p41<=1)
states: 258,292,953,085 (11)
................................................................
before gc: list nodes free: 4548379

after gc: idd nodes used:2759694, unused:61240306; list nodes free:285241699
..............................................................................................................................
EG iterations: 190
abstracting: (1<=p72)
states: 84,026,550,168 (10)
abstracting: (p72<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p20)
states: 72,510,307,596 (10)
abstracting: (p20<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p22)
states: 70,851,237,912 (10)
abstracting: (p22<=1)
states: 258,292,953,085 (11)
.......................
before gc: list nodes free: 3146641

after gc: idd nodes used:1478003, unused:62521997; list nodes free:291073665
.........................................................................................................................................................................................
before gc: list nodes free: 3347464

after gc: idd nodes used:1771370, unused:62228630; list nodes free:289732833
...................................................................
EG iterations: 275
abstracting: (1<=p50)
states: 31,132,922,806 (10)
abstracting: (p50<=1)
states: 258,292,953,085 (11)
......................................................MC time: 6m37.047sec

checking: [E [[AX [~ [[[1<=p76 & p76<=1] | [[p8<=1 & 1<=p8] | [[p63<=1 & 1<=p63] & [p43<=1 & 1<=p43]]]]]] | [[p109<=1 & 1<=p109] | ~ [[[EX [[p102<=1 & 1<=p102]] | [[[p4<=1 & 1<=p4] & [p23<=1 & 1<=p23]] | [p37<=1 & 1<=p37]]] & [[p77<=1 & 1<=p77] & [p93<=1 & 1<=p93]]]]]] U [[p21<=1 & 1<=p21] & [p49<=1 & 1<=p49]]] & [AF [AG [~ [A [[p46<=1 & 1<=p46] U [p93<=1 & 1<=p93]]]]] & AF [[~ [E [~ [[p34<=1 & 1<=p34]] U EX [[p106<=1 & 1<=p106]]]] & [p58<=0 & 0<=p58]]]]]
normalized: [[~ [EG [~ [[[p58<=0 & 0<=p58] & ~ [E [~ [[p34<=1 & 1<=p34]] U EX [[p106<=1 & 1<=p106]]]]]]]] & ~ [EG [E [true U [~ [EG [~ [[p93<=1 & 1<=p93]]]] & ~ [E [~ [[p93<=1 & 1<=p93]] U [~ [[p46<=1 & 1<=p46]] & ~ [[p93<=1 & 1<=p93]]]]]]]]]] & E [[[~ [[[[p93<=1 & 1<=p93] & [p77<=1 & 1<=p77]] & [[[p37<=1 & 1<=p37] | [[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]]] | EX [[p102<=1 & 1<=p102]]]]] | [p109<=1 & 1<=p109]] | ~ [EX [[[[[p43<=1 & 1<=p43] & [p63<=1 & 1<=p63]] | [p8<=1 & 1<=p8]] | [1<=p76 & p76<=1]]]]] U [[p49<=1 & 1<=p49] & [p21<=1 & 1<=p21]]]]

abstracting: (1<=p21)
states: 76,337,759,508 (10)
abstracting: (p21<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p49)
states: 31,132,922,806 (10)
abstracting: (p49<=1)
states: 258,292,953,085 (11)
abstracting: (p76<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p76)
states: 38,871,030,462 (10)
abstracting: (1<=p8)
states: 63,584 (4)
abstracting: (p8<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p63)
states: 567
abstracting: (p63<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p43)
states: 31,130,773,230 (10)
abstracting: (p43<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p109)
states: 33,164,281,632 (10)
abstracting: (p109<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p102)
states: 33,164,147,820 (10)
abstracting: (p102<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p4)
states: 90,962,670,630 (10)
abstracting: (p4<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p23)
states: 83,676,031,454 (10)
abstracting: (p23<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p37)
states: 32,851,293,508 (10)
abstracting: (p37<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p77)
states: 76,003,290,330 (10)
abstracting: (p77<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p93)
states: 29,620,123,227 (10)
abstracting: (p93<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p93)
states: 29,620,123,227 (10)
abstracting: (p93<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p46)
states: 31,611,664,710 (10)
abstracting: (p46<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p93)
states: 29,620,123,227 (10)
abstracting: (p93<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p93)
states: 29,620,123,227 (10)
abstracting: (p93<=1)
states: 258,292,953,085 (11)
..........................................................................................
EG iterations: 90

before gc: list nodes free: 2649832

after gc: idd nodes used:1448748, unused:62551252; list nodes free:291207037
..........................................................................................................................
EG iterations: 122
abstracting: (1<=p106)
states: 32,739,944,670 (10)
abstracting: (p106<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p34)
states: 32,513,110,866 (10)
abstracting: (p34<=1)
states: 258,292,953,085 (11)
abstracting: (0<=p58)
states: 258,292,953,085 (11)
abstracting: (p58<=0)
states: 228,369,471,973 (11)
............................................................................................................................
EG iterations: 124
-> the formula is FALSE

FORMULA ShieldIIPs-PT-002B-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m20.192sec

checking: [AF [[[[EX [AG [[p109<=1 & 1<=p109]]] & E [[p55<=1 & 1<=p55] U [p109<=1 & 1<=p109]]] & [EX [[p110<=1 & 1<=p110]] & [[[[p16<=1 & 1<=p16] & [p40<=1 & 1<=p40]] | [[p83<=1 & 1<=p83] & [[p91<=1 & 1<=p91] & [p119<=1 & 1<=p119]]]] & EG [[p27<=0 & 0<=p27]]]]] | EF [EX [[p89<=1 & 1<=p89]]]]] | ~ [A [AF [[[[[p21<=1 & 1<=p21] & [p48<=1 & 1<=p48]] | [p106<=1 & 1<=p106]] & AX [[p102<=1 & 1<=p102]]]] U ~ [[[p83<=1 & 1<=p83] & [[p91<=1 & 1<=p91] & [p118<=1 & 1<=p118]]]]]]]
normalized: [~ [[~ [EG [[[[p118<=1 & 1<=p118] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]]]] & ~ [E [[[[p118<=1 & 1<=p118] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]] U [EG [~ [[~ [EX [~ [[p102<=1 & 1<=p102]]]] & [[p106<=1 & 1<=p106] | [[p48<=1 & 1<=p48] & [p21<=1 & 1<=p21]]]]]] & [[[p118<=1 & 1<=p118] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]]]]]]] | ~ [EG [~ [[E [true U EX [[p89<=1 & 1<=p89]]] | [[[EG [[p27<=0 & 0<=p27]] & [[[[p119<=1 & 1<=p119] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]] | [[p40<=1 & 1<=p40] & [p16<=1 & 1<=p16]]]] & EX [[p110<=1 & 1<=p110]]] & [E [[p55<=1 & 1<=p55] U [p109<=1 & 1<=p109]] & EX [~ [E [true U ~ [[p109<=1 & 1<=p109]]]]]]]]]]]]

abstracting: (1<=p109)
states: 33,164,281,632 (10)
abstracting: (p109<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p109)
states: 33,164,281,632 (10)
abstracting: (p109<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p55)
states: 33,053,702,154 (10)
abstracting: (p55<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p110)
states: 133,812 (5)
abstracting: (p110<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p16)
states: 35,772,401,818 (10)
abstracting: (p16<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p40)
states: 90,561,627,666 (10)
abstracting: (p40<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p119)
states: 27,331,678,359 (10)
abstracting: (p119<=1)
states: 258,292,953,085 (11)
abstracting: (0<=p27)
states: 258,292,953,085 (11)
abstracting: (p27<=0)
states: 172,574,725,615 (11)
..........................................
before gc: list nodes free: 2899259

after gc: idd nodes used:1926640, unused:62073360; list nodes free:289035208
...............................................................................................................................................................
before gc: list nodes free: 2875797

after gc: idd nodes used:2936193, unused:61063807; list nodes free:284376887
.........................................................................................................................................
before gc: list nodes free: 2943014

after gc: idd nodes used:1841927, unused:62158073; list nodes free:289412847
..............................
EG iterations: 368
abstracting: (1<=p89)
states: 33,086,932,005 (10)
abstracting: (p89<=1)
states: 258,292,953,085 (11)
..
EG iterations: 1
abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p118)
states: 27,482,944,746 (10)
abstracting: (p118<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p21)
states: 76,337,759,508 (10)
abstracting: (p21<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p48)
states: 31,099,122,048 (10)
abstracting: (p48<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p106)
states: 32,739,944,670 (10)
abstracting: (p106<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p102)
states: 33,164,147,820 (10)
abstracting: (p102<=1)
states: 258,292,953,085 (11)
.
EG iterations: 0
abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p118)
states: 27,482,944,746 (10)
abstracting: (p118<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p118)
states: 27,482,944,746 (10)
abstracting: (p118<=1)
states: 258,292,953,085 (11)
..........................................................................................................
EG iterations: 106
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m48.726sec

checking: A [[[p87<=1 & 1<=p87] | ~ [E [A [AX [[[p25<=1 & 1<=p25] & [[p33<=1 & 1<=p33] & [p59<=1 & 1<=p59]]]] U [p34<=1 & 1<=p34]] U [[EF [[p82<=1 & 1<=p82]] & E [[[p86<=1 & 1<=p86] & [[p105<=1 & 1<=p105] & [p119<=1 & 1<=p119]]] U [p107<=1 & 1<=p107]]] & [[p32<=1 & 1<=p32] & [[p87<=1 & 1<=p87] & [[p47<=1 & 1<=p47] | [[p19<=1 & 1<=p19] & [p35<=1 & 1<=p35]]]]]]]]] U EX [AX [[[p34<=1 & 1<=p34] | [~ [[p47<=1 & 1<=p47]] & EX [[p97<=1 & 1<=p97]]]]]]]
normalized: [~ [EG [~ [EX [~ [EX [~ [[[EX [[p97<=1 & 1<=p97]] & ~ [[p47<=1 & 1<=p47]]] | [p34<=1 & 1<=p34]]]]]]]]] & ~ [E [~ [EX [~ [EX [~ [[[EX [[p97<=1 & 1<=p97]] & ~ [[p47<=1 & 1<=p47]]] | [p34<=1 & 1<=p34]]]]]]] U [~ [[~ [E [[~ [EG [~ [[p34<=1 & 1<=p34]]]] & ~ [E [~ [[p34<=1 & 1<=p34]] U [EX [~ [[[[p59<=1 & 1<=p59] & [p33<=1 & 1<=p33]] & [p25<=1 & 1<=p25]]]] & ~ [[p34<=1 & 1<=p34]]]]]] U [[[[[[p35<=1 & 1<=p35] & [p19<=1 & 1<=p19]] | [p47<=1 & 1<=p47]] & [p87<=1 & 1<=p87]] & [p32<=1 & 1<=p32]] & [E [[[[p119<=1 & 1<=p119] & [p105<=1 & 1<=p105]] & [p86<=1 & 1<=p86]] U [p107<=1 & 1<=p107]] & E [true U [p82<=1 & 1<=p82]]]]]] | [p87<=1 & 1<=p87]]] & ~ [EX [~ [EX [~ [[[EX [[p97<=1 & 1<=p97]] & ~ [[p47<=1 & 1<=p47]]] | [p34<=1 & 1<=p34]]]]]]]]]]]

abstracting: (1<=p34)
states: 32,513,110,866 (10)
abstracting: (p34<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p47)
states: 34,282,564,110 (10)
abstracting: (p47<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p97)
states: 551,119,068 (8)
abstracting: (p97<=1)
states: 258,292,953,085 (11)
...abstracting: (1<=p87)
states: 1,306,448,622 (9)
abstracting: (p87<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p82)
states: 84,553,097,010 (10)
abstracting: (p82<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p107)
states: 30,096,891,462 (10)
abstracting: (p107<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p86)
states: 86,097,689,206 (10)
abstracting: (p86<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p105)
states: 32,179,020,408 (10)
abstracting: (p105<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p119)
states: 27,331,678,359 (10)
abstracting: (p119<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p32)
states: 30,693,469,194 (10)
abstracting: (p32<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p87)
states: 1,306,448,622 (9)
abstracting: (p87<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p47)
states: 34,282,564,110 (10)
abstracting: (p47<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p19)
states: 74,678,689,824 (10)
abstracting: (p19<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p35)
states: 30,482,904,834 (10)
abstracting: (p35<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p34)
states: 32,513,110,866 (10)
abstracting: (p34<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p25)
states: 91,059,044,538 (10)
abstracting: (p25<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p33)
states: 31,594,445,580 (10)
abstracting: (p33<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p59)
states: 23,636,795,970 (10)
abstracting: (p59<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p34)
states: 32,513,110,866 (10)
abstracting: (p34<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p34)
states: 32,513,110,866 (10)
abstracting: (p34<=1)
states: 258,292,953,085 (11)
.
EG iterations: 1
abstracting: (1<=p34)
states: 32,513,110,866 (10)
abstracting: (p34<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p47)
states: 34,282,564,110 (10)
abstracting: (p47<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p97)
states: 551,119,068 (8)
abstracting: (p97<=1)
states: 258,292,953,085 (11)
...abstracting: (1<=p34)
states: 32,513,110,866 (10)
abstracting: (p34<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p47)
states: 34,282,564,110 (10)
abstracting: (p47<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p97)
states: 551,119,068 (8)
abstracting: (p97<=1)
states: 258,292,953,085 (11)
...............................................................................................................................
EG iterations: 124
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.019sec

checking: [[AX [EF [AX [AG [[[p86<=1 & 1<=p86] & [[p105<=1 & 1<=p105] & [p116<=1 & 1<=p116]]]]]]] | AG [AX [[E [[p64<=1 & 1<=p64] U [p61<=1 & 1<=p61]] & [p33<=1 & 1<=p33]]]]] | [AG [[p112<=1 & 1<=p112]] | [EG [AX [AG [[p63<=1 & 1<=p63]]]] & [E [[AX [[p116<=1 & 1<=p116]] & [EF [[p66<=1 & 1<=p66]] & AF [[p34<=1 & 1<=p34]]]] U AX [EX [[p24<=1 & 1<=p24]]]] & [[EG [[[p71<=1 & 1<=p71] & [p113<=1 & 1<=p113]]] | AX [AX [[[p71<=1 & 1<=p71] & [p113<=1 & 1<=p113]]]]] | [A [[[p78<=1 & 1<=p78] & [p80<=1 & 1<=p80]] U [p35<=1 & 1<=p35]] | [AG [[p18<=1 & 1<=p18]] | ~ [E [A [[p104<=1 & 1<=p104] U [p76<=1 & 1<=p76]] U [[p15<=1 & 1<=p15] & [p41<=1 & 1<=p41]]]]]]]]]]]
normalized: [[[[[[[~ [E [[~ [EG [~ [[p76<=1 & 1<=p76]]]] & ~ [E [~ [[p76<=1 & 1<=p76]] U [~ [[p104<=1 & 1<=p104]] & ~ [[p76<=1 & 1<=p76]]]]]] U [[p41<=1 & 1<=p41] & [p15<=1 & 1<=p15]]]] | ~ [E [true U ~ [[p18<=1 & 1<=p18]]]]] | [~ [EG [~ [[p35<=1 & 1<=p35]]]] & ~ [E [~ [[p35<=1 & 1<=p35]] U [~ [[[p80<=1 & 1<=p80] & [p78<=1 & 1<=p78]]] & ~ [[p35<=1 & 1<=p35]]]]]]] | [~ [EX [EX [~ [[[p113<=1 & 1<=p113] & [p71<=1 & 1<=p71]]]]]] | EG [[[p113<=1 & 1<=p113] & [p71<=1 & 1<=p71]]]]] & E [[[~ [EG [~ [[p34<=1 & 1<=p34]]]] & E [true U [p66<=1 & 1<=p66]]] & ~ [EX [~ [[p116<=1 & 1<=p116]]]]] U ~ [EX [~ [EX [[p24<=1 & 1<=p24]]]]]]] & EG [~ [EX [E [true U ~ [[p63<=1 & 1<=p63]]]]]]] | ~ [E [true U ~ [[p112<=1 & 1<=p112]]]]] | [~ [E [true U EX [~ [[[p33<=1 & 1<=p33] & E [[p64<=1 & 1<=p64] U [p61<=1 & 1<=p61]]]]]]] | ~ [EX [~ [E [true U ~ [EX [E [true U ~ [[[[p116<=1 & 1<=p116] & [p105<=1 & 1<=p105]] & [p86<=1 & 1<=p86]]]]]]]]]]]]

abstracting: (1<=p86)
states: 86,097,689,206 (10)
abstracting: (p86<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p105)
states: 32,179,020,408 (10)
abstracting: (p105<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p116)
states: 28,142,550,630 (10)
abstracting: (p116<=1)
states: 258,292,953,085 (11)
..abstracting: (1<=p61)
states: 28,329,447,996 (10)
abstracting: (p61<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p64)
states: 567
abstracting: (p64<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p33)
states: 31,594,445,580 (10)
abstracting: (p33<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p112)
states: 27,331,543,980 (10)
abstracting: (p112<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p63)
states: 567
abstracting: (p63<=1)
states: 258,292,953,085 (11)
..
EG iterations: 1
abstracting: (1<=p24)
states: 83,546,609,130 (10)
abstracting: (p24<=1)
states: 258,292,953,085 (11)
..abstracting: (1<=p116)
states: 28,142,550,630 (10)
abstracting: (p116<=1)
states: 258,292,953,085 (11)
.abstracting: (1<=p66)
states: 9,072 (3)
abstracting: (p66<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p34)
states: 32,513,110,866 (10)
abstracting: (p34<=1)
states: 258,292,953,085 (11)
.
EG iterations: 1
abstracting: (1<=p71)
states: 84,087,723,384 (10)
abstracting: (p71<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p113)
states: 31,258,026,678 (10)
abstracting: (p113<=1)
states: 258,292,953,085 (11)
....................................
before gc: list nodes free: 3036895

after gc: idd nodes used:3078990, unused:60921010; list nodes free:283778321
...............................................................................................................
EG iterations: 147
abstracting: (1<=p71)
states: 84,087,723,384 (10)
abstracting: (p71<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p113)
states: 31,258,026,678 (10)
abstracting: (p113<=1)
states: 258,292,953,085 (11)

before gc: list nodes free: 1031617

after gc: idd nodes used:2534925, unused:61465075; list nodes free:286228688
..abstracting: (1<=p35)
states: 30,482,904,834 (10)
abstracting: (p35<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p78)
states: 71,809,801,662 (10)
abstracting: (p78<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p80)
states: 72,527,382,444 (10)
abstracting: (p80<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p35)
states: 30,482,904,834 (10)
abstracting: (p35<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p35)
states: 30,482,904,834 (10)
abstracting: (p35<=1)
states: 258,292,953,085 (11)
.....................................................................................................................................................
EG iterations: 149
abstracting: (1<=p18)
states: 39,510,743,802 (10)
abstracting: (p18<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p15)
states: 90,561,627,666 (10)
abstracting: (p15<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p41)
states: 83,865,617,008 (10)
abstracting: (p41<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p76)
states: 38,871,030,462 (10)
abstracting: (p76<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p104)
states: 29,936,608,668 (10)
abstracting: (p104<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p76)
states: 38,871,030,462 (10)
abstracting: (p76<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p76)
states: 38,871,030,462 (10)
abstracting: (p76<=1)
states: 258,292,953,085 (11)
.................................
before gc: list nodes free: 3139531

after gc: idd nodes used:5122948, unused:58877052; list nodes free:274369581
...............MC time: 7m42.010sec

checking: EX [[[EG [[[p69<=0 & 0<=p69] & [p18<=0 & 0<=p18]]] & E [A [[[p21<=1 & 1<=p21] & [p49<=1 & 1<=p49]] U [p6<=1 & 1<=p6]] U [p63<=1 & 1<=p63]]] & [[p93<=0 & 0<=p93] & [[[[p89<=1 & 1<=p89] | [[p86<=0 & 0<=p86] | [p108<=0 & 0<=p108]]] | [[[p116<=0 & 0<=p116] | [AG [[[p83<=1 & 1<=p83] & [[p91<=1 & 1<=p91] & [p119<=1 & 1<=p119]]]] & [[p56<=1 & 1<=p56] | [[p75<=1 & 1<=p75] | [[p2<=1 & 1<=p2] & [p44<=1 & 1<=p44]]]]]] | [[[p2<=1 & 1<=p2] & [p44<=1 & 1<=p44]] | [[p66<=1 & 1<=p66] & [[p111<=1 & 1<=p111] & [[p28<=0 & 0<=p28] | [[p46<=0 & 0<=p46] | [p60<=0 & 0<=p60]]]]]]]] & [[p20<=0 & 0<=p20] | [p22<=0 & 0<=p22]]]]]]
normalized: EX [[[EG [[[p69<=0 & 0<=p69] & [p18<=0 & 0<=p18]]] & E [[~ [EG [~ [[p6<=1 & 1<=p6]]]] & ~ [E [~ [[p6<=1 & 1<=p6]] U [~ [[[p49<=1 & 1<=p49] & [p21<=1 & 1<=p21]]] & ~ [[p6<=1 & 1<=p6]]]]]] U [p63<=1 & 1<=p63]]] & [[[[p22<=0 & 0<=p22] | [p20<=0 & 0<=p20]] & [[[[[[[[p60<=0 & 0<=p60] | [p46<=0 & 0<=p46]] | [p28<=0 & 0<=p28]] & [p111<=1 & 1<=p111]] & [p66<=1 & 1<=p66]] | [[p44<=1 & 1<=p44] & [p2<=1 & 1<=p2]]] | [[[[[[p44<=1 & 1<=p44] & [p2<=1 & 1<=p2]] | [p75<=1 & 1<=p75]] | [p56<=1 & 1<=p56]] & ~ [E [true U ~ [[[[p119<=1 & 1<=p119] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]]]]]] | [p116<=0 & 0<=p116]]] | [[[p108<=0 & 0<=p108] | [p86<=0 & 0<=p86]] | [p89<=1 & 1<=p89]]]] & [p93<=0 & 0<=p93]]]]

abstracting: (0<=p93)
states: 258,292,953,085 (11)
abstracting: (p93<=0)
states: 228,672,829,858 (11)
abstracting: (1<=p89)
states: 33,086,932,005 (10)
abstracting: (p89<=1)
states: 258,292,953,085 (11)
abstracting: (0<=p86)
states: 258,292,953,085 (11)
abstracting: (p86<=0)
states: 172,195,263,879 (11)
abstracting: (0<=p108)
states: 258,292,953,085 (11)
abstracting: (p108<=0)
states: 225,128,671,453 (11)
abstracting: (0<=p116)
states: 258,292,953,085 (11)
abstracting: (p116<=0)
states: 230,150,402,455 (11)
abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p119)
states: 27,331,678,359 (10)
abstracting: (p119<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p56)
states: 25,086,996,510 (10)
abstracting: (p56<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p75)
states: 35,395,122,576 (10)
abstracting: (p75<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p2)
states: 83,682,550,786 (10)
abstracting: (p2<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p44)
states: 36,379,535,976 (10)
abstracting: (p44<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p2)
states: 83,682,550,786 (10)
abstracting: (p2<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p44)
states: 36,379,535,976 (10)
abstracting: (p44<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p66)
states: 9,072 (3)
abstracting: (p66<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p111)
states: 134,379 (5)
abstracting: (p111<=1)
states: 258,292,953,085 (11)
abstracting: (0<=p28)
states: 258,292,953,085 (11)
abstracting: (p28<=0)
states: 171,438,708,199 (11)
abstracting: (0<=p46)
states: 258,292,953,085 (11)
abstracting: (p46<=0)
states: 226,681,288,375 (11)
abstracting: (0<=p60)
states: 258,292,953,085 (11)
abstracting: (p60<=0)
states: 229,963,505,089 (11)
abstracting: (0<=p20)
states: 258,292,953,085 (11)
abstracting: (p20<=0)
states: 185,782,645,489 (11)
abstracting: (0<=p22)
states: 258,292,953,085 (11)
abstracting: (p22<=0)
states: 187,441,715,173 (11)
abstracting: (1<=p63)
states: 567
abstracting: (p63<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p6)
states: 3,974 (3)
abstracting: (p6<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p21)
states: 76,337,759,508 (10)
abstracting: (p21<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p49)
states: 31,132,922,806 (10)
abstracting: (p49<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p6)
states: 3,974 (3)
abstracting: (p6<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p6)
states: 3,974 (3)
abstracting: (p6<=1)
states: 258,292,953,085 (11)
.............................................
EG iterations: 45
abstracting: (0<=p18)
states: 258,292,953,085 (11)
abstracting: (p18<=0)
states: 218,782,209,283 (11)
abstracting: (0<=p69)
states: 258,292,953,085 (11)
abstracting: (p69<=0)
states: 258,283,389,901 (11)
..........................................................
before gc: list nodes free: 1539796

after gc: idd nodes used:4025929, unused:59974071; list nodes free:279440442
..........................................
before gc: list nodes free: 769189

after gc: idd nodes used:4483845, unused:59516155; list nodes free:277178387
................MC time: 5m46.018sec

checking: EX [EG [[[~ [A [[p75<=1 & 1<=p75] U [[p83<=1 & 1<=p83] & [[p91<=1 & 1<=p91] & [p118<=1 & 1<=p118]]]]] | [~ [A [[p109<=1 & 1<=p109] U [p89<=1 & 1<=p89]]] | EG [[p95<=0 & 0<=p95]]]] & [AX [[p89<=0 & 0<=p89]] | [p67<=1 & 1<=p67]]]]]
normalized: EX [EG [[[[p67<=1 & 1<=p67] | ~ [EX [~ [[p89<=0 & 0<=p89]]]]] & [[EG [[p95<=0 & 0<=p95]] | ~ [[~ [EG [~ [[p89<=1 & 1<=p89]]]] & ~ [E [~ [[p89<=1 & 1<=p89]] U [~ [[p109<=1 & 1<=p109]] & ~ [[p89<=1 & 1<=p89]]]]]]]] | ~ [[~ [EG [~ [[[[p118<=1 & 1<=p118] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]]]]] & ~ [E [~ [[[[p118<=1 & 1<=p118] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]]] U [~ [[p75<=1 & 1<=p75]] & ~ [[[[p118<=1 & 1<=p118] & [p91<=1 & 1<=p91]] & [p83<=1 & 1<=p83]]]]]]]]]]]]

abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p118)
states: 27,482,944,746 (10)
abstracting: (p118<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p75)
states: 35,395,122,576 (10)
abstracting: (p75<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p118)
states: 27,482,944,746 (10)
abstracting: (p118<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p83)
states: 88,192,559,538 (10)
abstracting: (p83<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p91)
states: 32,111,225,073 (10)
abstracting: (p91<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p118)
states: 27,482,944,746 (10)
abstracting: (p118<=1)
states: 258,292,953,085 (11)
.
EG iterations: 1
abstracting: (1<=p89)
states: 33,086,932,005 (10)
abstracting: (p89<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p109)
states: 33,164,281,632 (10)
abstracting: (p109<=1)
states: 258,292,953,085 (11)
abstracting: (1<=p89)
states: 33,086,932,005 (10)
abstracting: (p89<=1)
states: 258,292,953,085 (11)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5974808 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098976 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

167346 167781
iterations count:216760 (1806), effective:22401 (186)

initing FirstDep: 0m 0.000sec


iterations count:6900 (57), effective:660 (5)

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

iterations count:4955 (41), effective:441 (3)

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

iterations count:6924 (57), effective:699 (5)

iterations count:861 (7), effective:77 (0)

iterations count:12252 (102), effective:1230 (10)

iterations count:11926 (99), effective:1111 (9)

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

iterations count:2109 (17), effective:178 (1)

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

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

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

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

net_ddint.h:600: Timeout: after 343 sec


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

iterations count:1779 (14), effective:166 (1)

iterations count:11844 (98), effective:1187 (9)

iterations count:13961 (116), effective:1401 (11)

iterations count:15632 (130), effective:1569 (13)

iterations count:11497 (95), effective:1150 (9)

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

iterations count:7309 (60), effective:716 (5)

iterations count:34868 (290), effective:3486 (29)

iterations count:2834 (23), effective:238 (1)

iterations count:6595 (54), effective:623 (5)

iterations count:11839 (98), effective:1191 (9)

iterations count:188 (1), effective:12 (0)

net_ddint.h:600: Timeout: after 396 sec


iterations count:4800 (40), effective:438 (3)

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

iterations count:8454 (70), effective:832 (6)

iterations count:11072 (92), effective:1127 (9)

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

iterations count:1256 (10), effective:82 (0)

iterations count:8815 (73), effective:863 (7)

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

iterations count:11564 (96), effective:1161 (9)

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

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

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

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

iterations count:32385 (269), effective:3245 (27)

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

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

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

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

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

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

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

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

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

net_ddint.h:600: Timeout: after 461 sec


iterations count:1402 (11), effective:137 (1)

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

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

net_ddint.h:600: Timeout: after 345 sec


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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-002B"
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 ShieldIIPs-PT-002B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717400026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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