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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.5K Feb 26 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 14K Feb 26 15:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 15:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 15:17 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-d0m05-CTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678349138092

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

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

net check time: 0m 0.000sec

init dd package: 0m 2.840sec


RS generation: 0m 1.558sec


-> reachability set: #nodes 4621 (4.6e+03) #states 137,532 (5)



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

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

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

FORMULA DBSingleClientW-PT-d0m05-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.160sec

checking: EG [EF [[1<=p13 & 1<=p34]]]
normalized: EG [E [true U [1<=p13 & 1<=p34]]]

abstracting: (1<=p34)
states: 62,324 (4)
abstracting: (1<=p13)
states: 2,280 (3)
.........
EG iterations: 9
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m05-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.759sec

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

abstracting: (1<=p80)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
-> the formula is FALSE

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

MC time: 0m 0.135sec

checking: EG [[EG [[p23<=0 | p34<=0]] | [p1<=0 | p65<=0]]]
normalized: EG [[[p1<=0 | p65<=0] | EG [[p23<=0 | p34<=0]]]]

abstracting: (p34<=0)
states: 75,208 (4)
abstracting: (p23<=0)
states: 132,978 (5)
.
EG iterations: 1
abstracting: (p65<=0)
states: 127,898 (5)
abstracting: (p1<=0)
states: 110,400 (5)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.015sec

checking: AF [AG [[AX [[p21<=0 | p34<=0]] & [[p11<=0 | p60<=0] & [p12<=0 | p61<=0]]]]]
normalized: ~ [EG [E [true U ~ [[[[p12<=0 | p61<=0] & [p11<=0 | p60<=0]] & ~ [EX [~ [[p21<=0 | p34<=0]]]]]]]]]

abstracting: (p34<=0)
states: 75,208 (4)
abstracting: (p21<=0)
states: 132,978 (5)
.abstracting: (p60<=0)
states: 134,326 (5)
abstracting: (p11<=0)
states: 134,988 (5)
abstracting: (p61<=0)
states: 134,326 (5)
abstracting: (p12<=0)
states: 134,988 (5)
........
EG iterations: 8
-> the formula is FALSE

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

MC time: 0m 0.607sec

checking: EG [[EG [[EG [[p1<=0 | p70<=0]] | [p1<=0 | p72<=0]]] | [p17<=0 | p51<=0]]]
normalized: EG [[EG [[[p1<=0 | p72<=0] | EG [[p1<=0 | p70<=0]]]] | [p17<=0 | p51<=0]]]

abstracting: (p51<=0)
states: 131,790 (5)
abstracting: (p17<=0)
states: 135,036 (5)
abstracting: (p70<=0)
states: 119,754 (5)
abstracting: (p1<=0)
states: 110,400 (5)
..
EG iterations: 2
abstracting: (p72<=0)
states: 128,103 (5)
abstracting: (p1<=0)
states: 110,400 (5)
..
EG iterations: 2

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.078sec

checking: [AG [AX [EF [[1<=p1 & 1<=p84]]]] & EF [[[1<=p1 & 1<=p62] | [p1<=0 | p87<=0]]]]
normalized: [E [true U [[p1<=0 | p87<=0] | [1<=p1 & 1<=p62]]] & ~ [E [true U EX [~ [E [true U [1<=p1 & 1<=p84]]]]]]]

abstracting: (1<=p84)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
.abstracting: (1<=p62)
states: 9,634 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (p87<=0)
states: 128,423 (5)
abstracting: (p1<=0)
states: 110,400 (5)
-> the formula is FALSE

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

MC time: 0m 0.971sec

checking: EX [[AG [[[[p17<=0 | p51<=0] | [p12<=0 | p61<=0]] & [p1<=0 | p73<=0]]] | [1<=p1 & 1<=p84]]]
normalized: EX [[[1<=p1 & 1<=p84] | ~ [E [true U ~ [[[p1<=0 | p73<=0] & [[p12<=0 | p61<=0] | [p17<=0 | p51<=0]]]]]]]]

abstracting: (p51<=0)
states: 131,790 (5)
abstracting: (p17<=0)
states: 135,036 (5)
abstracting: (p61<=0)
states: 134,326 (5)
abstracting: (p12<=0)
states: 134,988 (5)
abstracting: (p73<=0)
states: 135,316 (5)
abstracting: (p1<=0)
states: 110,400 (5)
abstracting: (1<=p84)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
.-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m05-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.594sec

