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-167814482700426.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-20a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:39 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.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 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 57K 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-20a-CTLFireability-00
FORMULA_NAME DES-PT-20a-CTLFireability-01
FORMULA_NAME DES-PT-20a-CTLFireability-02
FORMULA_NAME DES-PT-20a-CTLFireability-03
FORMULA_NAME DES-PT-20a-CTLFireability-04
FORMULA_NAME DES-PT-20a-CTLFireability-05
FORMULA_NAME DES-PT-20a-CTLFireability-06
FORMULA_NAME DES-PT-20a-CTLFireability-07
FORMULA_NAME DES-PT-20a-CTLFireability-08
FORMULA_NAME DES-PT-20a-CTLFireability-09
FORMULA_NAME DES-PT-20a-CTLFireability-10
FORMULA_NAME DES-PT-20a-CTLFireability-11
FORMULA_NAME DES-PT-20a-CTLFireability-12
FORMULA_NAME DES-PT-20a-CTLFireability-13
FORMULA_NAME DES-PT-20a-CTLFireability-14
FORMULA_NAME DES-PT-20a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678389647192

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-20a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 19:20:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 19:20:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 19:20:48] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-09 19:20:48] [INFO ] Transformed 195 places.
[2023-03-09 19:20:48] [INFO ] Transformed 152 transitions.
[2023-03-09 19:20:48] [INFO ] Found NUPN structural information;
[2023-03-09 19:20:48] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 101 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Applied a total of 0 rules in 14 ms. Remains 195 /195 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 195 cols
[2023-03-09 19:20:48] [INFO ] Computed 59 place invariants in 17 ms
[2023-03-09 19:20:49] [INFO ] Implicit Places using invariants in 283 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 489 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 509 ms. Remains : 194/195 places, 138/138 transitions.
Support contains 101 out of 194 places after structural reductions.
[2023-03-09 19:20:49] [INFO ] Flatten gal took : 39 ms
[2023-03-09 19:20:49] [INFO ] Flatten gal took : 17 ms
[2023-03-09 19:20:49] [INFO ] Input system was already deterministic with 138 transitions.
Incomplete random walk after 10000 steps, including 213 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 71) seen :47
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) 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 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 138 rows 194 cols
[2023-03-09 19:20:50] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-09 19:20:50] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-09 19:20:50] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 19:20:50] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-09 19:20:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-09 19:20:50] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 164 ms returned sat
[2023-03-09 19:20:52] [INFO ] After 1400ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2023-03-09 19:20:52] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 5 ms to minimize.
[2023-03-09 19:20:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-09 19:20:53] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2023-03-09 19:20:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-09 19:20:53] [INFO ] After 2930ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :23
Attempting to minimize the solution found.
Minimization took 1597 ms.
[2023-03-09 19:20:55] [INFO ] After 5131ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :23
Fused 24 Parikh solutions to 23 different solutions.
Finished Parikh walk after 139 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=69 )
Parikh walk visited 23 properties in 535 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 21 ms
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 14 ms
[2023-03-09 19:20:56] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 96 out of 194 places (down from 100) after GAL structural reductions.
FORMULA DES-PT-20a-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 97 stabilizing places and 92 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 20 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 13 ms
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 11 ms
[2023-03-09 19:20:56] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 8 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 11 ms
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 11 ms
[2023-03-09 19:20:56] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 20 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 10 ms
[2023-03-09 19:20:56] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 194/194 places, 138/138 transitions.
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 10 ms
[2023-03-09 19:20:56] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 6 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 10 ms
[2023-03-09 19:20:56] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 5 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 10 ms
[2023-03-09 19:20:56] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 12 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 8 ms
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 8 ms
[2023-03-09 19:20:56] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 13 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:20:56] [INFO ] Flatten gal took : 8 ms
[2023-03-09 19:20:56] [INFO ] Input system was already deterministic with 137 transitions.
Incomplete random walk after 10000 steps, including 221 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1896914 steps, run timeout after 3001 ms. (steps per millisecond=632 ) properties seen :{}
Probabilistic random walk after 1896914 steps, saw 257531 distinct states, run finished after 3005 ms. (steps per millisecond=631 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 137 rows 193 cols
[2023-03-09 19:20:59] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-09 19:20:59] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-09 19:20:59] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-09 19:20:59] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 19:20:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-09 19:20:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-09 19:20:59] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 19:20:59] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 19:21:00] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 74 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 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 193 transition count 135
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 193 transition count 135
Applied a total of 8 rules in 21 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 1000000 steps, including 13412 resets, run finished after 2105 ms. (steps per millisecond=475 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1765 resets, run finished after 926 ms. (steps per millisecond=1079 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5829820 steps, run timeout after 9001 ms. (steps per millisecond=647 ) properties seen :{}
Probabilistic random walk after 5829820 steps, saw 751100 distinct states, run finished after 9001 ms. (steps per millisecond=647 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-09 19:21:12] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 19:21:12] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 19:21:12] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-09 19:21:12] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 19:21:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 19:21:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 59 ms returned sat
[2023-03-09 19:21:12] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 19:21:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 19:21:12] [INFO ] After 41ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 19:21:12] [INFO ] After 82ms 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 19:21:12] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 85 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 15 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-09 19:21:12] [INFO ] Invariant cache hit.
[2023-03-09 19:21:12] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-09 19:21:12] [INFO ] Invariant cache hit.
[2023-03-09 19:21:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 19:21:13] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-09 19:21:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 19:21:13] [INFO ] Invariant cache hit.
[2023-03-09 19:21:13] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 193/193 places, 135/135 transitions.
Incomplete random walk after 100000 steps, including 1336 resets, run finished after 328 ms. (steps per millisecond=304 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-09 19:21:13] [INFO ] Invariant cache hit.
[2023-03-09 19:21:13] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 19:21:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 19:21:13] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 19:21:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 19:21:13] [INFO ] After 24ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 19:21:13] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2023-03-09 19:21:13] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-09 19:21:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2023-03-09 19:21:13] [INFO ] After 150ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 19:21:13] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 19:21:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 19:21:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-09 19:21:13] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 19:21:13] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 19:21:13] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 19:21:13] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 13412 resets, run finished after 2057 ms. (steps per millisecond=486 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1740 resets, run finished after 913 ms. (steps per millisecond=1095 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3871760 steps, run timeout after 6001 ms. (steps per millisecond=645 ) properties seen :{}
Probabilistic random walk after 3871760 steps, saw 526203 distinct states, run finished after 6001 ms. (steps per millisecond=645 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 19:21:22] [INFO ] Invariant cache hit.
[2023-03-09 19:21:22] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 19:21:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 19:21:22] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 19:21:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 19:21:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-09 19:21:23] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 19:21:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 19:21:23] [INFO ] After 31ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 19:21:23] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 19:21:23] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 952 steps, including 3 resets, run visited all 1 properties in 5 ms. (steps per millisecond=190 )
FORMULA DES-PT-20a-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 5 ms.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 6 ms
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 9 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 6 ms
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 10 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 6 ms
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 6 ms
[2023-03-09 19:21:23] [INFO ] Input system was already deterministic with 137 transitions.
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:21:23] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-09 19:21:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 138 transitions and 675 arcs took 1 ms.
Total runtime 34957 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: 194 NrTr: 138 NrArc: 675)

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

