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.r106-tall-167814482700442.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DES-PT-30a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 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 DES-PT-30a-CTLFireability-00
FORMULA_NAME DES-PT-30a-CTLFireability-01
FORMULA_NAME DES-PT-30a-CTLFireability-02
FORMULA_NAME DES-PT-30a-CTLFireability-03
FORMULA_NAME DES-PT-30a-CTLFireability-04
FORMULA_NAME DES-PT-30a-CTLFireability-05
FORMULA_NAME DES-PT-30a-CTLFireability-06
FORMULA_NAME DES-PT-30a-CTLFireability-07
FORMULA_NAME DES-PT-30a-CTLFireability-08
FORMULA_NAME DES-PT-30a-CTLFireability-09
FORMULA_NAME DES-PT-30a-CTLFireability-10
FORMULA_NAME DES-PT-30a-CTLFireability-11
FORMULA_NAME DES-PT-30a-CTLFireability-12
FORMULA_NAME DES-PT-30a-CTLFireability-13
FORMULA_NAME DES-PT-30a-CTLFireability-14
FORMULA_NAME DES-PT-30a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678393263150

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=DES-PT-30a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 20:21:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 20:21:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:21:04] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-09 20:21:04] [INFO ] Transformed 234 places.
[2023-03-09 20:21:04] [INFO ] Transformed 191 transitions.
[2023-03-09 20:21:04] [INFO ] Found NUPN structural information;
[2023-03-09 20:21:04] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 135 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 233 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 176
Applied a total of 2 rules in 131 ms. Remains 233 /234 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 233 cols
[2023-03-09 20:21:05] [INFO ] Computed 59 place invariants in 23 ms
[2023-03-09 20:21:05] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-09 20:21:05] [INFO ] Invariant cache hit.
[2023-03-09 20:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:21:05] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2023-03-09 20:21:05] [INFO ] Invariant cache hit.
[2023-03-09 20:21:05] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/234 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 878 ms. Remains : 233/234 places, 176/177 transitions.
Support contains 135 out of 233 places after structural reductions.
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 46 ms
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 49 ms
[2023-03-09 20:21:06] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 81) seen :37
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 44) seen :0
Running SMT prover for 44 properties.
[2023-03-09 20:21:06] [INFO ] Invariant cache hit.
[2023-03-09 20:21:07] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:21:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 20:21:07] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:44
[2023-03-09 20:21:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 20:21:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-09 20:21:11] [INFO ] After 3798ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :43
[2023-03-09 20:21:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:21:16] [INFO ] After 4546ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :43
[2023-03-09 20:21:16] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 9 ms to minimize.
[2023-03-09 20:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-09 20:21:19] [INFO ] After 7425ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :43
Attempting to minimize the solution found.
Minimization took 2623 ms.
[2023-03-09 20:21:21] [INFO ] After 14492ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :43
Fused 44 Parikh solutions to 43 different solutions.
Parikh walk visited 36 properties in 1690 ms.
Support contains 20 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 174
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 233 transition count 174
Applied a total of 6 rules in 51 ms. Remains 233 /233 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 233/233 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 153 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 745869 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :{}
Probabilistic random walk after 745869 steps, saw 107120 distinct states, run finished after 3002 ms. (steps per millisecond=248 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 174 rows 233 cols
[2023-03-09 20:21:27] [INFO ] Computed 61 place invariants in 7 ms
[2023-03-09 20:21:27] [INFO ] [Real]Absence check using 36 positive place invariants in 25 ms returned sat
[2023-03-09 20:21:27] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 20:21:27] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 20:21:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 20:21:27] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 59 ms returned sat
[2023-03-09 20:21:27] [INFO ] After 374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 20:21:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:21:28] [INFO ] After 250ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 20:21:28] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 27 ms to minimize.
[2023-03-09 20:21:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-09 20:21:28] [INFO ] After 773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-03-09 20:21:28] [INFO ] After 1647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 1 properties in 247 ms.
Support contains 19 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 14 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 233/233 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-09 20:21:29] [INFO ] Invariant cache hit.
[2023-03-09 20:21:29] [INFO ] Implicit Places using invariants in 198 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 201 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/233 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 219 ms. Remains : 232/233 places, 174/174 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 827805 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :{}
Probabilistic random walk after 827805 steps, saw 117948 distinct states, run finished after 3002 ms. (steps per millisecond=275 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-09 20:21:32] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-09 20:21:32] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:21:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-09 20:21:32] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 20:21:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-09 20:21:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-09 20:21:33] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 20:21:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:21:33] [INFO ] After 177ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 20:21:33] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-09 20:21:34] [INFO ] After 1200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 222 ms.
Support contains 17 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-09 20:21:34] [INFO ] Invariant cache hit.
[2023-03-09 20:21:34] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-09 20:21:34] [INFO ] Invariant cache hit.
[2023-03-09 20:21:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:21:34] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-09 20:21:34] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 20:21:34] [INFO ] Invariant cache hit.
[2023-03-09 20:21:34] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 232/232 places, 174/174 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 174
Applied a total of 1 rules in 16 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-09 20:21:34] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 20:21:35] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:21:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-09 20:21:35] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 20:21:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:21:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 96 ms returned sat
[2023-03-09 20:21:35] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 20:21:35] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-09 20:21:35] [INFO ] After 752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-09 20:21:35] [INFO ] Flatten gal took : 25 ms
[2023-03-09 20:21:35] [INFO ] Flatten gal took : 15 ms
[2023-03-09 20:21:35] [INFO ] Input system was already deterministic with 176 transitions.
Computed a total of 136 stabilizing places and 130 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:21:35] [INFO ] Flatten gal took : 12 ms
[2023-03-09 20:21:35] [INFO ] Flatten gal took : 13 ms
[2023-03-09 20:21:36] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:21:36] [INFO ] Flatten gal took : 11 ms
[2023-03-09 20:21:36] [INFO ] Flatten gal took : 11 ms
[2023-03-09 20:21:36] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:21:36] [INFO ] Flatten gal took : 10 ms
[2023-03-09 20:21:36] [INFO ] Flatten gal took : 10 ms
[2023-03-09 20:21:36] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:21:36] [INFO ] Flatten gal took : 11 ms
[2023-03-09 20:21:36] [INFO ] Flatten gal took : 10 ms
[2023-03-09 20:21:36] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1791617 steps, run timeout after 3001 ms. (steps per millisecond=597 ) properties seen :{}
Probabilistic random walk after 1791617 steps, saw 243164 distinct states, run finished after 3001 ms. (steps per millisecond=597 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 233 cols
[2023-03-09 20:21:39] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-09 20:21:39] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:21:39] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 20:21:39] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:21:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 51 ms returned sat
[2023-03-09 20:21:39] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:21:39] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:39] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 20:21:39] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 268 ms.
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 233 transition count 174
Applied a total of 8 rules in 18 ms. Remains 233 /233 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 233/233 places, 174/176 transitions.
Incomplete random walk after 1000000 steps, including 13420 resets, run finished after 2127 ms. (steps per millisecond=470 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2308 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5571111 steps, run timeout after 9001 ms. (steps per millisecond=618 ) properties seen :{}
Probabilistic random walk after 5571111 steps, saw 722876 distinct states, run finished after 9001 ms. (steps per millisecond=618 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 233 cols
[2023-03-09 20:21:52] [INFO ] Computed 61 place invariants in 8 ms
[2023-03-09 20:21:52] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:21:52] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 20:21:52] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:21:52] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 92 ms returned sat
[2023-03-09 20:21:52] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 20:21:52] [INFO ] After 40ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:52] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 20:21:52] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 280 ms.
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 233/233 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-09 20:21:52] [INFO ] Invariant cache hit.
[2023-03-09 20:21:53] [INFO ] Implicit Places using invariants in 150 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/233 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 179 ms. Remains : 232/233 places, 174/174 transitions.
Incomplete random walk after 1000000 steps, including 13448 resets, run finished after 2111 ms. (steps per millisecond=473 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2320 resets, run finished after 942 ms. (steps per millisecond=1061 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5611461 steps, run timeout after 9001 ms. (steps per millisecond=623 ) properties seen :{}
Probabilistic random walk after 5611461 steps, saw 727376 distinct states, run finished after 9001 ms. (steps per millisecond=623 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-09 20:22:05] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 20:22:05] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 20:22:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 20:22:05] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:22:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:22:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 106 ms returned sat
[2023-03-09 20:22:05] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:22:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:22:05] [INFO ] After 31ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:22:05] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-09 20:22:05] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 96974 steps, including 610 resets, run visited all 1 properties in 214 ms. (steps per millisecond=453 )
FORMULA DES-PT-30a-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 214 ms.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 10 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 10 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 9 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 7 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 21 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 24 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 9 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 20 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 23 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 7 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 23 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 7 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 23 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 23 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 7 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 23 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 7 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 233/233 places, 176/176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 23 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 7 ms
[2023-03-09 20:22:06] [INFO ] Input system was already deterministic with 176 transitions.
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 24 ms
[2023-03-09 20:22:06] [INFO ] Flatten gal took : 25 ms
[2023-03-09 20:22:06] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-09 20:22:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 233 places, 176 transitions and 858 arcs took 2 ms.
Total runtime 62299 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: 233 NrTr: 176 NrArc: 858)

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