checking: [EF [EX [[1<=p1 & 1<=p72]]] | EG [AX [AG [[[[1<=p1 & 1<=p71] | [1<=p1 & 1<=p78]] & A [[1<=p1 & 1<=p73] U [1<=p1 & 1<=p38]]]]]]]
normalized: [EG [~ [EX [E [true U ~ [[[~ [EG [~ [[1<=p1 & 1<=p38]]]] & ~ [E [~ [[1<=p1 & 1<=p38]] U [~ [[1<=p1 & 1<=p73]] & ~ [[1<=p1 & 1<=p38]]]]]] & [[1<=p1 & 1<=p78] | [1<=p1 & 1<=p71]]]]]]]] | E [true U EX [[1<=p1 & 1<=p72]]]]

abstracting: (1<=p72)
states: 9,429 (3)
abstracting: (1<=p1)
states: 27,132 (4)
.abstracting: (1<=p71)
states: 9,429 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p78)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p38)
states: 42,822 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p73)
states: 2,216 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p38)
states: 42,822 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p38)
states: 42,822 (4)
abstracting: (1<=p1)
states: 27,132 (4)
..
EG iterations: 2
..
EG iterations: 1
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m05-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.855sec

checking: AF [EG [A [[AX [[1<=p1 & 1<=p54]] & [[1<=p1 & 1<=p74] | [[1<=p8 & 1<=p57] | [1<=p1 & [1<=p80 & 1<=p70]]]]] U [1<=p30 & 1<=p47]]]]
normalized: ~ [EG [~ [EG [[~ [EG [~ [[1<=p30 & 1<=p47]]]] & ~ [E [~ [[1<=p30 & 1<=p47]] U [~ [[[[[1<=p1 & [1<=p80 & 1<=p70]] | [1<=p8 & 1<=p57]] | [1<=p1 & 1<=p74]] & ~ [EX [~ [[1<=p1 & 1<=p54]]]]]] & ~ [[1<=p30 & 1<=p47]]]]]]]]]]

abstracting: (1<=p47)
states: 6,606 (3)
abstracting: (1<=p30)
states: 2,532 (3)
abstracting: (1<=p54)
states: 4,288 (3)
abstracting: (1<=p1)
states: 27,132 (4)
.abstracting: (1<=p74)
states: 2,216 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p57)
states: 15,159 (4)
abstracting: (1<=p8)
states: 4,181 (3)
abstracting: (1<=p70)
states: 17,778 (4)
abstracting: (1<=p80)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p47)
states: 6,606 (3)
abstracting: (1<=p30)
states: 2,532 (3)
abstracting: (1<=p47)
states: 6,606 (3)
abstracting: (1<=p30)
states: 2,532 (3)
.
EG iterations: 1
..
EG iterations: 2

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.064sec

checking: [AX [[A [[1<=p16 & 1<=p46] U [1<=p1 & 1<=p39]] & [AG [[1<=p1 & 1<=p76]] | [[1<=p1 & 1<=p67] | [1<=p1 & 1<=p72]]]]] | AG [AF [[p20<=0 | p34<=0]]]]
normalized: [~ [E [true U EG [~ [[p20<=0 | p34<=0]]]]] | ~ [EX [~ [[[[[1<=p1 & 1<=p72] | [1<=p1 & 1<=p67]] | ~ [E [true U ~ [[1<=p1 & 1<=p76]]]]] & [~ [EG [~ [[1<=p1 & 1<=p39]]]] & ~ [E [~ [[1<=p1 & 1<=p39]] U [~ [[1<=p16 & 1<=p46]] & ~ [[1<=p1 & 1<=p39]]]]]]]]]]]