net check time: 0m 0.000sec

init dd package: 0m 2.763sec


RS generation: 0m35.862sec


-> reachability set: #nodes 821984 (8.2e+05) #states 7,969,347,823,493 (12)



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

checking: EG [EF [[AF [[[p53<=0 & 0<=p53] | [p109<=0 & 0<=p109]]] & [[p80<=1 & 1<=p80] & [p85<=1 & 1<=p85]]]]]
normalized: EG [E [true U [~ [EG [~ [[[p53<=0 & 0<=p53] | [p109<=0 & 0<=p109]]]]] & [[p80<=1 & 1<=p80] & [p85<=1 & 1<=p85]]]]]

abstracting: (1<=p85)
states: 2,651,747,218,404 (12)
abstracting: (p85<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p80)
states: 190,960,892,828 (11)
abstracting: (p80<=1)
states: 7,969,347,823,493 (12)
abstracting: (0<=p109)
states: 7,969,347,823,493 (12)
abstracting: (p109<=0)
states: 3,879,800,451,967 (12)
abstracting: (0<=p53)
states: 7,969,347,823,493 (12)
abstracting: (p53<=0)
states: 7,549,853,984,373 (12)
............
before gc: list nodes free: 289259

after gc: idd nodes used:5763605, unused:58236395; list nodes free:259175080
......
before gc: list nodes free: 844824

after gc: idd nodes used:7981747, unused:56018253; list nodes free:253252440
..
before gc: list nodes free: 1048233

after gc: idd nodes used:9854199, unused:54145801; list nodes free:246730724
MC time: 4m23.101sec

checking: E [AG [AX [AG [AF [[[p147<=1 & 1<=p147] & [p163<=1 & 1<=p163]]]]]] U [[p39<=1 & 1<=p39] & [p189<=1 & 1<=p189]]]
normalized: E [~ [E [true U EX [E [true U EG [~ [[[p163<=1 & 1<=p163] & [p147<=1 & 1<=p147]]]]]]]] U [[p189<=1 & 1<=p189] & [p39<=1 & 1<=p39]]]

abstracting: (1<=p39)
states: 78,076,181,131 (10)
abstracting: (p39<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p189)
states: 1,406,063,598,185 (12)
abstracting: (p189<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p147)
states: 5,030,738,730,184 (12)
abstracting: (p147<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p163)
states: 2,660,803,732,557 (12)
abstracting: (p163<=1)
states: 7,969,347,823,493 (12)
.......
before gc: list nodes free: 3565183

after gc: idd nodes used:5868454, unused:58131546; list nodes free:265053445
.
before gc: list nodes free: 2736128

after gc: idd nodes used:8883150, unused:55116850; list nodes free:251153079
.MC time: 3m56.435sec

checking: EX [A [~ [AG [~ [[[p45<=1 & 1<=p45] & [p109<=1 & 1<=p109]]]]] U [[p12<=1 & 1<=p12] & [[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]]]]]
normalized: EX [[~ [EG [~ [[[[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]] & [p12<=1 & 1<=p12]]]]] & ~ [E [~ [[[[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]] & [p12<=1 & 1<=p12]]] U [~ [E [true U [[p109<=1 & 1<=p109] & [p45<=1 & 1<=p45]]]] & ~ [[[[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]] & [p12<=1 & 1<=p12]]]]]]]]