net check time: 0m 0.000sec

init dd package: 0m 2.714sec


RS generation: 0m41.855sec


-> reachability set: #nodes 788164 (7.9e+05) #states 16,369,951,883,674 (13)



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

checking: EG [[[p132<=0 & 0<=p132] | [[p142<=0 & 0<=p142] | [p144<=0 & 0<=p144]]]]
normalized: EG [[[p132<=0 & 0<=p132] | [[p142<=0 & 0<=p142] | [p144<=0 & 0<=p144]]]]

abstracting: (0<=p144)
states: 16,369,951,883,674 (13)
abstracting: (p144<=0)
states: 12,385,786,427,201 (13)
abstracting: (0<=p142)
states: 16,369,951,883,674 (13)
abstracting: (p142<=0)
states: 12,484,316,892,313 (13)
abstracting: (0<=p132)
states: 16,369,951,883,674 (13)
abstracting: (p132<=0)
states: 8,039,237,777,899 (12)
........
before gc: list nodes free: 1132486

after gc: idd nodes used:4375893, unused:59624107; list nodes free:267558496
.......
before gc: list nodes free: 1429929

after gc: idd nodes used:8512264, unused:55487736; list nodes free:250749796
......
before gc: list nodes free: 71456

after gc: idd nodes used:6395300, unused:57604700; list nodes free:260417973
MC time: 3m59.239sec

checking: AX [EF [EG [E [AX [[[p125<=1 & 1<=p125] & [p147<=1 & 1<=p147]]] U [[p125<=1 & 1<=p125] | [[p25<=1 & 1<=p25] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]]]]]]]
normalized: ~ [EX [~ [E [true U EG [E [~ [EX [~ [[[p147<=1 & 1<=p147] & [p125<=1 & 1<=p125]]]]] U [[[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p25<=1 & 1<=p25]] | [p125<=1 & 1<=p125]]]]]]]]

abstracting: (1<=p125)
states: 5,450,074,885,488 (12)
abstracting: (p125<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p25)
states: 598,699,214,524 (11)
abstracting: (p25<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p152)
states: 5,386,321,603,763 (12)
abstracting: (p152<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p154)
states: 10,976,557,739,681 (13)
abstracting: (p154<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p125)
states: 5,450,074,885,488 (12)
abstracting: (p125<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p147)
states: 8,210,253,844,158 (12)
abstracting: (p147<=1)
states: 16,369,951,883,674 (13)
.....
before gc: list nodes free: 1495383

after gc: idd nodes used:4394628, unused:59605372; list nodes free:269586730
....
before gc: list nodes free: 1859530

after gc: idd nodes used:6418809, unused:57581191; list nodes free:260453204
.MC time: 3m42.031sec

