About the Execution of ITS-Tools for LamportFastMutEx-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 503076.00 | 0.00 | 0.00 | TFTFFFTFFFFFTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423000612.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is LamportFastMutEx-COL-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423000612
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 40K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748872122479
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-02 13:48:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 13:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:48:44] [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.
[2025-06-02 13:48:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 13:48:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 627 ms
[2025-06-02 13:48:44] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 13:48:44] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2025-06-02 13:48:44] [INFO ] Skeletonized 13 HLPN properties in 1 ms. Removed 3 properties that had guard overlaps.
Initial state reduction rules removed 3 formulas.
FORMULA LamportFastMutEx-COL-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 10 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
RANDOM walk for 557 steps (0 resets) in 18 ms. (29 steps per ms) remains 0/9 properties
[2025-06-02 13:48:45] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:48:45] [INFO ] Flatten gal took : 2 ms
Domain [pid(5), pid(5)] 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.
[2025-06-02 13:48:45] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 27 ms.
[2025-06-02 13:48:45] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Support contains 70 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-06-02 13:48:45] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2025-06-02 13:48:45] [INFO ] Computed 26 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:48:45] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-06-02 13:48:45] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2025-06-02 13:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:48:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 13:48:45] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-02 13:48:45] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2025-06-02 13:48:45] [INFO ] Invariant cache hit.
[2025-06-02 13:48:45] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:46] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 19 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:46] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 6 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:46] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:46] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 4 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:46] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:46] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:46] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 5 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 5 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 18 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:47] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 3 ms to minimize.
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 6 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:48] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:49] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:49] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:49] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:49] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:49] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:49] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:49] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:49] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:49] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:50] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:50] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:50] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 8/74 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:50] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:51] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:51] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:51] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 5/79 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:51] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/80 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/80 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 144/246 variables, 102/182 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 40/222 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:53] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:53] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:53] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 3/225 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/225 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/225 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 225 constraints, problems are : Problem set: 24 solved, 152 unsolved in 11154 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 35/41 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/61 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 22/83 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/83 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 144/246 variables, 102/185 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 40/225 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 152/377 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:59] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:59] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:59] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 3/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:00] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:01] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/382 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:03] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:03] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:03] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 3/385 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:05] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:05] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:05] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:06] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 4/389 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:08] [INFO ] Deduced a trap along path composed of 4 places in 35 ms of which 12 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 1/390 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:13] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:13] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:13] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 3/393 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:16] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:16] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:16] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 3/396 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:19] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 1/397 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:23] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 1/398 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:26] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 1/399 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 399 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41284ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 41298ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/102 places, 156/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41695 ms. Remains : 102/102 places, 156/180 transitions.
Support contains 70 out of 102 places after structural reductions.
[2025-06-02 13:49:26] [INFO ] Flatten gal took : 43 ms
[2025-06-02 13:49:27] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:49:27] [INFO ] Input system was already deterministic with 156 transitions.
Reduction of identical properties reduced properties to check from 18 to 14
RANDOM walk for 1408 steps (0 resets) in 76 ms. (18 steps per ms) remains 0/14 properties
Computed a total of 1 stabilizing places and 4 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 18 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2025-06-02 13:49:27] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
// Phase 1: matrix 124 rows 98 cols
[2025-06-02 13:49:27] [INFO ] Computed 26 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:49:27] [INFO ] Implicit Places using invariants in 93 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 96 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/102 places, 152/156 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 94 transition count 148
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 148
Applied a total of 8 rules in 12 ms. Remains 90 /94 variables (removed 4) and now considering 148/152 (removed 4) transitions.
[2025-06-02 13:49:27] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
// Phase 1: matrix 120 rows 90 cols
[2025-06-02 13:49:27] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:49:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 13:49:27] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:49:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:49:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:49:27] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/102 places, 148/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 337 ms. Remains : 90/102 places, 148/156 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-00
Product exploration explored 100000 steps with 2317 reset in 397 ms.
Product exploration explored 100000 steps with 2365 reset in 308 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 79 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 9 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 13 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2025-06-02 13:49:29] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:49:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:49:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 13:49:29] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:49:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:49:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:49:29] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:49:29] [INFO ] Redundant transitions in 4 ms returned []
Running 144 sub problems to find dead transitions.
[2025-06-02 13:49:29] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:49:29] [INFO ] Invariant cache hit.
[2025-06-02 13:49:29] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 120/210 variables, 90/169 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:37] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/210 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 190 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9971 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:40] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:40] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:40] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 120/210 variables, 90/173 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 144/337 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:42] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:42] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:42] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:43] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:43] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:43] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 8/345 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:45] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:48] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:49] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 5/351 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:51] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:52] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:52] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:52] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:56] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:58] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:58] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:59] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:59] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:02] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 361 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40011ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 40012ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40250 ms. Remains : 90/90 places, 148/148 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 106 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2394 reset in 226 ms.
Product exploration explored 100000 steps with 2357 reset in 241 ms.
Built C files in :
/tmp/ltsmin5264760214622025481
[2025-06-02 13:50:10] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2025-06-02 13:50:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:50:10] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2025-06-02 13:50:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:50:10] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2025-06-02 13:50:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:50:10] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5264760214622025481
Running compilation step : cd /tmp/ltsmin5264760214622025481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 450 ms.
Running link step : cd /tmp/ltsmin5264760214622025481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5264760214622025481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1573256764847090996.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 12 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2025-06-02 13:50:25] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:50:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-02 13:50:25] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:50:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:50:25] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:50:25] [INFO ] Redundant transitions in 4 ms returned []
Running 144 sub problems to find dead transitions.
[2025-06-02 13:50:25] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:50:25] [INFO ] Invariant cache hit.
[2025-06-02 13:50:25] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:26] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:26] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:26] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:27] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:28] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:29] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:30] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:30] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:30] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:30] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:30] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:30] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:30] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:30] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 120/210 variables, 90/169 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:33] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/210 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 190 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9749 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:36] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:36] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:36] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 120/210 variables, 90/173 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 144/337 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:38] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:38] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:38] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:38] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:39] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:39] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:39] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:39] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 8/345 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:41] [INFO ] Deduced a trap along path composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:44] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:45] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:45] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:45] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:45] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 5/351 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:47] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:48] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:48] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:48] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:52] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:55] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:55] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:55] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:55] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:58] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 361 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39782ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 39783ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40001 ms. Remains : 90/90 places, 148/148 transitions.
Built C files in :
/tmp/ltsmin15422437002143211479
[2025-06-02 13:51:05] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2025-06-02 13:51:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:51:05] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2025-06-02 13:51:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:51:05] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2025-06-02 13:51:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:51:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15422437002143211479
Running compilation step : cd /tmp/ltsmin15422437002143211479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 293 ms.
Running link step : cd /tmp/ltsmin15422437002143211479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15422437002143211479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17414405256017654776.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 13:51:20] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:51:20] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:51:20] [INFO ] Time to serialize gal into /tmp/LTL2922485953948978430.gal : 4 ms
[2025-06-02 13:51:21] [INFO ] Time to serialize properties into /tmp/LTL10427363042337587633.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2922485953948978430.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14961641102833509776.hoa' '-atoms' '/tmp/LTL10427363042337587633.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10427363042337587633.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14961641102833509776.hoa
Detected timeout of ITS tools.
[2025-06-02 13:51:36] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:51:36] [INFO ] Flatten gal took : 7 ms
[2025-06-02 13:51:36] [INFO ] Time to serialize gal into /tmp/LTL12401699080153346949.gal : 2 ms
[2025-06-02 13:51:36] [INFO ] Time to serialize properties into /tmp/LTL16773698844841886901.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12401699080153346949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16773698844841886901.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((y_3<1)||(P_CS_21_4<1))&&((y_3<1)||(P_CS_21_2<1)))&&(((y_3<1)||(P_CS_21_3<1))&&((y_3<1)||(P_CS_21_1<1))))&&((((y_2<1)||(...590
Formula 0 simplified : FG!"(((((((y_3<1)||(P_CS_21_4<1))&&((y_3<1)||(P_CS_21_2<1)))&&(((y_3<1)||(P_CS_21_3<1))&&((y_3<1)||(P_CS_21_1<1))))&&((((y_2<1)||(P_...584
Detected timeout of ITS tools.
[2025-06-02 13:51:51] [INFO ] Flatten gal took : 15 ms
[2025-06-02 13:51:51] [INFO ] Applying decomposition
[2025-06-02 13:51:51] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13162511066366933809.txt' '-o' '/tmp/graph13162511066366933809.bin' '-w' '/tmp/graph13162511066366933809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13162511066366933809.bin' '-l' '-1' '-v' '-w' '/tmp/graph13162511066366933809.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:51:51] [INFO ] Decomposing Gal with order
[2025-06-02 13:51:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:51:51] [INFO ] Removed a total of 152 redundant transitions.
[2025-06-02 13:51:51] [INFO ] Flatten gal took : 39 ms
[2025-06-02 13:51:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 9 ms.
[2025-06-02 13:51:51] [INFO ] Time to serialize gal into /tmp/LTL16160923681925059036.gal : 7 ms
[2025-06-02 13:51:51] [INFO ] Time to serialize properties into /tmp/LTL9812301710014157466.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16160923681925059036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9812301710014157466.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((i5.u17.y_3<1)||(i4.u16.P_CS_21_4<1))&&((i5.u17.y_3<1)||(i0.u18.P_CS_21_2<1)))&&(((i5.u17.y_3<1)||(i1.u19.P_CS_21_3<1))&...870
Formula 0 simplified : FG!"(((((((i5.u17.y_3<1)||(i4.u16.P_CS_21_4<1))&&((i5.u17.y_3<1)||(i0.u18.P_CS_21_2<1)))&&(((i5.u17.y_3<1)||(i1.u19.P_CS_21_3<1))&&(...864
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t52, t56, t134, t139, t144, t148, t76_t80, t77_t81, t...734
Detected timeout of ITS tools.
Treatment of property LamportFastMutEx-COL-4-LTLFireability-00 finished in 158794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U !p1)||X(X(F((G(p0)||p2)))))))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:52:06] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2025-06-02 13:52:06] [INFO ] Computed 26 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:52:06] [INFO ] Implicit Places using invariants in 88 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 92 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 98/102 places, 156/156 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-02
Product exploration explored 100000 steps with 3833 reset in 360 ms.
Product exploration explored 100000 steps with 3803 reset in 341 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 126 steps (0 resets) in 8 ms. (14 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2025-06-02 13:52:08] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 98 cols
[2025-06-02 13:52:08] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:52:08] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2025-06-02 13:52:08] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-02 13:52:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:52:08] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 13:52:08] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-02 13:52:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:52:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:08] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:08] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:08] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:08] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:08] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:08] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:09] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:09] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:09] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:09] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 3 ms to minimize.
[2025-06-02 13:52:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 666 ms
[2025-06-02 13:52:09] [INFO ] Computed and/alt/rep : 112/428/112 causal constraints (skipped 12 transitions) in 6 ms.
[2025-06-02 13:52:09] [INFO ] Added : 90 causal constraints over 19 iterations in 227 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 18 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:52:09] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:52:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 13:52:09] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:52:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:52:09] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-06-02 13:52:09] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:52:09] [INFO ] Invariant cache hit.
[2025-06-02 13:52:09] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/98 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:10] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:10] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:10] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:10] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:10] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:10] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:10] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:11] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:12] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:13] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:14] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:14] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:14] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:14] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:14] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:14] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:14] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:14] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:14] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 128/226 variables, 98/177 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:16] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:17] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:17] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:18] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:18] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:18] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:19] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 0/226 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 204 constraints, problems are : Problem set: 0 solved, 152 unsolved in 13316 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 128/226 variables, 98/184 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 152/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:25] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:29] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:30] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:30] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:30] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:33] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:33] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:33] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:33] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:33] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:34] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:34] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 7/368 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:36] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:44] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:45] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:46] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:46] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/226 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:49] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 374 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43368ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 43369ms
Finished structural reductions in LTL mode , in 1 iterations and 43570 ms. Remains : 98/98 places, 156/156 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 127 steps (0 resets) in 8 ms. (14 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2025-06-02 13:52:53] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:52:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:52:53] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2025-06-02 13:52:53] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-02 13:52:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:52:54] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2025-06-02 13:52:54] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-06-02 13:52:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:52:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:54] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:54] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:54] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:54] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:54] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 3 ms to minimize.
[2025-06-02 13:52:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 288 ms
[2025-06-02 13:52:54] [INFO ] Computed and/alt/rep : 112/428/112 causal constraints (skipped 12 transitions) in 6 ms.
[2025-06-02 13:52:54] [INFO ] Added : 85 causal constraints over 18 iterations in 207 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3817 reset in 338 ms.
Product exploration explored 100000 steps with 3875 reset in 332 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 18 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 156
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 4 rules in 14 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:52:55] [INFO ] Redundant transitions in 4 ms returned []
Running 152 sub problems to find dead transitions.
[2025-06-02 13:52:55] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 98 cols
[2025-06-02 13:52:55] [INFO ] Computed 22 invariants in 2 ms
[2025-06-02 13:52:55] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/98 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:56] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:56] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:56] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:56] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:56] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:56] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:56] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:56] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:57] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 5 ms to minimize.
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:58] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:59] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/62 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:59] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:59] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:59] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/66 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:00] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:00] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/68 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:00] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:00] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 2/70 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/70 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 128/226 variables, 98/168 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 20/188 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:02] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:02] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:02] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:02] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 4/192 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:03] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:03] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:03] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 3/195 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/195 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 14 (OVERLAPS) 0/226 variables, 0/195 constraints. Problems are: Problem set: 4 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 195 constraints, problems are : Problem set: 4 solved, 148 unsolved in 10474 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 39/45 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/45 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 8/98 variables, 16/61 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 16/77 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:06] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:06] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:06] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:06] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/81 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/81 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 128/226 variables, 98/179 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 20/199 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 148/347 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:08] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:09] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:09] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:09] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:09] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:09] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 6/353 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:10] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:11] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 2/355 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:14] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 1/356 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/356 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 14 (OVERLAPS) 0/226 variables, 0/356 constraints. Problems are: Problem set: 4 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 356 constraints, problems are : Problem set: 4 solved, 148 unsolved in 22294 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 148/152 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32793ms problems are : Problem set: 4 solved, 148 unsolved
Search for dead transitions found 4 dead transitions in 32794ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/98 places, 152/156 transitions.
Graph (complete) has 417 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 94 /98 variables (removed 4) and now considering 152/152 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/98 places, 152/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32825 ms. Remains : 94/98 places, 152/156 transitions.
Built C files in :
/tmp/ltsmin14517716039128775155
[2025-06-02 13:53:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14517716039128775155
Running compilation step : cd /tmp/ltsmin14517716039128775155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 251 ms.
Running link step : cd /tmp/ltsmin14517716039128775155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14517716039128775155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14255416626003958106.hoa' '--buchi-type=spotba'
LTSmin run took 3520 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-4-LTLFireability-02 finished in 85960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(p0))))||G((X(p2)||p1))))'
Support contains 21 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:53:32] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2025-06-02 13:53:32] [INFO ] Computed 26 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:32] [INFO ] Implicit Places using invariants in 73 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 75 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 98/102 places, 156/156 transitions.
Stuttering acceptance computed with spot in 631 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-03
Entered a terminal (fully accepting) state of product in 14 steps with 2 reset in 0 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-03 finished in 742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||((p1 U G(p2)) U X(X(X(!p3)))))))'
Support contains 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:53:33] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:53:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:33] [INFO ] Implicit Places using invariants in 62 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 63 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 98/102 places, 156/156 transitions.
Stuttering acceptance computed with spot in 1068 ms :[(AND (NOT p0) p3), p3, (AND (NOT p2) p3), p3, (AND p3 (NOT p2)), p3, p3, true, (AND (NOT p2) p3), (AND p3 (NOT p2)), p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (NOT p2), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-04
Entered a terminal (fully accepting) state of product in 155 steps with 31 reset in 4 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-04 finished in 1193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 12 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2025-06-02 13:53:34] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
// Phase 1: matrix 124 rows 98 cols
[2025-06-02 13:53:34] [INFO ] Computed 26 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:34] [INFO ] Implicit Places using invariants in 71 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/102 places, 152/156 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 94 transition count 148
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 148
Applied a total of 8 rules in 6 ms. Remains 90 /94 variables (removed 4) and now considering 148/152 (removed 4) transitions.
[2025-06-02 13:53:34] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
// Phase 1: matrix 120 rows 90 cols
[2025-06-02 13:53:34] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-02 13:53:34] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:53:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:53:34] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/102 places, 148/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 272 ms. Remains : 90/102 places, 148/156 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 339 ms.
Stack based approach found an accepted trace after 101 steps with 0 reset with depth 102 and stack size 102 in 1 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-05 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(p1))))'
Support contains 13 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:53:34] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2025-06-02 13:53:34] [INFO ] Computed 26 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:35] [INFO ] Implicit Places using invariants in 78 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 79 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 98/102 places, 156/156 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-4-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-4-LTLFireability-06 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((X((X(p1) U (p2&&X(p1))))||p0)) U p3) U (!p4&&(G((X((X(p1) U (p2&&X(p1))))||p5)) U p3))))'
Support contains 30 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:53:35] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:53:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:35] [INFO ] Implicit Places using invariants in 73 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 74 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 98/102 places, 156/156 transitions.
Stuttering acceptance computed with spot in 2072 ms :[(OR (NOT p3) p4), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p5)) (AND (NOT p0) (NOT p2) (NOT p5))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p3) (NOT p5)) (AND (NOT p2) p4 (NOT p5)) (AND (NOT p1) p4 (NOT p5))), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) p4) (AND (NOT p2) p4)), (OR (AND (NOT p1) (NOT p5)) (AND (NOT p2) (NOT p5))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p5)), (OR (AND (NOT p1) (NOT p3) (NOT p5)) (AND (NOT p1) p4 (NOT p5))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p4)), (AND (NOT p1) (NOT p5)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p5)) (AND (NOT p0) (NOT p2) (NOT p5))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p3) (NOT p5)) (AND (NOT p2) p4 (NOT p5)) (AND (NOT p1) p4 (NOT p5))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p4)), (AND (NOT p1) (NOT p5)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p5)) (AND (NOT p2) (NOT p5))), (NOT p3)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-07 finished in 2282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 9 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2025-06-02 13:53:37] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
// Phase 1: matrix 124 rows 98 cols
[2025-06-02 13:53:37] [INFO ] Computed 26 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:37] [INFO ] Implicit Places using invariants in 64 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/102 places, 152/156 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 94 transition count 148
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 148
Applied a total of 8 rules in 5 ms. Remains 90 /94 variables (removed 4) and now considering 148/152 (removed 4) transitions.
[2025-06-02 13:53:37] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
// Phase 1: matrix 120 rows 90 cols
[2025-06-02 13:53:37] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:37] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-02 13:53:37] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:53:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:53:37] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/102 places, 148/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 90/102 places, 148/156 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 286 ms.
Stack based approach found an accepted trace after 299 steps with 7 reset with depth 132 and stack size 132 in 1 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-08 finished in 662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!G((p0 U p1)) U X(X(((F(p0) U p0)&&X(p2))))))'
Support contains 21 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:53:38] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2025-06-02 13:53:38] [INFO ] Computed 26 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:38] [INFO ] Implicit Places using invariants in 88 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 88 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 98/102 places, 156/156 transitions.
Stuttering acceptance computed with spot in 587 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-09
Product exploration explored 100000 steps with 14030 reset in 218 ms.
Product exploration explored 100000 steps with 13890 reset in 229 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 13 states, 22 edges and 3 AP (stutter sensitive) to 10 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
RANDOM walk for 432 steps (0 resets) in 13 ms. (30 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (OR p2 (NOT p0)) (OR p2 (NOT p1))))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F p2), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1)]
Knowledge based reduction with 6 factoid took 512 ms. Reduced automaton from 10 states, 16 edges and 3 AP (stutter sensitive) to 10 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
[2025-06-02 13:53:41] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 98 cols
[2025-06-02 13:53:41] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:53:41] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2025-06-02 13:53:41] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-06-02 13:53:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:53:41] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2025-06-02 13:53:42] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-06-02 13:53:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:53:42] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
[2025-06-02 13:53:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 313 ms
[2025-06-02 13:53:42] [INFO ] Computed and/alt/rep : 112/428/112 causal constraints (skipped 12 transitions) in 7 ms.
[2025-06-02 13:53:42] [INFO ] Added : 87 causal constraints over 18 iterations in 222 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-02 13:53:42] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:53:42] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2025-06-02 13:53:42] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-02 13:53:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:53:42] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2025-06-02 13:53:42] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-06-02 13:53:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:53:42] [INFO ] [Nat]Added 20 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
[2025-06-02 13:53:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2025-06-02 13:53:42] [INFO ] Computed and/alt/rep : 112/428/112 causal constraints (skipped 12 transitions) in 9 ms.
[2025-06-02 13:53:43] [INFO ] Added : 80 causal constraints over 17 iterations in 201 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 21 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:53:43] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:53:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 13:53:43] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:53:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:53:43] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-06-02 13:53:43] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:53:43] [INFO ] Invariant cache hit.
[2025-06-02 13:53:43] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/98 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 128/226 variables, 98/177 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:50] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:51] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:51] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:51] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:52] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:52] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:53] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 0/226 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 204 constraints, problems are : Problem set: 0 solved, 152 unsolved in 13413 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 128/226 variables, 98/184 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 152/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:59] [INFO ] Deduced a trap along path composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:03] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:04] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:04] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:04] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:07] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:07] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:07] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:07] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:08] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:08] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:08] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 7/368 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:10] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:18] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:19] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:20] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:20] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/226 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:23] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 374 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43450ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 43450ms
Finished structural reductions in LTL mode , in 1 iterations and 43633 ms. Remains : 98/98 places, 156/156 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 10 states, 16 edges and 3 AP (stutter sensitive) to 10 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
RANDOM walk for 109 steps (0 resets) in 14 ms. (7 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F p2), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 1 factoid took 412 ms. Reduced automaton from 10 states, 16 edges and 3 AP (stutter sensitive) to 10 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
[2025-06-02 13:54:28] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:54:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:54:28] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2025-06-02 13:54:28] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-06-02 13:54:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:54:28] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2025-06-02 13:54:29] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-02 13:54:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:54:29] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:29] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:29] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:29] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:29] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:29] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:29] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:29] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 3 ms to minimize.
[2025-06-02 13:54:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 427 ms
[2025-06-02 13:54:29] [INFO ] Computed and/alt/rep : 112/428/112 causal constraints (skipped 12 transitions) in 11 ms.
[2025-06-02 13:54:29] [INFO ] Added : 96 causal constraints over 20 iterations in 225 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-02 13:54:29] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:54:29] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2025-06-02 13:54:29] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-02 13:54:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:54:29] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 13:54:29] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-02 13:54:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:54:29] [INFO ] [Nat]Added 20 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:30] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 3 ms to minimize.
[2025-06-02 13:54:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2025-06-02 13:54:30] [INFO ] Computed and/alt/rep : 112/428/112 causal constraints (skipped 12 transitions) in 9 ms.
[2025-06-02 13:54:30] [INFO ] Added : 80 causal constraints over 17 iterations in 177 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Product exploration explored 100000 steps with 14094 reset in 186 ms.
Product exploration explored 100000 steps with 14089 reset in 190 ms.
Applying partial POR strategy [false, false, false, true, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Support contains 21 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 156
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 10 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:54:31] [INFO ] Redundant transitions in 1 ms returned []
Running 152 sub problems to find dead transitions.
[2025-06-02 13:54:31] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 98 cols
[2025-06-02 13:54:31] [INFO ] Computed 22 invariants in 1 ms
[2025-06-02 13:54:31] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/98 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:32] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:32] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:32] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:32] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:32] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:32] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:32] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:32] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:33] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 3 ms to minimize.
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 6 ms to minimize.
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:34] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:35] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:35] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:35] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:35] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:35] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 5 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/62 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:35] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:35] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:35] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:35] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/66 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:36] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:36] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/68 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:36] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:36] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 2/70 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/70 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 128/226 variables, 98/168 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 20/188 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:38] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:38] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:38] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:39] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 4/192 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:39] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:39] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:39] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 3/195 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/195 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 14 (OVERLAPS) 0/226 variables, 0/195 constraints. Problems are: Problem set: 4 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 195 constraints, problems are : Problem set: 4 solved, 148 unsolved in 10698 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 39/45 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/45 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 8/98 variables, 16/61 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 16/77 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:42] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:43] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/81 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/81 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 128/226 variables, 98/179 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 20/199 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 148/347 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:44] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:45] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:45] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:45] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:45] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:45] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 6/353 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:46] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:47] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 2/355 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:50] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 1/356 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/356 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 14 (OVERLAPS) 0/226 variables, 0/356 constraints. Problems are: Problem set: 4 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 356 constraints, problems are : Problem set: 4 solved, 148 unsolved in 22900 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 148/152 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33618ms problems are : Problem set: 4 solved, 148 unsolved
Search for dead transitions found 4 dead transitions in 33619ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/98 places, 152/156 transitions.
Graph (complete) has 417 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 94 /98 variables (removed 4) and now considering 152/152 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/98 places, 152/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33645 ms. Remains : 94/98 places, 152/156 transitions.
Built C files in :
/tmp/ltsmin11400647553119789927
[2025-06-02 13:55:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11400647553119789927
Running compilation step : cd /tmp/ltsmin11400647553119789927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin11400647553119789927;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11400647553119789927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7049061812010480939.hoa' '--buchi-type=spotba'
LTSmin run took 237 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-4-LTLFireability-09 finished in 87456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 13 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2025-06-02 13:55:05] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
// Phase 1: matrix 124 rows 98 cols
[2025-06-02 13:55:05] [INFO ] Computed 26 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:55:05] [INFO ] Implicit Places using invariants in 86 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 87 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/102 places, 152/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 94/102 places, 152/156 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-10
Product exploration explored 100000 steps with 1618 reset in 228 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 0 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-10 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U !p1)))'
Support contains 32 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:55:06] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2025-06-02 13:55:06] [INFO ] Computed 26 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:55:06] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-02 13:55:06] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:55:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 13:55:06] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-06-02 13:55:06] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:55:06] [INFO ] Invariant cache hit.
[2025-06-02 13:55:06] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/102 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:07] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:07] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:07] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:07] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:07] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:07] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:07] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:07] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:07] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:07] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:08] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:08] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:08] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:08] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:08] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:08] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:08] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:08] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:08] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:08] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:09] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:11] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:11] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:11] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:11] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:11] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:11] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:11] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:11] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:12] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 128/230 variables, 102/185 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 36/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 221 constraints, problems are : Problem set: 0 solved, 152 unsolved in 10572 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 38/44 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 19/83 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:17] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 128/230 variables, 102/186 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 36/222 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 152/374 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:20] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:20] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:20] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:20] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:22] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:22] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:22] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:25] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:25] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:25] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:25] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:27] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:27] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:27] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:30] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:30] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:31] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:36] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:41] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:41] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 394 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40605ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 40606ms
Finished structural reductions in LTL mode , in 1 iterations and 40803 ms. Remains : 102/102 places, 156/156 transitions.
Stuttering acceptance computed with spot in 135 ms :[p1, p1, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-4-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-4-LTLFireability-12 finished in 41281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(p1)&&X(p2))))'
Support contains 13 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:55:47] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:55:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:55:47] [INFO ] Implicit Places using invariants in 81 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 82 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 98/102 places, 156/156 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 21 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-4-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-4-LTLFireability-13 finished in 902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(p1)&&X(G(!p0))))))'
Support contains 29 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-02 13:55:48] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:55:48] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 13:55:48] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:55:48] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 13:55:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-06-02 13:55:48] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2025-06-02 13:55:48] [INFO ] Invariant cache hit.
[2025-06-02 13:55:48] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/102 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:49] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:49] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:49] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:49] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:49] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:49] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:49] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:50] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:51] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:52] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:53] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:54] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 128/230 variables, 102/185 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 36/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 221 constraints, problems are : Problem set: 0 solved, 152 unsolved in 10506 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 38/44 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 19/83 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:59] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 128/230 variables, 102/186 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 36/222 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 152/374 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:02] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:02] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:02] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:04] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:05] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:05] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:07] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:07] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:07] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:07] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:10] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:10] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:10] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:12] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:12] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:13] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:18] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:23] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:23] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 394 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40550ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 40551ms
Finished structural reductions in LTL mode , in 1 iterations and 40754 ms. Remains : 102/102 places, 156/156 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-15
Product exploration explored 100000 steps with 3336 reset in 306 ms.
Stack based approach found an accepted trace after 1278 steps with 41 reset with depth 36 and stack size 36 in 4 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-15 finished in 41190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2025-06-02 13:56:29] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16102514222944477231
[2025-06-02 13:56:29] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2025-06-02 13:56:29] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:56:29] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2025-06-02 13:56:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:56:29] [INFO ] Applying decomposition
[2025-06-02 13:56:29] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2025-06-02 13:56:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:56:29] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16102514222944477231
Running compilation step : cd /tmp/ltsmin16102514222944477231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 13:56:29] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph20675374458358917.txt' '-o' '/tmp/graph20675374458358917.bin' '-w' '/tmp/graph20675374458358917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph20675374458358917.bin' '-l' '-1' '-v' '-w' '/tmp/graph20675374458358917.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:56:29] [INFO ] Decomposing Gal with order
[2025-06-02 13:56:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:56:29] [INFO ] Removed a total of 170 redundant transitions.
[2025-06-02 13:56:29] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:56:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2025-06-02 13:56:29] [INFO ] Time to serialize gal into /tmp/LTLFireability16879741019122095545.gal : 3 ms
[2025-06-02 13:56:29] [INFO ] Time to serialize properties into /tmp/LTLFireability15420743573973859615.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16879741019122095545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15420743573973859615.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((i5.u32.y_3<1)||(i4.i0.u36.P_CS_21_4<1))&&((i5.u32.y_3<1)||(i2.u35.P_CS_21_2<1)))&&(((i5.u32.y_3<1)||(i5.u33.P_CS_21_3<1...885
Formula 0 simplified : FG!"(((((((i5.u32.y_3<1)||(i4.i0.u36.P_CS_21_4<1))&&((i5.u32.y_3<1)||(i2.u35.P_CS_21_2<1)))&&(((i5.u32.y_3<1)||(i5.u33.P_CS_21_3<1))...879
Compilation finished in 333 ms.
Running link step : cd /tmp/ltsmin16102514222944477231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16102514222944477231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t54, t63, t76, t78, t79, t104, t105, t106, t107, t108...579
LTSmin run took 35355 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 501563 ms.
BK_STOP 1748872625555
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-4"
export BK_EXAMINATION="LTLFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876423000612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;