abstracting: (1<=p12)
states: 459,379,921,544 (11)
abstracting: (p12<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p112)
states: 2,677,717,524,813 (12)
abstracting: (p112<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p114)
states: 5,285,129,563,984 (12)
abstracting: (p114<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p45)
states: 419,493,839,120 (11)
abstracting: (p45<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p109)
states: 4,089,547,371,526 (12)
abstracting: (p109<=1)
states: 7,969,347,823,493 (12)

before gc: list nodes free: 3244487

after gc: idd nodes used:3118407, unused:60881593; list nodes free:277370617
MC time: 3m39.245sec

checking: AX [A [EF [~ [[[p101<=1 & 1<=p101] & [[p106<=1 & 1<=p106] & [p108<=1 & 1<=p108]]]]] U [[p139<=1 & 1<=p139] & [p155<=1 & 1<=p155]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[[p155<=1 & 1<=p155] & [p139<=1 & 1<=p139]]]]] & ~ [E [~ [[[p155<=1 & 1<=p155] & [p139<=1 & 1<=p139]]] U [~ [E [true U ~ [[[[p108<=1 & 1<=p108] & [p106<=1 & 1<=p106]] & [p101<=1 & 1<=p101]]]]] & ~ [[[p155<=1 & 1<=p155] & [p139<=1 & 1<=p139]]]]]]]]]]

abstracting: (1<=p139)
states: 5,030,738,730,184 (12)
abstracting: (p139<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p155)
states: 2,660,803,732,557 (12)
abstracting: (p155<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p101)
states: 2,026,843,567,918 (12)
abstracting: (p101<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p106)
states: 4,207,508,779,554 (12)
abstracting: (p106<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p108)
states: 3,966,186,324,855 (12)
abstracting: (p108<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p139)
states: 5,030,738,730,184 (12)
abstracting: (p139<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p155)
states: 2,660,803,732,557 (12)
abstracting: (p155<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p139)
states: 5,030,738,730,184 (12)
abstracting: (p139<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p155)
states: 2,660,803,732,557 (12)
abstracting: (p155<=1)
states: 7,969,347,823,493 (12)
....
before gc: list nodes free: 3737856

after gc: idd nodes used:5376980, unused:58623020; list nodes free:267142948
...
before gc: list nodes free: 2680197

after gc: idd nodes used:8961266, unused:55038734; list nodes free:250837925
.MC time: 3m28.269sec

checking: [AX [AX [[p82<=1 & 1<=p82]]] | [AG [EF [[[p64<=1 & 1<=p64] & [p85<=1 & 1<=p85]]]] & [AX [EF [[[p96<=1 & 1<=p96] & [p110<=1 & 1<=p110]]]] & EX [[[p98<=0 & 0<=p98] | [p100<=0 & 0<=p100]]]]]]
normalized: [[[EX [[[p100<=0 & 0<=p100] | [p98<=0 & 0<=p98]]] & ~ [EX [~ [E [true U [[p110<=1 & 1<=p110] & [p96<=1 & 1<=p96]]]]]]] & ~ [E [true U ~ [E [true U [[p85<=1 & 1<=p85] & [p64<=1 & 1<=p64]]]]]]] | ~ [EX [EX [~ [[p82<=1 & 1<=p82]]]]]]

abstracting: (1<=p82)
states: 3,906,345,597,324 (12)
abstracting: (p82<=1)
states: 7,969,347,823,493 (12)
..abstracting: (1<=p64)
states: 424,148,592,650 (11)
abstracting: (p64<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p85)
states: 2,651,747,218,404 (12)
abstracting: (p85<=1)
states: 7,969,347,823,493 (12)

before gc: list nodes free: 3139451

after gc: idd nodes used:3749699, unused:60250301; list nodes free:274564278
MC time: 3m 9.005sec

checking: [AX [[E [[[p78<=1 & 1<=p78] & [p85<=1 & 1<=p85]] U [[p25<=1 & 1<=p25] & [p189<=1 & 1<=p189]]] & [[p75<=0 & 0<=p75] | [p85<=0 & 0<=p85]]]] | AG [[[p23<=0 & 0<=p23] | [p189<=0 & 0<=p189]]]]
normalized: [~ [EX [~ [[[[p85<=0 & 0<=p85] | [p75<=0 & 0<=p75]] & E [[[p85<=1 & 1<=p85] & [p78<=1 & 1<=p78]] U [[p189<=1 & 1<=p189] & [p25<=1 & 1<=p25]]]]]]] | ~ [E [true U ~ [[[p189<=0 & 0<=p189] | [p23<=0 & 0<=p23]]]]]]

abstracting: (0<=p23)
states: 7,969,347,823,493 (12)
abstracting: (p23<=0)
states: 7,509,968,298,177 (12)
abstracting: (0<=p189)
states: 7,969,347,823,493 (12)
abstracting: (p189<=0)
states: 6,563,284,225,308 (12)
abstracting: (1<=p25)
states: 459,379,921,544 (11)
abstracting: (p25<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p189)
states: 1,406,063,598,185 (12)
abstracting: (p189<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p78)
states: 443,592,057,255 (11)
abstracting: (p78<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p85)
states: 2,651,747,218,404 (12)
abstracting: (p85<=1)
states: 7,969,347,823,493 (12)
abstracting: (0<=p75)
states: 7,969,347,823,493 (12)
abstracting: (p75<=0)
states: 7,509,967,901,949 (12)
abstracting: (0<=p85)
states: 7,969,347,823,493 (12)
abstracting: (p85<=0)
states: 5,317,600,605,089 (12)

before gc: list nodes free: 3714121

