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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.5K Feb 26 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m06-CTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678349348150

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=DBSingleClientW-PT-d0m06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 08:09:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:09:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:09:09] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-09 08:09:09] [INFO ] Transformed 553 places.
[2023-03-09 08:09:09] [INFO ] Transformed 150 transitions.
[2023-03-09 08:09:09] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Support contains 69 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 99 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 99 transition count 136
Applied a total of 24 rules in 16 ms. Remains 99 /109 variables (removed 10) and now considering 136/150 (removed 14) transitions.
// Phase 1: matrix 136 rows 99 cols
[2023-03-09 08:09:09] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-09 08:09:10] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-09 08:09:10] [INFO ] Invariant cache hit.
[2023-03-09 08:09:10] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-09 08:09:10] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2023-03-09 08:09:10] [INFO ] Invariant cache hit.
[2023-03-09 08:09:10] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 136/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 99/109 places, 136/150 transitions.
Support contains 69 out of 99 places after structural reductions.
[2023-03-09 08:09:10] [INFO ] Flatten gal took : 33 ms
[2023-03-09 08:09:10] [INFO ] Flatten gal took : 13 ms
[2023-03-09 08:09:10] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 68 out of 99 places (down from 69) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 68) seen :25
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :3
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 112 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :5
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 111 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 152 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :3
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 108 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-09 08:09:11] [INFO ] Invariant cache hit.
[2023-03-09 08:09:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 08:09:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:09:11] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:31
[2023-03-09 08:09:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 08:09:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:09:12] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :30
[2023-03-09 08:09:12] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-09 08:09:12] [INFO ] After 450ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :2 sat :30
[2023-03-09 08:09:13] [INFO ] After 1052ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :30
Attempting to minimize the solution found.
Minimization took 472 ms.
[2023-03-09 08:09:13] [INFO ] After 2186ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :30
Fused 32 Parikh solutions to 30 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 40 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 93 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 93 transition count 130
Applied a total of 12 rules in 20 ms. Remains 93 /99 variables (removed 6) and now considering 130/136 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 93/99 places, 130/136 transitions.
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 112 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :2
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 153 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 111 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 130 rows 93 cols
[2023-03-09 08:09:14] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 08:09:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 08:09:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 08:09:14] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-09 08:09:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 08:09:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:09:15] [INFO ] After 293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-09 08:09:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-09 08:09:15] [INFO ] After 348ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-09 08:09:15] [INFO ] After 823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-09 08:09:16] [INFO ] After 1573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 178 ms.
Support contains 34 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 130/130 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 93/93 places, 130/130 transitions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 113 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 149 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 111 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 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 96 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 103 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Finished probabilistic random walk after 57599 steps, run visited all 24 properties in 187 ms. (steps per millisecond=308 )
Probabilistic random walk after 57599 steps, saw 24990 distinct states, run finished after 187 ms. (steps per millisecond=308 ) properties seen :24
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 11 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 10 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 65 out of 99 places (down from 67) after GAL structural reductions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 330 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 63 transition count 73
Applied a total of 78 rules in 22 ms. Remains 63 /99 variables (removed 36) and now considering 73/136 (removed 63) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 63/99 places, 73/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 95
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 77 transition count 94
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 66 transition count 83
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 63 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 62 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 62 transition count 71
Applied a total of 80 rules in 18 ms. Remains 62 /99 variables (removed 37) and now considering 71/136 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 62/99 places, 71/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 79 transition count 100
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 79 transition count 100
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 69 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 69 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 67 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 67 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 66 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 65 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 65 transition count 78
Applied a total of 73 rules in 10 ms. Remains 65 /99 variables (removed 34) and now considering 78/136 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 65/99 places, 78/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 100
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 80 transition count 99
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 70 transition count 89
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 70 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 67 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 67 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 65 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 65 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 62 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 62 transition count 73
Applied a total of 79 rules in 9 ms. Remains 62 /99 variables (removed 37) and now considering 73/136 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 62/99 places, 73/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 102
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 72 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 72 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 72 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 70 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 70 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 70 transition count 88
Applied a total of 61 rules in 4 ms. Remains 70 /99 variables (removed 29) and now considering 88/136 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 70/99 places, 88/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 80 transition count 101
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 71 transition count 92
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 71 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 69 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 67 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 66 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 66 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 66 transition count 82
Applied a total of 69 rules in 5 ms. Remains 66 /99 variables (removed 33) and now considering 82/136 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 66/99 places, 82/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 95
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 77 transition count 94
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 66 transition count 83
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 58 transition count 64
Applied a total of 90 rules in 14 ms. Remains 58 /99 variables (removed 41) and now considering 64/136 (removed 72) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 58/99 places, 64/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 107
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 107
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 73 transition count 98
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 73 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 73 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 71 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 71 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 70 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 70 transition count 90
Applied a total of 60 rules in 10 ms. Remains 70 /99 variables (removed 29) and now considering 90/136 (removed 46) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 70/99 places, 90/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 106
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 82 transition count 105
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 74 transition count 97
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 74 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 74 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 73 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 73 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 72 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 72 transition count 92
Applied a total of 57 rules in 11 ms. Remains 72 /99 variables (removed 27) and now considering 92/136 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 72/99 places, 92/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 108
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 82 transition count 107
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 74 transition count 99
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 74 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 74 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 73 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 73 transition count 96
Applied a total of 55 rules in 4 ms. Remains 73 /99 variables (removed 26) and now considering 96/136 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 73/99 places, 96/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 100
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 80 transition count 99
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 71 transition count 90
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 70 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 69 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 69 transition count 87
Applied a total of 61 rules in 4 ms. Remains 69 /99 variables (removed 30) and now considering 87/136 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/99 places, 87/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 84 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 84 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 84 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 80 transition count 107
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 80 transition count 107
Applied a total of 40 rules in 3 ms. Remains 80 /99 variables (removed 19) and now considering 107/136 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 80/99 places, 107/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 106
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 82 transition count 105
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 75 transition count 98
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 75 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 75 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 74 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 74 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 74 transition count 93
Applied a total of 54 rules in 6 ms. Remains 74 /99 variables (removed 25) and now considering 93/136 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 74/99 places, 93/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 67 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 67 transition count 82
Applied a total of 67 rules in 3 ms. Remains 67 /99 variables (removed 32) and now considering 82/136 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 67/99 places, 82/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 67 transition count 84
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 62 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 59 transition count 65
Applied a total of 88 rules in 14 ms. Remains 59 /99 variables (removed 40) and now considering 65/136 (removed 71) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 59/99 places, 65/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 108
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 82 transition count 107
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 74 transition count 99
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 71 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 71 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 71 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 69 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 69 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 67 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 67 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 66 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 66 transition count 83
Applied a total of 71 rules in 6 ms. Remains 66 /99 variables (removed 33) and now considering 83/136 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 66/99 places, 83/136 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:09:17] [INFO ] Input system was already deterministic with 83 transitions.
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:09:17] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-09 08:09:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 136 transitions and 532 arcs took 1 ms.
Total runtime 8142 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: 99 NrTr: 136 NrArc: 532)

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

