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-167813696000602.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-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000602
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 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 192K 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-20-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678735426772

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:23:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:23:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:23:48] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-13 19:23:48] [INFO ] Transformed 782 places.
[2023-03-13 19:23:48] [INFO ] Transformed 697 transitions.
[2023-03-13 19:23:48] [INFO ] Found NUPN structural information;
[2023-03-13 19:23:48] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 63 places in 17 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 103 place count 616 transition count 549
Iterating global reduction 1 with 89 rules applied. Total rules applied 192 place count 616 transition count 549
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 230 place count 578 transition count 511
Iterating global reduction 1 with 38 rules applied. Total rules applied 268 place count 578 transition count 511
Applied a total of 268 rules in 114 ms. Remains 578 /719 variables (removed 141) and now considering 511/638 (removed 127) transitions.
// Phase 1: matrix 511 rows 578 cols
[2023-03-13 19:23:48] [INFO ] Computed 107 place invariants in 25 ms
[2023-03-13 19:23:49] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-13 19:23:49] [INFO ] Invariant cache hit.
[2023-03-13 19:23:49] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-03-13 19:23:49] [INFO ] Invariant cache hit.
[2023-03-13 19:23:49] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/719 places, 511/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1223 ms. Remains : 578/719 places, 511/638 transitions.
Support contains 99 out of 578 places after structural reductions.
[2023-03-13 19:23:50] [INFO ] Flatten gal took : 84 ms
[2023-03-13 19:23:50] [INFO ] Flatten gal took : 36 ms
[2023-03-13 19:23:50] [INFO ] Input system was already deterministic with 511 transitions.
Support contains 94 out of 578 places (down from 99) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 58) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) 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 25) seen :0
Running SMT prover for 25 properties.
[2023-03-13 19:23:51] [INFO ] Invariant cache hit.
[2023-03-13 19:23:51] [INFO ] [Real]Absence check using 65 positive place invariants in 20 ms returned sat
[2023-03-13 19:23:51] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-13 19:23:51] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:24
[2023-03-13 19:23:51] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
[2023-03-13 19:23:51] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-13 19:23:51] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2023-03-13 19:23:51] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2023-03-13 19:23:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 282 ms
[2023-03-13 19:23:51] [INFO ] After 465ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-13 19:23:51] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-13 19:23:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-13 19:23:52] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 12 ms returned sat
[2023-03-13 19:23:52] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :23
[2023-03-13 19:23:53] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-13 19:23:53] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2023-03-13 19:23:53] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 1 ms to minimize.
[2023-03-13 19:23:53] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 1 ms to minimize.
[2023-03-13 19:23:53] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:23:54] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 1 ms to minimize.
[2023-03-13 19:23:54] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:23:54] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:23:54] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 0 ms to minimize.
[2023-03-13 19:23:54] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 1 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 0 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2720 ms
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 1 ms to minimize.
[2023-03-13 19:23:56] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:23:56] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 1 ms to minimize.
[2023-03-13 19:23:56] [INFO ] Deduced a trap composed of 116 places in 160 ms of which 1 ms to minimize.
[2023-03-13 19:23:56] [INFO ] Deduced a trap composed of 117 places in 125 ms of which 0 ms to minimize.
[2023-03-13 19:23:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 896 ms
[2023-03-13 19:23:56] [INFO ] Deduced a trap composed of 121 places in 141 ms of which 1 ms to minimize.
[2023-03-13 19:23:57] [INFO ] Deduced a trap composed of 122 places in 159 ms of which 1 ms to minimize.
[2023-03-13 19:23:57] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 1 ms to minimize.
[2023-03-13 19:23:57] [INFO ] Deduced a trap composed of 121 places in 166 ms of which 1 ms to minimize.
[2023-03-13 19:23:57] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 1 ms to minimize.
[2023-03-13 19:23:57] [INFO ] Deduced a trap composed of 108 places in 169 ms of which 1 ms to minimize.
[2023-03-13 19:23:58] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 1 ms to minimize.
[2023-03-13 19:23:58] [INFO ] Deduced a trap composed of 135 places in 128 ms of which 0 ms to minimize.
[2023-03-13 19:23:58] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 2 ms to minimize.
[2023-03-13 19:23:58] [INFO ] Deduced a trap composed of 119 places in 176 ms of which 0 ms to minimize.
[2023-03-13 19:23:58] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:23:58] [INFO ] Deduced a trap composed of 119 places in 141 ms of which 0 ms to minimize.
[2023-03-13 19:23:59] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 0 ms to minimize.
[2023-03-13 19:23:59] [INFO ] Deduced a trap composed of 124 places in 169 ms of which 1 ms to minimize.
[2023-03-13 19:23:59] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 2 ms to minimize.
[2023-03-13 19:23:59] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 1 ms to minimize.
[2023-03-13 19:23:59] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 0 ms to minimize.
[2023-03-13 19:24:00] [INFO ] Deduced a trap composed of 116 places in 163 ms of which 1 ms to minimize.
[2023-03-13 19:24:00] [INFO ] Deduced a trap composed of 124 places in 184 ms of which 1 ms to minimize.
[2023-03-13 19:24:00] [INFO ] Deduced a trap composed of 121 places in 146 ms of which 1 ms to minimize.
[2023-03-13 19:24:00] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 1 ms to minimize.
[2023-03-13 19:24:00] [INFO ] Deduced a trap composed of 117 places in 175 ms of which 1 ms to minimize.
[2023-03-13 19:24:01] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 0 ms to minimize.
[2023-03-13 19:24:01] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 1 ms to minimize.
[2023-03-13 19:24:01] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 1 ms to minimize.
[2023-03-13 19:24:01] [INFO ] Deduced a trap composed of 119 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:24:01] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 0 ms to minimize.
[2023-03-13 19:24:02] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 1 ms to minimize.
[2023-03-13 19:24:02] [INFO ] Deduced a trap composed of 120 places in 168 ms of which 1 ms to minimize.
[2023-03-13 19:24:02] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 1 ms to minimize.
[2023-03-13 19:24:02] [INFO ] Deduced a trap composed of 112 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:24:02] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 1 ms to minimize.
[2023-03-13 19:24:03] [INFO ] Deduced a trap composed of 121 places in 172 ms of which 0 ms to minimize.
[2023-03-13 19:24:03] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 1 ms to minimize.
[2023-03-13 19:24:03] [INFO ] Deduced a trap composed of 116 places in 163 ms of which 1 ms to minimize.
[2023-03-13 19:24:03] [INFO ] Deduced a trap composed of 118 places in 131 ms of which 1 ms to minimize.
[2023-03-13 19:24:03] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 1 ms to minimize.
[2023-03-13 19:24:03] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 0 ms to minimize.
[2023-03-13 19:24:04] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2023-03-13 19:24:04] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 0 ms to minimize.
[2023-03-13 19:24:04] [INFO ] Deduced a trap composed of 130 places in 132 ms of which 2 ms to minimize.
[2023-03-13 19:24:04] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 0 ms to minimize.
[2023-03-13 19:24:04] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 1 ms to minimize.
[2023-03-13 19:24:04] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 1 ms to minimize.
[2023-03-13 19:24:05] [INFO ] Deduced a trap composed of 117 places in 180 ms of which 0 ms to minimize.
[2023-03-13 19:24:05] [INFO ] Deduced a trap composed of 117 places in 157 ms of which 1 ms to minimize.
[2023-03-13 19:24:05] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 1 ms to minimize.
[2023-03-13 19:24:05] [INFO ] Deduced a trap composed of 109 places in 158 ms of which 1 ms to minimize.
[2023-03-13 19:24:05] [INFO ] Deduced a trap composed of 115 places in 159 ms of which 1 ms to minimize.
[2023-03-13 19:24:06] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:24:06] [INFO ] Deduced a trap composed of 116 places in 170 ms of which 1 ms to minimize.
[2023-03-13 19:24:06] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 0 ms to minimize.
[2023-03-13 19:24:06] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:24:06] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:24:07] [INFO ] Deduced a trap composed of 114 places in 166 ms of which 0 ms to minimize.
[2023-03-13 19:24:07] [INFO ] Deduced a trap composed of 115 places in 181 ms of which 3 ms to minimize.
[2023-03-13 19:24:07] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 1 ms to minimize.
[2023-03-13 19:24:07] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 0 ms to minimize.
[2023-03-13 19:24:07] [INFO ] Deduced a trap composed of 117 places in 175 ms of which 0 ms to minimize.
[2023-03-13 19:24:08] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 0 ms to minimize.
[2023-03-13 19:24:08] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 1 ms to minimize.
[2023-03-13 19:24:08] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 0 ms to minimize.
[2023-03-13 19:24:08] [INFO ] Deduced a trap composed of 121 places in 130 ms of which 1 ms to minimize.
[2023-03-13 19:24:08] [INFO ] Deduced a trap composed of 125 places in 153 ms of which 0 ms to minimize.
[2023-03-13 19:24:08] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:24:09] [INFO ] Deduced a trap composed of 125 places in 169 ms of which 1 ms to minimize.
[2023-03-13 19:24:09] [INFO ] Deduced a trap composed of 120 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:24:09] [INFO ] Deduced a trap composed of 126 places in 168 ms of which 1 ms to minimize.
[2023-03-13 19:24:09] [INFO ] Deduced a trap composed of 88 places in 170 ms of which 1 ms to minimize.
[2023-03-13 19:24:10] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 0 ms to minimize.
[2023-03-13 19:24:10] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 0 ms to minimize.
[2023-03-13 19:24:10] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2023-03-13 19:24:10] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 1 ms to minimize.
[2023-03-13 19:24:10] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 1 ms to minimize.
[2023-03-13 19:24:10] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 1 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 1 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 1 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 0 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 1 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 1 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 0 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 0 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 0 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 0 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 1 ms to minimize.
[2023-03-13 19:24:13] [INFO ] Deduced a trap composed of 126 places in 136 ms of which 0 ms to minimize.
[2023-03-13 19:24:13] [INFO ] Deduced a trap composed of 102 places in 168 ms of which 0 ms to minimize.
[2023-03-13 19:24:13] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 0 ms to minimize.
[2023-03-13 19:24:13] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 1 ms to minimize.
[2023-03-13 19:24:13] [INFO ] Deduced a trap composed of 113 places in 151 ms of which 0 ms to minimize.
[2023-03-13 19:24:13] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 0 ms to minimize.
[2023-03-13 19:24:14] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 1 ms to minimize.
[2023-03-13 19:24:14] [INFO ] Trap strengthening (SAT) tested/added 94/93 trap constraints in 17437 ms
[2023-03-13 19:24:14] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2023-03-13 19:24:14] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 0 ms to minimize.
[2023-03-13 19:24:14] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 0 ms to minimize.
[2023-03-13 19:24:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 518 ms
[2023-03-13 19:24:15] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 0 ms to minimize.
[2023-03-13 19:24:15] [INFO ] Deduced a trap composed of 115 places in 151 ms of which 1 ms to minimize.
[2023-03-13 19:24:15] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 0 ms to minimize.
[2023-03-13 19:24:15] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 1 ms to minimize.
[2023-03-13 19:24:15] [INFO ] Deduced a trap composed of 109 places in 195 ms of which 1 ms to minimize.
[2023-03-13 19:24:16] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 0 ms to minimize.
[2023-03-13 19:24:16] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:24:16] [INFO ] Deduced a trap composed of 115 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:24:16] [INFO ] Deduced a trap composed of 110 places in 176 ms of which 1 ms to minimize.
[2023-03-13 19:24:16] [INFO ] Deduced a trap composed of 114 places in 159 ms of which 0 ms to minimize.
[2023-03-13 19:24:17] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 19:24:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:24:17] [INFO ] After 25228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:25
Fused 25 Parikh solutions to 23 different solutions.
Parikh walk visited 4 properties in 457 ms.
Support contains 23 out of 578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 265 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 12 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1257 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 569 transition count 428
Reduce places removed 72 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 76 rules applied. Total rules applied 150 place count 497 transition count 424
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 154 place count 493 transition count 424
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 154 place count 493 transition count 319
Deduced a syphon composed of 105 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 385 place count 367 transition count 319
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 401 place count 351 transition count 303
Iterating global reduction 3 with 16 rules applied. Total rules applied 417 place count 351 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 417 place count 351 transition count 302
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 419 place count 350 transition count 302
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 693 place count 211 transition count 167
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 697 place count 209 transition count 174
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 699 place count 209 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 701 place count 207 transition count 172
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 706 place count 207 transition count 172
Applied a total of 706 rules in 136 ms. Remains 207 /578 variables (removed 371) and now considering 172/511 (removed 339) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 207/578 places, 172/511 transitions.
Incomplete random walk after 10000 steps, including 395 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 19:24:18] [INFO ] Flow matrix only has 171 transitions (discarded 1 similar events)
// Phase 1: matrix 171 rows 207 cols
[2023-03-13 19:24:18] [INFO ] Computed 82 place invariants in 8 ms
[2023-03-13 19:24:18] [INFO ] [Real]Absence check using 67 positive place invariants in 9 ms returned sat
[2023-03-13 19:24:18] [INFO ] [Real]Absence check using 67 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-13 19:24:18] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-13 19:24:18] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 19:24:18] [INFO ] After 8ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:24:18] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:24:18] [INFO ] [Nat]Absence check using 67 positive place invariants in 7 ms returned sat
[2023-03-13 19:24:18] [INFO ] [Nat]Absence check using 67 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-13 19:24:18] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:24:18] [INFO ] After 32ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:24:18] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2023-03-13 19:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-13 19:24:18] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-13 19:24:18] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 172/172 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 207 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 206 transition count 171
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 206 transition count 165
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 15 place count 199 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 195 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 195 transition count 161
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 39 place count 187 transition count 153
Applied a total of 39 rules in 43 ms. Remains 187 /207 variables (removed 20) and now considering 153/172 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 187/207 places, 153/172 transitions.
Incomplete random walk after 10000 steps, including 461 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 167 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 167 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 356294 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 356294 steps, saw 137516 distinct states, run finished after 3002 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 19:24:22] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
// Phase 1: matrix 152 rows 187 cols
[2023-03-13 19:24:22] [INFO ] Computed 81 place invariants in 6 ms
[2023-03-13 19:24:22] [INFO ] [Real]Absence check using 67 positive place invariants in 7 ms returned sat
[2023-03-13 19:24:22] [INFO ] [Real]Absence check using 67 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-13 19:24:22] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:24:22] [INFO ] [Nat]Absence check using 67 positive place invariants in 7 ms returned sat
[2023-03-13 19:24:22] [INFO ] [Nat]Absence check using 67 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-13 19:24:22] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:24:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-13 19:24:22] [INFO ] After 45ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:24:22] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-13 19:24:22] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 153/153 transitions.
Applied a total of 0 rules in 10 ms. Remains 187 /187 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 187/187 places, 153/153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 153/153 transitions.
Applied a total of 0 rules in 7 ms. Remains 187 /187 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2023-03-13 19:24:22] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
[2023-03-13 19:24:22] [INFO ] Invariant cache hit.
[2023-03-13 19:24:22] [INFO ] Implicit Places using invariants in 100 ms returned [10, 12, 14, 16, 18, 20, 22, 24, 26, 27, 28, 29, 30, 31, 36, 37, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 35 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 102 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/187 places, 150/153 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 146 transition count 126
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 146 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 14 place count 145 transition count 131
Applied a total of 14 rules in 11 ms. Remains 145 /152 variables (removed 7) and now considering 131/150 (removed 19) transitions.
[2023-03-13 19:24:22] [INFO ] Flow matrix only has 130 transitions (discarded 1 similar events)
// Phase 1: matrix 130 rows 145 cols
[2023-03-13 19:24:22] [INFO ] Computed 49 place invariants in 2 ms
[2023-03-13 19:24:22] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-13 19:24:22] [INFO ] Flow matrix only has 130 transitions (discarded 1 similar events)
[2023-03-13 19:24:22] [INFO ] Invariant cache hit.
[2023-03-13 19:24:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-13 19:24:22] [INFO ] Implicit Places using invariants and state equation in 204 ms returned [5, 29, 30, 32, 40, 76, 78, 80, 82, 84, 86, 88]
Discarding 12 places :
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Implicit Place search using SMT with State Equation took 300 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 133/187 places, 124/153 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 133 transition count 120
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 129 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 125 transition count 107
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 125 transition count 107
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 125 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 124 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 123 transition count 105
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 123 transition count 105
Ensure Unique test 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 4 with 2 rules applied. Total rules applied 22 place count 123 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 23 place count 122 transition count 103
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 6 with 6 rules applied. Total rules applied 29 place count 119 transition count 100
Applied a total of 29 rules in 20 ms. Remains 119 /133 variables (removed 14) and now considering 100/124 (removed 24) transitions.
[2023-03-13 19:24:22] [INFO ] Flow matrix only has 99 transitions (discarded 1 similar events)
// Phase 1: matrix 99 rows 119 cols
[2023-03-13 19:24:22] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-13 19:24:23] [INFO ] Implicit Places using invariants in 112 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 113 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 116/187 places, 100/153 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 97
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 113 transition count 97
Applied a total of 6 rules in 10 ms. Remains 113 /116 variables (removed 3) and now considering 97/100 (removed 3) transitions.
[2023-03-13 19:24:23] [INFO ] Flow matrix only has 96 transitions (discarded 1 similar events)
// Phase 1: matrix 96 rows 113 cols
[2023-03-13 19:24:23] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-13 19:24:23] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-13 19:24:23] [INFO ] Flow matrix only has 96 transitions (discarded 1 similar events)
[2023-03-13 19:24:23] [INFO ] Invariant cache hit.
[2023-03-13 19:24:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-13 19:24:23] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [25, 26, 28]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 195 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 110/187 places, 97/153 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 96 transition count 88
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 26 place count 93 transition count 85
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 93 transition count 85
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 31 place count 92 transition count 84
Applied a total of 31 rules in 11 ms. Remains 92 /110 variables (removed 18) and now considering 84/97 (removed 13) transitions.
[2023-03-13 19:24:23] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 92 cols
[2023-03-13 19:24:23] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-13 19:24:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-13 19:24:23] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-13 19:24:23] [INFO ] Invariant cache hit.
[2023-03-13 19:24:23] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-13 19:24:23] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 92/187 places, 84/153 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 939 ms. Remains : 92/187 places, 84/153 transitions.
Incomplete random walk after 10000 steps, including 621 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 159 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 476142 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 476142 steps, saw 164629 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 19:24:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-13 19:24:27] [INFO ] Invariant cache hit.
[2023-03-13 19:24:27] [INFO ] [Real]Absence check using 24 positive place invariants in 3 ms returned sat
[2023-03-13 19:24:27] [INFO ] [Real]Absence check using 24 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-13 19:24:27] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:24:27] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2023-03-13 19:24:27] [INFO ] [Nat]Absence check using 24 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-13 19:24:27] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:24:27] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-13 19:24:27] [INFO ] After 27ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:24:27] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-13 19:24:27] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-13 19:24:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-13 19:24:27] [INFO ] Invariant cache hit.
[2023-03-13 19:24:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-13 19:24:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-13 19:24:27] [INFO ] Invariant cache hit.
[2023-03-13 19:24:27] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-13 19:24:27] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-13 19:24:27] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-13 19:24:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-13 19:24:27] [INFO ] Invariant cache hit.
[2023-03-13 19:24:27] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 92/92 places, 84/84 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 92 transition count 78
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 87 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 87 transition count 74
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 19 place count 83 transition count 74
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 21 place count 82 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 23 place count 81 transition count 90
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 81 transition count 90
Applied a total of 25 rules in 14 ms. Remains 81 /92 variables (removed 11) and now considering 90/84 (removed -6) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 90 rows 81 cols
[2023-03-13 19:24:27] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-13 19:24:27] [INFO ] [Real]Absence check using 24 positive place invariants in 4 ms returned sat
[2023-03-13 19:24:27] [INFO ] [Real]Absence check using 24 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-13 19:24:27] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-13 19:24:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 19:24:27] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-13 19:24:27] [INFO ] After 14ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-13 19:24:27] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-13 19:24:27] [INFO ] [Nat]Absence check using 24 positive place invariants in 2 ms returned sat
[2023-03-13 19:24:27] [INFO ] [Nat]Absence check using 24 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-13 19:24:27] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:24:27] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:24:27] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2023-03-13 19:24:27] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2023-03-13 19:24:27] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2023-03-13 19:24:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2023-03-13 19:24:27] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-13 19:24:27] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 49 ms
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 35 ms
[2023-03-13 19:24:28] [INFO ] Input system was already deterministic with 511 transitions.
Support contains 84 out of 578 places (down from 85) after GAL structural reductions.
Computed a total of 505 stabilizing places and 448 stable transitions
Graph (complete) has 1265 edges and 578 vertex of which 575 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.26 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 286 edges and 578 vertex of which 7 / 578 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 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 568 transition count 422
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 490 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 489 transition count 421
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 160 place count 489 transition count 311
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 401 place count 358 transition count 311
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 428 place count 331 transition count 284
Iterating global reduction 3 with 27 rules applied. Total rules applied 455 place count 331 transition count 284
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 455 place count 331 transition count 282
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 459 place count 329 transition count 282
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 267 rules applied. Total rules applied 726 place count 194 transition count 150
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 728 place count 193 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 192 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 191 transition count 148
Applied a total of 730 rules in 79 ms. Remains 191 /578 variables (removed 387) and now considering 148/511 (removed 363) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 191/578 places, 148/511 transitions.
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:24:28] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 554 transition count 487
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 554 transition count 487
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 548 transition count 481
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 548 transition count 481
Applied a total of 60 rules in 38 ms. Remains 548 /578 variables (removed 30) and now considering 481/511 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 548/578 places, 481/511 transitions.
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 26 ms
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 23 ms
[2023-03-13 19:24:28] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 549 transition count 482
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 549 transition count 482
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 542 transition count 475
Applied a total of 72 rules in 41 ms. Remains 542 /578 variables (removed 36) and now considering 475/511 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 542/578 places, 475/511 transitions.
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 20 ms
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 20 ms
[2023-03-13 19:24:28] [INFO ] Input system was already deterministic with 475 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 549 transition count 482
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 549 transition count 482
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 541 transition count 474
Applied a total of 74 rules in 32 ms. Remains 541 /578 variables (removed 37) and now considering 474/511 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 541/578 places, 474/511 transitions.
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 19 ms
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 20 ms
[2023-03-13 19:24:28] [INFO ] Input system was already deterministic with 474 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 547 transition count 480
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 547 transition count 480
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 538 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 538 transition count 471
Applied a total of 80 rules in 33 ms. Remains 538 /578 variables (removed 40) and now considering 471/511 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 538/578 places, 471/511 transitions.
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 17 ms
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 17 ms
[2023-03-13 19:24:28] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 548 transition count 481
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 548 transition count 481
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 539 transition count 472
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 539 transition count 472
Applied a total of 78 rules in 33 ms. Remains 539 /578 variables (removed 39) and now considering 472/511 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 539/578 places, 472/511 transitions.
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 15 ms
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 16 ms
[2023-03-13 19:24:28] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 547 transition count 480
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 547 transition count 480
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 538 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 538 transition count 471
Applied a total of 80 rules in 32 ms. Remains 538 /578 variables (removed 40) and now considering 471/511 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 538/578 places, 471/511 transitions.
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:24:28] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:24:28] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 289 edges and 578 vertex of which 7 / 578 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 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 568 transition count 419
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 487 transition count 419
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 164 place count 487 transition count 308
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 243 rules applied. Total rules applied 407 place count 355 transition count 308
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 436 place count 326 transition count 279
Iterating global reduction 2 with 29 rules applied. Total rules applied 465 place count 326 transition count 279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 465 place count 326 transition count 277
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 469 place count 324 transition count 277
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 737 place count 188 transition count 145
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 739 place count 187 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 740 place count 186 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 741 place count 185 transition count 143
Applied a total of 741 rules in 41 ms. Remains 185 /578 variables (removed 393) and now considering 143/511 (removed 368) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 185/578 places, 143/511 transitions.
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:24:29] [INFO ] Input system was already deterministic with 143 transitions.
Finished random walk after 27 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
FORMULA BusinessProcesses-PT-20-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 547 transition count 480
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 547 transition count 480
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 538 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 538 transition count 471
Applied a total of 80 rules in 22 ms. Remains 538 /578 variables (removed 40) and now considering 471/511 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 538/578 places, 471/511 transitions.
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:29] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 548 transition count 481
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 548 transition count 481
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 539 transition count 472
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 539 transition count 472
Applied a total of 78 rules in 27 ms. Remains 539 /578 variables (removed 39) and now considering 472/511 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 539/578 places, 472/511 transitions.
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:29] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 287 edges and 578 vertex of which 7 / 578 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 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 568 transition count 421
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 161 place count 489 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 488 transition count 420
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 162 place count 488 transition count 307
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 410 place count 353 transition count 307
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 437 place count 326 transition count 280
Iterating global reduction 3 with 27 rules applied. Total rules applied 464 place count 326 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 464 place count 326 transition count 279
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 466 place count 325 transition count 279
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 726 place count 193 transition count 151
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 728 place count 192 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 191 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 190 transition count 149
Applied a total of 730 rules in 43 ms. Remains 190 /578 variables (removed 388) and now considering 149/511 (removed 362) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 190/578 places, 149/511 transitions.
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:24:29] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 291 edges and 578 vertex of which 7 / 578 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 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 568 transition count 419
Reduce places removed 81 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 487 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 486 transition count 418
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 166 place count 486 transition count 305
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 414 place count 351 transition count 305
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 443 place count 322 transition count 276
Iterating global reduction 3 with 29 rules applied. Total rules applied 472 place count 322 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 472 place count 322 transition count 274
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 476 place count 320 transition count 274
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 742 place count 185 transition count 143
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 744 place count 184 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 745 place count 183 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 746 place count 182 transition count 141
Applied a total of 746 rules in 36 ms. Remains 182 /578 variables (removed 396) and now considering 141/511 (removed 370) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 182/578 places, 141/511 transitions.
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:24:29] [INFO ] Input system was already deterministic with 141 transitions.
Finished random walk after 3604 steps, including 456 resets, run visited all 1 properties in 13 ms. (steps per millisecond=277 )
FORMULA BusinessProcesses-PT-20-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 551 transition count 484
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 551 transition count 484
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 542 transition count 475
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 542 transition count 475
Applied a total of 72 rules in 28 ms. Remains 542 /578 variables (removed 36) and now considering 475/511 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 542/578 places, 475/511 transitions.
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:24:29] [INFO ] Input system was already deterministic with 475 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 549 transition count 482
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 549 transition count 482
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 540 transition count 473
Applied a total of 76 rules in 22 ms. Remains 540 /578 variables (removed 38) and now considering 473/511 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 540/578 places, 473/511 transitions.
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:29] [INFO ] Input system was already deterministic with 473 transitions.
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:29] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 19:24:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 578 places, 511 transitions and 1591 arcs took 3 ms.
Total runtime 41029 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 578 NrTr: 511 NrArc: 1591)

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

net check time: 0m 0.000sec

init dd package: 0m 3.180sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6724192 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101956 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.001sec

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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