after gc: idd nodes used:5495793, unused:58504207; list nodes free:266586425
MC time: 2m55.030sec

checking: E [[~ [EG [A [[[p188<=1 & 1<=p188] & [p192<=1 & 1<=p192]] U [[p169<=1 & 1<=p169] & [p172<=1 & 1<=p172]]]]] | [[p58<=1 & 1<=p58] & [p109<=1 & 1<=p109]]] U EF [AG [[[[p188<=1 & 1<=p188] & [p192<=1 & 1<=p192]] | [[p12<=1 & 1<=p12] & [[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]]]]]]]
normalized: E [[[[p109<=1 & 1<=p109] & [p58<=1 & 1<=p58]] | ~ [EG [[~ [EG [~ [[[p172<=1 & 1<=p172] & [p169<=1 & 1<=p169]]]]] & ~ [E [~ [[[p172<=1 & 1<=p172] & [p169<=1 & 1<=p169]]] U [~ [[[p192<=1 & 1<=p192] & [p188<=1 & 1<=p188]]] & ~ [[[p172<=1 & 1<=p172] & [p169<=1 & 1<=p169]]]]]]]]]] U E [true U ~ [E [true U ~ [[[[[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]] & [p12<=1 & 1<=p12]] | [[p192<=1 & 1<=p192] & [p188<=1 & 1<=p188]]]]]]]]

abstracting: (1<=p188)
states: 812,694,224,023 (11)
abstracting: (p188<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p192)
states: 5,055,422,070,772 (12)
abstracting: (p192<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p12)
states: 459,379,921,544 (11)
abstracting: (p12<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p112)
states: 2,677,717,524,813 (12)
abstracting: (p112<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p114)
states: 5,285,129,563,984 (12)
abstracting: (p114<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p169)
states: 514,402,359,881 (11)
abstracting: (p169<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p172)
states: 659,581,848,390 (11)
abstracting: (p172<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p188)
states: 812,694,224,023 (11)
abstracting: (p188<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p192)
states: 5,055,422,070,772 (12)
abstracting: (p192<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p169)
states: 514,402,359,881 (11)
abstracting: (p169<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p172)
states: 659,581,848,390 (11)
abstracting: (p172<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p169)
states: 514,402,359,881 (11)
abstracting: (p169<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p172)
states: 659,581,848,390 (11)
abstracting: (p172<=1)
states: 7,969,347,823,493 (12)
.....
before gc: list nodes free: 5329182

after gc: idd nodes used:7730577, unused:56269423; list nodes free:256686045
.MC time: 2m43.354sec

checking: A [~ [[AG [[[[p57<=1 & 1<=p57] & [p109<=1 & 1<=p109]] & [[p40<=1 & 1<=p40] & [p189<=1 & 1<=p189]]]] & [[p23<=1 & 1<=p23] & [p189<=1 & 1<=p189]]]] U ~ [[[[p149<=1 & 1<=p149] & [p165<=1 & 1<=p165]] | [[[p75<=1 & 1<=p75] & [p85<=1 & 1<=p85]] | ~ [[[p171<=1 & 1<=p171] & [p176<=1 & 1<=p176]]]]]]]
normalized: [~ [EG [[[~ [[[p176<=1 & 1<=p176] & [p171<=1 & 1<=p171]]] | [[p85<=1 & 1<=p85] & [p75<=1 & 1<=p75]]] | [[p165<=1 & 1<=p165] & [p149<=1 & 1<=p149]]]]] & ~ [E [[[~ [[[p176<=1 & 1<=p176] & [p171<=1 & 1<=p171]]] | [[p85<=1 & 1<=p85] & [p75<=1 & 1<=p75]]] | [[p165<=1 & 1<=p165] & [p149<=1 & 1<=p149]]] U [[[[p189<=1 & 1<=p189] & [p23<=1 & 1<=p23]] & ~ [E [true U ~ [[[[p189<=1 & 1<=p189] & [p40<=1 & 1<=p40]] & [[p109<=1 & 1<=p109] & [p57<=1 & 1<=p57]]]]]]] & [[~ [[[p176<=1 & 1<=p176] & [p171<=1 & 1<=p171]]] | [[p85<=1 & 1<=p85] & [p75<=1 & 1<=p75]]] | [[p165<=1 & 1<=p165] & [p149<=1 & 1<=p149]]]]]]]

abstracting: (1<=p149)
states: 5,030,738,730,184 (12)
abstracting: (p149<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p165)
states: 2,660,803,732,557 (12)
abstracting: (p165<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p75)
states: 459,379,921,544 (11)
abstracting: (p75<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p85)
states: 2,651,747,218,404 (12)
abstracting: (p85<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p171)
states: 7,309,765,975,102 (12)
abstracting: (p171<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p176)
states: 180,161,863,630 (11)
abstracting: (p176<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p57)
states: 419,493,839,120 (11)
abstracting: (p57<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p109)
states: 4,089,547,371,526 (12)
abstracting: (p109<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p40)
states: 7,212,658,118 (9)
abstracting: (p40<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p189)
states: 1,406,063,598,185 (12)
abstracting: (p189<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p23)
states: 459,379,525,316 (11)
abstracting: (p23<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p189)
states: 1,406,063,598,185 (12)
abstracting: (p189<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p149)
states: 5,030,738,730,184 (12)
abstracting: (p149<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p165)
states: 2,660,803,732,557 (12)
abstracting: (p165<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p75)
states: 459,379,921,544 (11)
abstracting: (p75<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p85)
states: 2,651,747,218,404 (12)
abstracting: (p85<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p171)
states: 7,309,765,975,102 (12)
abstracting: (p171<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p176)
states: 180,161,863,630 (11)
abstracting: (p176<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p149)
states: 5,030,738,730,184 (12)
abstracting: (p149<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p165)
states: 2,660,803,732,557 (12)
abstracting: (p165<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p75)
states: 459,379,921,544 (11)
abstracting: (p75<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p85)
states: 2,651,747,218,404 (12)
abstracting: (p85<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p171)
states: 7,309,765,975,102 (12)
abstracting: (p171<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p176)
states: 180,161,863,630 (11)
abstracting: (p176<=1)
states: 7,969,347,823,493 (12)
...........
before gc: list nodes free: 4846886

