fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814482400218
Last Updated
May 14, 2023

About the Execution of Marcie+red for DBSingleClientW-PT-d0m09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10583.195 662908.00 676551.00 2292.80 FFFTFTFTFFFFTFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 15:34 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-d0m09-CTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678350346008

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

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

net check time: 0m 0.000sec

init dd package: 0m 2.781sec


RS generation: 1m17.883sec


-> reachability set: #nodes 32901 (3.3e+04) #states 797,075,377 (8)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

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

MC time: 0m 1.427sec

checking: AF [AX [[1<=p1 & 1<=p59]]]
normalized: ~ [EG [EX [~ [[1<=p1 & 1<=p59]]]]]

abstracting: (1<=p59)
states: 46,516,330 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
...............................
EG iterations: 30
-> the formula is FALSE

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

MC time: 0m11.479sec

checking: AX [AF [AG [[p1<=0 | p45<=0]]]]
normalized: ~ [EX [EG [E [true U ~ [[p1<=0 | p45<=0]]]]]]

abstracting: (p45<=0)
states: 748,886,476 (8)
abstracting: (p1<=0)
states: 672,097,939 (8)
.....................
EG iterations: 21
.-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m09-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.138sec

checking: AF [E [[1<=p7 & 1<=p61] U [1<=p1 & 1<=p90]]]
normalized: ~ [EG [~ [E [[1<=p7 & 1<=p61] U [1<=p1 & 1<=p90]]]]]

abstracting: (1<=p90)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p61)
states: 177,813,867 (8)
abstracting: (1<=p7)
states: 10,424,306 (7)
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 1.991sec

checking: EF [[EG [EX [AX [[p1<=0 | p59<=0]]]] & EX [[1<=p13 & 1<=p66]]]]
normalized: E [true U [EX [[1<=p13 & 1<=p66]] & EG [EX [~ [EX [~ [[p1<=0 | p59<=0]]]]]]]]

abstracting: (p59<=0)
states: 750,559,047 (8)
abstracting: (p1<=0)
states: 672,097,939 (8)
................................
EG iterations: 30
abstracting: (1<=p66)
states: 25,695,146 (7)
abstracting: (1<=p13)
states: 15,007,191 (7)
.-> the formula is TRUE

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

MC time: 0m25.741sec

checking: AF [AG [[p1<=0 | [p92<=0 | [1<=p1 & 1<=p75]]]]]
normalized: ~ [EG [E [true U ~ [[p1<=0 | [p92<=0 | [1<=p1 & 1<=p75]]]]]]]

abstracting: (1<=p75)
states: 154,726,218 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (p92<=0)
states: 667,378,396 (8)
abstracting: (p1<=0)
states: 672,097,939 (8)

before gc: list nodes free: 939004

after gc: idd nodes used:180183, unused:63819817; list nodes free:326252524
.............................
EG iterations: 29
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m09-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.791sec

checking: AF [EG [[[1<=p23 & 1<=p36] | [1<=p3 & 1<=p36]]]]
normalized: ~ [EG [~ [EG [[[1<=p3 & 1<=p36] | [1<=p23 & 1<=p36]]]]]]

abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p23)
states: 27,444,033 (7)
abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p3)
states: 1
..
EG iterations: 2

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.077sec

checking: AG [[EF [[1<=p1 & 1<=p72]] | [1<=p2 & 1<=p87]]]
normalized: ~ [E [true U ~ [[[1<=p2 & 1<=p87] | E [true U [1<=p1 & 1<=p72]]]]]]

abstracting: (1<=p72)
states: 154,726,218 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p87)
states: 19,058,536 (7)
abstracting: (1<=p2)
states: 27,596,517 (7)
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m09-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.440sec

checking: AF [~ [E [A [EF [[1<=p30 & 1<=p50]] U ~ [[1<=p3 & 1<=p36]]] U ~ [AF [E [[1<=p1 & 1<=p75] U [1<=p1 & 1<=p77]]]]]]]
normalized: ~ [EG [E [[~ [EG [[1<=p3 & 1<=p36]]] & ~ [E [[1<=p3 & 1<=p36] U [~ [E [true U [1<=p30 & 1<=p50]]] & [1<=p3 & 1<=p36]]]]] U EG [~ [E [[1<=p1 & 1<=p75] U [1<=p1 & 1<=p77]]]]]]]