net check time: 0m 0.000sec

init dd package: 0m 2.752sec


RS generation: 0m 8.245sec


-> reachability set: #nodes 11872 (1.2e+04) #states 2,120,881 (6)



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

checking: AF [AG [EF [[1<=p1 & 1<=p78]]]]
normalized: ~ [EG [E [true U ~ [E [true U [1<=p1 & 1<=p78]]]]]]

abstracting: (1<=p78)
states: 313,778 (5)
abstracting: (1<=p1)
states: 396,972 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.681sec

checking: EF [AG [[1<=p6 & 1<=p38]]]
normalized: E [true U ~ [E [true U ~ [[1<=p6 & 1<=p38]]]]]

abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p6)
states: 26,415 (4)
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [~ [A [~ [[1<=p85 & 1<=p1]] U [1<=p1 & 1<=p77]]]]
normalized: E [true U ~ [[~ [EG [~ [[1<=p1 & 1<=p77]]]] & ~ [E [~ [[1<=p1 & 1<=p77]] U [[1<=p85 & 1<=p1] & ~ [[1<=p1 & 1<=p77]]]]]]]]

abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p85)
states: 184,590 (5)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
..
EG iterations: 2
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.121sec

checking: AG [~ [A [AF [[1<=p16 & 1<=p51]] U ~ [EF [AG [[1<=p1 & 1<=p47]]]]]]]
normalized: ~ [E [true U [~ [EG [E [true U ~ [E [true U ~ [[1<=p1 & 1<=p47]]]]]]] & ~ [E [E [true U ~ [E [true U ~ [[1<=p1 & 1<=p47]]]]] U [EG [~ [[1<=p16 & 1<=p51]]] & E [true U ~ [E [true U ~ [[1<=p1 & 1<=p47]]]]]]]]]]]