checking: A [[[[p76<=1 & 1<=p76] & [p149<=1 & 1<=p149]] | [[p74<=1 & 1<=p74] & [p149<=1 & 1<=p149]]] U EF [[[p1<=1 & 1<=p1] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]]]]
normalized: [~ [EG [~ [E [true U [[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [E [true U [[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p1<=1 & 1<=p1]]]] U [~ [[[[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]] | [[p149<=1 & 1<=p149] & [p76<=1 & 1<=p76]]]] & ~ [E [true U [[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p1<=1 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 83,477,024,082 (10)
abstracting: (p1<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p152)
states: 5,386,321,603,763 (12)
abstracting: (p152<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p154)
states: 10,976,557,739,681 (13)
abstracting: (p154<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p76)
states: 564,617,457,142 (11)
abstracting: (p76<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p149)
states: 8,326,130,306,122 (12)
abstracting: (p149<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p74)
states: 564,617,457,142 (11)
abstracting: (p74<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p149)
states: 8,326,130,306,122 (12)
abstracting: (p149<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p1)
states: 83,477,024,082 (10)
abstracting: (p1<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p152)
states: 5,386,321,603,763 (12)
abstracting: (p152<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p154)
states: 10,976,557,739,681 (13)
abstracting: (p154<=1)
states: 16,369,951,883,674 (13)

before gc: list nodes free: 31438

after gc: idd nodes used:3007629, unused:60992371; list nodes free:275820330
abstracting: (1<=p1)
states: 83,477,024,082 (10)
abstracting: (p1<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p152)
states: 5,386,321,603,763 (12)
abstracting: (p152<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p154)
states: 10,976,557,739,681 (13)
abstracting: (p154<=1)
states: 16,369,951,883,674 (13)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DES-PT-30a-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m11.709sec

checking: EG [E [[[p51<=1 & 1<=p51] & [p228<=1 & 1<=p228]] U E [EF [[[[p105<=1 & 1<=p105] & [p124<=1 & 1<=p124]] | [[p113<=1 & 1<=p113] & [p124<=1 & 1<=p124]]]] U [EG [[[p81<=1 & 1<=p81] & [p149<=1 & 1<=p149]]] & EX [[[p17<=1 & 1<=p17] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]]]]]]]
normalized: EG [E [[[p228<=1 & 1<=p228] & [p51<=1 & 1<=p51]] U E [E [true U [[[p124<=1 & 1<=p124] & [p113<=1 & 1<=p113]] | [[p124<=1 & 1<=p124] & [p105<=1 & 1<=p105]]]] U [EX [[[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p17<=1 & 1<=p17]]] & EG [[[p149<=1 & 1<=p149] & [p81<=1 & 1<=p81]]]]]]]

abstracting: (1<=p81)
states: 564,617,457,142 (11)
abstracting: (p81<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p149)
states: 8,326,130,306,122 (12)
abstracting: (p149<=1)
states: 16,369,951,883,674 (13)
............
before gc: list nodes free: 6762101

after gc: idd nodes used:6397516, unused:57602484; list nodes free:260522181
.....
before gc: list nodes free: 2300333

after gc: idd nodes used:10679907, unused:53320093; list nodes free:241054269
.MC time: 3m36.911sec

checking: AF [[EG [[[p51<=0 & 0<=p51] | [p228<=0 & 0<=p228]]] & [[[[[p155<=0 & 0<=p155] | [p160<=0 & 0<=p160]] | [[p162<=0 & 0<=p162] | [p164<=0 & 0<=p164]]] | [[[p166<=0 & 0<=p166] | [p168<=0 & 0<=p168]] | [[p170<=0 & 0<=p170] | [[p172<=0 & 0<=p172] | [p174<=0 & 0<=p174]]]]] & [[p218<=0 & 0<=p218] | [p227<=0 & 0<=p227]]]]]
normalized: ~ [EG [~ [[[[[[[p170<=0 & 0<=p170] | [[p174<=0 & 0<=p174] | [p172<=0 & 0<=p172]]] | [[p168<=0 & 0<=p168] | [p166<=0 & 0<=p166]]] | [[[p164<=0 & 0<=p164] | [p162<=0 & 0<=p162]] | [[p160<=0 & 0<=p160] | [p155<=0 & 0<=p155]]]] & [[p227<=0 & 0<=p227] | [p218<=0 & 0<=p218]]] & EG [[[p228<=0 & 0<=p228] | [p51<=0 & 0<=p51]]]]]]]

abstracting: (0<=p51)
states: 16,369,951,883,674 (13)
abstracting: (p51<=0)
states: 15,771,242,140,578 (13)
abstracting: (0<=p228)
states: 16,369,951,883,674 (13)
abstracting: (p228<=0)
states: 13,667,654,893,557 (13)
...........
before gc: list nodes free: 1988108

after gc: idd nodes used:5928779, unused:58071221; list nodes free:264717045
.....
before gc: list nodes free: 663823

after gc: idd nodes used:6254203, unused:57745797; list nodes free:263189974
MC time: 3m23.801sec

checking: AF [[A [[~ [[[[p43<=1 & 1<=p43] & [p228<=1 & 1<=p228]] | EG [[[p93<=1 & 1<=p93] & [p124<=1 & 1<=p124]]]]] & EF [[[p17<=1 & 1<=p17] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]]]] U E [~ [[[p35<=1 & 1<=p35] & [p228<=1 & 1<=p228]]] U [[p100<=1 & 1<=p100] & [p124<=1 & 1<=p124]]]] & [[p52<=1 & 1<=p52] & [p228<=1 & 1<=p228]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [E [~ [[[p228<=1 & 1<=p228] & [p35<=1 & 1<=p35]]] U [[p124<=1 & 1<=p124] & [p100<=1 & 1<=p100]]]]]] & ~ [E [~ [E [~ [[[p228<=1 & 1<=p228] & [p35<=1 & 1<=p35]]] U [[p124<=1 & 1<=p124] & [p100<=1 & 1<=p100]]]] U [~ [E [~ [[[p228<=1 & 1<=p228] & [p35<=1 & 1<=p35]]] U [[p124<=1 & 1<=p124] & [p100<=1 & 1<=p100]]]] & ~ [[E [true U [[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p17<=1 & 1<=p17]]] & ~ [[EG [[[p124<=1 & 1<=p124] & [p93<=1 & 1<=p93]]] | [[p228<=1 & 1<=p228] & [p43<=1 & 1<=p43]]]]]]]]]] & [[p228<=1 & 1<=p228] & [p52<=1 & 1<=p52]]]]]]

abstracting: (1<=p52)
states: 598,709,743,096 (11)
abstracting: (p52<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p43)
states: 598,709,743,096 (11)
abstracting: (p43<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p93)
states: 553,051,126,860 (11)
abstracting: (p93<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p124)
states: 5,450,074,885,492 (12)
abstracting: (p124<=1)
states: 16,369,951,883,674 (13)
...............
before gc: list nodes free: 2894347

after gc: idd nodes used:7414205, unused:56585795; list nodes free:257948036
...MC time: 3m 6.151sec

checking: EG [[[[p75<=0 & 0<=p75] | [p149<=0 & 0<=p149]] & [EF [[[p59<=0 & 0<=p59] | [p228<=0 & 0<=p228]]] | [[p0<=0 & 0<=p0] & [[[p117<=1 & 1<=p117] & [p124<=1 & 1<=p124]] | [[[p85<=1 & 1<=p85] & [p149<=1 & 1<=p149]] | [[[p4<=1 & 1<=p4] & [p152<=1 & 1<=p152]] & [[p154<=1 & 1<=p154] & [[p222<=1 & 1<=p222] & [p227<=1 & 1<=p227]]]]]]]]]]
normalized: EG [[[[[[[[[[p227<=1 & 1<=p227] & [p222<=1 & 1<=p222]] & [p154<=1 & 1<=p154]] & [[p152<=1 & 1<=p152] & [p4<=1 & 1<=p4]]] | [[p149<=1 & 1<=p149] & [p85<=1 & 1<=p85]]] | [[p124<=1 & 1<=p124] & [p117<=1 & 1<=p117]]] & [p0<=0 & 0<=p0]] | E [true U [[p228<=0 & 0<=p228] | [p59<=0 & 0<=p59]]]] & [[p149<=0 & 0<=p149] | [p75<=0 & 0<=p75]]]]

abstracting: (0<=p75)
states: 16,369,951,883,674 (13)
abstracting: (p75<=0)
states: 15,805,334,426,532 (13)
abstracting: (0<=p149)
states: 16,369,951,883,674 (13)
abstracting: (p149<=0)
states: 8,043,821,577,552 (12)
abstracting: (0<=p59)
states: 16,369,951,883,674 (13)
abstracting: (p59<=0)
states: 16,361,295,481,034 (13)
abstracting: (0<=p228)
states: 16,369,951,883,674 (13)
abstracting: (p228<=0)
states: 13,667,654,893,557 (13)
abstracting: (0<=p0)
states: 16,369,951,883,674 (13)
abstracting: (p0<=0)
states: 16,369,951,883,673 (13)
abstracting: (1<=p117)
states: 578,085,740,627 (11)
abstracting: (p117<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p124)
states: 5,450,074,885,492 (12)
abstracting: (p124<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p85)
states: 564,617,457,142 (11)
abstracting: (p85<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p149)
states: 8,326,130,306,122 (12)
abstracting: (p149<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p4)
states: 598,709,533,164 (11)
abstracting: (p4<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p152)
states: 5,386,321,603,763 (12)
abstracting: (p152<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p154)
states: 10,976,557,739,681 (13)
abstracting: (p154<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p222)
states: 4,244,965,313,893 (12)
abstracting: (p222<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p227)
states: 1,942,477,536,867 (12)
abstracting: (p227<=1)
states: 16,369,951,883,674 (13)

before gc: list nodes free: 764673

after gc: idd nodes used:4216820, unused:59783180; list nodes free:272394721
.
EG iterations: 1
-> the formula is TRUE

FORMULA DES-PT-30a-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m59.485sec

checking: AG [AF [[[AG [[[p222<=1 & 1<=p222] & [p227<=1 & 1<=p227]]] | AX [[[p119<=1 & 1<=p119] & [p124<=1 & 1<=p124]]]] | [[[p141<=1 & 1<=p141] & [[p146<=1 & 1<=p146] & [p148<=1 & 1<=p148]]] | [EF [[[p33<=1 & 1<=p33] & [p228<=1 & 1<=p228]]] & [[AF [[[p31<=1 & 1<=p31] & [p228<=1 & 1<=p228]]] | [p156<=0 & 0<=p156]] | [[p158<=0 & 0<=p158] | [p215<=0 & 0<=p215]]]]]]]]
normalized: ~ [E [true U EG [~ [[[[[[[p215<=0 & 0<=p215] | [p158<=0 & 0<=p158]] | [[p156<=0 & 0<=p156] | ~ [EG [~ [[[p228<=1 & 1<=p228] & [p31<=1 & 1<=p31]]]]]]] & E [true U [[p228<=1 & 1<=p228] & [p33<=1 & 1<=p33]]]] | [[[p148<=1 & 1<=p148] & [p146<=1 & 1<=p146]] & [p141<=1 & 1<=p141]]] | [~ [EX [~ [[[p124<=1 & 1<=p124] & [p119<=1 & 1<=p119]]]]] | ~ [E [true U ~ [[[p227<=1 & 1<=p227] & [p222<=1 & 1<=p222]]]]]]]]]]]

abstracting: (1<=p222)
states: 4,244,965,313,893 (12)
abstracting: (p222<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p227)
states: 1,942,477,536,867 (12)
abstracting: (p227<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p119)
states: 248,618,263,763 (11)
abstracting: (p119<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p124)
states: 5,450,074,885,492 (12)
abstracting: (p124<=1)
states: 16,369,951,883,674 (13)
.abstracting: (1<=p141)
states: 4,095,034,499,784 (12)
abstracting: (p141<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p146)
states: 8,743,727,782,022 (12)
abstracting: (p146<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p148)
states: 8,159,698,039,515 (12)
abstracting: (p148<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p33)
states: 598,709,743,096 (11)
abstracting: (p33<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)

before gc: list nodes free: 4164921

after gc: idd nodes used:5757802, unused:58242198; list nodes free:265529104
MC time: 3m 6.975sec

checking: AG [[AF [[[EX [E [[[1<=p28 & p28<=1] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]] U [[p23<=1 & 1<=p23] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]]]] | A [[[p121<=1 & 1<=p121] & [p134<=1 & 1<=p134]] U [[p54<=1 & 1<=p54] & [p228<=1 & 1<=p228]]]] | [[[p133<=1 & 1<=p133] & [p207<=1 & 1<=p207]] | [[p61<=1 & 1<=p61] & [p149<=1 & 1<=p149]]]]] | [[p159<=1 & 1<=p159] & [p176<=1 & 1<=p176]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[[p149<=1 & 1<=p149] & [p61<=1 & 1<=p61]] | [[p207<=1 & 1<=p207] & [p133<=1 & 1<=p133]]] | [[~ [EG [~ [[[p228<=1 & 1<=p228] & [p54<=1 & 1<=p54]]]]] & ~ [E [~ [[[p228<=1 & 1<=p228] & [p54<=1 & 1<=p54]]] U [~ [[[p134<=1 & 1<=p134] & [p121<=1 & 1<=p121]]] & ~ [[[p228<=1 & 1<=p228] & [p54<=1 & 1<=p54]]]]]]] | EX [E [[[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [1<=p28 & p28<=1]] U [[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p23<=1 & 1<=p23]]]]]]]]] | [[p176<=1 & 1<=p176] & [p159<=1 & 1<=p159]]]]]]