abstracting: (1<=p39)
states: 25,028 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p46)
states: 6,606 (3)
abstracting: (1<=p16)
states: 2,496 (3)
abstracting: (1<=p39)
states: 25,028 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p39)
states: 25,028 (4)
abstracting: (1<=p1)
states: 27,132 (4)
..
EG iterations: 2
abstracting: (1<=p76)
states: 2,216 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p67)
states: 17,778 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p72)
states: 9,429 (3)
abstracting: (1<=p1)
states: 27,132 (4)
.abstracting: (p34<=0)
states: 75,208 (4)
abstracting: (p20<=0)
states: 132,978 (5)
..
EG iterations: 2
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m05-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: [~ [E [EF [AG [[[1<=p1 & 1<=p54] | [1<=p1 & 1<=p65]]]] U EF [[1<=p1 & 1<=p78]]]] | [EG [[p22<=0 | p34<=0]] & [AF [AX [[1<=p8 & 1<=p57]]] | AG [[1<=p1 & 1<=p55]]]]]
normalized: [[[~ [E [true U ~ [[1<=p1 & 1<=p55]]]] | ~ [EG [EX [~ [[1<=p8 & 1<=p57]]]]]] & EG [[p22<=0 | p34<=0]]] | ~ [E [E [true U ~ [E [true U ~ [[[1<=p1 & 1<=p65] | [1<=p1 & 1<=p54]]]]]] U E [true U [1<=p1 & 1<=p78]]]]]

abstracting: (1<=p78)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p54)
states: 4,288 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p65)
states: 9,634 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (p34<=0)
states: 75,208 (4)
abstracting: (p22<=0)
states: 132,978 (5)
.
EG iterations: 1
abstracting: (1<=p57)
states: 15,159 (4)
abstracting: (1<=p8)
states: 4,181 (3)
.............
EG iterations: 12
abstracting: (1<=p55)
states: 5,544 (3)
abstracting: (1<=p1)
states: 27,132 (4)
-> the formula is FALSE

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

MC time: 0m 1.130sec

checking: EG [EF [[E [[[1<=p1 & 1<=p76] | [1<=p1 & 1<=p39]] U ~ [[1<=p1 & 1<=p55]]] | [[[p1<=0 | p84<=0] & [p1<=0 | p39<=0]] | [EX [[1<=p1 & 1<=p39]] & [1<=p30 & 1<=p47]]]]]]
normalized: EG [E [true U [[[[1<=p30 & 1<=p47] & EX [[1<=p1 & 1<=p39]]] | [[p1<=0 | p39<=0] & [p1<=0 | p84<=0]]] | E [[[1<=p1 & 1<=p39] | [1<=p1 & 1<=p76]] U ~ [[1<=p1 & 1<=p55]]]]]]

abstracting: (1<=p55)
states: 5,544 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p76)
states: 2,216 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p39)
states: 25,028 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (p84<=0)
states: 128,423 (5)
abstracting: (p1<=0)
states: 110,400 (5)
abstracting: (p39<=0)
states: 112,504 (5)
abstracting: (p1<=0)
states: 110,400 (5)
abstracting: (1<=p39)
states: 25,028 (4)
abstracting: (1<=p1)
states: 27,132 (4)
.abstracting: (1<=p47)
states: 6,606 (3)
abstracting: (1<=p30)
states: 2,532 (3)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.039sec

checking: ~ [A [[EG [EX [[1<=p1 & 1<=p78]]] & [~ [[[[1<=p1 & 1<=p55] & [1<=p12 & 1<=p61]] | ~ [[1<=p1 & 1<=p68]]]] & ~ [AX [[[1<=p9 & 1<=p58] | [1<=p1 & 1<=p83]]]]]] U [EF [EX [[[1<=p1 & 1<=p72] | [1<=p1 & 1<=p67]]]] & [~ [EF [[[1<=p1 & 1<=p38] & [1<=p1 & 1<=p89]]]] | [EF [[1<=p1 & 1<=p74]] | [1<=p7 & 1<=p56]]]]]]
normalized: ~ [[~ [EG [~ [[[[[1<=p7 & 1<=p56] | E [true U [1<=p1 & 1<=p74]]] | ~ [E [true U [[1<=p1 & 1<=p89] & [1<=p1 & 1<=p38]]]]] & E [true U EX [[[1<=p1 & 1<=p67] | [1<=p1 & 1<=p72]]]]]]]] & ~ [E [~ [[[[[1<=p7 & 1<=p56] | E [true U [1<=p1 & 1<=p74]]] | ~ [E [true U [[1<=p1 & 1<=p89] & [1<=p1 & 1<=p38]]]]] & E [true U EX [[[1<=p1 & 1<=p67] | [1<=p1 & 1<=p72]]]]]] U [~ [[[EX [~ [[[1<=p1 & 1<=p83] | [1<=p9 & 1<=p58]]]] & ~ [[~ [[1<=p1 & 1<=p68]] | [[1<=p12 & 1<=p61] & [1<=p1 & 1<=p55]]]]] & EG [EX [[1<=p1 & 1<=p78]]]]] & ~ [[[[[1<=p7 & 1<=p56] | E [true U [1<=p1 & 1<=p74]]] | ~ [E [true U [[1<=p1 & 1<=p89] & [1<=p1 & 1<=p38]]]]] & E [true U EX [[[1<=p1 & 1<=p67] | [1<=p1 & 1<=p72]]]]]]]]]]]