after gc: idd nodes used:5818304, unused:58181696; list nodes free:265337129
.......................
EG iterations: 34
-> the formula is FALSE

FORMULA DES-PT-20a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 1.482sec

checking: [AG [A [EX [[[p107<=1 & 1<=p107] & [p86<=1 & 1<=p86]]] U [[p45<=1 & 1<=p45] & [p109<=1 & 1<=p109]]]] | EF [AG [[E [[[p125<=1 & 1<=p125] & [p142<=1 & 1<=p142]] U ~ [[[p75<=1 & 1<=p75] & [p85<=1 & 1<=p85]]]] | E [~ [[[p86<=1 & 1<=p86] & [p107<=1 & 1<=p107]]] U ~ [[[p17<=1 & 1<=p17] & [[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]]]]]]]]]
normalized: [~ [E [true U ~ [[~ [EG [~ [[[p109<=1 & 1<=p109] & [p45<=1 & 1<=p45]]]]] & ~ [E [~ [[[p109<=1 & 1<=p109] & [p45<=1 & 1<=p45]]] U [~ [EX [[[p86<=1 & 1<=p86] & [p107<=1 & 1<=p107]]]] & ~ [[[p109<=1 & 1<=p109] & [p45<=1 & 1<=p45]]]]]]]]]] | E [true U ~ [E [true U ~ [[E [[[p142<=1 & 1<=p142] & [p125<=1 & 1<=p125]] U ~ [[[p85<=1 & 1<=p85] & [p75<=1 & 1<=p75]]]] | E [~ [[[p107<=1 & 1<=p107] & [p86<=1 & 1<=p86]]] U ~ [[[[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]] & [p17<=1 & 1<=p17]]]]]]]]]]

abstracting: (1<=p17)
states: 456,255,601,862 (11)
abstracting: (p17<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p112)
states: 2,677,717,524,813 (12)
abstracting: (p112<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p114)
states: 5,285,129,563,984 (12)
abstracting: (p114<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p86)
states: 2,651,747,218,400 (12)
abstracting: (p86<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p107)
states: 4,003,161,498,637 (12)
abstracting: (p107<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p75)
states: 459,379,921,544 (11)
abstracting: (p75<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p85)
states: 2,651,747,218,404 (12)
abstracting: (p85<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p125)
states: 5,030,738,730,184 (12)
abstracting: (p125<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p142)
states: 2,938,609,093,308 (12)
abstracting: (p142<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p45)
states: 419,493,839,120 (11)
abstracting: (p45<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p109)
states: 4,089,547,371,526 (12)
abstracting: (p109<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p107)
states: 4,003,161,498,637 (12)
abstracting: (p107<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p86)
states: 2,651,747,218,400 (12)
abstracting: (p86<=1)
states: 7,969,347,823,493 (12)
.abstracting: (1<=p45)
states: 419,493,839,120 (11)
abstracting: (p45<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p109)
states: 4,089,547,371,526 (12)
abstracting: (p109<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p45)
states: 419,493,839,120 (11)
abstracting: (p45<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p109)
states: 4,089,547,371,526 (12)
abstracting: (p109<=1)
states: 7,969,347,823,493 (12)

before gc: list nodes free: 4277227

after gc: idd nodes used:6035169, unused:57964831; list nodes free:264320450
.
EG iterations: 1
-> the formula is TRUE

FORMULA DES-PT-20a-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m30.243sec

checking: AF [[[[p111<=1 & 1<=p111] & [p174<=1 & 1<=p174]] & [[EG [[[p45<=1 & 1<=p45] & [p109<=1 & 1<=p109]]] | [~ [E [[[p171<=1 & 1<=p171] & [p180<=1 & 1<=p180]] U [[p3<=1 & 1<=p3] & [[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]]]]] & [AG [[[p66<=0 & 0<=p66] | [p85<=0 & 0<=p85]]] & [[[p89<=0 & 0<=p89] | [p173<=0 & 0<=p173]] | [[p58<=0 & 0<=p58] | [p109<=0 & 0<=p109]]]]]] & [[p73<=0 & 0<=p73] | [p85<=0 & 0<=p85]]]]]
normalized: ~ [EG [~ [[[[[p85<=0 & 0<=p85] | [p73<=0 & 0<=p73]] & [[[[[[p109<=0 & 0<=p109] | [p58<=0 & 0<=p58]] | [[p173<=0 & 0<=p173] | [p89<=0 & 0<=p89]]] & ~ [E [true U ~ [[[p85<=0 & 0<=p85] | [p66<=0 & 0<=p66]]]]]] & ~ [E [[[p180<=1 & 1<=p180] & [p171<=1 & 1<=p171]] U [[[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]] & [p3<=1 & 1<=p3]]]]] | EG [[[p109<=1 & 1<=p109] & [p45<=1 & 1<=p45]]]]] & [[p174<=1 & 1<=p174] & [p111<=1 & 1<=p111]]]]]]