abstracting: (1<=p77)
states: 132,032,131 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p75)
states: 154,726,218 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
..
EG iterations: 2
abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p3)
states: 1
abstracting: (1<=p50)
states: 117,886,296 (8)
abstracting: (1<=p30)
states: 22,196,124 (7)

before gc: list nodes free: 1082150

after gc: idd nodes used:222203, unused:63777797; list nodes free:326041166
abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p3)
states: 1
abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p3)
states: 1
..
EG iterations: 2

EG iterations: 0
-> the formula is FALSE

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

MC time: 1m 7.591sec

checking: EG [E [[EG [EX [[1<=p1 & 1<=p59]]] | ~ [AX [EX [[1<=p1 & 1<=p92]]]]] U [EF [~ [[1<=p1 & 1<=p55]]] & AX [[1<=p31 & 1<=p57]]]]]
normalized: EG [E [[EX [~ [EX [[1<=p1 & 1<=p92]]]] | EG [EX [[1<=p1 & 1<=p59]]]] U [~ [EX [~ [[1<=p31 & 1<=p57]]]] & E [true U ~ [[1<=p1 & 1<=p55]]]]]]

abstracting: (1<=p55)
states: 41,622,555 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p57)
states: 117,592,567 (8)
abstracting: (1<=p31)
states: 22,196,124 (7)
.abstracting: (1<=p59)
states: 46,516,330 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
...............................
EG iterations: 30
abstracting: (1<=p92)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
...
EG iterations: 1
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m09-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.550sec

checking: EF [[[EG [[[1<=p1 & 1<=p60] | AX [[1<=p1 & 1<=p83]]]] & AX [AG [[1<=p1 & 1<=p43]]]] | [AG [EF [[1<=p1 & 1<=p88]]] & AF [AG [[1<=p1 & 1<=p68]]]]]]
normalized: E [true U [[~ [EG [E [true U ~ [[1<=p1 & 1<=p68]]]]] & ~ [E [true U ~ [E [true U [1<=p1 & 1<=p88]]]]]] | [~ [EX [E [true U ~ [[1<=p1 & 1<=p43]]]]] & EG [[~ [EX [~ [[1<=p1 & 1<=p83]]]] | [1<=p1 & 1<=p60]]]]]]

abstracting: (1<=p60)
states: 46,792,147 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p83)
states: 129,824,092 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
..............
EG iterations: 13
abstracting: (1<=p43)
states: 259,058 (5)
abstracting: (1<=p1)
states: 124,977,438 (8)
.abstracting: (1<=p88)
states: 19,058,536 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)

before gc: list nodes free: 2087493

after gc: idd nodes used:253340, unused:63746660; list nodes free:327949478
abstracting: (1<=p68)
states: 117,315,585 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)

EG iterations: 0
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m09-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m19.136sec

checking: ~ [E [~ [[1<=p1 & 1<=p39]] U EX [[E [[1<=p1 & 1<=p83] U [1<=p1 & 1<=p71]] | [A [[1<=p11 & 1<=p36] U [1<=p1 & 1<=p90]] | [1<=p22 & 1<=p36]]]]]]
normalized: ~ [E [~ [[1<=p1 & 1<=p39]] U EX [[[[1<=p22 & 1<=p36] | [~ [EG [~ [[1<=p1 & 1<=p90]]]] & ~ [E [~ [[1<=p1 & 1<=p90]] U [~ [[1<=p11 & 1<=p36]] & ~ [[1<=p1 & 1<=p90]]]]]]] | E [[1<=p1 & 1<=p83] U [1<=p1 & 1<=p71]]]]]]