abstracting: (1<=p47)
states: 128,388 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p51)
states: 145,461 (5)
abstracting: (1<=p16)
states: 44,529 (4)
.
EG iterations: 1
abstracting: (1<=p47)
states: 128,388 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p47)
states: 128,388 (5)
abstracting: (1<=p1)
states: 396,972 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

checking: [AX [EG [AG [AX [[1<=p1 & 1<=p45]]]]] | EG [[EF [[p1<=0 | p79<=0]] | AF [[1<=p24 & 1<=p38]]]]]
normalized: [EG [[~ [EG [~ [[1<=p24 & 1<=p38]]]] | E [true U [p1<=0 | p79<=0]]]] | ~ [EX [~ [EG [~ [E [true U EX [~ [[1<=p1 & 1<=p45]]]]]]]]]]

abstracting: (1<=p45)
states: 7,493 (3)
abstracting: (1<=p1)
states: 396,972 (5)
..
EG iterations: 1
.abstracting: (p79<=0)
states: 1,932,446 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p24)
states: 73,140 (4)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.545sec

checking: EF [[EG [[[p1<=0 | p80<=0] | [p1<=0 | p78<=0]]] & EX [[EX [[p1<=0 | p86<=0]] & [p18<=0 | p51<=0]]]]]
normalized: E [true U [EX [[[p18<=0 | p51<=0] & EX [[p1<=0 | p86<=0]]]] & EG [[[p1<=0 | p78<=0] | [p1<=0 | p80<=0]]]]]

abstracting: (p80<=0)
states: 1,932,446 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (p78<=0)
states: 1,807,103 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
..
EG iterations: 2
abstracting: (p86<=0)
states: 1,936,291 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
.abstracting: (p51<=0)
states: 1,975,420 (6)
abstracting: (p18<=0)
states: 2,076,352 (6)
.-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.662sec

checking: EX [~ [A [AF [AX [[1<=p51 & 1<=p20]]] U [[~ [EX [[1<=p10 & 1<=p66]]] & ~ [[1<=p1 & 1<=p73]]] & [1<=p33 & 1<=p60]]]]]
normalized: EX [~ [[~ [EG [~ [[[~ [EX [[1<=p10 & 1<=p66]]] & ~ [[1<=p1 & 1<=p73]]] & [1<=p33 & 1<=p60]]]]] & ~ [E [~ [[[~ [EX [[1<=p10 & 1<=p66]]] & ~ [[1<=p1 & 1<=p73]]] & [1<=p33 & 1<=p60]]] U [~ [[[~ [EX [[1<=p10 & 1<=p66]]] & ~ [[1<=p1 & 1<=p73]]] & [1<=p33 & 1<=p60]]] & EG [EX [~ [[1<=p51 & 1<=p20]]]]]]]]]]

abstracting: (1<=p20)
states: 44,529 (4)
abstracting: (1<=p51)
states: 145,461 (5)
..................
EG iterations: 17
abstracting: (1<=p60)
states: 145,560 (5)
abstracting: (1<=p33)
states: 45,003 (4)
abstracting: (1<=p73)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p66)
states: 315,678 (5)
abstracting: (1<=p10)
states: 43,748 (4)
.abstracting: (1<=p60)
states: 145,560 (5)
abstracting: (1<=p33)
states: 45,003 (4)
abstracting: (1<=p73)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p66)
states: 315,678 (5)
abstracting: (1<=p10)
states: 43,748 (4)
.abstracting: (1<=p60)
states: 145,560 (5)
abstracting: (1<=p33)
states: 45,003 (4)
abstracting: (1<=p73)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p66)
states: 315,678 (5)
abstracting: (1<=p10)
states: 43,748 (4)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.372sec

