Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110000199.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000199
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 29 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 29 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 29 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 169K May 10 09:33 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 DoubleExponent-PT-010-ReachabilityFireability-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654186263912

Running Version 202205111006
[2022-06-02 16:11:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:11:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:11:05] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2022-06-02 16:11:05] [INFO ] Transformed 534 places.
[2022-06-02 16:11:05] [INFO ] Transformed 498 transitions.
[2022-06-02 16:11:05] [INFO ] Parsed PT model containing 534 places and 498 transitions in 195 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 330 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 142468 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142468 steps, saw 71254 distinct states, run finished after 3003 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 498 rows 534 cols
[2022-06-02 16:11:09] [INFO ] Computed 54 place invariants in 87 ms
[2022-06-02 16:11:09] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-02 16:11:09] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 21 ms returned sat
[2022-06-02 16:11:10] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2022-06-02 16:11:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 21 ms returned sat
[2022-06-02 16:11:10] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2022-06-02 16:11:14] [INFO ] After 4057ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :12
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 6 ms to minimize.
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 1 ms to minimize.
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 1 ms to minimize.
[2022-06-02 16:11:16] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 15 ms to minimize.
[2022-06-02 16:11:16] [INFO ] Deduced a trap composed of 129 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:11:16] [INFO ] Deduced a trap composed of 113 places in 377 ms of which 0 ms to minimize.
[2022-06-02 16:11:16] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 0 ms to minimize.
[2022-06-02 16:11:16] [INFO ] Deduced a trap composed of 101 places in 75 ms of which 1 ms to minimize.
[2022-06-02 16:11:16] [INFO ] Deduced a trap composed of 115 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:11:17] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:11:17] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 0 ms to minimize.
[2022-06-02 16:11:17] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:11:17] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 1 ms to minimize.
[2022-06-02 16:11:17] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2022-06-02 16:11:17] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 0 ms to minimize.
[2022-06-02 16:11:17] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 0 ms to minimize.
[2022-06-02 16:11:18] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2578 ms
[2022-06-02 16:11:18] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 0 ms to minimize.
[2022-06-02 16:11:18] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
[2022-06-02 16:11:18] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
[2022-06-02 16:11:18] [INFO ] Deduced a trap composed of 210 places in 140 ms of which 4 ms to minimize.
[2022-06-02 16:11:18] [INFO ] Deduced a trap composed of 182 places in 140 ms of which 1 ms to minimize.
[2022-06-02 16:11:19] [INFO ] Deduced a trap composed of 184 places in 137 ms of which 0 ms to minimize.
[2022-06-02 16:11:19] [INFO ] Deduced a trap composed of 191 places in 132 ms of which 1 ms to minimize.
[2022-06-02 16:11:19] [INFO ] Deduced a trap composed of 206 places in 133 ms of which 1 ms to minimize.
[2022-06-02 16:11:19] [INFO ] Deduced a trap composed of 184 places in 132 ms of which 0 ms to minimize.
[2022-06-02 16:11:19] [INFO ] Deduced a trap composed of 173 places in 133 ms of which 0 ms to minimize.
[2022-06-02 16:11:19] [INFO ] Deduced a trap composed of 187 places in 134 ms of which 1 ms to minimize.
[2022-06-02 16:11:20] [INFO ] Deduced a trap composed of 202 places in 134 ms of which 1 ms to minimize.
[2022-06-02 16:11:20] [INFO ] Deduced a trap composed of 207 places in 140 ms of which 0 ms to minimize.
[2022-06-02 16:11:20] [INFO ] Deduced a trap composed of 228 places in 135 ms of which 1 ms to minimize.
[2022-06-02 16:11:20] [INFO ] Deduced a trap composed of 207 places in 133 ms of which 0 ms to minimize.
[2022-06-02 16:11:20] [INFO ] Deduced a trap composed of 185 places in 134 ms of which 1 ms to minimize.
[2022-06-02 16:11:21] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 1 ms to minimize.
[2022-06-02 16:11:21] [INFO ] Deduced a trap composed of 186 places in 135 ms of which 0 ms to minimize.
[2022-06-02 16:11:21] [INFO ] Deduced a trap composed of 224 places in 142 ms of which 2 ms to minimize.
[2022-06-02 16:11:21] [INFO ] Deduced a trap composed of 216 places in 133 ms of which 0 ms to minimize.
[2022-06-02 16:11:21] [INFO ] Deduced a trap composed of 242 places in 139 ms of which 0 ms to minimize.
[2022-06-02 16:11:22] [INFO ] Deduced a trap composed of 221 places in 137 ms of which 0 ms to minimize.
[2022-06-02 16:11:22] [INFO ] Deduced a trap composed of 197 places in 134 ms of which 1 ms to minimize.
[2022-06-02 16:11:22] [INFO ] Deduced a trap composed of 187 places in 144 ms of which 0 ms to minimize.
[2022-06-02 16:11:22] [INFO ] Deduced a trap composed of 206 places in 138 ms of which 0 ms to minimize.
[2022-06-02 16:11:22] [INFO ] Deduced a trap composed of 219 places in 138 ms of which 1 ms to minimize.
[2022-06-02 16:11:22] [INFO ] Deduced a trap composed of 218 places in 139 ms of which 1 ms to minimize.
[2022-06-02 16:11:23] [INFO ] Deduced a trap composed of 223 places in 136 ms of which 1 ms to minimize.
[2022-06-02 16:11:23] [INFO ] Deduced a trap composed of 228 places in 130 ms of which 1 ms to minimize.
[2022-06-02 16:11:23] [INFO ] Deduced a trap composed of 204 places in 133 ms of which 0 ms to minimize.
[2022-06-02 16:11:23] [INFO ] Deduced a trap composed of 218 places in 125 ms of which 1 ms to minimize.
[2022-06-02 16:11:23] [INFO ] Deduced a trap composed of 222 places in 127 ms of which 1 ms to minimize.
[2022-06-02 16:11:23] [INFO ] Deduced a trap composed of 222 places in 127 ms of which 1 ms to minimize.
[2022-06-02 16:11:24] [INFO ] Deduced a trap composed of 210 places in 129 ms of which 1 ms to minimize.
[2022-06-02 16:11:24] [INFO ] Deduced a trap composed of 202 places in 131 ms of which 2 ms to minimize.
[2022-06-02 16:11:24] [INFO ] Deduced a trap composed of 178 places in 126 ms of which 0 ms to minimize.
[2022-06-02 16:11:24] [INFO ] Deduced a trap composed of 238 places in 129 ms of which 1 ms to minimize.
[2022-06-02 16:11:24] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 6826 ms
[2022-06-02 16:11:25] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 1 ms to minimize.
[2022-06-02 16:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-06-02 16:11:26] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:11:26] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:11:26] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 6 ms to minimize.
[2022-06-02 16:11:27] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 0 ms to minimize.
[2022-06-02 16:11:27] [INFO ] Deduced a trap composed of 127 places in 69 ms of which 1 ms to minimize.
[2022-06-02 16:11:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 735 ms
[2022-06-02 16:11:28] [INFO ] Deduced a trap composed of 123 places in 157 ms of which 1 ms to minimize.
[2022-06-02 16:11:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2022-06-02 16:11:28] [INFO ] Deduced a trap composed of 202 places in 134 ms of which 0 ms to minimize.
[2022-06-02 16:11:28] [INFO ] Deduced a trap composed of 235 places in 126 ms of which 0 ms to minimize.
[2022-06-02 16:11:28] [INFO ] Deduced a trap composed of 257 places in 130 ms of which 0 ms to minimize.
[2022-06-02 16:11:29] [INFO ] Deduced a trap composed of 247 places in 123 ms of which 0 ms to minimize.
[2022-06-02 16:11:29] [INFO ] Deduced a trap composed of 235 places in 127 ms of which 1 ms to minimize.
[2022-06-02 16:11:29] [INFO ] Deduced a trap composed of 237 places in 124 ms of which 1 ms to minimize.
[2022-06-02 16:11:29] [INFO ] Deduced a trap composed of 144 places in 100 ms of which 2 ms to minimize.
[2022-06-02 16:11:29] [INFO ] Deduced a trap composed of 182 places in 132 ms of which 2 ms to minimize.
[2022-06-02 16:11:29] [INFO ] Deduced a trap composed of 228 places in 133 ms of which 3 ms to minimize.
[2022-06-02 16:11:30] [INFO ] Deduced a trap composed of 240 places in 135 ms of which 1 ms to minimize.
[2022-06-02 16:11:30] [INFO ] Deduced a trap composed of 247 places in 130 ms of which 1 ms to minimize.
[2022-06-02 16:11:30] [INFO ] Deduced a trap composed of 225 places in 120 ms of which 0 ms to minimize.
[2022-06-02 16:11:30] [INFO ] Deduced a trap composed of 230 places in 121 ms of which 0 ms to minimize.
[2022-06-02 16:11:30] [INFO ] Deduced a trap composed of 159 places in 115 ms of which 1 ms to minimize.
[2022-06-02 16:11:30] [INFO ] Deduced a trap composed of 208 places in 117 ms of which 0 ms to minimize.
[2022-06-02 16:11:30] [INFO ] Deduced a trap composed of 205 places in 132 ms of which 1 ms to minimize.
[2022-06-02 16:11:31] [INFO ] Deduced a trap composed of 214 places in 133 ms of which 0 ms to minimize.
[2022-06-02 16:11:31] [INFO ] Deduced a trap composed of 244 places in 124 ms of which 0 ms to minimize.
[2022-06-02 16:11:31] [INFO ] Deduced a trap composed of 251 places in 136 ms of which 0 ms to minimize.
[2022-06-02 16:11:31] [INFO ] Deduced a trap composed of 233 places in 130 ms of which 1 ms to minimize.
[2022-06-02 16:11:31] [INFO ] Deduced a trap composed of 201 places in 131 ms of which 1 ms to minimize.
[2022-06-02 16:11:31] [INFO ] Deduced a trap composed of 203 places in 132 ms of which 0 ms to minimize.
[2022-06-02 16:11:32] [INFO ] Deduced a trap composed of 251 places in 136 ms of which 1 ms to minimize.
[2022-06-02 16:11:32] [INFO ] Deduced a trap composed of 257 places in 130 ms of which 0 ms to minimize.
[2022-06-02 16:11:32] [INFO ] Deduced a trap composed of 237 places in 120 ms of which 1 ms to minimize.
[2022-06-02 16:11:32] [INFO ] Deduced a trap composed of 209 places in 113 ms of which 1 ms to minimize.
[2022-06-02 16:11:32] [INFO ] Deduced a trap composed of 200 places in 118 ms of which 0 ms to minimize.
[2022-06-02 16:11:32] [INFO ] Deduced a trap composed of 211 places in 116 ms of which 1 ms to minimize.
[2022-06-02 16:11:32] [INFO ] Deduced a trap composed of 254 places in 125 ms of which 1 ms to minimize.
[2022-06-02 16:11:33] [INFO ] Deduced a trap composed of 265 places in 122 ms of which 0 ms to minimize.
[2022-06-02 16:11:33] [INFO ] Deduced a trap composed of 263 places in 119 ms of which 1 ms to minimize.
[2022-06-02 16:11:33] [INFO ] Deduced a trap composed of 214 places in 119 ms of which 1 ms to minimize.
[2022-06-02 16:11:33] [INFO ] Deduced a trap composed of 243 places in 120 ms of which 0 ms to minimize.
[2022-06-02 16:11:33] [INFO ] Deduced a trap composed of 261 places in 120 ms of which 1 ms to minimize.
[2022-06-02 16:11:33] [INFO ] Deduced a trap composed of 251 places in 124 ms of which 1 ms to minimize.
[2022-06-02 16:11:34] [INFO ] Deduced a trap composed of 263 places in 121 ms of which 0 ms to minimize.
[2022-06-02 16:11:34] [INFO ] Deduced a trap composed of 248 places in 122 ms of which 1 ms to minimize.
[2022-06-02 16:11:34] [INFO ] Deduced a trap composed of 266 places in 117 ms of which 1 ms to minimize.
[2022-06-02 16:11:34] [INFO ] Deduced a trap composed of 241 places in 121 ms of which 0 ms to minimize.
[2022-06-02 16:11:34] [INFO ] Deduced a trap composed of 242 places in 118 ms of which 0 ms to minimize.
[2022-06-02 16:11:34] [INFO ] Deduced a trap composed of 258 places in 124 ms of which 1 ms to minimize.
[2022-06-02 16:11:34] [INFO ] Deduced a trap composed of 233 places in 128 ms of which 0 ms to minimize.
[2022-06-02 16:11:35] [INFO ] Deduced a trap composed of 222 places in 116 ms of which 1 ms to minimize.
[2022-06-02 16:11:35] [INFO ] Deduced a trap composed of 239 places in 123 ms of which 1 ms to minimize.
[2022-06-02 16:11:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 16:11:35] [INFO ] After 25120ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:15
FORMULA DoubleExponent-PT-010-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 125551 ms.
Support contains 140 out of 534 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 529 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 528 transition count 471
Reduce places removed 26 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 47 rules applied. Total rules applied 76 place count 502 transition count 450
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 97 place count 481 transition count 450
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 97 place count 481 transition count 427
Deduced a syphon composed of 23 places in 9 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 143 place count 458 transition count 427
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 227 place count 416 transition count 385
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 237 place count 411 transition count 385
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 411 transition count 384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 239 place count 410 transition count 384
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 268 place count 410 transition count 355
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 297 place count 381 transition count 355
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 319 place count 381 transition count 355
Applied a total of 319 rules in 203 ms. Remains 381 /534 variables (removed 153) and now considering 355/498 (removed 143) transitions.
Finished structural reductions, in 1 iterations. Remains : 381/534 places, 355/498 transitions.
Incomplete random walk after 1000000 steps, including 50974 resets, run finished after 22723 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Interrupted Best-First random walk after 292194 steps, including 11779 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Interrupted Best-First random walk after 306450 steps, including 12333 resets, run timeout after 5001 ms. (steps per millisecond=61 ) properties seen 0
Interrupted Best-First random walk after 285762 steps, including 11441 resets, run timeout after 5001 ms. (steps per millisecond=57 ) properties seen 0
Interrupted Best-First random walk after 319123 steps, including 12905 resets, run timeout after 5001 ms. (steps per millisecond=63 ) properties seen 0
Interrupted Best-First random walk after 314344 steps, including 15330 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 319334 steps, including 12855 resets, run timeout after 5001 ms. (steps per millisecond=63 ) properties seen 0
Interrupted Best-First random walk after 319102 steps, including 12886 resets, run timeout after 5001 ms. (steps per millisecond=63 ) properties seen 0
Interrupted Best-First random walk after 320476 steps, including 13021 resets, run timeout after 5001 ms. (steps per millisecond=64 ) properties seen 0
Interrupted Best-First random walk after 321039 steps, including 13054 resets, run timeout after 5001 ms. (steps per millisecond=64 ) properties seen 0
Interrupted Best-First random walk after 305060 steps, including 12329 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen 0
Interrupted Best-First random walk after 320164 steps, including 12927 resets, run timeout after 5001 ms. (steps per millisecond=64 ) properties seen 0
Interrupted Best-First random walk after 310713 steps, including 12612 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Probably explored full state space saw : 1570551 states, properties seen :0
Probabilistic random walk after 3141417 steps, saw 1570551 distinct states, run finished after 50527 ms. (steps per millisecond=62 ) properties seen :0
Interrupted probabilistic random walk after 13780152 steps, run timeout after 246001 ms. (steps per millisecond=56 ) properties seen :{1=1, 5=1, 9=1}
Exhaustive walk after 13780152 steps, saw 6890106 distinct states, run finished after 246002 ms. (steps per millisecond=56 ) properties seen :3
FORMULA DoubleExponent-PT-010-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DoubleExponent-PT-010-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DoubleExponent-PT-010-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 355 rows 381 cols
[2022-06-02 16:20:00] [INFO ] Computed 50 place invariants in 83 ms
[2022-06-02 16:20:00] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2022-06-02 16:20:00] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2022-06-02 16:20:00] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 16:20:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-02 16:20:00] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2022-06-02 16:20:02] [INFO ] After 2234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-02 16:20:02] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-06-02 16:20:07] [INFO ] After 4411ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-02 16:20:07] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:20:07] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2022-06-02 16:20:07] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 0 ms to minimize.
[2022-06-02 16:20:08] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 0 ms to minimize.
[2022-06-02 16:20:08] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 0 ms to minimize.
[2022-06-02 16:20:08] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:20:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 668 ms
[2022-06-02 16:20:08] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:20:08] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:20:09] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:20:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 417 ms
[2022-06-02 16:20:09] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:20:09] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2022-06-02 16:20:10] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 0 ms to minimize.
[2022-06-02 16:20:10] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2022-06-02 16:20:10] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2022-06-02 16:20:10] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 0 ms to minimize.
[2022-06-02 16:20:10] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2022-06-02 16:20:10] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 0 ms to minimize.
[2022-06-02 16:20:10] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2022-06-02 16:20:10] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 0 ms to minimize.
[2022-06-02 16:20:11] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 0 ms to minimize.
[2022-06-02 16:20:11] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2022-06-02 16:20:11] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:20:11] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1671 ms
[2022-06-02 16:20:12] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2022-06-02 16:20:12] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-06-02 16:20:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2022-06-02 16:20:14] [INFO ] After 11587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 4206 ms.
[2022-06-02 16:20:18] [INFO ] After 18219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 102613 ms.
Support contains 110 out of 381 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 381/381 places, 355/355 transitions.
Graph (complete) has 902 edges and 381 vertex of which 380 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 380 transition count 351
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 377 transition count 348
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 374 transition count 348
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 374 transition count 346
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 372 transition count 346
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 36 place count 363 transition count 337
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 363 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 362 transition count 336
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 44 place count 362 transition count 330
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 50 place count 356 transition count 330
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 54 place count 356 transition count 330
Applied a total of 54 rules in 88 ms. Remains 356 /381 variables (removed 25) and now considering 330/355 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/381 places, 330/355 transitions.
Incomplete random walk after 1000000 steps, including 55530 resets, run finished after 20832 ms. (steps per millisecond=48 ) properties (out of 9) seen :0
Interrupted Best-First random walk after 218531 steps, including 9436 resets, run timeout after 5001 ms. (steps per millisecond=43 ) properties seen 0
Interrupted Best-First random walk after 327214 steps, including 14124 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 332841 steps, including 14363 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen 0
Interrupted Best-First random walk after 314364 steps, including 17963 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 328636 steps, including 14138 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 340032 steps, including 14601 resets, run timeout after 5001 ms. (steps per millisecond=67 ) properties seen 0
Interrupted Best-First random walk after 337153 steps, including 14496 resets, run timeout after 5001 ms. (steps per millisecond=67 ) properties seen 0
Interrupted Best-First random walk after 326641 steps, including 14076 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 311055 steps, including 13439 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Probably explored full state space saw : 678170 states, properties seen :0
Probabilistic random walk after 1356381 steps, saw 678170 distinct states, run finished after 21340 ms. (steps per millisecond=63 ) properties seen :0
Interrupted probabilistic random walk after 11536987 steps, run timeout after 195001 ms. (steps per millisecond=59 ) properties seen :{}
Exhaustive walk after 11536987 steps, saw 5768555 distinct states, run finished after 195001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 330 rows 356 cols
[2022-06-02 16:26:43] [INFO ] Computed 50 place invariants in 33 ms
[2022-06-02 16:26:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-02 16:26:43] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2022-06-02 16:26:44] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 16:26:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-02 16:26:44] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2022-06-02 16:26:45] [INFO ] After 1407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-02 16:26:45] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-02 16:26:48] [INFO ] After 2691ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-02 16:26:49] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:26:49] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:26:49] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 0 ms to minimize.
[2022-06-02 16:26:49] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 0 ms to minimize.
[2022-06-02 16:26:49] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2022-06-02 16:26:49] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 0 ms to minimize.
[2022-06-02 16:26:49] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
[2022-06-02 16:26:49] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:26:49] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2022-06-02 16:26:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 801 ms
[2022-06-02 16:26:50] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2022-06-02 16:26:50] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2022-06-02 16:26:50] [INFO ] Deduced a trap composed of 132 places in 106 ms of which 0 ms to minimize.
[2022-06-02 16:26:50] [INFO ] Deduced a trap composed of 130 places in 104 ms of which 0 ms to minimize.
[2022-06-02 16:26:50] [INFO ] Deduced a trap composed of 118 places in 103 ms of which 1 ms to minimize.
[2022-06-02 16:26:51] [INFO ] Deduced a trap composed of 124 places in 97 ms of which 0 ms to minimize.
[2022-06-02 16:26:51] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:26:51] [INFO ] Deduced a trap composed of 124 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:26:51] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:26:51] [INFO ] Deduced a trap composed of 130 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:26:51] [INFO ] Deduced a trap composed of 127 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:26:51] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:26:51] [INFO ] Deduced a trap composed of 125 places in 86 ms of which 1 ms to minimize.
[2022-06-02 16:26:51] [INFO ] Deduced a trap composed of 131 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:26:52] [INFO ] Deduced a trap composed of 116 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:26:52] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 0 ms to minimize.
[2022-06-02 16:26:52] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:26:52] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2253 ms
[2022-06-02 16:26:52] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:26:53] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2022-06-02 16:26:53] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2022-06-02 16:26:53] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2022-06-02 16:26:53] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2022-06-02 16:26:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 442 ms
[2022-06-02 16:26:53] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:26:53] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:26:54] [INFO ] Deduced a trap composed of 120 places in 86 ms of which 1 ms to minimize.
[2022-06-02 16:26:54] [INFO ] Deduced a trap composed of 120 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:26:54] [INFO ] Deduced a trap composed of 122 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:26:54] [INFO ] Deduced a trap composed of 134 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:26:54] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:26:54] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:26:54] [INFO ] Deduced a trap composed of 111 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:26:54] [INFO ] Deduced a trap composed of 114 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:26:54] [INFO ] Deduced a trap composed of 116 places in 88 ms of which 1 ms to minimize.
[2022-06-02 16:26:55] [INFO ] Deduced a trap composed of 119 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:26:55] [INFO ] Deduced a trap composed of 125 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:26:55] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:26:55] [INFO ] Deduced a trap composed of 125 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:26:55] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:26:55] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:26:55] [INFO ] Deduced a trap composed of 122 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:26:55] [INFO ] Deduced a trap composed of 124 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:26:55] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:26:56] [INFO ] Deduced a trap composed of 131 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:26:56] [INFO ] Deduced a trap composed of 146 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:26:56] [INFO ] Deduced a trap composed of 146 places in 82 ms of which 1 ms to minimize.
[2022-06-02 16:26:56] [INFO ] Deduced a trap composed of 130 places in 99 ms of which 0 ms to minimize.
[2022-06-02 16:26:56] [INFO ] Deduced a trap composed of 108 places in 94 ms of which 0 ms to minimize.
[2022-06-02 16:26:56] [INFO ] Deduced a trap composed of 128 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:26:56] [INFO ] Deduced a trap composed of 141 places in 82 ms of which 1 ms to minimize.
[2022-06-02 16:26:56] [INFO ] Deduced a trap composed of 142 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:26:56] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2022-06-02 16:26:57] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:26:57] [INFO ] Deduced a trap composed of 130 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:26:57] [INFO ] Deduced a trap composed of 134 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:26:57] [INFO ] Deduced a trap composed of 141 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:26:57] [INFO ] Deduced a trap composed of 135 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:26:57] [INFO ] Deduced a trap composed of 133 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:26:57] [INFO ] Deduced a trap composed of 138 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:26:57] [INFO ] Deduced a trap composed of 125 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:26:57] [INFO ] Deduced a trap composed of 126 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:26:57] [INFO ] Deduced a trap composed of 132 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:26:58] [INFO ] Deduced a trap composed of 132 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:26:58] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:26:58] [INFO ] Deduced a trap composed of 128 places in 85 ms of which 1 ms to minimize.
[2022-06-02 16:26:58] [INFO ] Deduced a trap composed of 125 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:26:58] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:26:58] [INFO ] Deduced a trap composed of 117 places in 95 ms of which 0 ms to minimize.
[2022-06-02 16:26:58] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:26:58] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 1 ms to minimize.
[2022-06-02 16:26:59] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:26:59] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:26:59] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:26:59] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 5567 ms
[2022-06-02 16:26:59] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 0 ms to minimize.
[2022-06-02 16:26:59] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:26:59] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2022-06-02 16:26:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 263 ms
[2022-06-02 16:26:59] [INFO ] Deduced a trap composed of 70 places in 44 ms of which 1 ms to minimize.
[2022-06-02 16:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-06-02 16:27:02] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2022-06-02 16:27:03] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2022-06-02 16:27:03] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:27:03] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:27:03] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2022-06-02 16:27:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1159 ms
[2022-06-02 16:27:03] [INFO ] After 17820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 6083 ms.
[2022-06-02 16:27:09] [INFO ] After 25504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 120001 ms.
Support contains 110 out of 356 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 356/356 places, 330/330 transitions.
Applied a total of 0 rules in 32 ms. Remains 356 /356 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 330/330 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 356/356 places, 330/330 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 330/330 (removed 0) transitions.
// Phase 1: matrix 330 rows 356 cols
[2022-06-02 16:29:09] [INFO ] Computed 50 place invariants in 33 ms
[2022-06-02 16:29:09] [INFO ] Implicit Places using invariants in 227 ms returned [39, 65, 72, 103, 111, 141, 150, 285, 307, 346]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 229 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 346/356 places, 330/330 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 346 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 345 transition count 329
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 345 transition count 329
Applied a total of 5 rules in 29 ms. Remains 345 /346 variables (removed 1) and now considering 329/330 (removed 1) transitions.
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:29:10] [INFO ] Computed 40 place invariants in 18 ms
[2022-06-02 16:29:10] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:29:10] [INFO ] Computed 40 place invariants in 16 ms
[2022-06-02 16:29:10] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-02 16:29:11] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 345/356 places, 329/330 transitions.
Finished structural reductions, in 2 iterations. Remains : 345/356 places, 329/330 transitions.
Incomplete random walk after 1000000 steps, including 55446 resets, run finished after 19102 ms. (steps per millisecond=52 ) properties (out of 9) seen :0
Interrupted Best-First random walk after 325915 steps, including 13997 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 324480 steps, including 13946 resets, run timeout after 5001 ms. (steps per millisecond=64 ) properties seen 0
Interrupted Best-First random walk after 329187 steps, including 14283 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 328125 steps, including 18746 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 328692 steps, including 14159 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 325552 steps, including 14069 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 331011 steps, including 14353 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen 0
Interrupted Best-First random walk after 330837 steps, including 14311 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen 0
Interrupted Best-First random walk after 329177 steps, including 14267 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Probably explored full state space saw : 1290727 states, properties seen :0
Probabilistic random walk after 2581652 steps, saw 1290727 distinct states, run finished after 37859 ms. (steps per millisecond=68 ) properties seen :0
Interrupted probabilistic random walk after 11650166 steps, run timeout after 192001 ms. (steps per millisecond=60 ) properties seen :{}
Exhaustive walk after 11650166 steps, saw 5825100 distinct states, run finished after 192001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:34:05] [INFO ] Computed 40 place invariants in 10 ms
[2022-06-02 16:34:05] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2022-06-02 16:34:05] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 5 ms returned sat
[2022-06-02 16:34:05] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 16:34:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 16 ms returned sat
[2022-06-02 16:34:05] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-02 16:34:07] [INFO ] After 1458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-02 16:34:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-02 16:34:10] [INFO ] After 3132ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-02 16:34:10] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2022-06-02 16:34:10] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2022-06-02 16:34:11] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:34:11] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2022-06-02 16:34:11] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2022-06-02 16:34:11] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 0 ms to minimize.
[2022-06-02 16:34:11] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 0 ms to minimize.
[2022-06-02 16:34:11] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 0 ms to minimize.
[2022-06-02 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 667 ms
[2022-06-02 16:34:11] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2022-06-02 16:34:12] [INFO ] Deduced a trap composed of 138 places in 102 ms of which 0 ms to minimize.
[2022-06-02 16:34:12] [INFO ] Deduced a trap composed of 115 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:34:12] [INFO ] Deduced a trap composed of 124 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:34:12] [INFO ] Deduced a trap composed of 125 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:34:12] [INFO ] Deduced a trap composed of 124 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:34:12] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:34:12] [INFO ] Deduced a trap composed of 129 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:34:13] [INFO ] Deduced a trap composed of 123 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:34:13] [INFO ] Deduced a trap composed of 140 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:34:13] [INFO ] Deduced a trap composed of 127 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:34:13] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:34:13] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:34:13] [INFO ] Deduced a trap composed of 126 places in 78 ms of which 0 ms to minimize.
[2022-06-02 16:34:13] [INFO ] Deduced a trap composed of 128 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:34:13] [INFO ] Deduced a trap composed of 136 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:34:14] [INFO ] Deduced a trap composed of 132 places in 82 ms of which 1 ms to minimize.
[2022-06-02 16:34:14] [INFO ] Deduced a trap composed of 138 places in 220 ms of which 0 ms to minimize.
[2022-06-02 16:34:14] [INFO ] Deduced a trap composed of 136 places in 94 ms of which 1 ms to minimize.
[2022-06-02 16:34:14] [INFO ] Deduced a trap composed of 124 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:34:14] [INFO ] Deduced a trap composed of 117 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:34:14] [INFO ] Deduced a trap composed of 119 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:34:14] [INFO ] Deduced a trap composed of 117 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:34:15] [INFO ] Deduced a trap composed of 127 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:34:15] [INFO ] Deduced a trap composed of 137 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:34:15] [INFO ] Deduced a trap composed of 141 places in 79 ms of which 0 ms to minimize.
[2022-06-02 16:34:15] [INFO ] Deduced a trap composed of 131 places in 86 ms of which 1 ms to minimize.
[2022-06-02 16:34:15] [INFO ] Deduced a trap composed of 153 places in 85 ms of which 3 ms to minimize.
[2022-06-02 16:34:15] [INFO ] Deduced a trap composed of 130 places in 78 ms of which 0 ms to minimize.
[2022-06-02 16:34:15] [INFO ] Deduced a trap composed of 143 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:34:15] [INFO ] Deduced a trap composed of 126 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:34:15] [INFO ] Deduced a trap composed of 136 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:34:16] [INFO ] Deduced a trap composed of 128 places in 97 ms of which 1 ms to minimize.
[2022-06-02 16:34:16] [INFO ] Deduced a trap composed of 136 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:34:16] [INFO ] Deduced a trap composed of 144 places in 79 ms of which 0 ms to minimize.
[2022-06-02 16:34:16] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:34:16] [INFO ] Deduced a trap composed of 154 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:34:16] [INFO ] Deduced a trap composed of 129 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:34:16] [INFO ] Deduced a trap composed of 124 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:34:16] [INFO ] Deduced a trap composed of 140 places in 85 ms of which 1 ms to minimize.
[2022-06-02 16:34:16] [INFO ] Deduced a trap composed of 145 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:34:17] [INFO ] Deduced a trap composed of 138 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:34:17] [INFO ] Deduced a trap composed of 120 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:34:17] [INFO ] Deduced a trap composed of 147 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:34:17] [INFO ] Deduced a trap composed of 128 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:34:17] [INFO ] Deduced a trap composed of 134 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:34:17] [INFO ] Deduced a trap composed of 137 places in 94 ms of which 1 ms to minimize.
[2022-06-02 16:34:17] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 1 ms to minimize.
[2022-06-02 16:34:17] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2022-06-02 16:34:17] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 6032 ms
[2022-06-02 16:34:18] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:34:18] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2022-06-02 16:34:18] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2022-06-02 16:34:18] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2022-06-02 16:34:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 351 ms
[2022-06-02 16:34:18] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2022-06-02 16:34:18] [INFO ] Deduced a trap composed of 146 places in 98 ms of which 1 ms to minimize.
[2022-06-02 16:34:19] [INFO ] Deduced a trap composed of 145 places in 94 ms of which 1 ms to minimize.
[2022-06-02 16:34:19] [INFO ] Deduced a trap composed of 138 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:34:19] [INFO ] Deduced a trap composed of 134 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:34:19] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2022-06-02 16:34:19] [INFO ] Deduced a trap composed of 116 places in 77 ms of which 0 ms to minimize.
[2022-06-02 16:34:19] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:34:19] [INFO ] Deduced a trap composed of 129 places in 94 ms of which 1 ms to minimize.
[2022-06-02 16:34:19] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 0 ms to minimize.
[2022-06-02 16:34:20] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:34:20] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:34:20] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:34:20] [INFO ] Deduced a trap composed of 122 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:34:20] [INFO ] Deduced a trap composed of 126 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:34:20] [INFO ] Deduced a trap composed of 131 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:34:20] [INFO ] Deduced a trap composed of 132 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:34:20] [INFO ] Deduced a trap composed of 127 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:34:20] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:34:21] [INFO ] Deduced a trap composed of 114 places in 95 ms of which 1 ms to minimize.
[2022-06-02 16:34:21] [INFO ] Deduced a trap composed of 116 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:34:21] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 0 ms to minimize.
[2022-06-02 16:34:21] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2620 ms
[2022-06-02 16:34:21] [INFO ] Deduced a trap composed of 134 places in 94 ms of which 0 ms to minimize.
[2022-06-02 16:34:21] [INFO ] Deduced a trap composed of 132 places in 94 ms of which 0 ms to minimize.
[2022-06-02 16:34:21] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:34:21] [INFO ] Deduced a trap composed of 127 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:34:22] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:34:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 575 ms
[2022-06-02 16:34:22] [INFO ] Deduced a trap composed of 120 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:34:22] [INFO ] Deduced a trap composed of 120 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:34:22] [INFO ] Deduced a trap composed of 117 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:34:22] [INFO ] Deduced a trap composed of 117 places in 85 ms of which 1 ms to minimize.
[2022-06-02 16:34:22] [INFO ] Deduced a trap composed of 148 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:34:22] [INFO ] Deduced a trap composed of 122 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:34:22] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:34:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 758 ms
[2022-06-02 16:34:26] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:34:26] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:34:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2022-06-02 16:34:27] [INFO ] After 19611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 5543 ms.
[2022-06-02 16:34:32] [INFO ] After 26784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 102311 ms.
Support contains 110 out of 345 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 345/345 places, 329/329 transitions.
Applied a total of 0 rules in 10 ms. Remains 345 /345 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 345/345 places, 329/329 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 345/345 places, 329/329 transitions.
Applied a total of 0 rules in 9 ms. Remains 345 /345 variables (removed 0) and now considering 329/329 (removed 0) transitions.
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:36:14] [INFO ] Computed 40 place invariants in 15 ms
[2022-06-02 16:36:15] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:36:15] [INFO ] Computed 40 place invariants in 10 ms
[2022-06-02 16:36:15] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-02 16:36:16] [INFO ] Implicit Places using invariants and state equation in 1392 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2022-06-02 16:36:16] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:36:16] [INFO ] Computed 40 place invariants in 16 ms
[2022-06-02 16:36:16] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 345/345 places, 329/329 transitions.
Incomplete random walk after 1000000 steps, including 55496 resets, run finished after 19883 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Interrupted Best-First random walk after 300573 steps, including 12950 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen 0
Interrupted Best-First random walk after 298414 steps, including 12887 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 297997 steps, including 12847 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 301930 steps, including 17256 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen 0
Interrupted Best-First random walk after 288571 steps, including 12396 resets, run timeout after 5001 ms. (steps per millisecond=57 ) properties seen 0
Interrupted Best-First random walk after 277352 steps, including 11973 resets, run timeout after 5001 ms. (steps per millisecond=55 ) properties seen 0
Interrupted Best-First random walk after 331579 steps, including 14366 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen 0
Interrupted Best-First random walk after 337614 steps, including 14539 resets, run timeout after 5001 ms. (steps per millisecond=67 ) properties seen 0
Interrupted Best-First random walk after 292310 steps, including 12584 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Probably explored full state space saw : 1290727 states, properties seen :0
Probabilistic random walk after 2581652 steps, saw 1290727 distinct states, run finished after 47950 ms. (steps per millisecond=53 ) properties seen :0
Interrupted probabilistic random walk after 10921484 steps, run timeout after 192001 ms. (steps per millisecond=56 ) properties seen :{}
Exhaustive walk after 10921484 steps, saw 5461076 distinct states, run finished after 192003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:41:21] [INFO ] Computed 40 place invariants in 10 ms
[2022-06-02 16:41:21] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2022-06-02 16:41:21] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 5 ms returned sat
[2022-06-02 16:41:21] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 16:41:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 16 ms returned sat
[2022-06-02 16:41:21] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-02 16:41:23] [INFO ] After 1499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-02 16:41:23] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-02 16:41:26] [INFO ] After 3177ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-02 16:41:26] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2022-06-02 16:41:27] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2022-06-02 16:41:27] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2022-06-02 16:41:27] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 0 ms to minimize.
[2022-06-02 16:41:27] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2022-06-02 16:41:27] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 1 ms to minimize.
[2022-06-02 16:41:27] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2022-06-02 16:41:27] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 0 ms to minimize.
[2022-06-02 16:41:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 663 ms
[2022-06-02 16:41:27] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:41:28] [INFO ] Deduced a trap composed of 138 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:41:28] [INFO ] Deduced a trap composed of 115 places in 88 ms of which 1 ms to minimize.
[2022-06-02 16:41:28] [INFO ] Deduced a trap composed of 124 places in 85 ms of which 1 ms to minimize.
[2022-06-02 16:41:28] [INFO ] Deduced a trap composed of 125 places in 100 ms of which 0 ms to minimize.
[2022-06-02 16:41:28] [INFO ] Deduced a trap composed of 124 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:41:28] [INFO ] Deduced a trap composed of 130 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:41:28] [INFO ] Deduced a trap composed of 129 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:41:29] [INFO ] Deduced a trap composed of 123 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:41:29] [INFO ] Deduced a trap composed of 140 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:41:29] [INFO ] Deduced a trap composed of 127 places in 102 ms of which 0 ms to minimize.
[2022-06-02 16:41:29] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:41:29] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2022-06-02 16:41:29] [INFO ] Deduced a trap composed of 126 places in 87 ms of which 1 ms to minimize.
[2022-06-02 16:41:29] [INFO ] Deduced a trap composed of 128 places in 79 ms of which 0 ms to minimize.
[2022-06-02 16:41:29] [INFO ] Deduced a trap composed of 136 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:41:30] [INFO ] Deduced a trap composed of 132 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:41:30] [INFO ] Deduced a trap composed of 138 places in 82 ms of which 1 ms to minimize.
[2022-06-02 16:41:30] [INFO ] Deduced a trap composed of 136 places in 85 ms of which 1 ms to minimize.
[2022-06-02 16:41:30] [INFO ] Deduced a trap composed of 124 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:41:30] [INFO ] Deduced a trap composed of 117 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:41:30] [INFO ] Deduced a trap composed of 119 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:41:30] [INFO ] Deduced a trap composed of 117 places in 81 ms of which 1 ms to minimize.
[2022-06-02 16:41:30] [INFO ] Deduced a trap composed of 127 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:41:31] [INFO ] Deduced a trap composed of 137 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:41:31] [INFO ] Deduced a trap composed of 141 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:41:31] [INFO ] Deduced a trap composed of 131 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:41:31] [INFO ] Deduced a trap composed of 153 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:41:31] [INFO ] Deduced a trap composed of 130 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:41:31] [INFO ] Deduced a trap composed of 143 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:41:31] [INFO ] Deduced a trap composed of 126 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:41:31] [INFO ] Deduced a trap composed of 136 places in 80 ms of which 0 ms to minimize.
[2022-06-02 16:41:31] [INFO ] Deduced a trap composed of 128 places in 78 ms of which 0 ms to minimize.
[2022-06-02 16:41:31] [INFO ] Deduced a trap composed of 136 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:41:32] [INFO ] Deduced a trap composed of 144 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:41:32] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:41:32] [INFO ] Deduced a trap composed of 154 places in 85 ms of which 1 ms to minimize.
[2022-06-02 16:41:32] [INFO ] Deduced a trap composed of 129 places in 84 ms of which 4 ms to minimize.
[2022-06-02 16:41:32] [INFO ] Deduced a trap composed of 124 places in 79 ms of which 1 ms to minimize.
[2022-06-02 16:41:32] [INFO ] Deduced a trap composed of 140 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:41:32] [INFO ] Deduced a trap composed of 145 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:41:32] [INFO ] Deduced a trap composed of 138 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:41:32] [INFO ] Deduced a trap composed of 120 places in 75 ms of which 1 ms to minimize.
[2022-06-02 16:41:32] [INFO ] Deduced a trap composed of 147 places in 80 ms of which 0 ms to minimize.
[2022-06-02 16:41:33] [INFO ] Deduced a trap composed of 128 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:41:33] [INFO ] Deduced a trap composed of 134 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:41:33] [INFO ] Deduced a trap composed of 137 places in 79 ms of which 0 ms to minimize.
[2022-06-02 16:41:33] [INFO ] Deduced a trap composed of 123 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:41:33] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2022-06-02 16:41:33] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 5624 ms
[2022-06-02 16:41:33] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2022-06-02 16:41:33] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2022-06-02 16:41:34] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2022-06-02 16:41:34] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 0 ms to minimize.
[2022-06-02 16:41:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 333 ms
[2022-06-02 16:41:34] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:41:34] [INFO ] Deduced a trap composed of 146 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:41:34] [INFO ] Deduced a trap composed of 145 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:41:34] [INFO ] Deduced a trap composed of 138 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:41:34] [INFO ] Deduced a trap composed of 134 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:41:34] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:41:35] [INFO ] Deduced a trap composed of 116 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:41:35] [INFO ] Deduced a trap composed of 107 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:41:35] [INFO ] Deduced a trap composed of 129 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:41:35] [INFO ] Deduced a trap composed of 113 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:41:35] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 1 ms to minimize.
[2022-06-02 16:41:35] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:41:35] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:41:35] [INFO ] Deduced a trap composed of 122 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:41:35] [INFO ] Deduced a trap composed of 126 places in 80 ms of which 0 ms to minimize.
[2022-06-02 16:41:36] [INFO ] Deduced a trap composed of 131 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:41:36] [INFO ] Deduced a trap composed of 132 places in 211 ms of which 0 ms to minimize.
[2022-06-02 16:41:36] [INFO ] Deduced a trap composed of 127 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:41:36] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2022-06-02 16:41:36] [INFO ] Deduced a trap composed of 114 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:41:36] [INFO ] Deduced a trap composed of 116 places in 80 ms of which 1 ms to minimize.
[2022-06-02 16:41:36] [INFO ] Deduced a trap composed of 102 places in 85 ms of which 1 ms to minimize.
[2022-06-02 16:41:36] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2523 ms
[2022-06-02 16:41:37] [INFO ] Deduced a trap composed of 134 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:41:37] [INFO ] Deduced a trap composed of 132 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:41:37] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:41:37] [INFO ] Deduced a trap composed of 127 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:41:37] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:41:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 501 ms
[2022-06-02 16:41:37] [INFO ] Deduced a trap composed of 120 places in 78 ms of which 0 ms to minimize.
[2022-06-02 16:41:37] [INFO ] Deduced a trap composed of 120 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:41:37] [INFO ] Deduced a trap composed of 117 places in 81 ms of which 1 ms to minimize.
[2022-06-02 16:41:37] [INFO ] Deduced a trap composed of 117 places in 82 ms of which 1 ms to minimize.
[2022-06-02 16:41:38] [INFO ] Deduced a trap composed of 148 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:41:38] [INFO ] Deduced a trap composed of 122 places in 81 ms of which 1 ms to minimize.
[2022-06-02 16:41:38] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:41:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 715 ms
[2022-06-02 16:41:41] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:41:42] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:41:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2022-06-02 16:41:42] [INFO ] After 18719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 5113 ms.
[2022-06-02 16:41:47] [INFO ] After 25501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 100513 ms.
Support contains 110 out of 345 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 345/345 places, 329/329 transitions.
Applied a total of 0 rules in 8 ms. Remains 345 /345 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 345/345 places, 329/329 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 345/345 places, 329/329 transitions.
Applied a total of 0 rules in 8 ms. Remains 345 /345 variables (removed 0) and now considering 329/329 (removed 0) transitions.
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:43:27] [INFO ] Computed 40 place invariants in 17 ms
[2022-06-02 16:43:27] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:43:27] [INFO ] Computed 40 place invariants in 10 ms
[2022-06-02 16:43:28] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-02 16:43:29] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
[2022-06-02 16:43:29] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:43:29] [INFO ] Computed 40 place invariants in 16 ms
[2022-06-02 16:43:29] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 345/345 places, 329/329 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 345 transition count 326
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 342 transition count 326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 342 transition count 325
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 8 place count 341 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 340 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 340 transition count 324
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 340 transition count 322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 338 transition count 322
Applied a total of 14 rules in 33 ms. Remains 338 /345 variables (removed 7) and now considering 322/329 (removed 7) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 322 rows 338 cols
[2022-06-02 16:43:29] [INFO ] Computed 40 place invariants in 18 ms
[2022-06-02 16:43:29] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2022-06-02 16:43:29] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 7 ms returned sat
[2022-06-02 16:43:29] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 16:43:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2022-06-02 16:43:29] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 6 ms returned sat
[2022-06-02 16:43:31] [INFO ] After 1555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-02 16:43:31] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 0 ms to minimize.
[2022-06-02 16:43:31] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:43:31] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:43:31] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 0 ms to minimize.
[2022-06-02 16:43:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 367 ms
[2022-06-02 16:43:32] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:43:32] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:43:32] [INFO ] Deduced a trap composed of 126 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:43:32] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2022-06-02 16:43:32] [INFO ] Deduced a trap composed of 112 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:43:32] [INFO ] Deduced a trap composed of 130 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:43:32] [INFO ] Deduced a trap composed of 123 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:43:33] [INFO ] Deduced a trap composed of 145 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:43:33] [INFO ] Deduced a trap composed of 120 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:43:33] [INFO ] Deduced a trap composed of 148 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:43:33] [INFO ] Deduced a trap composed of 135 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:43:33] [INFO ] Deduced a trap composed of 127 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:43:33] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 0 ms to minimize.
[2022-06-02 16:43:33] [INFO ] Deduced a trap composed of 129 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:43:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1532 ms
[2022-06-02 16:43:34] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:43:34] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2022-06-02 16:43:34] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 0 ms to minimize.
[2022-06-02 16:43:34] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 0 ms to minimize.
[2022-06-02 16:43:34] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2022-06-02 16:43:34] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2022-06-02 16:43:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 460 ms
[2022-06-02 16:43:34] [INFO ] Deduced a trap composed of 145 places in 87 ms of which 1 ms to minimize.
[2022-06-02 16:43:34] [INFO ] Deduced a trap composed of 137 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:43:34] [INFO ] Deduced a trap composed of 133 places in 80 ms of which 1 ms to minimize.
[2022-06-02 16:43:35] [INFO ] Deduced a trap composed of 126 places in 80 ms of which 1 ms to minimize.
[2022-06-02 16:43:35] [INFO ] Deduced a trap composed of 130 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:43:35] [INFO ] Deduced a trap composed of 127 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:43:35] [INFO ] Deduced a trap composed of 125 places in 81 ms of which 1 ms to minimize.
[2022-06-02 16:43:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 716 ms
[2022-06-02 16:43:36] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:43:36] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 0 ms to minimize.
[2022-06-02 16:43:36] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:43:36] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:43:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 438 ms
[2022-06-02 16:43:36] [INFO ] After 6909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1405 ms.
[2022-06-02 16:43:38] [INFO ] After 8479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2022-06-02 16:43:38] [INFO ] Flatten gal took : 66 ms
[2022-06-02 16:43:38] [INFO ] Flatten gal took : 25 ms
[2022-06-02 16:43:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3943832101286889816.gal : 12 ms
[2022-06-02 16:43:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6653310360445485660.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3943832101286889816.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6653310360445485660.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6653310360445485660.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :13 after 21
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :21 after 44
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :44 after 89
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :89 after 373
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :373 after 3510
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :3510 after 20294
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :20294 after 323751
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :323751 after 1.12816e+06
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :1.12816e+06 after 2.737e+06
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :2.737e+06 after 5.95788e+06
SDD proceeding with computation,9 properties remain. new max is 65536
Detected timeout of ITS tools.
[2022-06-02 16:43:53] [INFO ] Flatten gal took : 23 ms
[2022-06-02 16:43:53] [INFO ] Applying decomposition
[2022-06-02 16:43:53] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16871149702400843409.txt' '-o' '/tmp/graph16871149702400843409.bin' '-w' '/tmp/graph16871149702400843409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16871149702400843409.bin' '-l' '-1' '-v' '-w' '/tmp/graph16871149702400843409.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:43:53] [INFO ] Decomposing Gal with order
[2022-06-02 16:43:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:43:53] [INFO ] Removed a total of 130 redundant transitions.
[2022-06-02 16:43:53] [INFO ] Flatten gal took : 171 ms
[2022-06-02 16:43:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 34 ms.
[2022-06-02 16:43:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7652450119781308180.gal : 9 ms
[2022-06-02 16:43:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17666484514957047321.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7652450119781308180.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17666484514957047321.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality17666484514957047321.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :6 after 14
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :14 after 25
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :25 after 52
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :52 after 3307
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11406567899559940758
[2022-06-02 16:44:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11406567899559940758
Running compilation step : cd /tmp/ltsmin11406567899559940758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 607 ms.
Running link step : cd /tmp/ltsmin11406567899559940758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11406567899559940758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'DoubleExponentPT010ReachabilityFireability00==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-02 16:44:24] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
[2022-06-02 16:44:24] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin7976213773422392585
[2022-06-02 16:44:24] [INFO ] Computing symmetric may disable matrix : 329 transitions.
[2022-06-02 16:44:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:44:24] [INFO ] Computing symmetric may enable matrix : 329 transitions.
[2022-06-02 16:44:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:44:24] [INFO ] Flatten gal took : 22 ms
[2022-06-02 16:44:24] [INFO ] Input system was already deterministic with 329 transitions.
[2022-06-02 16:44:24] [INFO ] Flatten gal took : 42 ms
[2022-06-02 16:44:24] [INFO ] Computing Do-Not-Accords matrix : 329 transitions.
[2022-06-02 16:44:24] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:44:24] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7976213773422392585
Running compilation step : cd /tmp/ltsmin7976213773422392585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '80' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9427054213238922419.txt' '-o' '/tmp/graph9427054213238922419.bin' '-w' '/tmp/graph9427054213238922419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9427054213238922419.bin' '-l' '-1' '-v' '-w' '/tmp/graph9427054213238922419.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:44:24] [INFO ] Decomposing Gal with order
[2022-06-02 16:44:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:44:24] [INFO ] Ran tautology test, simplified 0 / 9 in 149 ms.
[2022-06-02 16:44:24] [INFO ] Removed a total of 97 redundant transitions.
[2022-06-02 16:44:24] [INFO ] Flatten gal took : 32 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=0 took 8 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=0 took 8 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=1 took 0 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=1 took 0 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=1 took 2 ms
[2022-06-02 16:44:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 24 ms.
[2022-06-02 16:44:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18132929564225709815.gal : 7 ms
[2022-06-02 16:44:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10606677522624098759.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability18132929564225709815.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10606677522624098759.prop' '--nowitness'
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=2 took 44 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=2 took 5 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=2 took 3 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=2 took 2 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=2 took 7 ms
Loading property file /tmp/ReachabilityFireability10606677522624098759.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 329 rows 345 cols
[2022-06-02 16:44:24] [INFO ] Computed 40 place invariants in 10 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=3 took 82 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=3 took 2 ms
[2022-06-02 16:44:24] [INFO ] Computed 40 place invariants in 18 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=3 took 5 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=3 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=3 took 0 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=3 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=3 took 1 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=3 took 0 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=3 took 3 ms
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :2 after 9
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :9 after 14
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :14 after 26
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=4 took 83 ms
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :26 after 65
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=4 took 21 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=4 took 24 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=4 took 20 ms
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :65 after 113
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=4 took 17 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=4 took 23 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=4 took 18 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=4 took 23 ms
[2022-06-02 16:44:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=4 took 54 ms
[2022-06-02 16:44:25] [INFO ] Proved 345 variables to be positive in 600 ms
[2022-06-02 16:44:25] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=5 took 306 ms
[2022-06-02 16:44:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-00
[2022-06-02 16:44:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-00(SAT) depth K=0 took 70 ms
[2022-06-02 16:44:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-02
[2022-06-02 16:44:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-02(SAT) depth K=0 took 41 ms
Compilation finished in 985 ms.
Running link step : cd /tmp/ltsmin7976213773422392585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2022-06-02 16:44:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2022-06-02 16:44:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=0 took 24 ms
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7976213773422392585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityFireability00==true'
[2022-06-02 16:44:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2022-06-02 16:44:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=0 took 60 ms
[2022-06-02 16:44:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2022-06-02 16:44:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=0 took 68 ms
[2022-06-02 16:44:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2022-06-02 16:44:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=0 took 72 ms
[2022-06-02 16:44:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2022-06-02 16:44:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=0 took 96 ms
[2022-06-02 16:44:25] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=5 took 443 ms
[2022-06-02 16:44:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-13
[2022-06-02 16:44:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-13(SAT) depth K=0 took 100 ms
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :113 after 3687
[2022-06-02 16:44:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-14
[2022-06-02 16:44:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-14(SAT) depth K=0 took 128 ms
[2022-06-02 16:44:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=5 took 476 ms
[2022-06-02 16:44:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-00
[2022-06-02 16:44:26] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-00(SAT) depth K=1 took 468 ms
[2022-06-02 16:44:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=5 took 387 ms
[2022-06-02 16:44:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-02
[2022-06-02 16:44:26] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-02(SAT) depth K=1 took 384 ms
[2022-06-02 16:44:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=5 took 379 ms
[2022-06-02 16:44:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2022-06-02 16:44:26] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=1 took 268 ms
[2022-06-02 16:44:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2022-06-02 16:44:27] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=1 took 361 ms
[2022-06-02 16:44:27] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=5 took 765 ms
[2022-06-02 16:44:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2022-06-02 16:44:27] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=1 took 376 ms
[2022-06-02 16:44:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2022-06-02 16:44:27] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=1 took 167 ms
[2022-06-02 16:44:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=5 took 402 ms
[2022-06-02 16:44:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2022-06-02 16:44:28] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=1 took 282 ms
[2022-06-02 16:44:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-13
[2022-06-02 16:44:28] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-13(SAT) depth K=1 took 282 ms
[2022-06-02 16:44:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=5 took 419 ms
[2022-06-02 16:44:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=5 took 266 ms
[2022-06-02 16:44:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-14
[2022-06-02 16:44:29] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-14(SAT) depth K=1 took 786 ms
[2022-06-02 16:44:31] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=6 took 2408 ms
[2022-06-02 16:44:34] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=6 took 2934 ms
[2022-06-02 16:44:35] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=6 took 1179 ms
[2022-06-02 16:44:36] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=6 took 1290 ms
[2022-06-02 16:44:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-00
[2022-06-02 16:44:40] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-00(SAT) depth K=2 took 11306 ms
[2022-06-02 16:44:45] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=6 took 9255 ms
[2022-06-02 16:44:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-02
[2022-06-02 16:44:52] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-02(SAT) depth K=2 took 11849 ms
[2022-06-02 16:44:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=6 took 11614 ms
[2022-06-02 16:45:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=6 took 20772 ms
[2022-06-02 16:45:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=6 took 773 ms
[2022-06-02 16:45:20] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=6 took 1336 ms
[2022-06-02 16:45:22] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=7 took 2622 ms
[2022-06-02 16:45:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=7 took 1258 ms
[2022-06-02 16:45:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2022-06-02 16:45:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=2 took 33299 ms
[2022-06-02 16:45:48] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=7 took 24171 ms
[2022-06-02 16:45:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2022-06-02 16:45:57] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=2 took 31458 ms
[2022-06-02 16:46:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2022-06-02 16:46:01] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=2 took 4714 ms
[2022-06-02 16:46:02] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=7 took 13834 ms
[2022-06-02 16:46:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2022-06-02 16:46:11] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=2 took 9674 ms
[2022-06-02 16:46:21] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=7 took 19076 ms
[2022-06-02 16:46:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=7 took 17210 ms
[2022-06-02 16:46:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2022-06-02 16:46:39] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=2 took 27691 ms
[2022-06-02 16:46:54] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=7 took 15591 ms
[2022-06-02 16:46:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=7 took 2742 ms
[2022-06-02 16:47:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-13
[2022-06-02 16:47:04] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-13(SAT) depth K=2 took 25141 ms
[2022-06-02 16:47:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=7 took 11397 ms
[2022-06-02 16:47:19] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=8 took 11351 ms
[2022-06-02 16:47:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-14
[2022-06-02 16:47:20] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-14(SAT) depth K=2 took 15711 ms
[2022-06-02 16:47:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=8 took 36387 ms
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :3687 after 856472
[2022-06-02 16:48:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=8 took 19650 ms
[2022-06-02 16:49:44] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=8 took 89138 ms
[2022-06-02 16:49:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=8 took 12708 ms
[2022-06-02 16:50:46] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=8 took 48586 ms
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7976213773422392585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityFireability00==true'
Running LTSmin : cd /tmp/ltsmin7976213773422392585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityFireability02==true'
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :856472 after 2.38343e+06
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7976213773422392585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityFireability02==true'
Running LTSmin : cd /tmp/ltsmin7976213773422392585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityFireability03==true'
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :2.38343e+06 after 3.74155e+06
[2022-06-02 17:02:02] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=8 took 676013 ms
[2022-06-02 17:02:12] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=8 took 9941 ms
[2022-06-02 17:03:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=8 took 65742 ms
[2022-06-02 17:03:30] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=9 took 12377 ms
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7976213773422392585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityFireability03==true'
Running LTSmin : cd /tmp/ltsmin7976213773422392585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityFireability04==true'
[2022-06-02 17:06:30] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=9 took 180044 ms
[2022-06-02 17:08:06] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=9 took 96485 ms
[2022-06-02 17:09:10] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=9 took 64009 ms
[2022-06-02 17:10:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=9 took 77592 ms
[2022-06-02 17:10:59] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=9 took 31140 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="DoubleExponent-PT-010"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-010, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110000199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;