abstracting: (1<=p71)
states: 117,315,585 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p83)
states: 129,824,092 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p90)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p11)
states: 8,307,099 (6)
abstracting: (1<=p90)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p90)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
..
EG iterations: 2
abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p22)
states: 27,444,033 (7)
.abstracting: (1<=p39)
states: 251,805,411 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m09-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m50.479sec

checking: EG [E [AX [[AG [[1<=p1 & 1<=p68]] | [~ [[1<=p3 & 1<=p36]] | AF [[1<=p0 & 1<=p36]]]]] U [EF [[[EG [[1<=p15 & 1<=p49]] & 1<=p1] & [1<=p69 & [1<=p1 & 1<=p52]]]] & [1<=p1 & 1<=p59]]]]
normalized: EG [E [~ [EX [~ [[[~ [EG [~ [[1<=p0 & 1<=p36]]]] | ~ [[1<=p3 & 1<=p36]]] | ~ [E [true U ~ [[1<=p1 & 1<=p68]]]]]]]] U [[1<=p1 & 1<=p59] & E [true U [[1<=p69 & [1<=p1 & 1<=p52]] & [1<=p1 & EG [[1<=p15 & 1<=p49]]]]]]]]

abstracting: (1<=p49)
states: 117,886,296 (8)
abstracting: (1<=p15)
states: 21,921,723 (7)
..
EG iterations: 2
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p52)
states: 79,658,558 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p69)
states: 117,315,585 (8)
abstracting: (1<=p59)
states: 46,516,330 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p68)
states: 117,315,585 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p3)
states: 1
abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m09-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.131sec

checking: E [EF [[~ [[[1<=p1 & 1<=p41] & [1<=p1 & 1<=p93]]] & AX [[1<=p34 & 1<=p57]]]] U ~ [EF [AX [[A [[1<=p1 & 1<=p42] U [1<=p1 & 1<=p69]] & [[1<=p1 & 1<=p48] | [1<=p18 & 1<=p54]]]]]]]
normalized: E [E [true U [~ [EX [~ [[1<=p34 & 1<=p57]]]] & ~ [[[1<=p1 & 1<=p93] & [1<=p1 & 1<=p41]]]]] U ~ [E [true U ~ [EX [~ [[[[1<=p18 & 1<=p54] | [1<=p1 & 1<=p48]] & [~ [EG [~ [[1<=p1 & 1<=p69]]]] & ~ [E [~ [[1<=p1 & 1<=p69]] U [~ [[1<=p1 & 1<=p42]] & ~ [[1<=p1 & 1<=p69]]]]]]]]]]]]]

abstracting: (1<=p69)
states: 117,315,585 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p42)
states: 8
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p69)
states: 117,315,585 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p69)
states: 117,315,585 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
..
EG iterations: 2
abstracting: (1<=p48)
states: 48,188,901 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p54)
states: 31,191,147 (7)
abstracting: (1<=p18)
states: 21,921,723 (7)
.abstracting: (1<=p41)
states: 185,392,410 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p93)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p57)
states: 117,592,567 (8)
abstracting: (1<=p34)
states: 22,196,124 (7)
.-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m09-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.748sec

checking: A [~ [[EX [A [[1<=p1 & 1<=p56] U [1<=p1 & 1<=p59]]] | E [[1<=p1 & 1<=p38] U [[1<=p18 & 1<=p54] | [1<=p1 & 1<=p41]]]]] U AG [[AF [[1<=p1 & 1<=p92]] | [[[1<=p1 & 1<=p80] | [1<=p1 & 1<=p42]] & [[1<=p1 & 1<=p73] | [1<=p1 & 1<=p69]]]]]]
normalized: [~ [EG [E [true U ~ [[[[[1<=p1 & 1<=p69] | [1<=p1 & 1<=p73]] & [[1<=p1 & 1<=p42] | [1<=p1 & 1<=p80]]] | ~ [EG [~ [[1<=p1 & 1<=p92]]]]]]]]] & ~ [E [E [true U ~ [[[[[1<=p1 & 1<=p69] | [1<=p1 & 1<=p73]] & [[1<=p1 & 1<=p42] | [1<=p1 & 1<=p80]]] | ~ [EG [~ [[1<=p1 & 1<=p92]]]]]]] U [[E [[1<=p1 & 1<=p38] U [[1<=p1 & 1<=p41] | [1<=p18 & 1<=p54]]] | EX [[~ [EG [~ [[1<=p1 & 1<=p59]]]] & ~ [E [~ [[1<=p1 & 1<=p59]] U [~ [[1<=p1 & 1<=p56]] & ~ [[1<=p1 & 1<=p59]]]]]]]] & E [true U ~ [[[[[1<=p1 & 1<=p69] | [1<=p1 & 1<=p73]] & [[1<=p1 & 1<=p42] | [1<=p1 & 1<=p80]]] | ~ [EG [~ [[1<=p1 & 1<=p92]]]]]]]]]]]

