Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695900513.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900513
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 104K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678730461085

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=BusinessProcesses-PT-09
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:01:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:01:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:01:03] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-13 18:01:03] [INFO ] Transformed 403 places.
[2023-03-13 18:01:03] [INFO ] Transformed 374 transitions.
[2023-03-13 18:01:03] [INFO ] Found NUPN structural information;
[2023-03-13 18:01:03] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 89 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 40 place count 363 transition count 335
Iterating global reduction 1 with 39 rules applied. Total rules applied 79 place count 363 transition count 335
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 89 place count 353 transition count 325
Iterating global reduction 1 with 10 rules applied. Total rules applied 99 place count 353 transition count 325
Applied a total of 99 rules in 83 ms. Remains 353 /403 variables (removed 50) and now considering 325/374 (removed 49) transitions.
// Phase 1: matrix 325 rows 353 cols
[2023-03-13 18:01:03] [INFO ] Computed 64 place invariants in 26 ms
[2023-03-13 18:01:03] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-13 18:01:03] [INFO ] Invariant cache hit.
[2023-03-13 18:01:03] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2023-03-13 18:01:03] [INFO ] Invariant cache hit.
[2023-03-13 18:01:04] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/403 places, 325/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 983 ms. Remains : 353/403 places, 325/374 transitions.
Support contains 89 out of 353 places after structural reductions.
[2023-03-13 18:01:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 18:01:04] [INFO ] Flatten gal took : 47 ms
FORMULA BusinessProcesses-PT-09-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:01:04] [INFO ] Flatten gal took : 27 ms
[2023-03-13 18:01:04] [INFO ] Input system was already deterministic with 325 transitions.
Support contains 82 out of 353 places (down from 89) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 51) seen :35
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 10 ms. (steps per millisecond=100 ) 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 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 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 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 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 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) 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 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) 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 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 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-13 18:01:05] [INFO ] Invariant cache hit.
[2023-03-13 18:01:05] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-13 18:01:05] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-13 18:01:05] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 18:01:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-13 18:01:05] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-13 18:01:05] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2023-03-13 18:01:05] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 8 ms to minimize.
[2023-03-13 18:01:05] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2023-03-13 18:01:05] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-13 18:01:05] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-13 18:01:06] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-03-13 18:01:06] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2023-03-13 18:01:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 350 ms
[2023-03-13 18:01:06] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 1 ms to minimize.
[2023-03-13 18:01:06] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 1 ms to minimize.
[2023-03-13 18:01:09] [INFO ] Deduced a trap composed of 87 places in 3167 ms of which 2 ms to minimize.
[2023-03-13 18:01:09] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2023-03-13 18:01:09] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:01:10] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 0 ms to minimize.
[2023-03-13 18:01:10] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 0 ms to minimize.
[2023-03-13 18:01:10] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 1 ms to minimize.
[2023-03-13 18:01:10] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 0 ms to minimize.
[2023-03-13 18:01:10] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 1 ms to minimize.
[2023-03-13 18:01:10] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 1 ms to minimize.
[2023-03-13 18:01:10] [INFO ] Deduced a trap composed of 70 places in 144 ms of which 1 ms to minimize.
[2023-03-13 18:01:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4697 ms
[2023-03-13 18:01:11] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2023-03-13 18:01:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-13 18:01:11] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2023-03-13 18:01:11] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2023-03-13 18:01:11] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 1 ms to minimize.
[2023-03-13 18:01:11] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 1 ms to minimize.
[2023-03-13 18:01:11] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-13 18:01:11] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 0 ms to minimize.
[2023-03-13 18:01:12] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 1 ms to minimize.
[2023-03-13 18:01:12] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 0 ms to minimize.
[2023-03-13 18:01:12] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2023-03-13 18:01:12] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 1 ms to minimize.
[2023-03-13 18:01:12] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2023-03-13 18:01:12] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-03-13 18:01:12] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2023-03-13 18:01:13] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2023-03-13 18:01:13] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2023-03-13 18:01:13] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 3 ms to minimize.
[2023-03-13 18:01:13] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2236 ms
[2023-03-13 18:01:13] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 1 ms to minimize.
[2023-03-13 18:01:13] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 0 ms to minimize.
[2023-03-13 18:01:13] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 0 ms to minimize.
[2023-03-13 18:01:13] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 1 ms to minimize.
[2023-03-13 18:01:14] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 0 ms to minimize.
[2023-03-13 18:01:14] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 1 ms to minimize.
[2023-03-13 18:01:14] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 1 ms to minimize.
[2023-03-13 18:01:14] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 1 ms to minimize.
[2023-03-13 18:01:14] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 0 ms to minimize.
[2023-03-13 18:01:14] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 1 ms to minimize.
[2023-03-13 18:01:14] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:01:15] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 1 ms to minimize.
[2023-03-13 18:01:15] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 1 ms to minimize.
[2023-03-13 18:01:15] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 1 ms to minimize.
[2023-03-13 18:01:15] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 1 ms to minimize.
[2023-03-13 18:01:15] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2023-03-13 18:01:15] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 1 ms to minimize.
[2023-03-13 18:01:16] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 0 ms to minimize.
[2023-03-13 18:01:16] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 0 ms to minimize.
[2023-03-13 18:01:16] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 1 ms to minimize.
[2023-03-13 18:01:16] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 1 ms to minimize.
[2023-03-13 18:01:16] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2023-03-13 18:01:16] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 0 ms to minimize.
[2023-03-13 18:01:17] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 0 ms to minimize.
[2023-03-13 18:01:17] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 0 ms to minimize.
[2023-03-13 18:01:17] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 0 ms to minimize.
[2023-03-13 18:01:17] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 1 ms to minimize.
[2023-03-13 18:01:17] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:01:17] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2023-03-13 18:01:17] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2023-03-13 18:01:18] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2023-03-13 18:01:18] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 1 ms to minimize.
[2023-03-13 18:01:18] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 3 ms to minimize.
[2023-03-13 18:01:18] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 1 ms to minimize.
[2023-03-13 18:01:18] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 15 ms to minimize.
[2023-03-13 18:01:18] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 0 ms to minimize.
[2023-03-13 18:01:19] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 0 ms to minimize.
[2023-03-13 18:01:19] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 1 ms to minimize.
[2023-03-13 18:01:19] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 1 ms to minimize.
[2023-03-13 18:01:19] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 1 ms to minimize.
[2023-03-13 18:01:19] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 1 ms to minimize.
[2023-03-13 18:01:19] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 0 ms to minimize.
[2023-03-13 18:01:19] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 1 ms to minimize.
[2023-03-13 18:01:20] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 1 ms to minimize.
[2023-03-13 18:01:20] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 6738 ms
[2023-03-13 18:01:20] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 1 ms to minimize.
[2023-03-13 18:01:20] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 0 ms to minimize.
[2023-03-13 18:01:20] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 1 ms to minimize.
[2023-03-13 18:01:21] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 1 ms to minimize.
[2023-03-13 18:01:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 717 ms
[2023-03-13 18:01:21] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 0 ms to minimize.
[2023-03-13 18:01:21] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2023-03-13 18:01:21] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 0 ms to minimize.
[2023-03-13 18:01:21] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2023-03-13 18:01:21] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2023-03-13 18:01:21] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 1 ms to minimize.
[2023-03-13 18:01:22] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2023-03-13 18:01:22] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 0 ms to minimize.
[2023-03-13 18:01:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1085 ms
[2023-03-13 18:01:22] [INFO ] After 16804ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 349 ms.
[2023-03-13 18:01:22] [INFO ] After 17382ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 4 properties in 210 ms.
Support contains 22 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 325/325 transitions.
Graph (trivial) has 151 edges and 353 vertex of which 4 / 353 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 788 edges and 350 vertex of which 349 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 349 transition count 286
Reduce places removed 34 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 315 transition count 282
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 311 transition count 282
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 78 place count 311 transition count 216
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 219 place count 236 transition count 216
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 236 place count 219 transition count 199
Iterating global reduction 3 with 17 rules applied. Total rules applied 253 place count 219 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 253 place count 219 transition count 198
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 255 place count 218 transition count 198
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 390 place count 149 transition count 132
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 392 place count 149 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 394 place count 147 transition count 130
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 147 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 146 transition count 129
Applied a total of 396 rules in 96 ms. Remains 146 /353 variables (removed 207) and now considering 129/325 (removed 196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 146/353 places, 129/325 transitions.
Incomplete random walk after 10000 steps, including 409 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 129 rows 146 cols
[2023-03-13 18:01:23] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-13 18:01:23] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:01:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-13 18:01:23] [INFO ] [Nat]Absence check using 34 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-13 18:01:23] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:01:23] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2023-03-13 18:01:23] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2023-03-13 18:01:23] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2023-03-13 18:01:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 181 ms
[2023-03-13 18:01:23] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 18:01:23] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 129/129 transitions.
Graph (trivial) has 22 edges and 146 vertex of which 2 / 146 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 145 transition count 121
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 139 transition count 121
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 139 transition count 118
Deduced a syphon composed of 3 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 135 transition count 118
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 130 transition count 113
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 130 transition count 113
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 125 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 124 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 124 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 123 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 122 transition count 109
Applied a total of 45 rules in 58 ms. Remains 122 /146 variables (removed 24) and now considering 109/129 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 122/146 places, 109/129 transitions.
Incomplete random walk after 10000 steps, including 556 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1490954 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :{}
Probabilistic random walk after 1490954 steps, saw 444171 distinct states, run finished after 3014 ms. (steps per millisecond=494 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 122 cols
[2023-03-13 18:01:26] [INFO ] Computed 51 place invariants in 8 ms
[2023-03-13 18:01:26] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:01:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-13 18:01:26] [INFO ] [Nat]Absence check using 33 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-13 18:01:26] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:01:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 18:01:26] [INFO ] After 20ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:01:27] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2023-03-13 18:01:27] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2023-03-13 18:01:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-03-13 18:01:27] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-13 18:01:27] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 109/109 transitions.
Applied a total of 0 rules in 15 ms. Remains 122 /122 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 122/122 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 109/109 transitions.
Applied a total of 0 rules in 11 ms. Remains 122 /122 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-13 18:01:27] [INFO ] Invariant cache hit.
[2023-03-13 18:01:27] [INFO ] Implicit Places using invariants in 134 ms returned [11, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 149 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/122 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 165 ms. Remains : 120/122 places, 109/109 transitions.
Incomplete random walk after 10000 steps, including 554 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1430015 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :{}
Probabilistic random walk after 1430015 steps, saw 406850 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 120 cols
[2023-03-13 18:01:30] [INFO ] Computed 49 place invariants in 6 ms
[2023-03-13 18:01:30] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:01:30] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-13 18:01:30] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-13 18:01:30] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:01:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 18:01:30] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:01:30] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-03-13 18:01:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-13 18:01:30] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-13 18:01:30] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 120/120 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 109/109 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-13 18:01:30] [INFO ] Invariant cache hit.
[2023-03-13 18:01:30] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-13 18:01:30] [INFO ] Invariant cache hit.
[2023-03-13 18:01:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 18:01:31] [INFO ] Implicit Places using invariants and state equation in 201 ms returned [50, 70, 72, 78, 80]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 395 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 115/120 places, 109/109 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 115 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 114 transition count 108
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 8 place count 111 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 111 transition count 105
Applied a total of 9 rules in 22 ms. Remains 111 /115 variables (removed 4) and now considering 105/109 (removed 4) transitions.
// Phase 1: matrix 105 rows 111 cols
[2023-03-13 18:01:31] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-13 18:01:31] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-13 18:01:31] [INFO ] Invariant cache hit.
[2023-03-13 18:01:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 18:01:31] [INFO ] Implicit Places using invariants and state equation in 184 ms returned [15, 38, 40, 41]
Discarding 4 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 310 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 107/120 places, 101/109 transitions.
Graph (complete) has 386 edges and 107 vertex of which 98 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 89 transition count 65
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 89 transition count 65
Applied a total of 19 rules in 7 ms. Remains 89 /107 variables (removed 18) and now considering 65/101 (removed 36) transitions.
// Phase 1: matrix 65 rows 89 cols
[2023-03-13 18:01:31] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-13 18:01:31] [INFO ] Implicit Places using invariants in 70 ms returned [15, 16, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 86/120 places, 65/109 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 86 transition count 61
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 82 transition count 61
Applied a total of 8 rules in 13 ms. Remains 82 /86 variables (removed 4) and now considering 61/65 (removed 4) transitions.
// Phase 1: matrix 61 rows 82 cols
[2023-03-13 18:01:31] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-13 18:01:31] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-13 18:01:31] [INFO ] Invariant cache hit.
[2023-03-13 18:01:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:01:31] [INFO ] Implicit Places using invariants and state equation in 192 ms returned [42, 46, 48]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 276 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 79/120 places, 61/109 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 67 transition count 53
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 65 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 65 transition count 51
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 0 with 2 rules applied. Total rules applied 26 place count 64 transition count 50
Applied a total of 26 rules in 15 ms. Remains 64 /79 variables (removed 15) and now considering 50/61 (removed 11) transitions.
// Phase 1: matrix 50 rows 64 cols
[2023-03-13 18:01:31] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-13 18:01:31] [INFO ] Implicit Places using invariants in 89 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 63/120 places, 50/109 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 49
Applied a total of 2 rules in 6 ms. Remains 62 /63 variables (removed 1) and now considering 49/50 (removed 1) transitions.
// Phase 1: matrix 49 rows 62 cols
[2023-03-13 18:01:31] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-13 18:01:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-13 18:01:31] [INFO ] Invariant cache hit.
[2023-03-13 18:01:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:01:32] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 62/120 places, 49/109 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 1368 ms. Remains : 62/120 places, 49/109 transitions.
Incomplete random walk after 10000 steps, including 741 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 199 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2241345 steps, run timeout after 3001 ms. (steps per millisecond=746 ) properties seen :{}
Probabilistic random walk after 2241345 steps, saw 688061 distinct states, run finished after 3001 ms. (steps per millisecond=746 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 18:01:35] [INFO ] Invariant cache hit.
[2023-03-13 18:01:35] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:01:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-13 18:01:35] [INFO ] [Nat]Absence check using 20 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-13 18:01:35] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:01:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:01:35] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:01:35] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-13 18:01:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 18:01:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-03-13 18:01:35] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-13 18:01:35] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 49/49 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 62/62 places, 49/49 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-13 18:01:35] [INFO ] Invariant cache hit.
[2023-03-13 18:01:35] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-13 18:01:35] [INFO ] Invariant cache hit.
[2023-03-13 18:01:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:01:35] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-13 18:01:35] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-13 18:01:35] [INFO ] Invariant cache hit.
[2023-03-13 18:01:35] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 62/62 places, 49/49 transitions.
Graph (complete) has 160 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 3 place count 61 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 60 transition count 47
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 60 transition count 43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 56 transition count 43
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 56 transition count 43
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 56 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 56 transition count 42
Applied a total of 19 rules in 14 ms. Remains 56 /62 variables (removed 6) and now considering 42/49 (removed 7) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 42 rows 56 cols
[2023-03-13 18:01:35] [INFO ] Computed 23 place invariants in 0 ms
[2023-03-13 18:01:35] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:01:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-13 18:01:35] [INFO ] [Nat]Absence check using 19 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-13 18:01:35] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:01:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 18:01:35] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:01:35] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-13 18:01:35] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-13 18:01:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-13 18:01:35] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-13 18:01:35] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 37 ms
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 36 ms
[2023-03-13 18:01:36] [INFO ] Input system was already deterministic with 325 transitions.
Computed a total of 214 stabilizing places and 216 stable transitions
Graph (complete) has 792 edges and 353 vertex of which 352 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Graph (trivial) has 167 edges and 353 vertex of which 7 / 353 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 785 edges and 347 vertex of which 346 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 345 transition count 274
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 303 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 302 transition count 273
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 88 place count 302 transition count 210
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 224 place count 229 transition count 210
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 241 place count 212 transition count 193
Iterating global reduction 3 with 17 rules applied. Total rules applied 258 place count 212 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 258 place count 212 transition count 192
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 260 place count 211 transition count 192
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 408 place count 136 transition count 119
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 410 place count 135 transition count 118
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 416 place count 135 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 134 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 133 transition count 117
Applied a total of 418 rules in 113 ms. Remains 133 /353 variables (removed 220) and now considering 117/325 (removed 208) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 113 ms. Remains : 133/353 places, 117/325 transitions.
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:01:36] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Graph (trivial) has 173 edges and 353 vertex of which 7 / 353 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 785 edges and 347 vertex of which 346 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 345 transition count 273
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 302 transition count 273
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 88 place count 302 transition count 206
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 232 place count 225 transition count 206
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 255 place count 202 transition count 183
Iterating global reduction 2 with 23 rules applied. Total rules applied 278 place count 202 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 278 place count 202 transition count 181
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 282 place count 200 transition count 181
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 425 place count 127 transition count 111
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 2 with 2 rules applied. Total rules applied 427 place count 126 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 428 place count 125 transition count 109
Applied a total of 428 rules in 43 ms. Remains 125 /353 variables (removed 228) and now considering 109/325 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 125/353 places, 109/325 transitions.
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:01:36] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 330 transition count 302
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 330 transition count 302
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 320 transition count 292
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 320 transition count 292
Applied a total of 66 rules in 19 ms. Remains 320 /353 variables (removed 33) and now considering 292/325 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 320/353 places, 292/325 transitions.
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 16 ms
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 16 ms
[2023-03-13 18:01:36] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 329 transition count 301
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 329 transition count 301
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 320 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 320 transition count 292
Applied a total of 66 rules in 24 ms. Remains 320 /353 variables (removed 33) and now considering 292/325 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 320/353 places, 292/325 transitions.
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 15 ms
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 15 ms
[2023-03-13 18:01:36] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 327 transition count 299
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 327 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 317 transition count 289
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 317 transition count 289
Applied a total of 72 rules in 16 ms. Remains 317 /353 variables (removed 36) and now considering 289/325 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 317/353 places, 289/325 transitions.
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:01:36] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 327 transition count 299
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 327 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 317 transition count 289
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 317 transition count 289
Applied a total of 72 rules in 15 ms. Remains 317 /353 variables (removed 36) and now considering 289/325 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 317/353 places, 289/325 transitions.
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:01:36] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 329 transition count 301
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 329 transition count 301
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 320 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 320 transition count 292
Applied a total of 66 rules in 16 ms. Remains 320 /353 variables (removed 33) and now considering 292/325 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 320/353 places, 292/325 transitions.
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:01:36] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Graph (trivial) has 175 edges and 353 vertex of which 7 / 353 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 785 edges and 347 vertex of which 346 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 345 transition count 272
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 301 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 300 transition count 271
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 92 place count 300 transition count 204
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 236 place count 223 transition count 204
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 258 place count 201 transition count 182
Iterating global reduction 3 with 22 rules applied. Total rules applied 280 place count 201 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 280 place count 201 transition count 181
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 282 place count 200 transition count 181
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 423 place count 128 transition count 112
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 425 place count 127 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 426 place count 126 transition count 110
Applied a total of 426 rules in 47 ms. Remains 126 /353 variables (removed 227) and now considering 110/325 (removed 215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 126/353 places, 110/325 transitions.
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:01:36] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 328 transition count 300
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 328 transition count 300
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 319 transition count 291
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 319 transition count 291
Applied a total of 68 rules in 13 ms. Remains 319 /353 variables (removed 34) and now considering 291/325 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 319/353 places, 291/325 transitions.
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:01:36] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:01:36] [INFO ] Input system was already deterministic with 291 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 331 transition count 303
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 331 transition count 303
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 325 transition count 297
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 325 transition count 297
Applied a total of 56 rules in 12 ms. Remains 325 /353 variables (removed 28) and now considering 297/325 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 325/353 places, 297/325 transitions.
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 15 ms
[2023-03-13 18:01:37] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 330 transition count 302
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 330 transition count 302
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 322 transition count 294
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 322 transition count 294
Applied a total of 62 rules in 14 ms. Remains 322 /353 variables (removed 31) and now considering 294/325 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 322/353 places, 294/325 transitions.
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:01:37] [INFO ] Input system was already deterministic with 294 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 327 transition count 299
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 327 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 317 transition count 289
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 317 transition count 289
Applied a total of 72 rules in 16 ms. Remains 317 /353 variables (removed 36) and now considering 289/325 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 317/353 places, 289/325 transitions.
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:01:37] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 330 transition count 302
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 330 transition count 302
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 323 transition count 295
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 323 transition count 295
Applied a total of 60 rules in 22 ms. Remains 323 /353 variables (removed 30) and now considering 295/325 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 323/353 places, 295/325 transitions.
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:01:37] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 327 transition count 299
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 327 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 317 transition count 289
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 317 transition count 289
Applied a total of 72 rules in 16 ms. Remains 317 /353 variables (removed 36) and now considering 289/325 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 317/353 places, 289/325 transitions.
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:01:37] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 325/325 transitions.
Graph (trivial) has 176 edges and 353 vertex of which 7 / 353 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 785 edges and 347 vertex of which 346 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 345 transition count 271
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 300 transition count 271
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 92 place count 300 transition count 205
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 233 place count 225 transition count 205
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 256 place count 202 transition count 182
Iterating global reduction 2 with 23 rules applied. Total rules applied 279 place count 202 transition count 182
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 279 place count 202 transition count 180
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 283 place count 200 transition count 180
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 432 place count 124 transition count 107
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 2 with 2 rules applied. Total rules applied 434 place count 123 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 435 place count 122 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 121 transition count 105
Applied a total of 436 rules in 20 ms. Remains 121 /353 variables (removed 232) and now considering 105/325 (removed 220) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 121/353 places, 105/325 transitions.
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:01:37] [INFO ] Input system was already deterministic with 105 transitions.
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:01:37] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:01:37] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 18:01:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 353 places, 325 transitions and 1049 arcs took 2 ms.
Total runtime 34511 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: 353 NrTr: 325 NrArc: 1049)

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

net check time: 0m 0.000sec

init dd package: 0m 3.142sec


before gc: list nodes free: 552203

after gc: idd nodes used:37806514, unused:26193486; list nodes free:109901650

RS generation: 28m44.047sec


-> last computed set: #nodes 37806163 (3.8e+07) #states 1,908,425,143 (9)


CANNOT_COMPUTE


BK_STOP 1678732252141

--------------------
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.002sec

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="BusinessProcesses-PT-09"
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 BusinessProcesses-PT-09, 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 r042-tajo-167813695900513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-09.tgz
mv BusinessProcesses-PT-09 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;