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-167903718000490.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 ShieldPPPs-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000490
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 708K 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 ShieldPPPs-PT-040B-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679518612855

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 20:56:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 20:56:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:56:56] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-22 20:56:56] [INFO ] Transformed 2723 places.
[2023-03-22 20:56:56] [INFO ] Transformed 2523 transitions.
[2023-03-22 20:56:56] [INFO ] Found NUPN structural information;
[2023-03-22 20:56:56] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 222 out of 2723 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Discarding 245 places :
Symmetric choice reduction at 0 with 245 rule applications. Total rules 245 place count 2478 transition count 2278
Iterating global reduction 0 with 245 rules applied. Total rules applied 490 place count 2478 transition count 2278
Applied a total of 490 rules in 425 ms. Remains 2478 /2723 variables (removed 245) and now considering 2278/2523 (removed 245) transitions.
// Phase 1: matrix 2278 rows 2478 cols
[2023-03-22 20:56:57] [INFO ] Computed 441 place invariants in 35 ms
[2023-03-22 20:56:59] [INFO ] Implicit Places using invariants in 2254 ms returned []
[2023-03-22 20:56:59] [INFO ] Invariant cache hit.
[2023-03-22 20:57:05] [INFO ] Implicit Places using invariants and state equation in 5830 ms returned []
Implicit Place search using SMT with State Equation took 8194 ms to find 0 implicit places.
[2023-03-22 20:57:05] [INFO ] Invariant cache hit.
[2023-03-22 20:57:07] [INFO ] Dead Transitions using invariants and state equation in 2117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2478/2723 places, 2278/2523 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10742 ms. Remains : 2478/2723 places, 2278/2523 transitions.
Support contains 222 out of 2478 places after structural reductions.
[2023-03-22 20:57:08] [INFO ] Flatten gal took : 187 ms
[2023-03-22 20:57:08] [INFO ] Flatten gal took : 97 ms
[2023-03-22 20:57:08] [INFO ] Input system was already deterministic with 2278 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 655 ms. (steps per millisecond=15 ) properties (out of 126) seen :87
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) seen :0
Running SMT prover for 39 properties.
[2023-03-22 20:57:09] [INFO ] Invariant cache hit.
[2023-03-22 20:57:12] [INFO ] [Real]Absence check using 441 positive place invariants in 288 ms returned sat
[2023-03-22 20:57:13] [INFO ] After 3908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:39
[2023-03-22 20:57:15] [INFO ] [Nat]Absence check using 441 positive place invariants in 182 ms returned sat
[2023-03-22 20:57:26] [INFO ] After 7993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :39
[2023-03-22 20:57:27] [INFO ] Deduced a trap composed of 27 places in 714 ms of which 23 ms to minimize.
[2023-03-22 20:57:27] [INFO ] Deduced a trap composed of 28 places in 663 ms of which 2 ms to minimize.
[2023-03-22 20:57:28] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 1 ms to minimize.
[2023-03-22 20:57:29] [INFO ] Deduced a trap composed of 31 places in 720 ms of which 3 ms to minimize.
[2023-03-22 20:57:29] [INFO ] Deduced a trap composed of 25 places in 575 ms of which 14 ms to minimize.
[2023-03-22 20:57:30] [INFO ] Deduced a trap composed of 21 places in 679 ms of which 1 ms to minimize.
[2023-03-22 20:57:31] [INFO ] Deduced a trap composed of 44 places in 473 ms of which 12 ms to minimize.
[2023-03-22 20:57:31] [INFO ] Deduced a trap composed of 57 places in 623 ms of which 1 ms to minimize.
[2023-03-22 20:57:32] [INFO ] Deduced a trap composed of 55 places in 601 ms of which 1 ms to minimize.
[2023-03-22 20:57:33] [INFO ] Deduced a trap composed of 44 places in 435 ms of which 1 ms to minimize.
[2023-03-22 20:57:33] [INFO ] Deduced a trap composed of 50 places in 430 ms of which 0 ms to minimize.
[2023-03-22 20:57:34] [INFO ] Deduced a trap composed of 53 places in 470 ms of which 1 ms to minimize.
[2023-03-22 20:57:34] [INFO ] Deduced a trap composed of 78 places in 429 ms of which 1 ms to minimize.
[2023-03-22 20:57:35] [INFO ] Deduced a trap composed of 57 places in 422 ms of which 1 ms to minimize.
[2023-03-22 20:57:35] [INFO ] Deduced a trap composed of 71 places in 581 ms of which 1 ms to minimize.
[2023-03-22 20:57:36] [INFO ] Deduced a trap composed of 73 places in 479 ms of which 1 ms to minimize.
[2023-03-22 20:57:36] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 10398 ms
[2023-03-22 20:57:38] [INFO ] Deduced a trap composed of 23 places in 738 ms of which 2 ms to minimize.
[2023-03-22 20:57:38] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 847 ms
[2023-03-22 20:57:38] [INFO ] After 20036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :38
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 20:57:38] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :38
Parikh walk visited 1 properties in 7020 ms.
Support contains 88 out of 2478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Drop transitions removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 2478 transition count 2021
Reduce places removed 257 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 265 rules applied. Total rules applied 522 place count 2221 transition count 2013
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 530 place count 2213 transition count 2013
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 530 place count 2213 transition count 1813
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 930 place count 2013 transition count 1813
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 950 place count 1993 transition count 1793
Iterating global reduction 3 with 20 rules applied. Total rules applied 970 place count 1993 transition count 1793
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 970 place count 1993 transition count 1784
Deduced a syphon composed of 9 places in 10 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 988 place count 1984 transition count 1784
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 2 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 3 with 1354 rules applied. Total rules applied 2342 place count 1307 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 320 times.
Drop transitions removed 320 transitions
Iterating global reduction 3 with 320 rules applied. Total rules applied 2662 place count 1307 transition count 1107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2663 place count 1306 transition count 1106
Applied a total of 2663 rules in 703 ms. Remains 1306 /2478 variables (removed 1172) and now considering 1106/2278 (removed 1172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 703 ms. Remains : 1306/2478 places, 1106/2278 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 38) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1106 rows 1306 cols
[2023-03-22 20:57:47] [INFO ] Computed 441 place invariants in 25 ms
[2023-03-22 20:57:47] [INFO ] [Real]Absence check using 429 positive place invariants in 455 ms returned sat
[2023-03-22 20:57:47] [INFO ] [Real]Absence check using 429 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 20:57:49] [INFO ] After 2350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 20:57:49] [INFO ] [Nat]Absence check using 429 positive place invariants in 145 ms returned sat
[2023-03-22 20:57:49] [INFO ] [Nat]Absence check using 429 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 20:57:51] [INFO ] After 1757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 20:57:52] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 15 ms to minimize.
[2023-03-22 20:57:52] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 0 ms to minimize.
[2023-03-22 20:57:52] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 3 ms to minimize.
[2023-03-22 20:57:53] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 0 ms to minimize.
[2023-03-22 20:57:53] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 14 ms to minimize.
[2023-03-22 20:57:53] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-22 20:57:54] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2023-03-22 20:57:54] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2023-03-22 20:57:54] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 1 ms to minimize.
[2023-03-22 20:57:55] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 1 ms to minimize.
[2023-03-22 20:57:55] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 0 ms to minimize.
[2023-03-22 20:57:55] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
[2023-03-22 20:57:55] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2023-03-22 20:57:56] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 0 ms to minimize.
[2023-03-22 20:57:56] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 0 ms to minimize.
[2023-03-22 20:57:56] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 0 ms to minimize.
[2023-03-22 20:57:57] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 9 ms to minimize.
[2023-03-22 20:57:57] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 0 ms to minimize.
[2023-03-22 20:57:57] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-22 20:57:57] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2023-03-22 20:57:58] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2023-03-22 20:57:58] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2023-03-22 20:57:58] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 1 ms to minimize.
[2023-03-22 20:57:58] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2023-03-22 20:57:58] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 0 ms to minimize.
[2023-03-22 20:57:59] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 11 ms to minimize.
[2023-03-22 20:57:59] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7217 ms
[2023-03-22 20:57:59] [INFO ] Deduced a trap composed of 5 places in 508 ms of which 1 ms to minimize.
[2023-03-22 20:58:00] [INFO ] Deduced a trap composed of 4 places in 897 ms of which 1 ms to minimize.
[2023-03-22 20:58:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1710 ms
[2023-03-22 20:58:01] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2023-03-22 20:58:01] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 1 ms to minimize.
[2023-03-22 20:58:02] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 0 ms to minimize.
[2023-03-22 20:58:02] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2023-03-22 20:58:02] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 1 ms to minimize.
[2023-03-22 20:58:02] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-22 20:58:03] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 1 ms to minimize.
[2023-03-22 20:58:03] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-22 20:58:03] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 0 ms to minimize.
[2023-03-22 20:58:03] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2023-03-22 20:58:04] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-22 20:58:04] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2023-03-22 20:58:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3214 ms
[2023-03-22 20:58:04] [INFO ] Deduced a trap composed of 8 places in 374 ms of which 1 ms to minimize.
[2023-03-22 20:58:05] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-22 20:58:05] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-22 20:58:05] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 1 ms to minimize.
[2023-03-22 20:58:06] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-22 20:58:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1570 ms
[2023-03-22 20:58:06] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 0 ms to minimize.
[2023-03-22 20:58:06] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2023-03-22 20:58:07] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2023-03-22 20:58:07] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 9 ms to minimize.
[2023-03-22 20:58:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1071 ms
[2023-03-22 20:58:07] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2023-03-22 20:58:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-22 20:58:08] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 17 ms to minimize.
[2023-03-22 20:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-22 20:58:08] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 13 ms to minimize.
[2023-03-22 20:58:08] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 0 ms to minimize.
[2023-03-22 20:58:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 736 ms
[2023-03-22 20:58:09] [INFO ] After 18956ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 876 ms.
[2023-03-22 20:58:10] [INFO ] After 20594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 409 ms.
Support contains 40 out of 1306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 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 1306 transition count 1103
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1303 transition count 1103
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 1303 transition count 1097
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 1297 transition count 1097
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 64 place count 1274 transition count 1074
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 1274 transition count 1074
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1273 transition count 1073
Applied a total of 77 rules in 177 ms. Remains 1273 /1306 variables (removed 33) and now considering 1073/1106 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 1273/1306 places, 1073/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1073 rows 1273 cols
[2023-03-22 20:58:11] [INFO ] Computed 441 place invariants in 15 ms
[2023-03-22 20:58:12] [INFO ] [Real]Absence check using 424 positive place invariants in 129 ms returned sat
[2023-03-22 20:58:12] [INFO ] [Real]Absence check using 424 positive and 17 generalized place invariants in 40 ms returned sat
[2023-03-22 20:58:14] [INFO ] After 2566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 20:58:15] [INFO ] [Nat]Absence check using 424 positive place invariants in 118 ms returned sat
[2023-03-22 20:58:15] [INFO ] [Nat]Absence check using 424 positive and 17 generalized place invariants in 13 ms returned sat
[2023-03-22 20:58:16] [INFO ] After 1393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 20:58:17] [INFO ] Deduced a trap composed of 5 places in 404 ms of which 1 ms to minimize.
[2023-03-22 20:58:17] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-22 20:58:17] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2023-03-22 20:58:18] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2023-03-22 20:58:18] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 0 ms to minimize.
[2023-03-22 20:58:18] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
[2023-03-22 20:58:19] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2023-03-22 20:58:19] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-22 20:58:19] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-22 20:58:19] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 6 ms to minimize.
[2023-03-22 20:58:20] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2023-03-22 20:58:20] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 0 ms to minimize.
[2023-03-22 20:58:21] [INFO ] Deduced a trap composed of 10 places in 464 ms of which 1 ms to minimize.
[2023-03-22 20:58:21] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 14 ms to minimize.
[2023-03-22 20:58:21] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 1 ms to minimize.
[2023-03-22 20:58:21] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 1 ms to minimize.
[2023-03-22 20:58:22] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 0 ms to minimize.
[2023-03-22 20:58:22] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2023-03-22 20:58:22] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 1 ms to minimize.
[2023-03-22 20:58:23] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 0 ms to minimize.
[2023-03-22 20:58:23] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 1 ms to minimize.
[2023-03-22 20:58:23] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6511 ms
[2023-03-22 20:58:24] [INFO ] Deduced a trap composed of 9 places in 479 ms of which 0 ms to minimize.
[2023-03-22 20:58:24] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 1 ms to minimize.
[2023-03-22 20:58:24] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 0 ms to minimize.
[2023-03-22 20:58:25] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-22 20:58:25] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2023-03-22 20:58:25] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 13 ms to minimize.
[2023-03-22 20:58:25] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2023-03-22 20:58:26] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2023-03-22 20:58:26] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2023-03-22 20:58:26] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-22 20:58:26] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-22 20:58:27] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 0 ms to minimize.
[2023-03-22 20:58:27] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 0 ms to minimize.
[2023-03-22 20:58:27] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2023-03-22 20:58:27] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-22 20:58:28] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2023-03-22 20:58:28] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4429 ms
[2023-03-22 20:58:28] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 1 ms to minimize.
[2023-03-22 20:58:28] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2023-03-22 20:58:28] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-22 20:58:29] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-22 20:58:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1030 ms
[2023-03-22 20:58:29] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 0 ms to minimize.
[2023-03-22 20:58:29] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 1 ms to minimize.
[2023-03-22 20:58:30] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2023-03-22 20:58:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 900 ms
[2023-03-22 20:58:30] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-22 20:58:30] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2023-03-22 20:58:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2023-03-22 20:58:31] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-22 20:58:31] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2023-03-22 20:58:31] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-22 20:58:32] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
[2023-03-22 20:58:32] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 0 ms to minimize.
[2023-03-22 20:58:32] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 13 ms to minimize.
[2023-03-22 20:58:33] [INFO ] Deduced a trap composed of 12 places in 587 ms of which 0 ms to minimize.
[2023-03-22 20:58:33] [INFO ] Deduced a trap composed of 22 places in 439 ms of which 0 ms to minimize.
[2023-03-22 20:58:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2990 ms
[2023-03-22 20:58:34] [INFO ] After 18623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 754 ms.
[2023-03-22 20:58:34] [INFO ] After 20525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 419 ms.
Support contains 39 out of 1273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1273/1273 places, 1073/1073 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1272 transition count 1072
Applied a total of 2 rules in 61 ms. Remains 1272 /1273 variables (removed 1) and now considering 1072/1073 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1272/1273 places, 1072/1073 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1072 rows 1272 cols
[2023-03-22 20:58:36] [INFO ] Computed 441 place invariants in 15 ms
[2023-03-22 20:58:36] [INFO ] [Real]Absence check using 424 positive place invariants in 113 ms returned sat
[2023-03-22 20:58:36] [INFO ] [Real]Absence check using 424 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-22 20:58:38] [INFO ] After 1705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 20:58:38] [INFO ] [Nat]Absence check using 424 positive place invariants in 188 ms returned sat
[2023-03-22 20:58:38] [INFO ] [Nat]Absence check using 424 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-22 20:58:39] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 20:58:40] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-22 20:58:40] [INFO ] Deduced a trap composed of 6 places in 523 ms of which 1 ms to minimize.
[2023-03-22 20:58:40] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 0 ms to minimize.
[2023-03-22 20:58:41] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2023-03-22 20:58:41] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 1 ms to minimize.
[2023-03-22 20:58:41] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-22 20:58:42] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-22 20:58:42] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 0 ms to minimize.
[2023-03-22 20:58:42] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2023-03-22 20:58:42] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
[2023-03-22 20:58:43] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 0 ms to minimize.
[2023-03-22 20:58:43] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2023-03-22 20:58:43] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-22 20:58:44] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2023-03-22 20:58:44] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2023-03-22 20:58:44] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 14 ms to minimize.
[2023-03-22 20:58:44] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2023-03-22 20:58:45] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2023-03-22 20:58:45] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2023-03-22 20:58:45] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-22 20:58:45] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 0 ms to minimize.
[2023-03-22 20:58:46] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-22 20:58:46] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2023-03-22 20:58:46] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2023-03-22 20:58:46] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2023-03-22 20:58:47] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2023-03-22 20:58:47] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7231 ms
[2023-03-22 20:58:47] [INFO ] Deduced a trap composed of 5 places in 433 ms of which 1 ms to minimize.
[2023-03-22 20:58:48] [INFO ] Deduced a trap composed of 7 places in 381 ms of which 1 ms to minimize.
[2023-03-22 20:58:48] [INFO ] Deduced a trap composed of 10 places in 473 ms of which 1 ms to minimize.
[2023-03-22 20:58:49] [INFO ] Deduced a trap composed of 17 places in 758 ms of which 4 ms to minimize.
[2023-03-22 20:58:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2459 ms
[2023-03-22 20:58:50] [INFO ] Deduced a trap composed of 5 places in 380 ms of which 1 ms to minimize.
[2023-03-22 20:58:50] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 1 ms to minimize.
[2023-03-22 20:58:51] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 1 ms to minimize.
[2023-03-22 20:58:51] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2023-03-22 20:58:51] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-22 20:58:52] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 0 ms to minimize.
[2023-03-22 20:58:52] [INFO ] Deduced a trap composed of 6 places in 361 ms of which 1 ms to minimize.
[2023-03-22 20:58:52] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2023-03-22 20:58:53] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2023-03-22 20:58:53] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 0 ms to minimize.
[2023-03-22 20:58:53] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2023-03-22 20:58:53] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 0 ms to minimize.
[2023-03-22 20:58:54] [INFO ] Deduced a trap composed of 23 places in 383 ms of which 0 ms to minimize.
[2023-03-22 20:58:54] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2023-03-22 20:58:54] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 0 ms to minimize.
[2023-03-22 20:58:55] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5164 ms
[2023-03-22 20:58:55] [INFO ] Deduced a trap composed of 12 places in 463 ms of which 1 ms to minimize.
[2023-03-22 20:58:56] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 0 ms to minimize.
[2023-03-22 20:58:56] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2023-03-22 20:58:56] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-22 20:58:56] [INFO ] Deduced a trap composed of 14 places in 376 ms of which 1 ms to minimize.
[2023-03-22 20:58:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1839 ms
[2023-03-22 20:58:57] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-22 20:58:57] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 0 ms to minimize.
[2023-03-22 20:58:57] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-22 20:58:58] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 0 ms to minimize.
[2023-03-22 20:58:58] [INFO ] Deduced a trap composed of 7 places in 341 ms of which 1 ms to minimize.
[2023-03-22 20:58:59] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 1 ms to minimize.
[2023-03-22 20:58:59] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2023-03-22 20:58:59] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-22 20:58:59] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2023-03-22 20:59:00] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2023-03-22 20:59:00] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-22 20:59:00] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-22 20:59:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3617 ms
[2023-03-22 20:59:01] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-22 20:59:01] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
[2023-03-22 20:59:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 567 ms
[2023-03-22 20:59:01] [INFO ] After 22601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 542 ms.
[2023-03-22 20:59:01] [INFO ] After 23795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 269 ms.
Support contains 32 out of 1272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1272/1272 places, 1072/1072 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 1272 transition count 1071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1271 transition count 1071
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 1268 transition count 1068
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1268 transition count 1068
Applied a total of 13 rules in 105 ms. Remains 1268 /1272 variables (removed 4) and now considering 1068/1072 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 1268/1272 places, 1068/1072 transitions.
[2023-03-22 20:59:02] [INFO ] Flatten gal took : 70 ms
[2023-03-22 20:59:02] [INFO ] Flatten gal took : 74 ms
[2023-03-22 20:59:02] [INFO ] Input system was already deterministic with 2278 transitions.
Computed a total of 497 stabilizing places and 497 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 2444 transition count 2244
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 2444 transition count 2244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 2443 transition count 2243
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 2443 transition count 2243
Applied a total of 70 rules in 304 ms. Remains 2443 /2478 variables (removed 35) and now considering 2243/2278 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 2443/2478 places, 2243/2278 transitions.
[2023-03-22 20:59:03] [INFO ] Flatten gal took : 64 ms
[2023-03-22 20:59:03] [INFO ] Flatten gal took : 82 ms
[2023-03-22 20:59:03] [INFO ] Input system was already deterministic with 2243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2447 transition count 2247
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2447 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2446 transition count 2246
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2446 transition count 2246
Applied a total of 64 rules in 328 ms. Remains 2446 /2478 variables (removed 32) and now considering 2246/2278 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 2446/2478 places, 2246/2278 transitions.
[2023-03-22 20:59:03] [INFO ] Flatten gal took : 97 ms
[2023-03-22 20:59:03] [INFO ] Flatten gal took : 71 ms
[2023-03-22 20:59:03] [INFO ] Input system was already deterministic with 2246 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2477 transition count 1998
Reduce places removed 279 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 281 rules applied. Total rules applied 560 place count 2198 transition count 1996
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 562 place count 2196 transition count 1996
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 562 place count 2196 transition count 1798
Deduced a syphon composed of 198 places in 5 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 958 place count 1998 transition count 1798
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 991 place count 1965 transition count 1765
Iterating global reduction 3 with 33 rules applied. Total rules applied 1024 place count 1965 transition count 1765
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 1024 place count 1965 transition count 1753
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1048 place count 1953 transition count 1753
Performed 697 Post agglomeration using F-continuation condition.Transition count delta: 697
Deduced a syphon composed of 697 places in 2 ms
Reduce places removed 697 places and 0 transitions.
Iterating global reduction 3 with 1394 rules applied. Total rules applied 2442 place count 1256 transition count 1056
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2444 place count 1254 transition count 1054
Applied a total of 2444 rules in 531 ms. Remains 1254 /2478 variables (removed 1224) and now considering 1054/2278 (removed 1224) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 532 ms. Remains : 1254/2478 places, 1054/2278 transitions.
[2023-03-22 20:59:04] [INFO ] Flatten gal took : 45 ms
[2023-03-22 20:59:04] [INFO ] Flatten gal took : 50 ms
[2023-03-22 20:59:04] [INFO ] Input system was already deterministic with 1054 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2443 transition count 2243
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2443 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2442 transition count 2242
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2442 transition count 2242
Applied a total of 72 rules in 334 ms. Remains 2442 /2478 variables (removed 36) and now considering 2242/2278 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 2442/2478 places, 2242/2278 transitions.
[2023-03-22 20:59:05] [INFO ] Flatten gal took : 50 ms
[2023-03-22 20:59:05] [INFO ] Flatten gal took : 57 ms
[2023-03-22 20:59:05] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 2477 transition count 1999
Reduce places removed 278 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 280 rules applied. Total rules applied 558 place count 2199 transition count 1997
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 560 place count 2197 transition count 1997
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 560 place count 2197 transition count 1797
Deduced a syphon composed of 200 places in 5 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 960 place count 1997 transition count 1797
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 995 place count 1962 transition count 1762
Iterating global reduction 3 with 35 rules applied. Total rules applied 1030 place count 1962 transition count 1762
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 1030 place count 1962 transition count 1750
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1054 place count 1950 transition count 1750
Performed 703 Post agglomeration using F-continuation condition.Transition count delta: 703
Deduced a syphon composed of 703 places in 2 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 3 with 1406 rules applied. Total rules applied 2460 place count 1247 transition count 1047
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2462 place count 1245 transition count 1045
Applied a total of 2462 rules in 511 ms. Remains 1245 /2478 variables (removed 1233) and now considering 1045/2278 (removed 1233) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 511 ms. Remains : 1245/2478 places, 1045/2278 transitions.
[2023-03-22 20:59:05] [INFO ] Flatten gal took : 29 ms
[2023-03-22 20:59:05] [INFO ] Flatten gal took : 34 ms
[2023-03-22 20:59:06] [INFO ] Input system was already deterministic with 1045 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2446 transition count 2246
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2446 transition count 2246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 2445 transition count 2245
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 2445 transition count 2245
Applied a total of 66 rules in 461 ms. Remains 2445 /2478 variables (removed 33) and now considering 2245/2278 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 2445/2478 places, 2245/2278 transitions.
[2023-03-22 20:59:06] [INFO ] Flatten gal took : 48 ms
[2023-03-22 20:59:06] [INFO ] Flatten gal took : 52 ms
[2023-03-22 20:59:06] [INFO ] Input system was already deterministic with 2245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 2450 transition count 2250
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 2450 transition count 2250
Applied a total of 56 rules in 265 ms. Remains 2450 /2478 variables (removed 28) and now considering 2250/2278 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 2450/2478 places, 2250/2278 transitions.
[2023-03-22 20:59:07] [INFO ] Flatten gal took : 51 ms
[2023-03-22 20:59:07] [INFO ] Flatten gal took : 58 ms
[2023-03-22 20:59:07] [INFO ] Input system was already deterministic with 2250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2445 transition count 2245
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2445 transition count 2245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 2444 transition count 2244
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 2444 transition count 2244
Applied a total of 68 rules in 309 ms. Remains 2444 /2478 variables (removed 34) and now considering 2244/2278 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 2444/2478 places, 2244/2278 transitions.
[2023-03-22 20:59:07] [INFO ] Flatten gal took : 48 ms
[2023-03-22 20:59:07] [INFO ] Flatten gal took : 65 ms
[2023-03-22 20:59:07] [INFO ] Input system was already deterministic with 2244 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 2444 transition count 2244
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 2444 transition count 2244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 2443 transition count 2243
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 2443 transition count 2243
Applied a total of 70 rules in 380 ms. Remains 2443 /2478 variables (removed 35) and now considering 2243/2278 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 2443/2478 places, 2243/2278 transitions.
[2023-03-22 20:59:08] [INFO ] Flatten gal took : 53 ms
[2023-03-22 20:59:08] [INFO ] Flatten gal took : 59 ms
[2023-03-22 20:59:08] [INFO ] Input system was already deterministic with 2243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2449 transition count 2249
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2449 transition count 2249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 2448 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 2448 transition count 2248
Applied a total of 60 rules in 274 ms. Remains 2448 /2478 variables (removed 30) and now considering 2248/2278 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 2448/2478 places, 2248/2278 transitions.
[2023-03-22 20:59:08] [INFO ] Flatten gal took : 54 ms
[2023-03-22 20:59:08] [INFO ] Flatten gal took : 51 ms
[2023-03-22 20:59:09] [INFO ] Input system was already deterministic with 2248 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2443 transition count 2243
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2443 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2442 transition count 2242
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2442 transition count 2242
Applied a total of 72 rules in 331 ms. Remains 2442 /2478 variables (removed 36) and now considering 2242/2278 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 2442/2478 places, 2242/2278 transitions.
[2023-03-22 20:59:09] [INFO ] Flatten gal took : 53 ms
[2023-03-22 20:59:09] [INFO ] Flatten gal took : 58 ms
[2023-03-22 20:59:09] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2446 transition count 2246
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2446 transition count 2246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 2445 transition count 2245
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 2445 transition count 2245
Applied a total of 66 rules in 355 ms. Remains 2445 /2478 variables (removed 33) and now considering 2245/2278 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 2445/2478 places, 2245/2278 transitions.
[2023-03-22 20:59:10] [INFO ] Flatten gal took : 47 ms
[2023-03-22 20:59:10] [INFO ] Flatten gal took : 51 ms
[2023-03-22 20:59:10] [INFO ] Input system was already deterministic with 2245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2447 transition count 2247
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2447 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2446 transition count 2246
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2446 transition count 2246
Applied a total of 64 rules in 442 ms. Remains 2446 /2478 variables (removed 32) and now considering 2246/2278 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 2446/2478 places, 2246/2278 transitions.
[2023-03-22 20:59:10] [INFO ] Flatten gal took : 50 ms
[2023-03-22 20:59:10] [INFO ] Flatten gal took : 55 ms
[2023-03-22 20:59:10] [INFO ] Input system was already deterministic with 2246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2443 transition count 2243
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2443 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2442 transition count 2242
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2442 transition count 2242
Applied a total of 72 rules in 371 ms. Remains 2442 /2478 variables (removed 36) and now considering 2242/2278 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 2442/2478 places, 2242/2278 transitions.
[2023-03-22 20:59:11] [INFO ] Flatten gal took : 60 ms
[2023-03-22 20:59:11] [INFO ] Flatten gal took : 57 ms
[2023-03-22 20:59:11] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2443 transition count 2243
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2443 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2442 transition count 2242
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2442 transition count 2242
Applied a total of 72 rules in 286 ms. Remains 2442 /2478 variables (removed 36) and now considering 2242/2278 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 2442/2478 places, 2242/2278 transitions.
[2023-03-22 20:59:11] [INFO ] Flatten gal took : 46 ms
[2023-03-22 20:59:11] [INFO ] Flatten gal took : 49 ms
[2023-03-22 20:59:12] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 2477 transition count 1999
Reduce places removed 278 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 557 place count 2199 transition count 1998
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 2198 transition count 1998
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 558 place count 2198 transition count 1798
Deduced a syphon composed of 200 places in 7 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 958 place count 1998 transition count 1798
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 991 place count 1965 transition count 1765
Iterating global reduction 3 with 33 rules applied. Total rules applied 1024 place count 1965 transition count 1765
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1024 place count 1965 transition count 1754
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1046 place count 1954 transition count 1754
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 699
Deduced a syphon composed of 699 places in 2 ms
Reduce places removed 699 places and 0 transitions.
Iterating global reduction 3 with 1398 rules applied. Total rules applied 2444 place count 1255 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2446 place count 1253 transition count 1053
Applied a total of 2446 rules in 485 ms. Remains 1253 /2478 variables (removed 1225) and now considering 1053/2278 (removed 1225) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 485 ms. Remains : 1253/2478 places, 1053/2278 transitions.
[2023-03-22 20:59:12] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:59:12] [INFO ] Flatten gal took : 36 ms
[2023-03-22 20:59:12] [INFO ] Input system was already deterministic with 1053 transitions.
[2023-03-22 20:59:12] [INFO ] Flatten gal took : 63 ms
[2023-03-22 20:59:12] [INFO ] Flatten gal took : 65 ms
[2023-03-22 20:59:12] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-22 20:59:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2478 places, 2278 transitions and 6476 arcs took 9 ms.
Total runtime 136766 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 2478 NrTr: 2278 NrArc: 6476)

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

net check time: 0m 0.003sec

init dd package: 0m 2.885sec


before gc: list nodes free: 1897662

after gc: idd nodes used:44046665, unused:19953335; list nodes free:88043094

RS generation: 21m 2.965sec


-> last computed set: #nodes 44044189 (4.4e+07) #states 64,939,905,302,662 (13)


CANNOT_COMPUTE


BK_STOP 1679520044941

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.018sec

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="ShieldPPPs-PT-040B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldPPPs-PT-040B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903718000490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-PT-040B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;