abstracting: (1<=p92)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
..
EG iterations: 2
abstracting: (1<=p80)
states: 19,058,536 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p42)
states: 8
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p73)
states: 118,075,500 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p69)
states: 117,315,585 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p59)
states: 46,516,330 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p56)
states: 47,993,480 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p59)
states: 46,516,330 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p59)
states: 46,516,330 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
..
EG iterations: 2
.abstracting: (1<=p54)
states: 31,191,147 (7)
abstracting: (1<=p18)
states: 21,921,723 (7)
abstracting: (1<=p41)
states: 185,392,410 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p38)
states: 2
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p92)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
..
EG iterations: 2
abstracting: (1<=p80)
states: 19,058,536 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p42)
states: 8
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p73)
states: 118,075,500 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p69)
states: 117,315,585 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)

before gc: list nodes free: 5088215

after gc: idd nodes used:417649, unused:63582351; list nodes free:327117353
abstracting: (1<=p92)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
..
EG iterations: 2
abstracting: (1<=p80)
states: 19,058,536 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p42)
states: 8
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p73)
states: 118,075,500 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p69)
states: 117,315,585 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)

EG iterations: 0
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m09-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 1.386sec

checking: E [~ [[[E [[E [[1<=p1 & 1<=p73] U [1<=p1 & 1<=p83]] & [1<=p1 & 1<=p59]] U [EF [[1<=p21 & 1<=p36]] | ~ [[1<=p1 & 1<=p95]]]] & EX [[1<=p1 & 1<=p95]]] & [1<=p1 & [1<=p69 & ~ [[1<=p1 & 1<=p55]]]]]] U [[1<=p1 & 1<=p79] & [1<=p77 & [~ [[[EX [~ [[p1<=0 | p45<=0]]] | E [[1<=p1 & 1<=p90] U [1<=p1 & 1<=p81]]] & AG [[1<=p1 & 1<=p72]]]] | [~ [A [EG [[1<=p0 & 1<=p36]] U [[1<=p1 & 1<=p76] & [1<=p1 & 1<=p90]]]] & EX [EX [[1<=p1 & 1<=p37]]]]]]]]
normalized: E [~ [[[1<=p1 & [1<=p69 & ~ [[1<=p1 & 1<=p55]]]] & [EX [[1<=p1 & 1<=p95]] & E [[[1<=p1 & 1<=p59] & E [[1<=p1 & 1<=p73] U [1<=p1 & 1<=p83]]] U [~ [[1<=p1 & 1<=p95]] | E [true U [1<=p21 & 1<=p36]]]]]]] U [[1<=p77 & [[EX [EX [[1<=p1 & 1<=p37]]] & ~ [[~ [EG [~ [[[1<=p1 & 1<=p90] & [1<=p1 & 1<=p76]]]]] & ~ [E [~ [[[1<=p1 & 1<=p90] & [1<=p1 & 1<=p76]]] U [~ [EG [[1<=p0 & 1<=p36]]] & ~ [[[1<=p1 & 1<=p90] & [1<=p1 & 1<=p76]]]]]]]]] | ~ [[~ [E [true U ~ [[1<=p1 & 1<=p72]]]] & [E [[1<=p1 & 1<=p90] U [1<=p1 & 1<=p81]] | EX [~ [[p1<=0 | p45<=0]]]]]]]] & [1<=p1 & 1<=p79]]]