abstracting: (1<=p72)
states: 9,429 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p67)
states: 17,778 (4)
abstracting: (1<=p1)
states: 27,132 (4)
.abstracting: (1<=p38)
states: 42,822 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p89)
states: 9,778 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p74)
states: 2,216 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p56)
states: 15,159 (4)
abstracting: (1<=p7)
states: 4,181 (3)
abstracting: (1<=p78)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
............
EG iterations: 11
abstracting: (1<=p55)
states: 5,544 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p61)
states: 3,206 (3)
abstracting: (1<=p12)
states: 2,544 (3)
abstracting: (1<=p68)
states: 9,778 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p58)
states: 13,902 (4)
abstracting: (1<=p9)
states: 4,181 (3)
abstracting: (1<=p83)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
.abstracting: (1<=p72)
states: 9,429 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p67)
states: 17,778 (4)
abstracting: (1<=p1)
states: 27,132 (4)
.abstracting: (1<=p38)
states: 42,822 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p89)
states: 9,778 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p74)
states: 2,216 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p56)
states: 15,159 (4)
abstracting: (1<=p7)
states: 4,181 (3)
abstracting: (1<=p72)
states: 9,429 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p67)
states: 17,778 (4)
abstracting: (1<=p1)
states: 27,132 (4)
.abstracting: (1<=p38)
states: 42,822 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p89)
states: 9,778 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p74)
states: 2,216 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p56)
states: 15,159 (4)
abstracting: (1<=p7)
states: 4,181 (3)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 2.249sec

checking: [AX [AF [E [A [[1<=p21 & 1<=p34] U [1<=p30 & 1<=p47]] U AG [[1<=p1 & 1<=p49]]]]] | [EF [[[1<=p29 & 1<=p34] | [[EX [[1<=p1 & 1<=p54]] | [[1<=p1 & 1<=p55] | AF [[1<=p1 & 1<=p67]]]] & [1<=p23 & 1<=p34]]]] & A [[AF [[EF [[1<=p1 & 1<=p86]] | ~ [[1<=p1 & 1<=p54]]]] & [1<=p1 & 1<=p78]] U [AG [[E [[1<=p1 & 1<=p86] U [1<=p1 & 1<=p72]] | [[1<=p1 & 1<=p80] | [1<=p6 & 1<=p34]]]] & EF [[1<=p1 & 1<=p44]]]]]]
normalized: [[[~ [EG [~ [[E [true U [1<=p1 & 1<=p44]] & ~ [E [true U ~ [[[[1<=p6 & 1<=p34] | [1<=p1 & 1<=p80]] | E [[1<=p1 & 1<=p86] U [1<=p1 & 1<=p72]]]]]]]]]] & ~ [E [~ [[E [true U [1<=p1 & 1<=p44]] & ~ [E [true U ~ [[[[1<=p6 & 1<=p34] | [1<=p1 & 1<=p80]] | E [[1<=p1 & 1<=p86] U [1<=p1 & 1<=p72]]]]]]]] U [~ [[[1<=p1 & 1<=p78] & ~ [EG [~ [[~ [[1<=p1 & 1<=p54]] | E [true U [1<=p1 & 1<=p86]]]]]]]] & ~ [[E [true U [1<=p1 & 1<=p44]] & ~ [E [true U ~ [[[[1<=p6 & 1<=p34] | [1<=p1 & 1<=p80]] | E [[1<=p1 & 1<=p86] U [1<=p1 & 1<=p72]]]]]]]]]]]] & E [true U [[[1<=p23 & 1<=p34] & [[~ [EG [~ [[1<=p1 & 1<=p67]]]] | [1<=p1 & 1<=p55]] | EX [[1<=p1 & 1<=p54]]]] | [1<=p29 & 1<=p34]]]] | ~ [EX [EG [~ [E [[~ [EG [~ [[1<=p30 & 1<=p47]]]] & ~ [E [~ [[1<=p30 & 1<=p47]] U [~ [[1<=p21 & 1<=p34]] & ~ [[1<=p30 & 1<=p47]]]]]] U ~ [E [true U ~ [[1<=p1 & 1<=p49]]]]]]]]]]

