About the Execution of 2025-gold for LamportFastMutEx-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 535.216 | 29671.00 | 44290.00 | 262.50 | 4 5 4 4 5 5 4 5 5 5 4 20 20 1 4 5 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r175-smll-177961111800046.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is LamportFastMutEx-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-177961111800046
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 8.4K Mar 7 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 16:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 7 16:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 15 11:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Mar 7 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 7 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Mar 7 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 11:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 41K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779743168107
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-25 21:06:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 21:06:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 21:06:10] [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.
[2026-05-25 21:06:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-25 21:06:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1239 ms
[2026-05-25 21:06:11] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
[2026-05-25 21:06:11] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 10 ms.
[2026-05-25 21:06:11] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2026-05-25 21:06:11] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 1, 0, 5] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 25, 25, 1, 5, 5]
FORMULA LamportFastMutEx-COL-5-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-25 21:06:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2026-05-25 21:06:11] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-25 21:06:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 21:06:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 21:06:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:11] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 21:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 21:06:12] [INFO ] Added : 7 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 21:06:12] [INFO ] Added : 4 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 21:06:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 21:06:12] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:12] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:12] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 21:06:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 21:06:12] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:12] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2026-05-25 21:06:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 21:06:12] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:12] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2026-05-25 21:06:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 21:06:12] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:12] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2026-05-25 21:06:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:12] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-25 21:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2026-05-25 21:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:13] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:13] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:13] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2026-05-25 21:06:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:13] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:13] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:13] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:13] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 21:06:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:13] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:13] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 21:06:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:13] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 21:06:13] [INFO ] Added : 11 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 21:06:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:13] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:13] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-25 21:06:13] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 21:06:13] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 21:06:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 21:06:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 21:06:13] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 21:06:13] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 25, 25, 5]
Domain [pid(6), pid(6)] 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.
[2026-05-25 21:06:13] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 47 ms.
[2026-05-25 21:06:13] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 25, 25, 5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 25, 25, 5]
[2026-05-25 21:06:13] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2026-05-25 21:06:13] [INFO ] Computed 37 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 25, 25, 5]
RANDOM walk for 10000 steps (2 resets) in 83 ms. (119 steps per ms)
FORMULA LamportFastMutEx-COL-5-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (18 resets) in 160 ms. (559 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 4, 4, 4, 4, 20, 16, 4] Max Struct:[5, 5, 5, 5, 5, 5, 25, 25, 5]
[2026-05-25 21:06:13] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2026-05-25 21:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:13] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2026-05-25 21:06:14] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2026-05-25 21:06:14] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 21:06:14] [INFO ] [Real]Added 55 Read/Feed constraints in 21 ms returned sat
[2026-05-25 21:06:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:14] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2026-05-25 21:06:14] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-25 21:06:14] [INFO ] [Nat]Added 55 Read/Feed constraints in 18 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:14] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:14] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:14] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:14] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:14] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:15] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:15] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:15] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:15] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 4 ms to minimize.
[2026-05-25 21:06:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1044 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:15] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2026-05-25 21:06:15] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-25 21:06:15] [INFO ] [Real]Added 55 Read/Feed constraints in 14 ms returned sat
[2026-05-25 21:06:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:15] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2026-05-25 21:06:15] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-25 21:06:15] [INFO ] [Nat]Added 55 Read/Feed constraints in 19 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:15] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:15] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:15] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:16] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:16] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:16] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:16] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:16] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:16] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:16] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:16] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:17] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:17] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:17] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:17] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:17] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 5 ms to minimize.
[2026-05-25 21:06:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1798 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:17] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2026-05-25 21:06:17] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-25 21:06:17] [INFO ] [Real]Added 55 Read/Feed constraints in 17 ms returned sat
[2026-05-25 21:06:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:17] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2026-05-25 21:06:17] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2026-05-25 21:06:17] [INFO ] [Nat]Added 55 Read/Feed constraints in 37 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:17] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:18] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:18] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:18] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:18] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:18] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:18] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:18] [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
[2026-05-25 21:06:18] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 3 ms to minimize.
[2026-05-25 21:06:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 771 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:18] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-25 21:06:18] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-25 21:06:18] [INFO ] [Real]Added 55 Read/Feed constraints in 11 ms returned sat
[2026-05-25 21:06:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:18] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2026-05-25 21:06:18] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2026-05-25 21:06:18] [INFO ] [Nat]Added 55 Read/Feed constraints in 20 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:19] [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
[2026-05-25 21:06:19] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:20] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
[2026-05-25 21:06:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1040 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:20] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2026-05-25 21:06:20] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2026-05-25 21:06:20] [INFO ] [Real]Added 55 Read/Feed constraints in 9 ms returned sat
[2026-05-25 21:06:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2026-05-25 21:06:20] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2026-05-25 21:06:20] [INFO ] [Nat]Added 55 Read/Feed constraints in 18 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:20] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 5 ms to minimize.
[2026-05-25 21:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2026-05-25 21:06:20] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 25 ms.
[2026-05-25 21:06:20] [INFO ] Added : 63 causal constraints over 14 iterations in 339 ms. Result :sat
Minimization took 153 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:21] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-25 21:06:21] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-25 21:06:21] [INFO ] [Real]Added 55 Read/Feed constraints in 12 ms returned sat
[2026-05-25 21:06:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:21] [INFO ] [Nat]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-25 21:06:21] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-25 21:06:21] [INFO ] [Nat]Added 55 Read/Feed constraints in 24 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:21] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:21] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:21] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:21] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:21] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:22] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:22] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:22] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:22] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 5 ms to minimize.
[2026-05-25 21:06:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 885 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:22] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2026-05-25 21:06:22] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-25 21:06:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:22] [INFO ] [Nat]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-25 21:06:22] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-25 21:06:22] [INFO ] [Nat]Added 55 Read/Feed constraints in 35 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:22] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:22] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:23] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:23] [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
[2026-05-25 21:06:23] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:23] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:23] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:23] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:23] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 5 ms to minimize.
[2026-05-25 21:06:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1011 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:23] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-25 21:06:23] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 21:06:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-25 21:06:23] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-25 21:06:23] [INFO ] [Nat]Added 55 Read/Feed constraints in 48 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:24] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:24] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:24] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:24] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:24] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:24] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:24] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:24] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:24] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 6 ms to minimize.
[2026-05-25 21:06:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 927 ms
[2026-05-25 21:06:24] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 17 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:25] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:25] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 4 ms to minimize.
[2026-05-25 21:06:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2026-05-25 21:06:25] [INFO ] Added : 39 causal constraints over 9 iterations in 430 ms. Result :sat
Minimization took 152 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:25] [INFO ] [Real]Absence check using 37 positive place invariants in 17 ms returned sat
[2026-05-25 21:06:25] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-25 21:06:25] [INFO ] [Real]Added 55 Read/Feed constraints in 12 ms returned sat
[2026-05-25 21:06:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 21:06:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2026-05-25 21:06:25] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-25 21:06:25] [INFO ] [Nat]Added 55 Read/Feed constraints in 25 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:25] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:26] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:26] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:26] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:26] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:26] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:26] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:26] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:26] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:27] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:27] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 8 ms to minimize.
[2026-05-25 21:06:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1298 ms
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 4, 4, 4, 4, 20, 16, 4] Max Struct:[4, 4, 4, 4, 5, 4, 20, 25, 4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 16] Max Struct:[5, 25]
Support contains 30 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 137 transition count 255
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 52 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 132/137 places, 255/260 transitions.
[2026-05-25 21:06:27] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2026-05-25 21:06:27] [INFO ] Computed 37 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 16] Max Struct:[5, 25]
RANDOM walk for 1000000 steps (2 resets) in 2118 ms. (471 steps per ms)
FORMULA LamportFastMutEx-COL-5-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 706 ms. (1414 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[25]
[2026-05-25 21:06:30] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
[2026-05-25 21:06:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 21:06:30] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2026-05-25 21:06:30] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-25 21:06:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 21:06:30] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2026-05-25 21:06:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 21:06:30] [INFO ] [Nat]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-25 21:06:30] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2026-05-25 21:06:30] [INFO ] [Nat]Added 55 Read/Feed constraints in 34 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:30] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:31] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:31] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:31] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:31] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:31] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:31] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:31] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 5 ms to minimize.
[2026-05-25 21:06:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 811 ms
[2026-05-25 21:06:31] [INFO ] Computed and/alt/rep : 165/730/165 causal constraints (skipped 25 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:32] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 5 ms to minimize.
[2026-05-25 21:06:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2026-05-25 21:06:32] [INFO ] Added : 84 causal constraints over 17 iterations in 660 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[25]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19] Max Struct:[25]
Support contains 25 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 132 /132 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 132/132 places, 255/255 transitions.
[2026-05-25 21:06:32] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
[2026-05-25 21:06:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19] Max Struct:[25]
RANDOM walk for 1000000 steps (2 resets) in 1971 ms. (507 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1448 ms. (690 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[25]
[2026-05-25 21:06:36] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
[2026-05-25 21:06:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 21:06:36] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-25 21:06:36] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-25 21:06:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 21:06:36] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2026-05-25 21:06:36] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-25 21:06:36] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 21:06:36] [INFO ] [Nat]Added 55 Read/Feed constraints in 62 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:36] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:36] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:36] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:36] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:36] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:37] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:37] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 21:06:37] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 8 ms to minimize.
[2026-05-25 21:06:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 930 ms
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[20]
FORMULA LamportFastMutEx-COL-5-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-25 21:06:37] [INFO ] Flatten gal took : 77 ms
[2026-05-25 21:06:37] [INFO ] Flatten gal took : 44 ms
[2026-05-25 21:06:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4510685941625648190.gal : 23 ms
[2026-05-25 21:06:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14416524848226317644.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4510685941625648190.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14416524848226317644.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 27736 ms.
BK_STOP 1779743197778
--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is LamportFastMutEx-COL-5, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-177961111800046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;