abstracting: (1<=p111)
states: 5,291,630,298,679 (12)
abstracting: (p111<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p174)
states: 149,419,041,611 (11)
abstracting: (p174<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p45)
states: 419,493,839,120 (11)
abstracting: (p45<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p109)
states: 4,089,547,371,526 (12)
abstracting: (p109<=1)
states: 7,969,347,823,493 (12)
.............
before gc: list nodes free: 6186986

after gc: idd nodes used:8635442, unused:55364558; list nodes free:252518303
..MC time: 2m33.210sec

checking: E [~ [[[[[p175<=1 & 1<=p175] & [p190<=1 & 1<=p190]] | EX [[[p119<=1 & 1<=p119] & [p136<=1 & 1<=p136]]]] & A [[EX [[[p182<=1 & 1<=p182] & [p188<=1 & 1<=p188]]] | [EX [[[p178<=1 & 1<=p178] & [p188<=1 & 1<=p188]]] | A [[[p86<=1 & 1<=p86] & [p107<=1 & 1<=p107]] U [[p41<=1 & 1<=p41] & [p109<=1 & 1<=p109]]]]] U [[EG [[[p123<=1 & 1<=p123] & [p140<=1 & 1<=p140]]] & EX [[[p98<=1 & 1<=p98] & [p100<=1 & 1<=p100]]]] & [[p101<=1 & 1<=p101] & [[p106<=1 & 1<=p106] & [p108<=1 & 1<=p108]]]]]]] U [[p12<=1 & 1<=p12] & [[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]]]]
normalized: E [~ [[[~ [EG [~ [[[[[p108<=1 & 1<=p108] & [p106<=1 & 1<=p106]] & [p101<=1 & 1<=p101]] & [EX [[[p100<=1 & 1<=p100] & [p98<=1 & 1<=p98]]] & EG [[[p140<=1 & 1<=p140] & [p123<=1 & 1<=p123]]]]]]]] & ~ [E [~ [[[[[p108<=1 & 1<=p108] & [p106<=1 & 1<=p106]] & [p101<=1 & 1<=p101]] & [EX [[[p100<=1 & 1<=p100] & [p98<=1 & 1<=p98]]] & EG [[[p140<=1 & 1<=p140] & [p123<=1 & 1<=p123]]]]]] U [~ [[[[~ [EG [~ [[[p109<=1 & 1<=p109] & [p41<=1 & 1<=p41]]]]] & ~ [E [~ [[[p109<=1 & 1<=p109] & [p41<=1 & 1<=p41]]] U [~ [[[p107<=1 & 1<=p107] & [p86<=1 & 1<=p86]]] & ~ [[[p109<=1 & 1<=p109] & [p41<=1 & 1<=p41]]]]]]] | EX [[[p188<=1 & 1<=p188] & [p178<=1 & 1<=p178]]]] | EX [[[p188<=1 & 1<=p188] & [p182<=1 & 1<=p182]]]]] & ~ [[[[[p108<=1 & 1<=p108] & [p106<=1 & 1<=p106]] & [p101<=1 & 1<=p101]] & [EX [[[p100<=1 & 1<=p100] & [p98<=1 & 1<=p98]]] & EG [[[p140<=1 & 1<=p140] & [p123<=1 & 1<=p123]]]]]]]]]] & [EX [[[p136<=1 & 1<=p136] & [p119<=1 & 1<=p119]]] | [[p190<=1 & 1<=p190] & [p175<=1 & 1<=p175]]]]] U [[[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]] & [p12<=1 & 1<=p12]]]

abstracting: (1<=p12)
states: 459,379,921,544 (11)
abstracting: (p12<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p114)
states: 5,285,129,563,984 (12)
abstracting: (p114<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p112)
states: 2,677,717,524,813 (12)
abstracting: (p112<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p175)
states: 1,388,737,870,011 (12)
abstracting: (p175<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p190)
states: 1,432,745,099,519 (12)
abstracting: (p190<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p119)
states: 5,030,738,730,184 (12)
abstracting: (p119<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p136)
states: 2,938,609,093,308 (12)
abstracting: (p136<=1)
states: 7,969,347,823,493 (12)
.abstracting: (1<=p123)
states: 5,030,738,730,184 (12)
abstracting: (p123<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p140)
states: 2,938,609,093,308 (12)
abstracting: (p140<=1)
states: 7,969,347,823,493 (12)

before gc: list nodes free: 2650187

after gc: idd nodes used:7907915, unused:56092085; list nodes free:255693897
.......MC time: 2m21.106sec