abstracting: (1<=p49)
states: 9,089 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p47)
states: 6,606 (3)
abstracting: (1<=p30)
states: 2,532 (3)
abstracting: (1<=p34)
states: 62,324 (4)
abstracting: (1<=p21)
states: 4,554 (3)
abstracting: (1<=p47)
states: 6,606 (3)
abstracting: (1<=p30)
states: 2,532 (3)
abstracting: (1<=p47)
states: 6,606 (3)
abstracting: (1<=p30)
states: 2,532 (3)
.
EG iterations: 1

EG iterations: 0
.abstracting: (1<=p34)
states: 62,324 (4)
abstracting: (1<=p29)
states: 528
abstracting: (1<=p54)
states: 4,288 (3)
abstracting: (1<=p1)
states: 27,132 (4)
.abstracting: (1<=p55)
states: 5,544 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p67)
states: 17,778 (4)
abstracting: (1<=p1)
states: 27,132 (4)
..
EG iterations: 2
abstracting: (1<=p34)
states: 62,324 (4)
abstracting: (1<=p23)
states: 4,554 (3)
abstracting: (1<=p72)
states: 9,429 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p86)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p80)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p34)
states: 62,324 (4)
abstracting: (1<=p6)
states: 2,280 (3)
abstracting: (1<=p44)
states: 13,572 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p86)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p54)
states: 4,288 (3)
abstracting: (1<=p1)
states: 27,132 (4)
.......
EG iterations: 7
abstracting: (1<=p78)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p72)
states: 9,429 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p86)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p80)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p34)
states: 62,324 (4)
abstracting: (1<=p6)
states: 2,280 (3)
abstracting: (1<=p44)
states: 13,572 (4)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p72)
states: 9,429 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p86)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p80)
states: 9,109 (3)
abstracting: (1<=p1)
states: 27,132 (4)
abstracting: (1<=p34)
states: 62,324 (4)
abstracting: (1<=p6)
states: 2,280 (3)
abstracting: (1<=p44)
states: 13,572 (4)
abstracting: (1<=p1)
states: 27,132 (4)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 1.253sec

totally nodes used: 5981894 (6.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 14150205 25812772 39962977
used/not used/entry size/cache size: 25649303 41459561 16 1024MB
basic ops cache: hits/miss/sum: 3310583 5361817 8672400
used/not used/entry size/cache size: 7681303 9095913 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: 21271 53098 74369
used/not used/entry size/cache size: 52954 8335654 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 61804013
1 4720390
2 504314
3 70221
4 8612
5 911
6 170
7 92
8 66
9 42
>= 10 33

Total processing time: 0m15.637sec


BK_STOP 1678349161363

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

4540
iterations count:101835 (801), effective:2130 (16)

initing FirstDep: 0m 0.000sec


iterations count:15142 (119), effective:320 (2)

iterations count:232 (1), effective:7 (0)

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

iterations count:12909 (101), effective:235 (1)

iterations count:17011 (133), effective:357 (2)

iterations count:2402 (18), effective:37 (0)

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

iterations count:14055 (110), effective:309 (2)

iterations count:14072 (110), effective:308 (2)

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

iterations count:276 (2), effective:9 (0)

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

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

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

iterations count:19883 (156), effective:396 (3)

iterations count:700 (5), effective:16 (0)

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

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

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

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

iterations count:8349 (65), effective:183 (1)

iterations count:22320 (175), effective:441 (3)

iterations count:16138 (127), effective:347 (2)

iterations count:8349 (65), effective:183 (1)

iterations count:22320 (175), effective:441 (3)

iterations count:16138 (127), effective:347 (2)

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

iterations count:8349 (65), effective:183 (1)

iterations count:22320 (175), effective:441 (3)

iterations count:16138 (127), effective:347 (2)

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

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

iterations count:13458 (105), effective:301 (2)

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

iterations count:347 (2), effective:11 (0)

iterations count:3716 (29), effective:62 (0)

iterations count:16478 (129), effective:344 (2)

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

iterations count:347 (2), effective:11 (0)

iterations count:3716 (29), effective:62 (0)

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

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

iterations count:347 (2), effective:11 (0)

iterations count:3716 (29), effective:62 (0)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m05"
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-d0m05, 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-167814482400186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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