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-177961111800053.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-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-177961111800053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 15K Mar 7 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 7 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 7 16:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K 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 11K Mar 15 11:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 15 11:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 15 11:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 15 11:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Mar 7 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 7 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K Mar 7 16:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 192K Mar 7 16:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 11:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Mar 15 11:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 157K 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-PT-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779749633247

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 22:53:55] [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 22:53:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 22:53:56] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2026-05-25 22:53:56] [INFO ] Transformed 174 places.
[2026-05-25 22:53:56] [INFO ] Transformed 318 transitions.
[2026-05-25 22:53:56] [INFO ] Found NUPN structural information;
[2026-05-25 22:53:56] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5]
[2026-05-25 22:53:56] [INFO ] Parsed PT model containing 174 places and 318 transitions and 1380 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 37 places in 4 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-PT-5-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 22:53:56] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2026-05-25 22:53:56] [INFO ] Computed 37 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 111 ms. (89 steps per ms)
FORMULA LamportFastMutEx-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 153 ms. (324 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 4, 4, 4] Max Struct:[5, 5, 5, 5, 5]
[2026-05-25 22:53:56] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2026-05-25 22:53:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 22:53:57] [INFO ] [Real]Absence check using 37 positive place invariants in 49 ms returned sat
[2026-05-25 22:53:57] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2026-05-25 22:53:57] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 22:53:57] [INFO ] [Real]Added 55 Read/Feed constraints in 21 ms returned sat
[2026-05-25 22:53:57] [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 22:53:57] [INFO ] [Nat]Absence check using 37 positive place invariants in 27 ms returned sat
[2026-05-25 22:53:58] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2026-05-25 22:53:58] [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 22:53:58] [INFO ] Deduced a trap composed of 9 places in 424 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:01] [INFO ] Deduced a trap composed of 9 places in 3031 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:01] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:01] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:02] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:02] [INFO ] Deduced a trap composed of 14 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 22:54:02] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:02] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:02] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 5 ms to minimize.
[2026-05-25 22:54:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 4534 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 22:54:02] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2026-05-25 22:54:02] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-25 22:54:02] [INFO ] [Real]Added 55 Read/Feed constraints in 17 ms returned sat
[2026-05-25 22:54:02] [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 22:54:02] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2026-05-25 22:54:03] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-25 22:54:03] [INFO ] [Nat]Added 55 Read/Feed constraints in 21 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:03] [INFO ] Deduced a trap composed of 26 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 22:54:03] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:03] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:03] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:03] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:03] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:04] [INFO ] Deduced a trap composed of 11 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 22:54:04] [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 22:54:04] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:04] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:04] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:04] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:05] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:05] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:05] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:05] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 9 ms to minimize.
[2026-05-25 22:54:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 2446 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 22:54:05] [INFO ] [Real]Absence check using 37 positive place invariants in 22 ms returned sat
[2026-05-25 22:54:05] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-25 22:54:05] [INFO ] [Real]Added 55 Read/Feed constraints in 22 ms returned sat
[2026-05-25 22:54:05] [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 22:54:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2026-05-25 22:54:05] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2026-05-25 22:54:05] [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 22:54:06] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:06] [INFO ] Deduced a trap composed of 10 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 22:54:06] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:06] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:06] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:06] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:06] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:06] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:06] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 5 ms to minimize.
[2026-05-25 22:54:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 862 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 22:54:06] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned sat
[2026-05-25 22:54:07] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-25 22:54:07] [INFO ] [Real]Added 55 Read/Feed constraints in 13 ms returned sat
[2026-05-25 22:54:07] [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 22:54:07] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2026-05-25 22:54:07] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-25 22:54:07] [INFO ] [Nat]Added 55 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:07] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:07] [INFO ] Deduced a trap composed of 9 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 22:54:07] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:07] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:07] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:07] [INFO ] Deduced a trap composed of 26 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 22:54:07] [INFO ] Deduced a trap composed of 26 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 22:54:08] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:08] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:08] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:08] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:08] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 22:54:08] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 4 ms to minimize.
[2026-05-25 22:54:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1241 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 22:54:08] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-25 22:54:08] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-25 22:54:08] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2026-05-25 22:54:08] [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 22:54:08] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2026-05-25 22:54:08] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-25 22:54:08] [INFO ] [Nat]Added 55 Read/Feed constraints in 18 ms returned sat
[2026-05-25 22:54:08] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 19 ms.
[2026-05-25 22:54:09] [INFO ] Added : 57 causal constraints over 12 iterations in 398 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 4, 4, 4] Max Struct:[4, 4, 4, 4, 5]
FORMULA LamportFastMutEx-PT-5-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[5]
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 103 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 127/137 places, 250/260 transitions.
[2026-05-25 22:54:09] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2026-05-25 22:54:09] [INFO ] Computed 37 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[5]
RANDOM walk for 1000000 steps (2 resets) in 2268 ms. (440 steps per ms)
FORMULA LamportFastMutEx-PT-5-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 637 ms. (1567 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 22:54:12] [INFO ] Flatten gal took : 92 ms
[2026-05-25 22:54:13] [INFO ] Flatten gal took : 35 ms
[2026-05-25 22:54:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7113744062589676784.gal : 23 ms
[2026-05-25 22:54:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7659620987065747178.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/ReachabilityCardinality7113744062589676784.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7659620987065747178.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 17320 ms.

BK_STOP 1779749653159

--------------------
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-PT-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-PT-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-177961111800053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-5.tgz
mv LamportFastMutEx-PT-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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;