checking: EX [[AF [[[1<=p2 & 1<=p91] | [1<=p15 & 1<=p38]]] | [[1<=p0 & 1<=p38] | [EG [E [[1<=p1 & 1<=p42] U [1<=p1 & 1<=p96]]] & [1<=p8 & 1<=p64]]]]]
normalized: EX [[[[[1<=p8 & 1<=p64] & EG [E [[1<=p1 & 1<=p42] U [1<=p1 & 1<=p96]]]] | [1<=p0 & 1<=p38]] | ~ [EG [~ [[[1<=p15 & 1<=p38] | [1<=p2 & 1<=p91]]]]]]]

abstracting: (1<=p91)
states: 33,238 (4)
abstracting: (1<=p2)
states: 70,179 (4)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p15)
states: 26,415 (4)
.
EG iterations: 1
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p96)
states: 183,831 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p42)
states: 662,845 (5)
abstracting: (1<=p1)
states: 396,972 (5)
..........
EG iterations: 10
abstracting: (1<=p64)
states: 321,313 (5)
abstracting: (1<=p8)
states: 43,748 (4)
.-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.470sec

checking: AX [EF [[AG [[p36<=0 | p60<=0]] & [[~ [E [[1<=p1 & 1<=p89] U [1<=p1 & 1<=p42]]] | [1<=p1 & 1<=p71]] & [EG [[1<=p1 & 1<=p82]] | EF [[1<=p1 & 1<=p92]]]]]]]
normalized: ~ [EX [~ [E [true U [[[E [true U [1<=p1 & 1<=p92]] | EG [[1<=p1 & 1<=p82]]] & [[1<=p1 & 1<=p71] | ~ [E [[1<=p1 & 1<=p89] U [1<=p1 & 1<=p42]]]]] & ~ [E [true U ~ [[p36<=0 | p60<=0]]]]]]]]]

abstracting: (p60<=0)
states: 1,975,321 (6)
abstracting: (p36<=0)
states: 2,075,878 (6)
abstracting: (1<=p42)
states: 662,845 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p89)
states: 183,987 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p71)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p82)
states: 33,238 (4)
abstracting: (1<=p1)
states: 396,972 (5)
.........
EG iterations: 9
abstracting: (1<=p92)
states: 33,238 (4)
abstracting: (1<=p1)
states: 396,972 (5)
.-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.402sec

checking: EX [EG [[~ [A [[1<=p1 & 1<=p44] U [1<=p1 & 1<=p73]]] | [[AF [[p1<=0 | p85<=0]] & [[p1<=0 | p48<=0] & [p1<=0 | p73<=0]]] | [[p1<=0 | p80<=0] & [p22<=0 | p38<=0]]]]]]
normalized: EX [EG [[[[[p22<=0 | p38<=0] & [p1<=0 | p80<=0]] | [[[p1<=0 | p73<=0] & [p1<=0 | p48<=0]] & ~ [EG [~ [[p1<=0 | p85<=0]]]]]] | ~ [[~ [EG [~ [[1<=p1 & 1<=p73]]]] & ~ [E [~ [[1<=p1 & 1<=p73]] U [~ [[1<=p1 & 1<=p44]] & ~ [[1<=p1 & 1<=p73]]]]]]]]]]

abstracting: (1<=p73)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p44)
states: 8
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p73)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p73)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
..
EG iterations: 2
abstracting: (p85<=0)
states: 1,936,291 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
.........
EG iterations: 9
abstracting: (p48<=0)
states: 1,954,497 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (p73<=0)
states: 1,936,826 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (p80<=0)
states: 1,932,446 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (p38<=0)
states: 1,087,873 (6)
abstracting: (p22<=0)
states: 2,047,741 (6)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.559sec

