Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 48K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748881066522

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 16:17:47] [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]
[2025-06-02 16:17:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:17:48] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2025-06-02 16:17:48] [INFO ] Transformed 69 places.
[2025-06-02 16:17:48] [INFO ] Transformed 96 transitions.
[2025-06-02 16:17:48] [INFO ] Found NUPN structural information;
[2025-06-02 16:17:48] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, 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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_await_13_0, P_await_13_1, P_await_13_2, P_done_0_0, P_done_0_1, P_done_0_2, P_done_1_0, P_done_1_1, P_done_1_2, P_done_2_0, P_done_2_1, P_done_2_2, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_awaity_0, P_awaity_1, P_awaity_2, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2]
[2025-06-02 16:17:48] [INFO ] Parsed PT model containing 69 places and 96 transitions and 402 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 34 transitions.
FORMULA LamportFastMutEx-PT-2-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 2, 0, 0, 0, 1] Max Struct:[2, 2, 2, 2, 2, 2, 4, 1, 1, 1]
FORMULA LamportFastMutEx-PT-2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 2, 2, 4, 1, 1]
[2025-06-02 16:17:48] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2025-06-02 16:17:48] [INFO ] Computed 10 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 2, 2, 4, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 48 ms. (204 steps per ms)
FORMULA LamportFastMutEx-PT-2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 126 ms. (393 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 2] Max Struct:[2, 2, 2, 2, 4]
[2025-06-02 16:17:48] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:48] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:17:48] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 16:17:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 16:17:48] [INFO ] [Real]Added 16 Read/Feed constraints in 4 ms returned sat
[2025-06-02 16:17:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 16:17:48] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 16:17:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:48] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:48] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:48] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:48] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:48] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
[2025-06-02 16:17:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 320 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Real]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 16:17:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
[2025-06-02 16:17:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 123 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:49] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:17:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
[2025-06-02 16:17:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 306 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:17:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
[2025-06-02 16:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-02 16:17:49] [INFO ] Computed and/alt/rep : 56/152/52 causal constraints (skipped 2 transitions) in 4 ms.
[2025-06-02 16:17:49] [INFO ] Added : 37 causal constraints over 8 iterations in 65 ms. Result :sat
Minimization took 17 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 16:17:49] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:17:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-02 16:17:50] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 16:17:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:50] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:50] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:50] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:50] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
[2025-06-02 16:17:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 154 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 2] Max Struct:[1, 1, 1, 2, 2]
FORMULA LamportFastMutEx-PT-2-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 62/62 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 60
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 42 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 40 transition count 58
Applied a total of 8 rules in 23 ms. Remains 40 /44 variables (removed 4) and now considering 58/62 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 40/44 places, 58/62 transitions.
[2025-06-02 16:17:50] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 40 cols
[2025-06-02 16:17:50] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[2]
RANDOM walk for 1000000 steps (2 resets) in 1872 ms. (533 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 800 ms. (1248 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2025-06-02 16:17:52] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-02 16:17:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:17:52] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-02 16:17:53] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 16:17:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 16:17:53] [INFO ] [Real]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 16:17:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:17:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-02 16:17:53] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-02 16:17:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:17:53] [INFO ] Computed and/alt/rep : 48/148/46 causal constraints (skipped 4 transitions) in 4 ms.
[2025-06-02 16:17:53] [INFO ] Added : 21 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2025-06-02 16:17:53] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-02 16:17:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:53] [INFO ] Implicit Places using invariants in 69 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 38/40 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77 ms. Remains : 38/40 places, 58/58 transitions.
[2025-06-02 16:17:53] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 38 cols
[2025-06-02 16:17:53] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[2]
RANDOM walk for 1000000 steps (2 resets) in 1697 ms. (588 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 781 ms. (1278 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2025-06-02 16:17:55] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-02 16:17:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:17:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 16:17:55] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 16:17:55] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:17:55] [INFO ] [Real]Added 12 Read/Feed constraints in 7 ms returned sat
[2025-06-02 16:17:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:17:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 16:17:55] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 16:17:55] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:17:55] [INFO ] Computed and/alt/rep : 52/148/48 causal constraints (skipped 2 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:55] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:55] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
[2025-06-02 16:17:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2025-06-02 16:17:56] [INFO ] Added : 18 causal constraints over 6 iterations in 155 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 38/38 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2025-06-02 16:17:56] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-02 16:17:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-02 16:17:56] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-02 16:17:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:17:56] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:17:56] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-02 16:17:56] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-02 16:17:56] [INFO ] Invariant cache hit.
[2025-06-02 16:17:56] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 4 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:56] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:57] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:57] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:57] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:57] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 19/65 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/65 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 52/90 variables, 38/103 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 12/115 constraints. Problems are: Problem set: 12 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:57] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/116 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/116 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/116 constraints. Problems are: Problem set: 12 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 116 constraints, problems are : Problem set: 12 solved, 44 unsolved in 1850 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/40 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 11/51 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/51 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 2/38 variables, 4/55 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 2/57 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 9/66 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/66 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 52/90 variables, 38/104 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 12/116 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 44/160 constraints. Problems are: Problem set: 12 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:58] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 1/161 constraints. Problems are: Problem set: 12 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:58] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 1/162 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/162 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 14 (OVERLAPS) 0/90 variables, 0/162 constraints. Problems are: Problem set: 12 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 162 constraints, problems are : Problem set: 12 solved, 44 unsolved in 2104 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 44/56 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3990ms problems are : Problem set: 12 solved, 44 unsolved
Search for dead transitions found 12 dead transitions in 3996ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 38/38 places, 46/58 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:18:00] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4155 ms. Remains : 38/38 places, 46/58 transitions.
[2025-06-02 16:18:00] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
// Phase 1: matrix 44 rows 38 cols
[2025-06-02 16:18:00] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[2]
RANDOM walk for 1000000 steps (2 resets) in 1666 ms. (599 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 733 ms. (1362 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2025-06-02 16:18:02] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-06-02 16:18:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:18:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 16:18:02] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-02 16:18:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-02 16:18:02] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:18:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:18:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 16:18:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 16:18:02] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:02] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
[2025-06-02 16:18:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2025-06-02 16:18:02] [INFO ] Computed and/alt/rep : 44/124/42 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 16:18:02] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 38/38 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2025-06-02 16:18:02] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-06-02 16:18:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 16:18:02] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-06-02 16:18:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-02 16:18:02] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:18:02] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-02 16:18:02] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-06-02 16:18:02] [INFO ] Invariant cache hit.
[2025-06-02 16:18:02] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:03] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:04] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:04] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 44/82 variables, 38/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/82 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 116 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2030 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 2/38 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:05] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 44/82 variables, 38/107 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 10/117 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 44/161 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:05] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:05] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/82 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/82 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 15 (OVERLAPS) 0/82 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 163 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2217 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4263ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 4264ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4392 ms. Remains : 38/38 places, 46/46 transitions.
RANDOM walk for 40000 steps (8 resets) in 691 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
[2025-06-02 16:18:07] [INFO ] Flatten gal took : 36 ms
[2025-06-02 16:18:07] [INFO ] Flatten gal took : 9 ms
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
[2025-06-02 16:18:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12789002183713185882.gal : 8 ms
[2025-06-02 16:18:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1417088990250740209.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12789002183713185882.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1417088990250740209.prop' '--nowitness' '--gen-order' 'FOLLOW'
Probably explored full state space saw : 324 states, properties seen :0
Probabilistic random walk after 932 steps, saw 324 distinct states, run finished after 37 ms. (steps per millisecond=25 ) properties seen :0

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Explored full state space saw : 324 states, properties seen :0
Exhaustive walk after 932 steps, saw 324 distinct states, run finished after 16 ms. (steps per millisecond=58 ) properties seen :0
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality1417088990250740209.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 35
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :35 after 89
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :89 after 152
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA LamportFastMutEx-PT-2-UpperBounds-03 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 19695 ms.

BK_STOP 1748881087687

--------------------
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-2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-2, 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 r114-tall-174876423100653"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 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 ;