abstracting: (1<=p79)
states: 19,058,536 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (p45<=0)
states: 748,886,476 (8)
abstracting: (p1<=0)
states: 672,097,939 (8)
.abstracting: (1<=p81)
states: 19,058,536 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p90)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p72)
states: 154,726,218 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p76)
states: 132,032,131 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p90)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p0)
states: 1
..
EG iterations: 2
abstracting: (1<=p76)
states: 132,032,131 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p90)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p76)
states: 132,032,131 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p90)
states: 129,696,981 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
..
EG iterations: 2
abstracting: (1<=p37)
states: 2
abstracting: (1<=p1)
states: 124,977,438 (8)
..abstracting: (1<=p77)
states: 132,032,131 (8)
abstracting: (1<=p36)
states: 447,443,877 (8)
abstracting: (1<=p21)
states: 27,444,033 (7)
abstracting: (1<=p95)
states: 118,075,500 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p83)
states: 129,824,092 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p73)
states: 118,075,500 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p59)
states: 46,516,330 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p95)
states: 118,075,500 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)
.abstracting: (1<=p55)
states: 41,622,555 (7)
abstracting: (1<=p1)
states: 124,977,438 (8)
abstracting: (1<=p69)
states: 117,315,585 (8)
abstracting: (1<=p1)
states: 124,977,438 (8)

before gc: list nodes free: 9765433

after gc: idd nodes used:432974, unused:63567026; list nodes free:327026536
-> the formula is TRUE

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

MC time: 1m35.746sec

totally nodes used: 320275838 (3.2e+08)
number of garbage collections: 5
fire ops cache: hits/miss/sum: 1008885585 1120595085 2129480670
used/not used/entry size/cache size: 6831284 60277580 16 1024MB
basic ops cache: hits/miss/sum: 289957587 320969236 610926823
used/not used/entry size/cache size: 2562017 14215199 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: 494410 727856 1222266
used/not used/entry size/cache size: 0 8388608 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 65465289
1 1528416
2 98861
3 13507
4 2212
5 198
6 92
7 25
8 25
9 5
>= 10 234

Total processing time: 10m54.472sec


BK_STOP 1678351008916

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

12039 11551 13723 12044 27109 58101 57712 55138 35018 52277 42915 56613 45820 37748 47374 42444
iterations count:1640690 (12336), effective:33605 (252)

initing FirstDep: 0m 0.000sec


iterations count:64445 (484), effective:1556 (11)

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

iterations count:81007 (609), effective:2046 (15)
42824 50124
iterations count:284848 (2141), effective:6609 (49)

iterations count:27071 (203), effective:504 (3)

iterations count:31695 (238), effective:1366 (10)

iterations count:133 (1), effective:0 (0)
50085 48070
iterations count:263916 (1984), effective:6298 (47)

iterations count:3405 (25), effective:76 (0)

iterations count:1471 (11), effective:26 (0)

iterations count:21466 (161), effective:798 (6)

iterations count:388 (2), effective:8 (0)

iterations count:81751 (614), effective:2054 (15)

iterations count:25940 (195), effective:1053 (7)

iterations count:815 (6), effective:16 (0)

iterations count:19808 (148), effective:699 (5)

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

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

iterations count:25378 (190), effective:486 (3)

iterations count:815 (6), effective:16 (0)

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

iterations count:21164 (159), effective:759 (5)

iterations count:19808 (148), effective:699 (5)

iterations count:3686 (27), effective:80 (0)

iterations count:389 (2), effective:7 (0)

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

iterations count:3686 (27), effective:80 (0)

iterations count:81621 (613), effective:2162 (16)

iterations count:3686 (27), effective:80 (0)

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

iterations count:1162 (8), effective:21 (0)

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

iterations count:29426 (221), effective:557 (4)

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

iterations count:303 (2), effective:6 (0)
48364
iterations count:183500 (1379), effective:4373 (32)

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

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