checking: E [[[p55<=1 & 1<=p55] & [p109<=1 & 1<=p109]] U [AF [[EX [[[p91<=1 & 1<=p91] & [p184<=1 & 1<=p184]]] & [E [[[p6<=1 & 1<=p6] & [[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]]] U [[p52<=1 & 1<=p52] & [p109<=1 & 1<=p109]]] & EG [~ [[[p20<=1 & 1<=p20] & [[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]]]]]]]] & [AX [~ [AF [[[p40<=1 & 1<=p40] & [p189<=1 & 1<=p189]]]]] & [~ [EG [[[[p101<=1 & 1<=p101] & [[p106<=1 & 1<=p106] & [p108<=1 & 1<=p108]]] | [p86<=1 & 1<=p86]]]] | ~ [[[AX [[[p92<=1 & 1<=p92] & [p99<=1 & 1<=p99]]] | AX [[p96<=1 & 1<=p96]]] & ~ [EG [[[p171<=1 & 1<=p171] & [p180<=1 & 1<=p180]]]]]]]]]]
normalized: E [[[p109<=1 & 1<=p109] & [p55<=1 & 1<=p55]] U [[[~ [[[~ [EX [~ [[[p92<=1 & 1<=p92] & [p99<=1 & 1<=p99]]]]] | ~ [EX [~ [[p96<=1 & 1<=p96]]]]] & ~ [EG [[[p180<=1 & 1<=p180] & [p171<=1 & 1<=p171]]]]]] | ~ [EG [[[p86<=1 & 1<=p86] | [[[p108<=1 & 1<=p108] & [p106<=1 & 1<=p106]] & [p101<=1 & 1<=p101]]]]]] & ~ [EX [~ [EG [~ [[[p189<=1 & 1<=p189] & [p40<=1 & 1<=p40]]]]]]]] & ~ [EG [~ [[[EG [~ [[[[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]] & [p20<=1 & 1<=p20]]]] & E [[[[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]] & [p6<=1 & 1<=p6]] U [[p109<=1 & 1<=p109] & [p52<=1 & 1<=p52]]]] & EX [[[p184<=1 & 1<=p184] & [p91<=1 & 1<=p91]]]]]]]]]

abstracting: (1<=p91)
states: 2,891,567,872,209 (12)
abstracting: (p91<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p184)
states: 1,334,255,201,605 (12)
abstracting: (p184<=1)
states: 7,969,347,823,493 (12)

before gc: list nodes free: 3665586

after gc: idd nodes used:7581928, unused:56418072; list nodes free:257271021
.abstracting: (1<=p52)
states: 419,493,839,120 (11)
abstracting: (p52<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p109)
states: 4,089,547,371,526 (12)
abstracting: (p109<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p6)
states: 459,379,921,544 (11)
abstracting: (p6<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p112)
states: 2,677,717,524,813 (12)
abstracting: (p112<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p114)
states: 5,285,129,563,984 (12)
abstracting: (p114<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p20)
states: 193,278,361,944 (11)
abstracting: (p20<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p112)
states: 2,677,717,524,813 (12)
abstracting: (p112<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p114)
states: 5,285,129,563,984 (12)
abstracting: (p114<=1)
states: 7,969,347,823,493 (12)
........MC time: 2m 9.013sec

checking: AF [[[EF [EX [[[p135<=1 & 1<=p135] & [p151<=1 & 1<=p151]]]] & ~ [E [[[p17<=1 & 1<=p17] & [[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]]] U [[p117<=1 & 1<=p117] & [p186<=1 & 1<=p186]]]]] & [EG [[[p49<=1 & 1<=p49] & [p109<=1 & 1<=p109]]] & [[AG [[[p111<=1 & 1<=p111] & [p174<=1 & 1<=p174]]] | [[p101<=1 & 1<=p101] & [[p106<=1 & 1<=p106] & [p108<=1 & 1<=p108]]]] & [[p91<=0 & 0<=p91] | [[p184<=0 & 0<=p184] | [[p82<=1 & 1<=p82] & [[p94<=1 & 1<=p94] & [[EG [AF [[[p96<=1 & 1<=p96] & [p97<=1 & 1<=p97]]]] | [p31<=0 & 0<=p31]] | [[p189<=0 & 0<=p189] | [[p102<=1 & 1<=p102] & [p104<=1 & 1<=p104]]]]]]]]]]]]
normalized: ~ [EG [~ [[[[[~ [E [true U ~ [[[p174<=1 & 1<=p174] & [p111<=1 & 1<=p111]]]]] | [[[p108<=1 & 1<=p108] & [p106<=1 & 1<=p106]] & [p101<=1 & 1<=p101]]] & [[[[[[[p31<=0 & 0<=p31] | EG [~ [EG [~ [[[p97<=1 & 1<=p97] & [p96<=1 & 1<=p96]]]]]]] | [[[p102<=1 & 1<=p102] & [p104<=1 & 1<=p104]] | [p189<=0 & 0<=p189]]] & [p94<=1 & 1<=p94]] & [p82<=1 & 1<=p82]] | [p184<=0 & 0<=p184]] | [p91<=0 & 0<=p91]]] & EG [[[p109<=1 & 1<=p109] & [p49<=1 & 1<=p49]]]] & [~ [E [[[[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]] & [p17<=1 & 1<=p17]] U [[p186<=1 & 1<=p186] & [p117<=1 & 1<=p117]]]] & E [true U EX [[[p151<=1 & 1<=p151] & [p135<=1 & 1<=p135]]]]]]]]]

abstracting: (1<=p135)
states: 5,030,738,730,184 (12)
abstracting: (p135<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p151)
states: 2,660,803,732,557 (12)
abstracting: (p151<=1)
states: 7,969,347,823,493 (12)
.
before gc: list nodes free: 3440172

after gc: idd nodes used:8796951, unused:55203049; list nodes free:251791324
MC time: 1m58.243sec

