Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418800386.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is LamportFastMutEx-COL-8, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418800386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679512725432

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 19:18:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 19:18:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:18:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 19:18:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 19:18:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 486 ms
[2023-03-22 19:18:47] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2023-03-22 19:18:47] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 6 ms.
[2023-03-22 19:18:47] [INFO ] Skeletonized 5 HLPN properties in 1 ms. Removed 11 properties that had guard overlaps.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 8362 steps, including 2 resets, run visited all 7 properties in 42 ms. (steps per millisecond=199 )
[2023-03-22 19:18:47] [INFO ] Flatten gal took : 14 ms
[2023-03-22 19:18:47] [INFO ] Flatten gal took : 2 ms
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 19:18:47] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 30 ms.
[2023-03-22 19:18:47] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Support contains 266 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 13 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 19:18:48] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 19:18:48] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-22 19:18:48] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-22 19:18:48] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 19:18:48] [INFO ] Invariant cache hit.
[2023-03-22 19:18:48] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 19:18:48] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2023-03-22 19:18:48] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 19:18:48] [INFO ] Invariant cache hit.
[2023-03-22 19:18:48] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 978 ms. Remains : 266/266 places, 584/584 transitions.
Support contains 266 out of 266 places after structural reductions.
[2023-03-22 19:18:49] [INFO ] Flatten gal took : 121 ms
[2023-03-22 19:18:49] [INFO ] Flatten gal took : 110 ms
[2023-03-22 19:18:50] [INFO ] Input system was already deterministic with 584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 46) seen :44
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 19:18:50] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 19:18:50] [INFO ] Invariant cache hit.
[2023-03-22 19:18:51] [INFO ] [Real]Absence check using 82 positive place invariants in 41 ms returned sat
[2023-03-22 19:18:51] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 19:18:51] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 19:18:52] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 19:18:52] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 19:18:52] [INFO ] After 345ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 19:18:53] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 7 ms to minimize.
[2023-03-22 19:18:53] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-22 19:18:53] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 2 ms to minimize.
[2023-03-22 19:18:53] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2023-03-22 19:18:53] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2023-03-22 19:18:53] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:18:53] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2023-03-22 19:18:54] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2023-03-22 19:18:54] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:18:54] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-22 19:18:54] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:18:54] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:18:54] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2023-03-22 19:18:54] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2023-03-22 19:18:54] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:18:55] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2023-03-22 19:18:55] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:18:55] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:18:55] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:18:55] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-22 19:18:55] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:18:55] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:18:55] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:18:55] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:18:56] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2023-03-22 19:18:56] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2023-03-22 19:18:56] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-03-22 19:18:56] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-22 19:18:56] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-22 19:18:56] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:18:56] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:18:56] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2023-03-22 19:18:56] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:18:57] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2023-03-22 19:18:57] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 4 ms to minimize.
[2023-03-22 19:18:57] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:18:57] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-22 19:18:57] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-22 19:18:57] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:18:57] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2023-03-22 19:18:57] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-03-22 19:18:57] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2023-03-22 19:18:58] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:18:58] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:18:58] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2023-03-22 19:18:58] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:18:58] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:18:58] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:18:58] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:18:58] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:18:58] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:18:58] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:18:59] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2023-03-22 19:18:59] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:18:59] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:18:59] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 4 ms to minimize.
[2023-03-22 19:18:59] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:18:59] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:18:59] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 0 ms to minimize.
[2023-03-22 19:18:59] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:18:59] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:19:00] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:00] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:19:00] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:19:00] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:00] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2023-03-22 19:19:00] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2023-03-22 19:19:00] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:19:00] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:19:00] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:19:01] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2023-03-22 19:19:01] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:19:01] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:19:01] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:19:01] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:19:01] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2023-03-22 19:19:01] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:19:01] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:19:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-22 19:19:01] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 19:19:02] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:19:03] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:19:03] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:19:03] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2023-03-22 19:19:03] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2023-03-22 19:19:03] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:19:03] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:03] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:19:03] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:19:04] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:04] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:19:04] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2023-03-22 19:19:04] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:19:04] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2023-03-22 19:19:04] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 0 ms to minimize.
[2023-03-22 19:19:04] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2023-03-22 19:19:04] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:19:04] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:19:05] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:19:05] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2023-03-22 19:19:05] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:05] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2023-03-22 19:19:05] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2023-03-22 19:19:05] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2023-03-22 19:19:05] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2023-03-22 19:19:05] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2023-03-22 19:19:06] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:19:06] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-22 19:19:06] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2023-03-22 19:19:06] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:19:06] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:06] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:19:06] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:19:06] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:19:06] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:19:07] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:19:07] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:19:07] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2023-03-22 19:19:07] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2023-03-22 19:19:07] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:19:07] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:19:07] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2023-03-22 19:19:08] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-03-22 19:19:08] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2023-03-22 19:19:08] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2023-03-22 19:19:08] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:19:08] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2023-03-22 19:19:08] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:19:08] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-22 19:19:08] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-22 19:19:08] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:09] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 0 ms to minimize.
[2023-03-22 19:19:09] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2023-03-22 19:19:09] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:19:09] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2023-03-22 19:19:09] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:19:09] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:19:09] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:19:09] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:19:10] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:19:10] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:19:10] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:10] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:19:10] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:19:10] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:19:10] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:10] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-22 19:19:11] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:19:11] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:19:11] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:19:11] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2023-03-22 19:19:11] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2023-03-22 19:19:11] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:19:11] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:19:11] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:19:11] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:11] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:19:12] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:12] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:19:12] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:19:12] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:19:12] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:19:12] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:19:12] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 0 ms to minimize.
[2023-03-22 19:19:12] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2023-03-22 19:19:13] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:19:13] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:13] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:19:13] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:19:13] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:19:13] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 0 ms to minimize.
[2023-03-22 19:19:13] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:13] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:19:13] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2023-03-22 19:19:14] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2023-03-22 19:19:14] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:19:14] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:19:14] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:19:14] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:19:14] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:14] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:19:14] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:19:14] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:19:15] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:19:15] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:19:15] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2023-03-22 19:19:15] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2023-03-22 19:19:15] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:19:15] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:19:15] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:19:15] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:19:15] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:16] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:19:16] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:19:16] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2023-03-22 19:19:16] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:19:16] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:19:16] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2023-03-22 19:19:16] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2023-03-22 19:19:16] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 19:19:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 19:19:16] [INFO ] After 25089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 10 ms.
Support contains 105 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 30 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 266/266 places, 584/584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 313017 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 313017 steps, saw 171420 distinct states, run finished after 3002 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 19:19:20] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 19:19:20] [INFO ] Invariant cache hit.
[2023-03-22 19:19:20] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 19:19:20] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 19:19:20] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 19:19:21] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 19:19:21] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 19:19:21] [INFO ] After 329ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 19:19:21] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-22 19:19:21] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2023-03-22 19:19:22] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 0 ms to minimize.
[2023-03-22 19:19:22] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:19:22] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:19:22] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:19:22] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:19:22] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:19:22] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2023-03-22 19:19:22] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:22] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2023-03-22 19:19:23] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2023-03-22 19:19:23] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:19:23] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-03-22 19:19:23] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-22 19:19:23] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:19:23] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:19:23] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2023-03-22 19:19:23] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:19:23] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:19:24] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2023-03-22 19:19:24] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2023-03-22 19:19:24] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-22 19:19:24] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 0 ms to minimize.
[2023-03-22 19:19:24] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-22 19:19:24] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2023-03-22 19:19:24] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2023-03-22 19:19:24] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:19:24] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-22 19:19:24] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:19:25] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2023-03-22 19:19:25] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:19:25] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:19:25] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:19:25] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:25] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2023-03-22 19:19:25] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:19:25] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:19:25] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2023-03-22 19:19:25] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2023-03-22 19:19:26] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2023-03-22 19:19:26] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:19:26] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:19:26] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2023-03-22 19:19:26] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 4 ms to minimize.
[2023-03-22 19:19:26] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 3 ms to minimize.
[2023-03-22 19:19:26] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:19:26] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:19:26] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2023-03-22 19:19:27] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2023-03-22 19:19:27] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:19:27] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:19:27] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2023-03-22 19:19:27] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:27] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:19:27] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2023-03-22 19:19:27] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:19:27] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:19:28] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 0 ms to minimize.
[2023-03-22 19:19:28] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2023-03-22 19:19:28] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2023-03-22 19:19:28] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2023-03-22 19:19:28] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 0 ms to minimize.
[2023-03-22 19:19:28] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2023-03-22 19:19:28] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:28] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:19:29] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2023-03-22 19:19:29] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:19:29] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2023-03-22 19:19:29] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2023-03-22 19:19:29] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:19:29] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:29] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:19:29] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:19:29] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2023-03-22 19:19:30] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:30] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:19:30] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2023-03-22 19:19:30] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2023-03-22 19:19:30] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2023-03-22 19:19:30] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:19:30] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:19:30] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:19:30] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:19:31] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:31] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:19:31] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:19:31] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:19:31] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2023-03-22 19:19:31] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-22 19:19:31] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:19:31] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:31] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2023-03-22 19:19:32] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:32] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:19:32] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2023-03-22 19:19:32] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2023-03-22 19:19:32] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:19:32] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:19:32] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2023-03-22 19:19:32] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:19:32] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:19:33] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:19:33] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:19:33] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:19:33] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:19:33] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:19:33] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:19:33] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:33] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:33] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:19:34] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:19:34] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:19:34] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2023-03-22 19:19:34] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:34] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:19:34] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:19:34] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:34] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:19:34] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:19:35] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:19:35] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2023-03-22 19:19:35] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2023-03-22 19:19:35] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:19:35] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2023-03-22 19:19:35] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:19:35] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:19:35] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:19:35] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:19:36] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:36] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:19:36] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2023-03-22 19:19:36] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-22 19:19:36] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:19:36] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:19:36] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:19:36] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:19:37] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2023-03-22 19:19:37] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:19:37] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:19:37] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2023-03-22 19:19:37] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:19:37] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2023-03-22 19:19:37] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:19:37] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:19:37] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:19:37] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:19:38] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:19:38] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:19:38] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2023-03-22 19:19:38] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:19:38] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:19:38] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:19:38] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:38] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2023-03-22 19:19:38] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2023-03-22 19:19:39] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:19:39] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:19:39] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:19:39] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:19:39] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2023-03-22 19:19:39] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2023-03-22 19:19:39] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:19:39] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:19:39] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2023-03-22 19:19:40] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2023-03-22 19:19:40] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:19:40] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:19:40] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:19:40] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:19:40] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2023-03-22 19:19:40] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:19:40] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:40] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:19:41] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2023-03-22 19:19:41] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:19:41] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:19:41] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:19:41] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:19:41] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:41] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2023-03-22 19:19:41] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:19:41] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:19:42] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:19:42] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:19:42] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:19:42] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:19:42] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:19:42] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2023-03-22 19:19:42] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2023-03-22 19:19:42] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 0 ms to minimize.
[2023-03-22 19:19:42] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:19:42] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:19:43] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2023-03-22 19:19:43] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:43] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:19:43] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:19:43] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:19:43] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2023-03-22 19:19:43] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:19:43] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:19:44] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:19:44] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:19:44] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:19:44] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:19:44] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2023-03-22 19:19:44] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:44] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2023-03-22 19:19:44] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:19:44] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 0 ms to minimize.
[2023-03-22 19:19:45] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:19:45] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2023-03-22 19:19:45] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:19:45] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2023-03-22 19:19:45] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2023-03-22 19:19:45] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:19:45] [INFO ] Trap strengthening (SAT) tested/added 216/216 trap constraints in 24025 ms
[2023-03-22 19:19:45] [INFO ] After 24534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 19:19:45] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 105 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 41 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 266/266 places, 584/584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 19 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 19:19:45] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 19:19:45] [INFO ] Invariant cache hit.
[2023-03-22 19:19:45] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-22 19:19:45] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 19:19:45] [INFO ] Invariant cache hit.
[2023-03-22 19:19:46] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 19:19:46] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-03-22 19:19:46] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-22 19:19:46] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 19:19:46] [INFO ] Invariant cache hit.
[2023-03-22 19:19:46] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 800 ms. Remains : 266/266 places, 584/584 transitions.
Graph (trivial) has 176 edges and 266 vertex of which 40 / 266 are part of one of the 8 SCC in 6 ms
Free SCC test removed 32 places
Drop transitions removed 96 transitions
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (complete) has 632 edges and 234 vertex of which 225 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 225 transition count 312
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 74 place count 225 transition count 304
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 82 place count 217 transition count 304
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 217 transition count 304
Applied a total of 90 rules in 76 ms. Remains 217 /266 variables (removed 49) and now considering 304/584 (removed 280) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 304 rows 217 cols
[2023-03-22 19:19:46] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-22 19:19:46] [INFO ] [Real]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-22 19:19:46] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 19:19:47] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-22 19:19:47] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 19:19:47] [INFO ] After 678ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 296 ms.
[2023-03-22 19:19:48] [INFO ] After 1051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 19:19:48] [INFO ] Flatten gal took : 52 ms
[2023-03-22 19:19:48] [INFO ] Flatten gal took : 66 ms
[2023-03-22 19:19:48] [INFO ] Input system was already deterministic with 584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:48] [INFO ] Flatten gal took : 27 ms
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 31 ms
[2023-03-22 19:19:49] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 22 ms
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 23 ms
[2023-03-22 19:19:49] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 21 ms
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 23 ms
[2023-03-22 19:19:49] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 20 ms
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 22 ms
[2023-03-22 19:19:49] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 32 ms
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 27 ms
[2023-03-22 19:19:49] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 16 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 19 ms
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 22 ms
[2023-03-22 19:19:49] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 23 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 258/266 places, 576/584 transitions.
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 18 ms
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 22 ms
[2023-03-22 19:19:49] [INFO ] Input system was already deterministic with 576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 19 ms
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 22 ms
[2023-03-22 19:19:49] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 20 ms
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 25 ms
[2023-03-22 19:19:49] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 18 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 258/266 places, 576/584 transitions.
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 18 ms
[2023-03-22 19:19:49] [INFO ] Flatten gal took : 19 ms
[2023-03-22 19:19:50] [INFO ] Input system was already deterministic with 576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 19 ms
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 22 ms
[2023-03-22 19:19:50] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 18 ms
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 20 ms
[2023-03-22 19:19:50] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 1 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 18 ms
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 22 ms
[2023-03-22 19:19:50] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 16 ms
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 17 ms
[2023-03-22 19:19:50] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 16 ms
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 17 ms
[2023-03-22 19:19:50] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 17 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 258/266 places, 576/584 transitions.
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 16 ms
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 18 ms
[2023-03-22 19:19:50] [INFO ] Input system was already deterministic with 576 transitions.
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 52 ms
[2023-03-22 19:19:50] [INFO ] Flatten gal took : 50 ms
[2023-03-22 19:19:51] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 36 ms.
[2023-03-22 19:19:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 584 transitions and 2560 arcs took 3 ms.
Total runtime 64196 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1787/ctl_0_ --ctl=/tmp/1787/ctl_1_ --ctl=/tmp/1787/ctl_2_ --ctl=/tmp/1787/ctl_3_ --ctl=/tmp/1787/ctl_4_ --ctl=/tmp/1787/ctl_5_ --ctl=/tmp/1787/ctl_6_ --ctl=/tmp/1787/ctl_7_ --ctl=/tmp/1787/ctl_8_ --ctl=/tmp/1787/ctl_9_ --ctl=/tmp/1787/ctl_10_ --ctl=/tmp/1787/ctl_11_ --ctl=/tmp/1787/ctl_12_ --ctl=/tmp/1787/ctl_13_ --ctl=/tmp/1787/ctl_14_ --ctl=/tmp/1787/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11922112 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16092276 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-COL-8, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856418800386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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