About the Execution of Marcie+red for ShieldIIPt-PT-030B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10117.607 | 2149326.00 | 2245046.00 | 117.20 | ???F??????T????T | 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.r394-oct2-167903717700297.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700297
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 512K Mar 5 18:23 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 ShieldIIPt-PT-030B-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679502163942
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:22:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 16:22:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:22:47] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-22 16:22:47] [INFO ] Transformed 2103 places.
[2023-03-22 16:22:47] [INFO ] Transformed 1953 transitions.
[2023-03-22 16:22:47] [INFO ] Found NUPN structural information;
[2023-03-22 16:22:47] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-030B-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 302 place count 1801 transition count 1651
Iterating global reduction 0 with 302 rules applied. Total rules applied 604 place count 1801 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 605 place count 1800 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 606 place count 1800 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 607 place count 1799 transition count 1649
Iterating global reduction 0 with 1 rules applied. Total rules applied 608 place count 1799 transition count 1649
Applied a total of 608 rules in 902 ms. Remains 1799 /2103 variables (removed 304) and now considering 1649/1953 (removed 304) transitions.
// Phase 1: matrix 1649 rows 1799 cols
[2023-03-22 16:22:48] [INFO ] Computed 271 place invariants in 25 ms
[2023-03-22 16:22:50] [INFO ] Implicit Places using invariants in 1785 ms returned []
[2023-03-22 16:22:50] [INFO ] Invariant cache hit.
[2023-03-22 16:22:53] [INFO ] Implicit Places using invariants and state equation in 2845 ms returned []
Implicit Place search using SMT with State Equation took 4756 ms to find 0 implicit places.
[2023-03-22 16:22:53] [INFO ] Invariant cache hit.
[2023-03-22 16:22:54] [INFO ] Dead Transitions using invariants and state equation in 1270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1799/2103 places, 1649/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6944 ms. Remains : 1799/2103 places, 1649/1953 transitions.
Support contains 85 out of 1799 places after structural reductions.
[2023-03-22 16:22:55] [INFO ] Flatten gal took : 236 ms
[2023-03-22 16:22:55] [INFO ] Flatten gal took : 75 ms
[2023-03-22 16:22:55] [INFO ] Input system was already deterministic with 1649 transitions.
Support contains 78 out of 1799 places (down from 85) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 45) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 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 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 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 2 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 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-22 16:22:55] [INFO ] Invariant cache hit.
[2023-03-22 16:22:57] [INFO ] After 1419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-22 16:22:58] [INFO ] [Nat]Absence check using 271 positive place invariants in 204 ms returned sat
[2023-03-22 16:23:03] [INFO ] After 3406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-03-22 16:23:04] [INFO ] Deduced a trap composed of 31 places in 906 ms of which 7 ms to minimize.
[2023-03-22 16:23:04] [INFO ] Deduced a trap composed of 16 places in 393 ms of which 2 ms to minimize.
[2023-03-22 16:23:05] [INFO ] Deduced a trap composed of 27 places in 384 ms of which 1 ms to minimize.
[2023-03-22 16:23:05] [INFO ] Deduced a trap composed of 26 places in 599 ms of which 15 ms to minimize.
[2023-03-22 16:23:06] [INFO ] Deduced a trap composed of 26 places in 426 ms of which 1 ms to minimize.
[2023-03-22 16:23:06] [INFO ] Deduced a trap composed of 29 places in 342 ms of which 0 ms to minimize.
[2023-03-22 16:23:07] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 27 ms to minimize.
[2023-03-22 16:23:07] [INFO ] Deduced a trap composed of 34 places in 475 ms of which 2 ms to minimize.
[2023-03-22 16:23:08] [INFO ] Deduced a trap composed of 29 places in 365 ms of which 1 ms to minimize.
[2023-03-22 16:23:08] [INFO ] Deduced a trap composed of 30 places in 330 ms of which 0 ms to minimize.
[2023-03-22 16:23:08] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 1 ms to minimize.
[2023-03-22 16:23:09] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 1 ms to minimize.
[2023-03-22 16:23:09] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 0 ms to minimize.
[2023-03-22 16:23:10] [INFO ] Deduced a trap composed of 37 places in 383 ms of which 1 ms to minimize.
[2023-03-22 16:23:10] [INFO ] Deduced a trap composed of 26 places in 352 ms of which 1 ms to minimize.
[2023-03-22 16:23:10] [INFO ] Deduced a trap composed of 37 places in 314 ms of which 2 ms to minimize.
[2023-03-22 16:23:11] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 1 ms to minimize.
[2023-03-22 16:23:11] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 0 ms to minimize.
[2023-03-22 16:23:11] [INFO ] Deduced a trap composed of 37 places in 417 ms of which 1 ms to minimize.
[2023-03-22 16:23:12] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 1 ms to minimize.
[2023-03-22 16:23:12] [INFO ] Deduced a trap composed of 26 places in 410 ms of which 1 ms to minimize.
[2023-03-22 16:23:13] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 32 ms to minimize.
[2023-03-22 16:23:13] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 0 ms to minimize.
[2023-03-22 16:23:13] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 1 ms to minimize.
[2023-03-22 16:23:14] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 0 ms to minimize.
[2023-03-22 16:23:14] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 0 ms to minimize.
[2023-03-22 16:23:14] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 2 ms to minimize.
[2023-03-22 16:23:14] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 1 ms to minimize.
[2023-03-22 16:23:15] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 2 ms to minimize.
[2023-03-22 16:23:15] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 1 ms to minimize.
[2023-03-22 16:23:15] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 14 ms to minimize.
[2023-03-22 16:23:16] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 1 ms to minimize.
[2023-03-22 16:23:16] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 0 ms to minimize.
[2023-03-22 16:23:16] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 0 ms to minimize.
[2023-03-22 16:23:16] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 23 ms to minimize.
[2023-03-22 16:23:17] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 13526 ms
[2023-03-22 16:23:17] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 1 ms to minimize.
[2023-03-22 16:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2023-03-22 16:23:18] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 0 ms to minimize.
[2023-03-22 16:23:18] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 0 ms to minimize.
[2023-03-22 16:23:18] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 9 ms to minimize.
[2023-03-22 16:23:18] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 11 ms to minimize.
[2023-03-22 16:23:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1093 ms
[2023-03-22 16:23:19] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 1 ms to minimize.
[2023-03-22 16:23:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2023-03-22 16:23:20] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 0 ms to minimize.
[2023-03-22 16:23:20] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 13 ms to minimize.
[2023-03-22 16:23:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2023-03-22 16:23:21] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-22 16:23:21] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2023-03-22 16:23:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2023-03-22 16:23:22] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 0 ms to minimize.
[2023-03-22 16:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-22 16:23:22] [INFO ] After 22368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 16:23:22] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 0 properties in 2475 ms.
Support contains 50 out of 1799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 332 place count 1799 transition count 1317
Reduce places removed 332 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 336 rules applied. Total rules applied 668 place count 1467 transition count 1313
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 672 place count 1463 transition count 1313
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 220 Pre rules applied. Total rules applied 672 place count 1463 transition count 1093
Deduced a syphon composed of 220 places in 3 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 3 with 440 rules applied. Total rules applied 1112 place count 1243 transition count 1093
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1120 place count 1235 transition count 1085
Iterating global reduction 3 with 8 rules applied. Total rules applied 1128 place count 1235 transition count 1085
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1128 place count 1235 transition count 1078
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1142 place count 1228 transition count 1078
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 3 with 1022 rules applied. Total rules applied 2164 place count 717 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2165 place count 717 transition count 566
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2167 place count 716 transition count 565
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 2319 place count 640 transition count 607
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2320 place count 640 transition count 606
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 2323 place count 640 transition count 603
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2326 place count 637 transition count 603
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 2356 place count 637 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2357 place count 636 transition count 602
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2359 place count 634 transition count 602
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2359 place count 634 transition count 601
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2361 place count 633 transition count 601
Applied a total of 2361 rules in 429 ms. Remains 633 /1799 variables (removed 1166) and now considering 601/1649 (removed 1048) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 442 ms. Remains : 633/1799 places, 601/1649 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 30) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 601 rows 633 cols
[2023-03-22 16:23:26] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-22 16:23:26] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-22 16:23:27] [INFO ] [Nat]Absence check using 269 positive place invariants in 166 ms returned sat
[2023-03-22 16:23:28] [INFO ] After 1024ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-22 16:23:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-22 16:23:29] [INFO ] After 1005ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-22 16:23:29] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2023-03-22 16:23:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-22 16:23:30] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2023-03-22 16:23:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-22 16:23:30] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-22 16:23:30] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2023-03-22 16:23:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2023-03-22 16:23:31] [INFO ] After 3080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 1011 ms.
[2023-03-22 16:23:32] [INFO ] After 6173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 369 ms.
Support contains 45 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 601/601 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 633 transition count 599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 631 transition count 599
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 631 transition count 598
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 630 transition count 598
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 628 transition count 596
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 626 transition count 598
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 626 transition count 597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 625 transition count 597
Applied a total of 16 rules in 53 ms. Remains 625 /633 variables (removed 8) and now considering 597/601 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 625/633 places, 597/601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 26) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 597 rows 625 cols
[2023-03-22 16:23:33] [INFO ] Computed 269 place invariants in 4 ms
[2023-03-22 16:23:33] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-22 16:23:34] [INFO ] [Nat]Absence check using 269 positive place invariants in 58 ms returned sat
[2023-03-22 16:23:36] [INFO ] After 1595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-22 16:23:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-22 16:23:36] [INFO ] After 503ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-22 16:23:37] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 26 ms to minimize.
[2023-03-22 16:23:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-22 16:23:38] [INFO ] After 1841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 687 ms.
[2023-03-22 16:23:38] [INFO ] After 4884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 247 ms.
Support contains 33 out of 625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 625/625 places, 597/597 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 625 transition count 594
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 622 transition count 594
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 622 transition count 592
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 620 transition count 592
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 617 transition count 589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 615 transition count 589
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 615 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 614 transition count 588
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 613 transition count 587
Applied a total of 23 rules in 102 ms. Remains 613 /625 variables (removed 12) and now considering 587/597 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 613/625 places, 587/597 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 82356 steps, run timeout after 3006 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82356 steps, saw 51624 distinct states, run finished after 3008 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 587 rows 613 cols
[2023-03-22 16:23:42] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-22 16:23:43] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-22 16:23:43] [INFO ] [Nat]Absence check using 269 positive place invariants in 122 ms returned sat
[2023-03-22 16:23:44] [INFO ] After 975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-22 16:23:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-22 16:23:45] [INFO ] After 786ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-22 16:23:45] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2023-03-22 16:23:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-22 16:23:46] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2023-03-22 16:23:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-22 16:23:46] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 12 ms to minimize.
[2023-03-22 16:23:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-22 16:23:47] [INFO ] After 2580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 937 ms.
[2023-03-22 16:23:48] [INFO ] After 5160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 214 ms.
Support contains 32 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 587/587 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 613 transition count 586
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 612 transition count 586
Applied a total of 2 rules in 15 ms. Remains 612 /613 variables (removed 1) and now considering 586/587 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 612/613 places, 586/587 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 106421 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106421 steps, saw 66060 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 586 rows 612 cols
[2023-03-22 16:23:51] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-22 16:23:52] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-22 16:23:52] [INFO ] [Nat]Absence check using 269 positive place invariants in 93 ms returned sat
[2023-03-22 16:23:53] [INFO ] After 757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-22 16:23:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-22 16:23:54] [INFO ] After 607ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-22 16:23:55] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-22 16:23:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-22 16:23:55] [INFO ] After 1776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 687 ms.
[2023-03-22 16:23:56] [INFO ] After 3824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 287 ms.
Support contains 32 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 586/586 transitions.
Applied a total of 0 rules in 12 ms. Remains 612 /612 variables (removed 0) and now considering 586/586 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 612/612 places, 586/586 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 586/586 transitions.
Applied a total of 0 rules in 11 ms. Remains 612 /612 variables (removed 0) and now considering 586/586 (removed 0) transitions.
[2023-03-22 16:23:56] [INFO ] Invariant cache hit.
[2023-03-22 16:23:56] [INFO ] Implicit Places using invariants in 329 ms returned [601]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 337 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 611/612 places, 586/586 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 610 transition count 585
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 610 transition count 585
Applied a total of 2 rules in 22 ms. Remains 610 /611 variables (removed 1) and now considering 585/586 (removed 1) transitions.
// Phase 1: matrix 585 rows 610 cols
[2023-03-22 16:23:56] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-22 16:23:57] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-22 16:23:57] [INFO ] Invariant cache hit.
[2023-03-22 16:23:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-22 16:23:58] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1624 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 610/612 places, 585/586 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1995 ms. Remains : 610/612 places, 585/586 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 103187 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103187 steps, saw 63603 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 16 properties.
[2023-03-22 16:24:01] [INFO ] Invariant cache hit.
[2023-03-22 16:24:02] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-22 16:24:02] [INFO ] [Nat]Absence check using 268 positive place invariants in 50 ms returned sat
[2023-03-22 16:24:03] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-22 16:24:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-22 16:24:04] [INFO ] After 554ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-22 16:24:04] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2023-03-22 16:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-22 16:24:04] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-22 16:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-22 16:24:04] [INFO ] After 1495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 572 ms.
[2023-03-22 16:24:05] [INFO ] After 3481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 210 ms.
Support contains 32 out of 610 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 610/610 places, 585/585 transitions.
Applied a total of 0 rules in 12 ms. Remains 610 /610 variables (removed 0) and now considering 585/585 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 610/610 places, 585/585 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 610/610 places, 585/585 transitions.
Applied a total of 0 rules in 10 ms. Remains 610 /610 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2023-03-22 16:24:05] [INFO ] Invariant cache hit.
[2023-03-22 16:24:06] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-22 16:24:06] [INFO ] Invariant cache hit.
[2023-03-22 16:24:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-22 16:24:07] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
[2023-03-22 16:24:07] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-22 16:24:07] [INFO ] Invariant cache hit.
[2023-03-22 16:24:07] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1695 ms. Remains : 610/610 places, 585/585 transitions.
Partial Free-agglomeration rule applied 53 times.
Drop transitions removed 53 transitions
Iterating global reduction 0 with 53 rules applied. Total rules applied 53 place count 610 transition count 585
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 610 transition count 584
Applied a total of 54 rules in 48 ms. Remains 610 /610 variables (removed 0) and now considering 584/585 (removed 1) transitions.
Running SMT prover for 16 properties.
// Phase 1: matrix 584 rows 610 cols
[2023-03-22 16:24:07] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-22 16:24:07] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-22 16:24:08] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2023-03-22 16:24:08] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-22 16:24:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-22 16:24:09] [INFO ] After 547ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-22 16:24:09] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2023-03-22 16:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-22 16:24:10] [INFO ] After 1859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 702 ms.
[2023-03-22 16:24:11] [INFO ] After 3720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
[2023-03-22 16:24:11] [INFO ] Flatten gal took : 73 ms
[2023-03-22 16:24:11] [INFO ] Flatten gal took : 68 ms
[2023-03-22 16:24:11] [INFO ] Input system was already deterministic with 1649 transitions.
Computed a total of 486 stabilizing places and 486 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1772 transition count 1622
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1772 transition count 1622
Applied a total of 54 rules in 204 ms. Remains 1772 /1799 variables (removed 27) and now considering 1622/1649 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 1772/1799 places, 1622/1649 transitions.
[2023-03-22 16:24:12] [INFO ] Flatten gal took : 57 ms
[2023-03-22 16:24:12] [INFO ] Flatten gal took : 72 ms
[2023-03-22 16:24:12] [INFO ] Input system was already deterministic with 1622 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 1798 transition count 1286
Reduce places removed 362 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 363 rules applied. Total rules applied 725 place count 1436 transition count 1285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 726 place count 1435 transition count 1285
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 224 Pre rules applied. Total rules applied 726 place count 1435 transition count 1061
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 1174 place count 1211 transition count 1061
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1197 place count 1188 transition count 1038
Iterating global reduction 3 with 23 rules applied. Total rules applied 1220 place count 1188 transition count 1038
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1220 place count 1188 transition count 1018
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1260 place count 1168 transition count 1018
Performed 473 Post agglomeration using F-continuation condition.Transition count delta: 473
Deduced a syphon composed of 473 places in 0 ms
Reduce places removed 473 places and 0 transitions.
Iterating global reduction 3 with 946 rules applied. Total rules applied 2206 place count 695 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2207 place count 695 transition count 544
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2209 place count 694 transition count 543
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2211 place count 692 transition count 541
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2213 place count 690 transition count 541
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2213 place count 690 transition count 540
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2215 place count 689 transition count 540
Applied a total of 2215 rules in 309 ms. Remains 689 /1799 variables (removed 1110) and now considering 540/1649 (removed 1109) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 309 ms. Remains : 689/1799 places, 540/1649 transitions.
[2023-03-22 16:24:12] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:24:12] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:24:12] [INFO ] Input system was already deterministic with 540 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 1798 transition count 1289
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 1439 transition count 1289
Performed 226 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 226 Pre rules applied. Total rules applied 718 place count 1439 transition count 1063
Deduced a syphon composed of 226 places in 1 ms
Reduce places removed 226 places and 0 transitions.
Iterating global reduction 2 with 452 rules applied. Total rules applied 1170 place count 1213 transition count 1063
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1189 place count 1194 transition count 1044
Iterating global reduction 2 with 19 rules applied. Total rules applied 1208 place count 1194 transition count 1044
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 1208 place count 1194 transition count 1028
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1240 place count 1178 transition count 1028
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 0 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 2 with 956 rules applied. Total rules applied 2196 place count 700 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2197 place count 700 transition count 549
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2199 place count 699 transition count 548
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2201 place count 697 transition count 546
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2203 place count 695 transition count 546
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2203 place count 695 transition count 545
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2205 place count 694 transition count 545
Applied a total of 2205 rules in 311 ms. Remains 694 /1799 variables (removed 1105) and now considering 545/1649 (removed 1104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 311 ms. Remains : 694/1799 places, 545/1649 transitions.
[2023-03-22 16:24:12] [INFO ] Flatten gal took : 17 ms
[2023-03-22 16:24:12] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:24:13] [INFO ] Input system was already deterministic with 545 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1798 transition count 1287
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 1 with 361 rules applied. Total rules applied 722 place count 1437 transition count 1287
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 223 Pre rules applied. Total rules applied 722 place count 1437 transition count 1064
Deduced a syphon composed of 223 places in 1 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 2 with 446 rules applied. Total rules applied 1168 place count 1214 transition count 1064
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1190 place count 1192 transition count 1042
Iterating global reduction 2 with 22 rules applied. Total rules applied 1212 place count 1192 transition count 1042
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 1212 place count 1192 transition count 1022
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 1252 place count 1172 transition count 1022
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 474
Deduced a syphon composed of 474 places in 0 ms
Reduce places removed 474 places and 0 transitions.
Iterating global reduction 2 with 948 rules applied. Total rules applied 2200 place count 698 transition count 548
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2201 place count 698 transition count 547
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2203 place count 697 transition count 546
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2205 place count 695 transition count 544
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2207 place count 693 transition count 544
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2207 place count 693 transition count 543
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2209 place count 692 transition count 543
Applied a total of 2209 rules in 293 ms. Remains 692 /1799 variables (removed 1107) and now considering 543/1649 (removed 1106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 293 ms. Remains : 692/1799 places, 543/1649 transitions.
[2023-03-22 16:24:13] [INFO ] Flatten gal took : 17 ms
[2023-03-22 16:24:13] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:24:13] [INFO ] Input system was already deterministic with 543 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 1798 transition count 1286
Reduce places removed 362 places and 0 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 724 place count 1436 transition count 1286
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 225 Pre rules applied. Total rules applied 724 place count 1436 transition count 1061
Deduced a syphon composed of 225 places in 1 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 2 with 450 rules applied. Total rules applied 1174 place count 1211 transition count 1061
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1197 place count 1188 transition count 1038
Iterating global reduction 2 with 23 rules applied. Total rules applied 1220 place count 1188 transition count 1038
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 1220 place count 1188 transition count 1018
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 1260 place count 1168 transition count 1018
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 475
Deduced a syphon composed of 475 places in 0 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 2 with 950 rules applied. Total rules applied 2210 place count 693 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2211 place count 693 transition count 542
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2213 place count 692 transition count 541
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2214 place count 692 transition count 541
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2216 place count 690 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2218 place count 688 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2218 place count 688 transition count 538
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2220 place count 687 transition count 538
Applied a total of 2220 rules in 289 ms. Remains 687 /1799 variables (removed 1112) and now considering 538/1649 (removed 1111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 289 ms. Remains : 687/1799 places, 538/1649 transitions.
[2023-03-22 16:24:13] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:24:13] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:24:13] [INFO ] Input system was already deterministic with 538 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1775 transition count 1625
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1775 transition count 1625
Applied a total of 48 rules in 207 ms. Remains 1775 /1799 variables (removed 24) and now considering 1625/1649 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 1775/1799 places, 1625/1649 transitions.
[2023-03-22 16:24:14] [INFO ] Flatten gal took : 35 ms
[2023-03-22 16:24:14] [INFO ] Flatten gal took : 37 ms
[2023-03-22 16:24:14] [INFO ] Input system was already deterministic with 1625 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1798 transition count 1290
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 1440 transition count 1290
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 716 place count 1440 transition count 1066
Deduced a syphon composed of 224 places in 2 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 2 with 448 rules applied. Total rules applied 1164 place count 1216 transition count 1066
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1182 place count 1198 transition count 1048
Iterating global reduction 2 with 18 rules applied. Total rules applied 1200 place count 1198 transition count 1048
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 1200 place count 1198 transition count 1032
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1232 place count 1182 transition count 1032
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 0 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 2 with 958 rules applied. Total rules applied 2190 place count 703 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2191 place count 703 transition count 552
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2193 place count 702 transition count 551
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2194 place count 702 transition count 551
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2196 place count 700 transition count 549
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2198 place count 698 transition count 549
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2198 place count 698 transition count 548
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2200 place count 697 transition count 548
Applied a total of 2200 rules in 244 ms. Remains 697 /1799 variables (removed 1102) and now considering 548/1649 (removed 1101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 245 ms. Remains : 697/1799 places, 548/1649 transitions.
[2023-03-22 16:24:14] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:24:14] [INFO ] Flatten gal took : 17 ms
[2023-03-22 16:24:14] [INFO ] Input system was already deterministic with 548 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1772 transition count 1622
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1772 transition count 1622
Applied a total of 54 rules in 194 ms. Remains 1772 /1799 variables (removed 27) and now considering 1622/1649 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 1772/1799 places, 1622/1649 transitions.
[2023-03-22 16:24:14] [INFO ] Flatten gal took : 36 ms
[2023-03-22 16:24:14] [INFO ] Flatten gal took : 38 ms
[2023-03-22 16:24:14] [INFO ] Input system was already deterministic with 1622 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1774 transition count 1624
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1774 transition count 1624
Applied a total of 50 rules in 220 ms. Remains 1774 /1799 variables (removed 25) and now considering 1624/1649 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 1774/1799 places, 1624/1649 transitions.
[2023-03-22 16:24:15] [INFO ] Flatten gal took : 38 ms
[2023-03-22 16:24:15] [INFO ] Flatten gal took : 52 ms
[2023-03-22 16:24:15] [INFO ] Input system was already deterministic with 1624 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 1798 transition count 1286
Reduce places removed 362 places and 0 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 724 place count 1436 transition count 1286
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 225 Pre rules applied. Total rules applied 724 place count 1436 transition count 1061
Deduced a syphon composed of 225 places in 1 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 2 with 450 rules applied. Total rules applied 1174 place count 1211 transition count 1061
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1196 place count 1189 transition count 1039
Iterating global reduction 2 with 22 rules applied. Total rules applied 1218 place count 1189 transition count 1039
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 1218 place count 1189 transition count 1020
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 1256 place count 1170 transition count 1020
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 476
Deduced a syphon composed of 476 places in 1 ms
Reduce places removed 476 places and 0 transitions.
Iterating global reduction 2 with 952 rules applied. Total rules applied 2208 place count 694 transition count 544
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2209 place count 694 transition count 543
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2211 place count 693 transition count 542
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2213 place count 691 transition count 540
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2215 place count 689 transition count 540
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2215 place count 689 transition count 539
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 688 transition count 539
Applied a total of 2217 rules in 268 ms. Remains 688 /1799 variables (removed 1111) and now considering 539/1649 (removed 1110) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 268 ms. Remains : 688/1799 places, 539/1649 transitions.
[2023-03-22 16:24:15] [INFO ] Flatten gal took : 28 ms
[2023-03-22 16:24:15] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:24:15] [INFO ] Input system was already deterministic with 539 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1798 transition count 1288
Reduce places removed 360 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 362 rules applied. Total rules applied 722 place count 1438 transition count 1286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 724 place count 1436 transition count 1286
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 225 Pre rules applied. Total rules applied 724 place count 1436 transition count 1061
Deduced a syphon composed of 225 places in 1 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 1174 place count 1211 transition count 1061
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1197 place count 1188 transition count 1038
Iterating global reduction 3 with 23 rules applied. Total rules applied 1220 place count 1188 transition count 1038
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1220 place count 1188 transition count 1018
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1260 place count 1168 transition count 1018
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 475
Deduced a syphon composed of 475 places in 1 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 3 with 950 rules applied. Total rules applied 2210 place count 693 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2211 place count 693 transition count 542
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2213 place count 692 transition count 541
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2215 place count 690 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2217 place count 688 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2217 place count 688 transition count 538
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2219 place count 687 transition count 538
Applied a total of 2219 rules in 238 ms. Remains 687 /1799 variables (removed 1112) and now considering 538/1649 (removed 1111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 238 ms. Remains : 687/1799 places, 538/1649 transitions.
[2023-03-22 16:24:16] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:24:16] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:24:16] [INFO ] Input system was already deterministic with 538 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1775 transition count 1625
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1775 transition count 1625
Applied a total of 48 rules in 203 ms. Remains 1775 /1799 variables (removed 24) and now considering 1625/1649 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 1775/1799 places, 1625/1649 transitions.
[2023-03-22 16:24:16] [INFO ] Flatten gal took : 37 ms
[2023-03-22 16:24:16] [INFO ] Flatten gal took : 39 ms
[2023-03-22 16:24:16] [INFO ] Input system was already deterministic with 1625 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1799/1799 places, 1649/1649 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1772 transition count 1622
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1772 transition count 1622
Applied a total of 54 rules in 207 ms. Remains 1772 /1799 variables (removed 27) and now considering 1622/1649 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 1772/1799 places, 1622/1649 transitions.
[2023-03-22 16:24:16] [INFO ] Flatten gal took : 33 ms
[2023-03-22 16:24:16] [INFO ] Flatten gal took : 34 ms
[2023-03-22 16:24:16] [INFO ] Input system was already deterministic with 1622 transitions.
[2023-03-22 16:24:16] [INFO ] Flatten gal took : 35 ms
[2023-03-22 16:24:16] [INFO ] Flatten gal took : 36 ms
[2023-03-22 16:24:16] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-22 16:24:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1799 places, 1649 transitions and 4258 arcs took 7 ms.
Total runtime 89932 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 1799 NrTr: 1649 NrArc: 4258)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.212sec
net check time: 0m 0.000sec
init dd package: 0m 3.078sec
before gc: list nodes free: 1477226
after gc: idd nodes used:52700951, unused:11299049; list nodes free:50541098
RS generation: 33m41.089sec
-> last computed set: #nodes 52699154 (5.3e+07) #states 38,957,809,478,331,880,828,872,559 (25)
CANNOT_COMPUTE
BK_STOP 1679504313268
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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.007sec
idd.cc:820: DD Exception: No free nodes
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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldIIPt-PT-030B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717700297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030B.tgz
mv ShieldIIPt-PT-030B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;