abstracting: (1<=p159)
states: 10,321,385,205,863 (13)
abstracting: (p159<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p176)
states: 6,048,566,677,810 (12)
abstracting: (p176<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p23)
states: 598,709,743,096 (11)
abstracting: (p23<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p152)
states: 5,386,321,603,763 (12)
abstracting: (p152<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p154)
states: 10,976,557,739,681 (13)
abstracting: (p154<=1)
states: 16,369,951,883,674 (13)
abstracting: (p28<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p28)
states: 440,430,893,316 (11)
abstracting: (1<=p152)
states: 5,386,321,603,763 (12)
abstracting: (p152<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p154)
states: 10,976,557,739,681 (13)
abstracting: (p154<=1)
states: 16,369,951,883,674 (13)
.abstracting: (1<=p54)
states: 595,656,928,150 (11)
abstracting: (p54<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p121)
states: 8,081,922,419,536 (12)
abstracting: (p121<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p134)
states: 4,057,275,269,347 (12)
abstracting: (p134<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p54)
states: 595,656,928,150 (11)
abstracting: (p54<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p54)
states: 595,656,928,150 (11)
abstracting: (p54<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
.............
before gc: list nodes free: 1897644

after gc: idd nodes used:10805552, unused:53194448; list nodes free:242655646
MC time: 2m47.471sec

checking: EF [[AG [[[[[[p41<=1 & 1<=p41] & [p228<=1 & 1<=p228]] & [[p48<=1 & 1<=p48] & [p228<=1 & 1<=p228]]] | [[[p104<=1 & 1<=p104] & [p124<=1 & 1<=p124]] & [[p141<=1 & 1<=p141] & [[p146<=1 & 1<=p146] & [p148<=1 & 1<=p148]]]]] | [[[p106<=1 & 1<=p106] & [p124<=1 & 1<=p124]] | [[[p125<=1 & 1<=p125] & [p147<=1 & 1<=p147]] | [[p103<=1 & 1<=p103] & [p124<=1 & 1<=p124]]]]]] | [[[p10<=1 & 1<=p10] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]] | [[p88<=1 & 1<=p88] & [p149<=1 & 1<=p149]]]]]
normalized: E [true U [~ [E [true U ~ [[[[[[p41<=1 & 1<=p41] & [p228<=1 & 1<=p228]] & [[p228<=1 & 1<=p228] & [p48<=1 & 1<=p48]]] | [[[[p148<=1 & 1<=p148] & [p146<=1 & 1<=p146]] & [p141<=1 & 1<=p141]] & [[p124<=1 & 1<=p124] & [p104<=1 & 1<=p104]]]] | [[[[p124<=1 & 1<=p124] & [p103<=1 & 1<=p103]] | [[p147<=1 & 1<=p147] & [p125<=1 & 1<=p125]]] | [[p124<=1 & 1<=p124] & [p106<=1 & 1<=p106]]]]]]] | [[[p149<=1 & 1<=p149] & [p88<=1 & 1<=p88]] | [[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p10<=1 & 1<=p10]]]]]