checking: [E [~ [A [AF [[[[p116<=1 & 1<=p116] & [[p118<=1 & 1<=p118] & [p175<=1 & 1<=p175]]] | [[p86<=1 & 1<=p86] & [p107<=1 & 1<=p107]]]] U [[p101<=1 & 1<=p101] & [[p106<=1 & 1<=p106] & [p108<=1 & 1<=p108]]]]] U [[p89<=1 & 1<=p89] & [p173<=1 & 1<=p173]]] | AF [[[[p3<=1 & 1<=p3] & [[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]]] | [AG [[[[[[[p115<=1 & 1<=p115] & [p120<=1 & 1<=p120]] & [[p122<=1 & 1<=p122] & [p124<=1 & 1<=p124]]] & [[[p126<=1 & 1<=p126] & [p128<=1 & 1<=p128]] & [[p130<=1 & 1<=p130] & [[p132<=1 & 1<=p132] & [p134<=1 & 1<=p134]]]]] | [[p131<=1 & 1<=p131] & [p148<=1 & 1<=p148]]] & AX [[[p53<=1 & 1<=p53] & [p109<=1 & 1<=p109]]]]] | EX [[[[p27<=1 & 1<=p27] & [p189<=1 & 1<=p189]] | [[[p4<=1 & 1<=p4] & [[p112<=1 & 1<=p112] & [p114<=1 & 1<=p114]]] | [[[p86<=1 & 1<=p86] & [p107<=1 & 1<=p107]] & [[p143<=1 & 1<=p143] & [p159<=1 & 1<=p159]]]]]]]]]]
normalized: [~ [EG [~ [[[EX [[[[[p4<=1 & 1<=p4] & [[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]]] | [[[p159<=1 & 1<=p159] & [p143<=1 & 1<=p143]] & [[p107<=1 & 1<=p107] & [p86<=1 & 1<=p86]]]] | [[p189<=1 & 1<=p189] & [p27<=1 & 1<=p27]]]] | ~ [E [true U ~ [[~ [EX [~ [[[p109<=1 & 1<=p109] & [p53<=1 & 1<=p53]]]]] & [[[p148<=1 & 1<=p148] & [p131<=1 & 1<=p131]] | [[[[[p134<=1 & 1<=p134] & [p132<=1 & 1<=p132]] & [p130<=1 & 1<=p130]] & [[p128<=1 & 1<=p128] & [p126<=1 & 1<=p126]]] & [[[p124<=1 & 1<=p124] & [p122<=1 & 1<=p122]] & [[p120<=1 & 1<=p120] & [p115<=1 & 1<=p115]]]]]]]]]] | [[[p114<=1 & 1<=p114] & [p112<=1 & 1<=p112]] & [p3<=1 & 1<=p3]]]]]] | E [~ [[~ [EG [~ [[[[p108<=1 & 1<=p108] & [p106<=1 & 1<=p106]] & [p101<=1 & 1<=p101]]]]] & ~ [E [~ [[[[p108<=1 & 1<=p108] & [p106<=1 & 1<=p106]] & [p101<=1 & 1<=p101]]] U [EG [~ [[[[p107<=1 & 1<=p107] & [p86<=1 & 1<=p86]] | [[[p175<=1 & 1<=p175] & [p118<=1 & 1<=p118]] & [p116<=1 & 1<=p116]]]]] & ~ [[[[p108<=1 & 1<=p108] & [p106<=1 & 1<=p106]] & [p101<=1 & 1<=p101]]]]]]]] U [[p173<=1 & 1<=p173] & [p89<=1 & 1<=p89]]]]

abstracting: (1<=p89)
states: 5,216,034,207,963 (12)
abstracting: (p89<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p173)
states: 849,529,305,817 (11)
abstracting: (p173<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p101)
states: 2,026,843,567,918 (12)
abstracting: (p101<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p106)
states: 4,207,508,779,554 (12)
abstracting: (p106<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p108)
states: 3,966,186,324,855 (12)
abstracting: (p108<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p116)
states: 624,269,451,191 (11)
abstracting: (p116<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p118)
states: 5,057,124,943,011 (12)
abstracting: (p118<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p175)
states: 1,388,737,870,011 (12)
abstracting: (p175<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p86)
states: 2,651,747,218,400 (12)
abstracting: (p86<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p107)
states: 4,003,161,498,637 (12)
abstracting: (p107<=1)
states: 7,969,347,823,493 (12)
....
before gc: list nodes free: 2943575

after gc: idd nodes used:14846495, unused:49153505; list nodes free:224314272
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5995804 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16097440 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

828394 900589
iterations count:242391 (1756), effective:23516 (170)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 254 sec


net_ddint.h:600: Timeout: after 235 sec


sat_reach.icc:155: Timeout: after 218 sec


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

ctl_mc.icc:221: Timeout: after 203 sec


sat_reach.icc:155: Timeout: after 188 sec

838659
iterations count:121162 (877), effective:11310 (81)

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

net_ddint.h:600: Timeout: after 174 sec


iterations count:1876 (13), effective:151 (1)

iterations count:1823 (13), effective:144 (1)

net_ddint.h:600: Timeout: after 162 sec


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

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

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

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

iterations count:2439 (17), effective:310 (2)

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

net_ddint.h:600: Timeout: after 152 sec


net_ddint.h:600: Timeout: after 140 sec


iterations count:18081 (131), effective:2030 (14)

net_ddint.h:600: Timeout: after 128 sec


sat_reach.icc:155: Timeout: after 117 sec


net_ddint.h:600: Timeout: after 107 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-20a"
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-20a, 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-167814482700426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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