checking: [EX [[[~ [A [[[1<=p1 & 1<=p89] | [1<=p1 & 1<=p50]] U ~ [[1<=p1 & 1<=p39]]]] & AG [[p1<=0 | p44<=0]]] | [AG [[1<=p28 & 1<=p38]] | AG [[[p1<=0 | p63<=0] & [p1<=0 | p59<=0]]]]]] | EG [[p1<=0 | p80<=0]]]
normalized: [EG [[p1<=0 | p80<=0]] | EX [[[~ [E [true U ~ [[[p1<=0 | p59<=0] & [p1<=0 | p63<=0]]]]] | ~ [E [true U ~ [[1<=p28 & 1<=p38]]]]] | [~ [E [true U ~ [[p1<=0 | p44<=0]]]] & ~ [[~ [EG [[1<=p1 & 1<=p39]]] & ~ [E [[1<=p1 & 1<=p39] U [~ [[[1<=p1 & 1<=p50] | [1<=p1 & 1<=p89]]] & [1<=p1 & 1<=p39]]]]]]]]]]

abstracting: (1<=p39)
states: 2
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p89)
states: 183,987 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p50)
states: 128,388 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p39)
states: 2
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p39)
states: 2
abstracting: (1<=p1)
states: 396,972 (5)
..
EG iterations: 2
abstracting: (p44<=0)
states: 2,120,873 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p28)
states: 73,140 (4)
abstracting: (p63<=0)
states: 2,015,979 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (p59<=0)
states: 1,995,123 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
.abstracting: (p80<=0)
states: 1,932,446 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
..
EG iterations: 2
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.105sec

checking: AF [[EG [EF [[[p1<=0 | p73<=0] & [p1<=0 | p54<=0]]]] & EF [[[[E [[1<=p1 & 1<=p63] U [1<=p1 & 1<=p48]] | [[1<=p1 & 1<=p90] | [1<=p6 & 1<=p38]]] & EF [[1<=p1 & 1<=p76]]] | [[1<=p1 & 1<=p89] | [1<=p25 & 1<=p38]]]]]]
normalized: ~ [EG [~ [[E [true U [[[1<=p25 & 1<=p38] | [1<=p1 & 1<=p89]] | [E [true U [1<=p1 & 1<=p76]] & [[[1<=p6 & 1<=p38] | [1<=p1 & 1<=p90]] | E [[1<=p1 & 1<=p63] U [1<=p1 & 1<=p48]]]]]] & EG [E [true U [[p1<=0 | p54<=0] & [p1<=0 | p73<=0]]]]]]]]

abstracting: (p73<=0)
states: 1,936,826 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (p54<=0)
states: 1,983,039 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)

EG iterations: 0
abstracting: (1<=p48)
states: 166,384 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p63)
states: 104,902 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p90)
states: 183,987 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p6)
states: 26,415 (4)
abstracting: (1<=p76)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p89)
states: 183,987 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p25)
states: 73,140 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.431sec

checking: A [E [~ [[[E [~ [[p1<=0 | p86<=0]] U [1<=p12 & 1<=p38]] & AX [[1<=p1 & 1<=p97]]] & [E [[1<=p6 & 1<=p38] U [1<=p1 & 1<=p43]] & [1<=p1 & 1<=p59]]]] U E [~ [[1<=p1 & 1<=p94]] U ~ [[AG [[1<=p1 & 1<=p81]] | EX [[1<=p1 & 1<=p97]]]]]] U [1<=p5 & 1<=p38]]
normalized: [~ [EG [~ [[1<=p5 & 1<=p38]]]] & ~ [E [~ [[1<=p5 & 1<=p38]] U [~ [E [~ [[[[1<=p1 & 1<=p59] & E [[1<=p6 & 1<=p38] U [1<=p1 & 1<=p43]]] & [~ [EX [~ [[1<=p1 & 1<=p97]]]] & E [~ [[p1<=0 | p86<=0]] U [1<=p12 & 1<=p38]]]]] U E [~ [[1<=p1 & 1<=p94]] U ~ [[EX [[1<=p1 & 1<=p97]] | ~ [E [true U ~ [[1<=p1 & 1<=p81]]]]]]]]] & ~ [[1<=p5 & 1<=p38]]]]]]

abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p5)
states: 26,415 (4)
abstracting: (1<=p81)
states: 33,238 (4)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p97)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
.abstracting: (1<=p94)
states: 183,831 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p12)
states: 26,415 (4)
abstracting: (p86<=0)
states: 1,936,291 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (1<=p97)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
.abstracting: (1<=p43)
states: 411,252 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p6)
states: 26,415 (4)
abstracting: (1<=p59)
states: 125,758 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p5)
states: 26,415 (4)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p5)
states: 26,415 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.276sec

checking: EG [A [~ [[[AG [[1<=p1 & 1<=p78]] | [[1<=p1 & 1<=p63] & [1<=p1 & 1<=p49]]] | [[1<=p1 & 1<=p89] | [1<=p2 & 1<=p91]]]] U [[AG [[1<=p1 & 1<=p41]] & ~ [E [[1<=p1 & 1<=p92] U [1<=p1 & 1<=p48]]]] & [~ [A [[1<=p28 & 1<=p38] U [1<=p1 & 1<=p77]]] & [1<=p1 & 1<=p73]]]]]
normalized: EG [[~ [EG [~ [[[[1<=p1 & 1<=p73] & ~ [[~ [EG [~ [[1<=p1 & 1<=p77]]]] & ~ [E [~ [[1<=p1 & 1<=p77]] U [~ [[1<=p28 & 1<=p38]] & ~ [[1<=p1 & 1<=p77]]]]]]]] & [~ [E [[1<=p1 & 1<=p92] U [1<=p1 & 1<=p48]]] & ~ [E [true U ~ [[1<=p1 & 1<=p41]]]]]]]]] & ~ [E [~ [[[[1<=p1 & 1<=p73] & ~ [[~ [EG [~ [[1<=p1 & 1<=p77]]]] & ~ [E [~ [[1<=p1 & 1<=p77]] U [~ [[1<=p28 & 1<=p38]] & ~ [[1<=p1 & 1<=p77]]]]]]]] & [~ [E [[1<=p1 & 1<=p92] U [1<=p1 & 1<=p48]]] & ~ [E [true U ~ [[1<=p1 & 1<=p41]]]]]]] U [[[[1<=p2 & 1<=p91] | [1<=p1 & 1<=p89]] | [[[1<=p1 & 1<=p49] & [1<=p1 & 1<=p63]] | ~ [E [true U ~ [[1<=p1 & 1<=p78]]]]]] & ~ [[[[1<=p1 & 1<=p73] & ~ [[~ [EG [~ [[1<=p1 & 1<=p77]]]] & ~ [E [~ [[1<=p1 & 1<=p77]] U [~ [[1<=p28 & 1<=p38]] & ~ [[1<=p1 & 1<=p77]]]]]]]] & [~ [E [[1<=p1 & 1<=p92] U [1<=p1 & 1<=p48]]] & ~ [E [true U ~ [[1<=p1 & 1<=p41]]]]]]]]]]]]

abstracting: (1<=p41)
states: 662,853 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p48)
states: 166,384 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p92)
states: 33,238 (4)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p28)
states: 73,140 (4)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
..
EG iterations: 2
abstracting: (1<=p73)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p78)
states: 313,778 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p63)
states: 104,902 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p49)
states: 117,488 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p89)
states: 183,987 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p91)
states: 33,238 (4)
abstracting: (1<=p2)
states: 70,179 (4)
abstracting: (1<=p41)
states: 662,853 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p48)
states: 166,384 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p92)
states: 33,238 (4)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p28)
states: 73,140 (4)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
..
EG iterations: 2
abstracting: (1<=p73)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p41)
states: 662,853 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p48)
states: 166,384 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p92)
states: 33,238 (4)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p28)
states: 73,140 (4)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p77)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
..
EG iterations: 2
abstracting: (1<=p73)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.090sec