abstracting: (1<=p10)
states: 598,709,743,096 (11)
abstracting: (p10<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p152)
states: 5,386,321,603,763 (12)
abstracting: (p152<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p154)
states: 10,976,557,739,681 (13)
abstracting: (p154<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p88)
states: 421,485,867,730 (11)
abstracting: (p88<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p149)
states: 8,326,130,306,122 (12)
abstracting: (p149<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p106)
states: 598,709,743,096 (11)
abstracting: (p106<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p124)
states: 5,450,074,885,492 (12)
abstracting: (p124<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p125)
states: 5,450,074,885,488 (12)
abstracting: (p125<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p147)
states: 8,210,253,844,158 (12)
abstracting: (p147<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p103)
states: 598,709,743,096 (11)
abstracting: (p103<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p124)
states: 5,450,074,885,492 (12)
abstracting: (p124<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p104)
states: 598,709,743,096 (11)
abstracting: (p104<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p124)
states: 5,450,074,885,492 (12)
abstracting: (p124<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p141)
states: 4,095,034,499,784 (12)
abstracting: (p141<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p146)
states: 8,743,727,782,022 (12)
abstracting: (p146<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p148)
states: 8,159,698,039,515 (12)
abstracting: (p148<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p48)
states: 598,709,743,096 (11)
abstracting: (p48<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p41)
states: 598,709,743,096 (11)
abstracting: (p41<=1)
states: 16,369,951,883,674 (13)

before gc: list nodes free: 3507107

after gc: idd nodes used:7322023, unused:56677977; list nodes free:258318251
MC time: 2m40.214sec

checking: EG [[[[p128<=1 & 1<=p128] & [[p213<=1 & 1<=p213] & [EX [[[p83<=0 & 0<=p83] | [p149<=0 & 0<=p149]]] | AG [[[p101<=0 & 0<=p101] | [p124<=0 & 0<=p124]]]]]] | [EF [[[[p171<=0 & 0<=p171] | [p188<=0 & 0<=p188]] & [[[p25<=0 & 0<=p25] | [p152<=0 & 0<=p152]] | [[p154<=0 & 0<=p154] | [[p50<=0 & 0<=p50] | [p228<=0 & 0<=p228]]]]]] & [[[p222<=0 & 0<=p222] | [p227<=0 & 0<=p227]] & [AF [[[p18<=0 & 0<=p18] | [[p152<=0 & 0<=p152] | [p154<=0 & 0<=p154]]]] | [[p159<=0 & 0<=p159] | [p176<=0 & 0<=p176]]]]]]]
normalized: EG [[[[[[[p176<=0 & 0<=p176] | [p159<=0 & 0<=p159]] | ~ [EG [~ [[[[p154<=0 & 0<=p154] | [p152<=0 & 0<=p152]] | [p18<=0 & 0<=p18]]]]]] & [[p227<=0 & 0<=p227] | [p222<=0 & 0<=p222]]] & E [true U [[[[[p228<=0 & 0<=p228] | [p50<=0 & 0<=p50]] | [p154<=0 & 0<=p154]] | [[p152<=0 & 0<=p152] | [p25<=0 & 0<=p25]]] & [[p188<=0 & 0<=p188] | [p171<=0 & 0<=p171]]]]] | [[[~ [E [true U ~ [[[p124<=0 & 0<=p124] | [p101<=0 & 0<=p101]]]]] | EX [[[p149<=0 & 0<=p149] | [p83<=0 & 0<=p83]]]] & [p213<=1 & 1<=p213]] & [p128<=1 & 1<=p128]]]]

abstracting: (1<=p128)
states: 10,655,062,314,773 (13)
abstracting: (p128<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p213)
states: 1,715,372,384,214 (12)
abstracting: (p213<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p83)
states: 16,369,951,883,674 (13)
abstracting: (p83<=0)
states: 15,805,334,426,532 (13)
abstracting: (0<=p149)
states: 16,369,951,883,674 (13)
abstracting: (p149<=0)
states: 8,043,821,577,552 (12)
.abstracting: (0<=p101)
states: 16,369,951,883,674 (13)
abstracting: (p101<=0)
states: 15,771,242,140,578 (13)
abstracting: (0<=p124)
states: 16,369,951,883,674 (13)
abstracting: (p124<=0)
states: 10,919,876,998,182 (13)
MC time: 2m22.001sec

checking: A [~ [[[[p108<=1 & 1<=p108] & [p124<=1 & 1<=p124]] | E [AG [~ [[[p116<=1 & 1<=p116] & [p124<=1 & 1<=p124]]]] U ~ [AF [[[p208<=1 & 1<=p208] & [p210<=1 & 1<=p210]]]]]]] U [EX [[[p59<=1 & 1<=p59] & [p228<=1 & 1<=p228]]] & [EX [E [AG [[[p151<=1 & 1<=p151] & [p214<=1 & 1<=p214]]] U EX [[[p78<=1 & 1<=p78] & [p149<=1 & 1<=p149]]]]] | [E [[[[p179<=1 & 1<=p179] & [p195<=1 & 1<=p195]] | [[p43<=1 & 1<=p43] & [p228<=1 & 1<=p228]]] U [AX [[[p187<=1 & 1<=p187] & [p203<=1 & 1<=p203]]] & ~ [[[p208<=1 & 1<=p208] & [p210<=1 & 1<=p210]]]]] & EG [[[[[p49<=1 & 1<=p49] & [p228<=1 & 1<=p228]] & [[p71<=1 & 1<=p71] & [p149<=1 & 1<=p149]]] | ~ [[[p29<=1 & 1<=p29] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]]]]]]]]]
normalized: [~ [EG [~ [[[[EG [[~ [[[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p29<=1 & 1<=p29]]] | [[[p149<=1 & 1<=p149] & [p71<=1 & 1<=p71]] & [[p228<=1 & 1<=p228] & [p49<=1 & 1<=p49]]]]] & E [[[[p228<=1 & 1<=p228] & [p43<=1 & 1<=p43]] | [[p195<=1 & 1<=p195] & [p179<=1 & 1<=p179]]] U [~ [[[p210<=1 & 1<=p210] & [p208<=1 & 1<=p208]]] & ~ [EX [~ [[[p203<=1 & 1<=p203] & [p187<=1 & 1<=p187]]]]]]]] | EX [E [~ [E [true U ~ [[[p214<=1 & 1<=p214] & [p151<=1 & 1<=p151]]]]] U EX [[[p149<=1 & 1<=p149] & [p78<=1 & 1<=p78]]]]]] & EX [[[p228<=1 & 1<=p228] & [p59<=1 & 1<=p59]]]]]]] & ~ [E [~ [[[[EG [[~ [[[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p29<=1 & 1<=p29]]] | [[[p149<=1 & 1<=p149] & [p71<=1 & 1<=p71]] & [[p228<=1 & 1<=p228] & [p49<=1 & 1<=p49]]]]] & E [[[[p228<=1 & 1<=p228] & [p43<=1 & 1<=p43]] | [[p195<=1 & 1<=p195] & [p179<=1 & 1<=p179]]] U [~ [[[p210<=1 & 1<=p210] & [p208<=1 & 1<=p208]]] & ~ [EX [~ [[[p203<=1 & 1<=p203] & [p187<=1 & 1<=p187]]]]]]]] | EX [E [~ [E [true U ~ [[[p214<=1 & 1<=p214] & [p151<=1 & 1<=p151]]]]] U EX [[[p149<=1 & 1<=p149] & [p78<=1 & 1<=p78]]]]]] & EX [[[p228<=1 & 1<=p228] & [p59<=1 & 1<=p59]]]]] U [[E [~ [E [true U [[p124<=1 & 1<=p124] & [p116<=1 & 1<=p116]]]] U EG [~ [[[p210<=1 & 1<=p210] & [p208<=1 & 1<=p208]]]]] | [[p124<=1 & 1<=p124] & [p108<=1 & 1<=p108]]] & ~ [[[[EG [[~ [[[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p29<=1 & 1<=p29]]] | [[[p149<=1 & 1<=p149] & [p71<=1 & 1<=p71]] & [[p228<=1 & 1<=p228] & [p49<=1 & 1<=p49]]]]] & E [[[[p228<=1 & 1<=p228] & [p43<=1 & 1<=p43]] | [[p195<=1 & 1<=p195] & [p179<=1 & 1<=p179]]] U [~ [[[p210<=1 & 1<=p210] & [p208<=1 & 1<=p208]]] & ~ [EX [~ [[[p203<=1 & 1<=p203] & [p187<=1 & 1<=p187]]]]]]]] | EX [E [~ [E [true U ~ [[[p214<=1 & 1<=p214] & [p151<=1 & 1<=p151]]]]] U EX [[[p149<=1 & 1<=p149] & [p78<=1 & 1<=p78]]]]]] & EX [[[p228<=1 & 1<=p228] & [p59<=1 & 1<=p59]]]]]]]]]

abstracting: (1<=p59)
states: 8,656,402,640 (9)
abstracting: (p59<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
.abstracting: (1<=p78)
states: 564,617,457,142 (11)
abstracting: (p78<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p149)
states: 8,326,130,306,122 (12)
abstracting: (p149<=1)
states: 16,369,951,883,674 (13)
.abstracting: (1<=p151)
states: 10,983,630,279,910 (13)
abstracting: (p151<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p214)
states: 358,394,040,080 (11)
abstracting: (p214<=1)
states: 16,369,951,883,674 (13)

before gc: list nodes free: 5170201

after gc: idd nodes used:7799997, unused:56200003; list nodes free:256202135
.abstracting: (1<=p187)
states: 10,321,385,205,863 (13)
abstracting: (p187<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p203)
states: 5,474,436,783,462 (12)
abstracting: (p203<=1)
states: 16,369,951,883,674 (13)
.abstracting: (1<=p208)
states: 560,507,566,053 (11)
abstracting: (p208<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p210)
states: 101,305,512,648 (11)
abstracting: (p210<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p179)
states: 10,321,385,205,863 (13)
abstracting: (p179<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p195)
states: 5,474,436,783,462 (12)
abstracting: (p195<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p43)
states: 598,709,743,096 (11)
abstracting: (p43<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
MC time: 2m11.003sec

checking: EX [[[[EF [[[p217<=1 & 1<=p217] & [p219<=1 & 1<=p219]]] | [E [[[p169<=1 & 1<=p169] & [p186<=1 & 1<=p186]] U [[p52<=1 & 1<=p52] & [p228<=1 & 1<=p228]]] | EG [[[p31<=1 & 1<=p31] & [p228<=1 & 1<=p228]]]]] | [AG [AF [[[p138<=0 & 0<=p138] | [p140<=0 & 0<=p140]]]] | [[[p45<=1 & 1<=p45] & [p228<=1 & 1<=p228]] | [[[p119<=1 & 1<=p119] & [p124<=1 & 1<=p124]] & [[p72<=1 & 1<=p72] & [p149<=1 & 1<=p149]]]]]] & [A [[AF [[[p132<=1 & 1<=p132] & [[p142<=1 & 1<=p142] & [p144<=1 & 1<=p144]]]] | ~ [AF [[[p217<=1 & 1<=p217] & [p219<=1 & 1<=p219]]]]] U [[[[p68<=1 & 1<=p68] & [[p149<=1 & 1<=p149] & [p125<=1 & 1<=p125]]] & [[p147<=1 & 1<=p147] & [[p221<=1 & 1<=p221] & [p223<=1 & 1<=p223]]]] | ~ [AF [[[p128<=1 & 1<=p128] & [p213<=1 & 1<=p213]]]]]] | AG [AX [[[p69<=1 & 1<=p69] & [p149<=1 & 1<=p149]]]]]]]
normalized: EX [[[~ [E [true U EX [~ [[[p149<=1 & 1<=p149] & [p69<=1 & 1<=p69]]]]]] | [~ [EG [~ [[EG [~ [[[p213<=1 & 1<=p213] & [p128<=1 & 1<=p128]]]] | [[[[p223<=1 & 1<=p223] & [p221<=1 & 1<=p221]] & [p147<=1 & 1<=p147]] & [[[p125<=1 & 1<=p125] & [p149<=1 & 1<=p149]] & [p68<=1 & 1<=p68]]]]]]] & ~ [E [~ [[EG [~ [[[p213<=1 & 1<=p213] & [p128<=1 & 1<=p128]]]] | [[[[p223<=1 & 1<=p223] & [p221<=1 & 1<=p221]] & [p147<=1 & 1<=p147]] & [[[p125<=1 & 1<=p125] & [p149<=1 & 1<=p149]] & [p68<=1 & 1<=p68]]]]] U [~ [[EG [~ [[[p219<=1 & 1<=p219] & [p217<=1 & 1<=p217]]]] | ~ [EG [~ [[[[p144<=1 & 1<=p144] & [p142<=1 & 1<=p142]] & [p132<=1 & 1<=p132]]]]]]] & ~ [[EG [~ [[[p213<=1 & 1<=p213] & [p128<=1 & 1<=p128]]]] | [[[[p223<=1 & 1<=p223] & [p221<=1 & 1<=p221]] & [p147<=1 & 1<=p147]] & [[[p125<=1 & 1<=p125] & [p149<=1 & 1<=p149]] & [p68<=1 & 1<=p68]]]]]]]]]] & [[[[[[p149<=1 & 1<=p149] & [p72<=1 & 1<=p72]] & [[p124<=1 & 1<=p124] & [p119<=1 & 1<=p119]]] | [[p228<=1 & 1<=p228] & [p45<=1 & 1<=p45]]] | ~ [E [true U EG [~ [[[p140<=0 & 0<=p140] | [p138<=0 & 0<=p138]]]]]]] | [[EG [[[p228<=1 & 1<=p228] & [p31<=1 & 1<=p31]]] | E [[[p186<=1 & 1<=p186] & [p169<=1 & 1<=p169]] U [[p228<=1 & 1<=p228] & [p52<=1 & 1<=p52]]]] | E [true U [[p219<=1 & 1<=p219] & [p217<=1 & 1<=p217]]]]]]]

abstracting: (1<=p217)
states: 5,292,521,378,554 (12)
abstracting: (p217<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p219)
states: 1,785,927,434,568 (12)
abstracting: (p219<=1)
states: 16,369,951,883,674 (13)

before gc: list nodes free: 7300030

after gc: idd nodes used:8777690, unused:55222310; list nodes free:251764185
MC time: 2m 1.703sec

checking: [EF [EG [AG [[[[p63<=1 & 1<=p63] & [p149<=1 & 1<=p149]] | [[p52<=1 & 1<=p52] & [p228<=1 & 1<=p228]]]]]] | [AX [EG [[[[p97<=0 & 0<=p97] | [p124<=0 & 0<=p124]] | [[p175<=0 & 0<=p175] | [[p191<=0 & 0<=p191] | [p121<=0 & 0<=p121]]]]]] | [E [[[EF [[[p132<=1 & 1<=p132] & [[p142<=1 & 1<=p142] & [p144<=1 & 1<=p144]]]] & EX [[[[p222<=1 & 1<=p222] & [p227<=1 & 1<=p227]] & [[p25<=1 & 1<=p25] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]]]]] & [[p7<=1 & 1<=p7] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]]] U [[p112<=1 & 1<=p112] & [p124<=1 & 1<=p124]]] & [EX [[[p208<=1 & 1<=p208] & [p210<=1 & 1<=p210]]] | A [~ [AF [[[[p125<=1 & 1<=p125] & [p147<=1 & 1<=p147]] & [[p11<=1 & 1<=p11] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]]]]] U ~ [[~ [AX [[[p96<=1 & 1<=p96] & [p124<=1 & 1<=p124]]]] | ~ [[[p74<=1 & 1<=p74] & [p149<=1 & 1<=p149]]]]]]]]]]
normalized: [[~ [EX [~ [EG [[[[[p121<=0 & 0<=p121] | [p191<=0 & 0<=p191]] | [p175<=0 & 0<=p175]] | [[p124<=0 & 0<=p124] | [p97<=0 & 0<=p97]]]]]]] | [[[~ [EG [[~ [[[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]]] | EX [~ [[[p124<=1 & 1<=p124] & [p96<=1 & 1<=p96]]]]]]] & ~ [E [[~ [[[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]]] | EX [~ [[[p124<=1 & 1<=p124] & [p96<=1 & 1<=p96]]]]] U [~ [EG [~ [[[[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p11<=1 & 1<=p11]] & [[p147<=1 & 1<=p147] & [p125<=1 & 1<=p125]]]]]] & [~ [[[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]]] | EX [~ [[[p124<=1 & 1<=p124] & [p96<=1 & 1<=p96]]]]]]]]] | EX [[[p210<=1 & 1<=p210] & [p208<=1 & 1<=p208]]]] & E [[[[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p7<=1 & 1<=p7]] & [EX [[[[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p25<=1 & 1<=p25]] & [[p227<=1 & 1<=p227] & [p222<=1 & 1<=p222]]]] & E [true U [[[p144<=1 & 1<=p144] & [p142<=1 & 1<=p142]] & [p132<=1 & 1<=p132]]]]] U [[p124<=1 & 1<=p124] & [p112<=1 & 1<=p112]]]]] | E [true U EG [~ [E [true U ~ [[[[p228<=1 & 1<=p228] & [p52<=1 & 1<=p52]] | [[p149<=1 & 1<=p149] & [p63<=1 & 1<=p63]]]]]]]]]