checking: [E [AF [AX [AF [[1<=p1 & 1<=p83]]]] U [[~ [[p36<=0 | p60<=0]] | [EG [AX [[1<=p1 & 1<=p43]]] | E [AX [[1<=p24 & 1<=p38]] U [[1<=p1 & 1<=p97] & [1<=p1 & 1<=p96]]]]] & [1<=p1 & 1<=p98]]] | AG [[~ [E [[EF [~ [[p1<=0 | p86<=0]]] & [[1<=p37 & 1<=p61] | [1<=p15 & 1<=p38]]] U [1<=p1 & 1<=p80]]] | EG [[[p1<=0 | p96<=0] & [p1<=0 | p89<=0]]]]]]
normalized: [~ [E [true U ~ [[EG [[[p1<=0 | p89<=0] & [p1<=0 | p96<=0]]] | ~ [E [[[[1<=p15 & 1<=p38] | [1<=p37 & 1<=p61]] & E [true U ~ [[p1<=0 | p86<=0]]]] U [1<=p1 & 1<=p80]]]]]]] | E [~ [EG [EX [EG [~ [[1<=p1 & 1<=p83]]]]]] U [[1<=p1 & 1<=p98] & [[E [~ [EX [~ [[1<=p24 & 1<=p38]]]] U [[1<=p1 & 1<=p96] & [1<=p1 & 1<=p97]]] | EG [~ [EX [~ [[1<=p1 & 1<=p43]]]]]] | ~ [[p36<=0 | p60<=0]]]]]]

abstracting: (p60<=0)
states: 1,975,321 (6)
abstracting: (p36<=0)
states: 2,075,878 (6)
abstracting: (1<=p43)
states: 411,252 (5)
abstracting: (1<=p1)
states: 396,972 (5)
.........
EG iterations: 8
abstracting: (1<=p97)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p96)
states: 183,831 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p24)
states: 73,140 (4)
.abstracting: (1<=p98)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p83)
states: 33,238 (4)
abstracting: (1<=p1)
states: 396,972 (5)
..
EG iterations: 2
..................
EG iterations: 17
abstracting: (1<=p80)
states: 188,435 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (p86<=0)
states: 1,936,291 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (1<=p61)
states: 145,560 (5)
abstracting: (1<=p37)
states: 45,003 (4)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p15)
states: 26,415 (4)
abstracting: (p96<=0)
states: 1,937,050 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
abstracting: (p89<=0)
states: 1,936,894 (6)
abstracting: (p1<=0)
states: 1,723,909 (6)
..
EG iterations: 2
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.445sec

checking: E [AF [[[EX [[1<=p1 & 1<=p63]] | EG [[[1<=p1 & 1<=p43] & [1<=p1 & 1<=p73]]]] | [[~ [[[1<=p1 & 1<=p78] | [1<=p6 & 1<=p38]]] & A [[1<=p1 & 1<=p48] U [1<=p1 & 1<=p98]]] | [[~ [[1<=p34 & 1<=p61]] & [[1<=p1 & 1<=p74] | [1<=p1 & 1<=p70]]] | [~ [[1<=p1 & 1<=p86]] & [1<=p1 & 1<=p98]]]]]] U [[~ [AX [[1<=p27 & 1<=p38]]] & ~ [[AX [EX [[1<=p1 & 1<=p75]]] & EF [[AX [[1<=p1 & 1<=p48]] | EF [[1<=p21 & 1<=p57]]]]]]] & [1<=p27 & 1<=p38]]]
normalized: E [~ [EG [~ [[[[[[1<=p1 & 1<=p98] & ~ [[1<=p1 & 1<=p86]]] | [[[1<=p1 & 1<=p70] | [1<=p1 & 1<=p74]] & ~ [[1<=p34 & 1<=p61]]]] | [[~ [EG [~ [[1<=p1 & 1<=p98]]]] & ~ [E [~ [[1<=p1 & 1<=p98]] U [~ [[1<=p1 & 1<=p48]] & ~ [[1<=p1 & 1<=p98]]]]]] & ~ [[[1<=p6 & 1<=p38] | [1<=p1 & 1<=p78]]]]] | [EG [[[1<=p1 & 1<=p73] & [1<=p1 & 1<=p43]]] | EX [[1<=p1 & 1<=p63]]]]]]] U [[1<=p27 & 1<=p38] & [~ [[E [true U [E [true U [1<=p21 & 1<=p57]] | ~ [EX [~ [[1<=p1 & 1<=p48]]]]]] & ~ [EX [~ [EX [[1<=p1 & 1<=p75]]]]]]] & EX [~ [[1<=p27 & 1<=p38]]]]]]

abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p27)
states: 73,140 (4)
.abstracting: (1<=p75)
states: 313,778 (5)
abstracting: (1<=p1)
states: 396,972 (5)
..abstracting: (1<=p48)
states: 166,384 (5)
abstracting: (1<=p1)
states: 396,972 (5)
.abstracting: (1<=p57)
states: 75,195 (4)
abstracting: (1<=p21)
states: 44,529 (4)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p27)
states: 73,140 (4)
abstracting: (1<=p63)
states: 104,902 (5)
abstracting: (1<=p1)
states: 396,972 (5)
.abstracting: (1<=p43)
states: 411,252 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p73)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
........
EG iterations: 8
abstracting: (1<=p78)
states: 313,778 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p38)
states: 1,033,008 (6)
abstracting: (1<=p6)
states: 26,415 (4)
abstracting: (1<=p98)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p48)
states: 166,384 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p98)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p98)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
...
EG iterations: 3
abstracting: (1<=p61)
states: 145,560 (5)
abstracting: (1<=p34)
states: 45,003 (4)
abstracting: (1<=p74)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p70)
states: 184,055 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p86)
states: 184,590 (5)
abstracting: (1<=p1)
states: 396,972 (5)
abstracting: (1<=p98)
states: 184,912 (5)
abstracting: (1<=p1)
states: 396,972 (5)
...
EG iterations: 3
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m06-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.305sec

totally nodes used: 37933645 (3.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 78014231 130954157 208968388
used/not used/entry size/cache size: 61625445 5483419 16 1024MB
basic ops cache: hits/miss/sum: 22447165 36568694 59015859
used/not used/entry size/cache size: 16450115 327101 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 76129 182246 258375
used/not used/entry size/cache size: 180324 8208284 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 39385374
1 19778329
2 6132590
3 1461614
4 286720
5 49278
6 8903
7 2311
8 1007
9 687
>= 10 2051

Total processing time: 1m 7.401sec


BK_STOP 1678349426104

--------------------
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

9368 9486 10781 10416 11380
iterations count:512867 (3771), effective:10721 (78)

initing FirstDep: 0m 0.000sec


iterations count:46667 (343), effective:822 (6)

iterations count:17288 (127), effective:619 (4)

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

iterations count:74967 (551), effective:1644 (12)

iterations count:7657 (56), effective:200 (1)

iterations count:183 (1), effective:3 (0)

iterations count:183 (1), effective:3 (0)

iterations count:183 (1), effective:3 (0)

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

iterations count:881 (6), effective:9 (0)

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

iterations count:2837 (20), effective:38 (0)

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

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

iterations count:73083 (537), effective:1535 (11)

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

iterations count:54119 (397), effective:1234 (9)

iterations count:54895 (403), effective:1255 (9)

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

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

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

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

iterations count:47123 (346), effective:1013 (7)

iterations count:2114 (15), effective:37 (0)

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

iterations count:49198 (361), effective:923 (6)

iterations count:25668 (188), effective:418 (3)

iterations count:1750 (12), effective:28 (0)

iterations count:4307 (31), effective:110 (0)

iterations count:240 (1), effective:3 (0)

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

iterations count:1816 (13), effective:23 (0)

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

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

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

iterations count:2001 (14), effective:36 (0)

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

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

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

iterations count:60634 (445), effective:1203 (8)

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

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

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

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

iterations count:3235 (23), effective:59 (0)

iterations count:67083 (493), effective:1377 (10)

iterations count:273 (2), effective:2 (0)

iterations count:74502 (547), effective:1593 (11)

iterations count:59829 (439), effective:1403 (10)

iterations count:8205 (60), effective:250 (1)

iterations count:296 (2), effective:6 (0)

iterations count:45246 (332), effective:825 (6)

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="DBSingleClientW-PT-d0m06"
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 DBSingleClientW-PT-d0m06, 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-167814482400194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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