abstracting: (1<=p63)
states: 564,617,457,142 (11)
abstracting: (p63<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p149)
states: 8,326,130,306,122 (12)
abstracting: (p149<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p52)
states: 598,709,743,096 (11)
abstracting: (p52<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
.
EG iterations: 1
abstracting: (1<=p112)
states: 598,709,743,096 (11)
abstracting: (p112<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p124)
states: 5,450,074,885,492 (12)
abstracting: (p124<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p132)
states: 8,330,714,105,775 (12)
abstracting: (p132<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p142)
states: 3,885,634,991,361 (12)
abstracting: (p142<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p144)
states: 3,984,165,456,473 (12)
abstracting: (p144<=1)
states: 16,369,951,883,674 (13)
MC time: 1m52.497sec

checking: [AX [[[[A [AF [[[p91<=1 & 1<=p91] & [p124<=1 & 1<=p124]]] U [[[p62<=1 & 1<=p62] & [p149<=1 & 1<=p149]] | [[p135<=1 & 1<=p135] & [p145<=1 & 1<=p145]]]] & [[p10<=0 & 0<=p10] | [[p152<=0 & 0<=p152] | [p154<=0 & 0<=p154]]]] & [[p135<=1 & 1<=p135] & [p145<=1 & 1<=p145]]] | EG [E [A [[[p130<=1 & 1<=p130] & [p224<=1 & 1<=p224]] U [[p37<=1 & 1<=p37] & [p228<=1 & 1<=p228]]] U ~ [[[p84<=1 & 1<=p84] & [p149<=1 & 1<=p149]]]]]]] & E [[A [[A [[[p132<=1 & 1<=p132] & [p139<=1 & 1<=p139]] U [[p116<=1 & 1<=p116] & [p124<=1 & 1<=p124]]] & [[[[p56<=1 & 1<=p56] & [p228<=1 & 1<=p228]] & [[p59<=1 & 1<=p59] & [p228<=1 & 1<=p228]]] | [[p51<=1 & 1<=p51] & [p228<=1 & 1<=p228]]]] U [A [[[p209<=1 & 1<=p209] & [p212<=1 & 1<=p212]] U [[p65<=1 & 1<=p65] & [p149<=1 & 1<=p149]]] & ~ [EX [[[p121<=1 & 1<=p121] & [p134<=1 & 1<=p134]]]]]] | AG [~ [A [[[p6<=1 & 1<=p6] & [[p152<=1 & 1<=p152] & [p154<=1 & 1<=p154]]] U [[[p120<=1 & 1<=p120] & [[p122<=1 & 1<=p122] & [p126<=1 & 1<=p126]]] & [[p127<=1 & 1<=p127] & [[p129<=1 & 1<=p129] & [p131<=1 & 1<=p131]]]]]]]] U EF [~ [[~ [[[p57<=1 & 1<=p57] & [p228<=1 & 1<=p228]]] | AF [[[p52<=1 & 1<=p52] & [p228<=1 & 1<=p228]]]]]]]]
normalized: [~ [EX [~ [[[[[[[p154<=0 & 0<=p154] | [p152<=0 & 0<=p152]] | [p10<=0 & 0<=p10]] & [~ [EG [~ [[[[p145<=1 & 1<=p145] & [p135<=1 & 1<=p135]] | [[p149<=1 & 1<=p149] & [p62<=1 & 1<=p62]]]]]] & ~ [E [~ [[[[p145<=1 & 1<=p145] & [p135<=1 & 1<=p135]] | [[p149<=1 & 1<=p149] & [p62<=1 & 1<=p62]]]] U [EG [~ [[[p124<=1 & 1<=p124] & [p91<=1 & 1<=p91]]]] & ~ [[[[p145<=1 & 1<=p145] & [p135<=1 & 1<=p135]] | [[p149<=1 & 1<=p149] & [p62<=1 & 1<=p62]]]]]]]]] & [[p145<=1 & 1<=p145] & [p135<=1 & 1<=p135]]] | EG [E [[~ [EG [~ [[[p228<=1 & 1<=p228] & [p37<=1 & 1<=p37]]]]] & ~ [E [~ [[[p228<=1 & 1<=p228] & [p37<=1 & 1<=p37]]] U [~ [[[p228<=1 & 1<=p228] & [p37<=1 & 1<=p37]]] & ~ [[[p224<=1 & 1<=p224] & [p130<=1 & 1<=p130]]]]]]] U ~ [[[p149<=1 & 1<=p149] & [p84<=1 & 1<=p84]]]]]]]]] & E [[[~ [EG [~ [[[~ [EG [~ [[[p149<=1 & 1<=p149] & [p65<=1 & 1<=p65]]]]] & ~ [E [~ [[[p149<=1 & 1<=p149] & [p65<=1 & 1<=p65]]] U [~ [[[p212<=1 & 1<=p212] & [p209<=1 & 1<=p209]]] & ~ [[[p149<=1 & 1<=p149] & [p65<=1 & 1<=p65]]]]]]] & ~ [EX [[[p134<=1 & 1<=p134] & [p121<=1 & 1<=p121]]]]]]]] & ~ [E [~ [[[~ [EG [~ [[[p149<=1 & 1<=p149] & [p65<=1 & 1<=p65]]]]] & ~ [E [~ [[[p149<=1 & 1<=p149] & [p65<=1 & 1<=p65]]] U [~ [[[p212<=1 & 1<=p212] & [p209<=1 & 1<=p209]]] & ~ [[[p149<=1 & 1<=p149] & [p65<=1 & 1<=p65]]]]]]] & ~ [EX [[[p134<=1 & 1<=p134] & [p121<=1 & 1<=p121]]]]]] U [~ [[[~ [EG [~ [[[p149<=1 & 1<=p149] & [p65<=1 & 1<=p65]]]]] & ~ [E [~ [[[p149<=1 & 1<=p149] & [p65<=1 & 1<=p65]]] U [~ [[[p212<=1 & 1<=p212] & [p209<=1 & 1<=p209]]] & ~ [[[p149<=1 & 1<=p149] & [p65<=1 & 1<=p65]]]]]]] & ~ [EX [[[p134<=1 & 1<=p134] & [p121<=1 & 1<=p121]]]]]] & ~ [[[[[p228<=1 & 1<=p228] & [p51<=1 & 1<=p51]] | [[[p228<=1 & 1<=p228] & [p59<=1 & 1<=p59]] & [[p228<=1 & 1<=p228] & [p56<=1 & 1<=p56]]]] & [~ [EG [~ [[[p124<=1 & 1<=p124] & [p116<=1 & 1<=p116]]]]] & ~ [E [~ [[[p124<=1 & 1<=p124] & [p116<=1 & 1<=p116]]] U [~ [[[p139<=1 & 1<=p139] & [p132<=1 & 1<=p132]]] & ~ [[[p124<=1 & 1<=p124] & [p116<=1 & 1<=p116]]]]]]]]]]]]] | ~ [E [true U [~ [EG [~ [[[[[p131<=1 & 1<=p131] & [p129<=1 & 1<=p129]] & [p127<=1 & 1<=p127]] & [[[p126<=1 & 1<=p126] & [p122<=1 & 1<=p122]] & [p120<=1 & 1<=p120]]]]]] & ~ [E [~ [[[[[p131<=1 & 1<=p131] & [p129<=1 & 1<=p129]] & [p127<=1 & 1<=p127]] & [[[p126<=1 & 1<=p126] & [p122<=1 & 1<=p122]] & [p120<=1 & 1<=p120]]]] U [~ [[[[p154<=1 & 1<=p154] & [p152<=1 & 1<=p152]] & [p6<=1 & 1<=p6]]] & ~ [[[[[p131<=1 & 1<=p131] & [p129<=1 & 1<=p129]] & [p127<=1 & 1<=p127]] & [[[p126<=1 & 1<=p126] & [p122<=1 & 1<=p122]] & [p120<=1 & 1<=p120]]]]]]]]]]] U E [true U ~ [[~ [EG [~ [[[p228<=1 & 1<=p228] & [p52<=1 & 1<=p52]]]]] | ~ [[[p228<=1 & 1<=p228] & [p57<=1 & 1<=p57]]]]]]]]

abstracting: (1<=p57)
states: 280,601,790,499 (11)
abstracting: (p57<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p52)
states: 598,709,743,096 (11)
abstracting: (p52<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,702,296,990,117 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
.........
before gc: list nodes free: 3018077

after gc: idd nodes used:11914785, unused:52085215; list nodes free:237535487
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5988324 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099296 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

829220 877723 783150 789581
iterations count:446691 (2538), effective:35971 (204)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 237 sec


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

net_ddint.h:600: Timeout: after 221 sec


iterations count:6379 (36), effective:425 (2)

iterations count:6379 (36), effective:425 (2)

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

iterations count:6379 (36), effective:425 (2)

net_ddint.h:600: Timeout: after 215 sec


net_ddint.h:600: Timeout: after 200 sec


net_ddint.h:600: Timeout: after 185 sec


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

iterations count:181 (1), effective:1 (0)
686962
sat_reach.icc:155: Timeout: after 181 sec


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

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

net_ddint.h:600: Timeout: after 166 sec


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

sat_reach.icc:155: Timeout: after 153 sec


sat_reach.icc:155: Timeout: after 141 sec


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

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

sat_reach.icc:155: Timeout: after 130 sec


sat_reach.icc:155: Timeout: after 120 sec


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

sat_reach.icc:155: Timeout: after 111 sec


net_ddint.h:600: Timeout: after 102 sec

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="DES-PT-30a"
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 DES-PT-30a, 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 r106-tall-167814482700442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30a.tgz
mv DES-PT-30a 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 ;