About the Execution of ITS-Tools for LamportFastMutEx-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 226662.00 | 0.00 | 0.00 | 6 7 6 7 6 7 7 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423200693.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-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423200693
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 206K 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 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 420K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.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 265K 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-7-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748886370921
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-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 17:46:12] [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 17:46:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:46:12] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2025-06-02 17:46:12] [INFO ] Transformed 264 places.
[2025-06-02 17:46:12] [INFO ] Transformed 536 transitions.
[2025-06-02 17:46:12] [INFO ] Found NUPN structural information;
[2025-06-02 17:46:12] [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_start_1_6, P_start_1_7, 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_b_6_false, P_b_6_true, P_b_7_false, P_b_7_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_setx_3_6, P_setx_3_7, 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_setbi_5_6, P_setbi_5_7, 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_ify0_4_6, P_ify0_4_7, 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_sety_9_6, P_sety_9_7, 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_ifxi_10_6, P_ifxi_10_7, 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_setbi_11_6, P_setbi_11_7, 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_fordo_12_6, P_fordo_12_7, 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_0_6, P_wait_0_7, 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_1_6, P_wait_1_7, 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_2_6, P_wait_2_7, 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_3_6, P_wait_3_7, 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_4_6, P_wait_4_7, 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_wait_5_6, P_wait_5_7, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, 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_await_13_6, P_await_13_7, 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_0_6, P_done_0_7, 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_1_6, P_done_1_7, 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_2_6, P_done_2_7, 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_3_6, P_done_3_7, 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_4_6, P_done_4_7, 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_done_5_6, P_done_5_7, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, 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_ifyi_15_6, P_ifyi_15_7, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, 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_CS_21_6, P_CS_21_7, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7]
[2025-06-02 17:46:12] [INFO ] Parsed PT model containing 264 places and 536 transitions and 2352 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 74 transitions.
FORMULA LamportFastMutEx-PT-7-UpperBounds-07 1 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, 1, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA LamportFastMutEx-PT-7-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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:[7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 17:46:12] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2025-06-02 17:46:12] [INFO ] Computed 65 invariants in 19 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:[7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 97 ms. (102 steps per ms)
FORMULA LamportFastMutEx-PT-7-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 109 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 4, 5, 6, 6] Max Struct:[7, 7, 7, 7, 7]
[2025-06-02 17:46:12] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 17:46:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:46:13] [INFO ] [Real]Absence check using 65 positive place invariants in 33 ms returned sat
[2025-06-02 17:46:13] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-06-02 17:46:13] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-02 17:46:13] [INFO ] [Real]Added 91 Read/Feed constraints in 12 ms returned sat
[2025-06-02 17:46:13] [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 17:46:13] [INFO ] [Nat]Absence check using 65 positive place invariants in 20 ms returned sat
[2025-06-02 17:46:13] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-02 17:46:13] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:13] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:13] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:13] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:13] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:14] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:14] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:14] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:14] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:14] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:14] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:14] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
[2025-06-02 17:46:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 995 ms
[2025-06-02 17:46:14] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:15] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:15] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:16] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:16] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 4 ms to minimize.
[2025-06-02 17:46:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 557 ms
[2025-06-02 17:46:16] [INFO ] Added : 156 causal constraints over 33 iterations in 1796 ms. Result :sat
Minimization took 1932 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:46:18] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-02 17:46:18] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-02 17:46:18] [INFO ] [Real]Added 91 Read/Feed constraints in 9 ms returned sat
[2025-06-02 17:46:18] [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 17:46:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-02 17:46:18] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-02 17:46:18] [INFO ] [Nat]Added 91 Read/Feed constraints in 14 ms returned sat
[2025-06-02 17:46:18] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 27 ms.
[2025-06-02 17:46:19] [INFO ] Added : 36 causal constraints over 8 iterations in 527 ms. Result :sat
Minimization took 129 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:46:19] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 17:46:19] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-02 17:46:19] [INFO ] [Real]Added 91 Read/Feed constraints in 11 ms returned sat
[2025-06-02 17:46:19] [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 17:46:19] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-02 17:46:19] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-02 17:46:19] [INFO ] [Nat]Added 91 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:19] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:19] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:20] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:20] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:20] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:20] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:20] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:20] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:20] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:20] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:20] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 4 ms to minimize.
[2025-06-02 17:46:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1258 ms
[2025-06-02 17:46:20] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 25 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:21] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:21] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
[2025-06-02 17:46:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2025-06-02 17:46:21] [INFO ] Added : 92 causal constraints over 21 iterations in 842 ms. Result :sat
Minimization took 104 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:46:22] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-02 17:46:22] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-06-02 17:46:22] [INFO ] [Real]Added 91 Read/Feed constraints in 11 ms returned sat
[2025-06-02 17:46:22] [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 17:46:22] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-02 17:46:22] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-06-02 17:46:22] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:22] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:22] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:22] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:22] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:22] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:22] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:23] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:24] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:24] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:24] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
[2025-06-02 17:46:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 21 trap constraints in 1817 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:46:24] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 17:46:24] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-06-02 17:46:24] [INFO ] [Real]Added 91 Read/Feed constraints in 13 ms returned sat
[2025-06-02 17:46:24] [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 17:46:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 17:46:24] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-02 17:46:24] [INFO ] [Nat]Added 91 Read/Feed constraints in 14 ms returned sat
[2025-06-02 17:46:24] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 18 ms.
[2025-06-02 17:46:24] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 4, 5, 6, 6] Max Struct:[7, 7, 7, 6, 7]
FORMULA LamportFastMutEx-PT-7-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 4, 5] Max Struct:[7, 7, 7]
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 29 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 219/219 places, 462/462 transitions.
[2025-06-02 17:46:25] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 17:46:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 4, 5] Max Struct:[7, 7, 7]
RANDOM walk for 1000000 steps (2 resets) in 3490 ms. (286 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 3205 ms. (935 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6, 6] Max Struct:[7, 7, 7]
[2025-06-02 17:46:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 17:46:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:32] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 17:46:32] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-06-02 17:46:32] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-02 17:46:32] [INFO ] [Real]Added 91 Read/Feed constraints in 13 ms returned sat
[2025-06-02 17:46:32] [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 17:46:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-02 17:46:32] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-06-02 17:46:32] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:32] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:32] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:32] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:32] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:32] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:32] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:33] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
[2025-06-02 17:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1186 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:33] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-02 17:46:33] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-02 17:46:33] [INFO ] [Real]Added 91 Read/Feed constraints in 9 ms returned sat
[2025-06-02 17:46:33] [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 17:46:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 17:46:33] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-06-02 17:46:33] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2025-06-02 17:46:33] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 21 ms.
[2025-06-02 17:46:34] [INFO ] Added : 41 causal constraints over 9 iterations in 341 ms. Result :sat
Minimization took 83 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:34] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 17:46:34] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-02 17:46:34] [INFO ] [Real]Added 91 Read/Feed constraints in 9 ms returned sat
[2025-06-02 17:46:34] [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 17:46:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 17:46:34] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-02 17:46:34] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:34] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:35] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:36] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 6 ms to minimize.
[2025-06-02 17:46:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1369 ms
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6, 6] Max Struct:[6, 7, 6]
FORMULA LamportFastMutEx-PT-7-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 7 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 212 transition count 448
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 28 place count 205 transition count 448
Applied a total of 28 rules in 69 ms. Remains 205 /219 variables (removed 14) and now considering 448/462 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 205/219 places, 448/462 transitions.
[2025-06-02 17:46:36] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2025-06-02 17:46:36] [INFO ] Computed 65 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 3370 ms. (296 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 892 ms. (1119 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2025-06-02 17:46:40] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:46:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:40] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2025-06-02 17:46:40] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-02 17:46:40] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-02 17:46:41] [INFO ] [Real]Added 91 Read/Feed constraints in 19 ms returned sat
[2025-06-02 17:46:41] [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 17:46:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 17:46:41] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-02 17:46:41] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2025-06-02 17:46:41] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 25 ms.
[2025-06-02 17:46:41] [INFO ] Added : 93 causal constraints over 19 iterations in 631 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 7 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 205/205 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2025-06-02 17:46:42] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:46:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:42] [INFO ] Implicit Places using invariants in 289 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 291 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/205 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 317 ms. Remains : 198/205 places, 448/448 transitions.
[2025-06-02 17:46:42] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2025-06-02 17:46:42] [INFO ] Computed 58 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 3241 ms. (308 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 872 ms. (1145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2025-06-02 17:46:46] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:46] [INFO ] [Real]Absence check using 58 positive place invariants in 16 ms returned sat
[2025-06-02 17:46:46] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-02 17:46:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 17:46:46] [INFO ] [Real]Added 42 Read/Feed constraints in 7 ms returned sat
[2025-06-02 17:46:46] [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 17:46:46] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2025-06-02 17:46:47] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-02 17:46:47] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2025-06-02 17:46:47] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:48] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 13 ms to minimize.
[2025-06-02 17:46:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2025-06-02 17:46:48] [INFO ] Added : 165 causal constraints over 33 iterations in 1136 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2025-06-02 17:46:48] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:48] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-02 17:46:48] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 17:46:49] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:46:49] [INFO ] Redundant transitions in 31 ms returned []
Running 441 sub problems to find dead transitions.
[2025-06-02 17:46:49] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:46:49] [INFO ] Invariant cache hit.
[2025-06-02 17:46:49] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 58/256 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:51] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 9 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:51] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:51] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 9 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:51] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:51] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:51] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:51] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:53] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:53] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 8 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:53] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 7 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:53] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 9 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 20/276 constraints. Problems are: Problem set: 8 solved, 433 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:53] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:53] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:53] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:53] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:53] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:54] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:54] [INFO ] Deduced a trap composed of 16 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 17:46:54] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:54] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:54] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:54] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:54] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:54] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:54] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:55] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:55] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:55] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:55] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 8 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:55] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:55] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 11 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/296 constraints. Problems are: Problem set: 35 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:57] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:57] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:57] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:57] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:58] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:58] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:58] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:58] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:58] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:58] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:58] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:58] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:59] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:59] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:59] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:59] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:59] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:59] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:59] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:00] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 11 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 20/316 constraints. Problems are: Problem set: 37 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:00] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:00] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:00] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:01] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:01] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:01] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Problem TDEAD123 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:01] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:01] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:01] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:01] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:01] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:02] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:02] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:02] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:02] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:02] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:02] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:02] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:03] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:03] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 8 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/336 constraints. Problems are: Problem set: 41 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:03] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:04] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:04] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:04] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:04] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:04] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:04] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 3 ms to minimize.
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:05] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:05] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:05] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:05] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:05] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:06] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:06] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:06] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:06] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:06] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:06] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:06] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:07] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 10 ms to minimize.
Problem TDEAD203 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/356 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:09] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:09] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:10] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:10] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:10] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:10] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:11] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:11] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:11] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:11] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:11] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:11] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:12] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:12] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:12] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:12] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:12] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:12] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:12] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:13] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/376 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:14] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:14] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:15] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:15] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:15] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:15] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:15] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:16] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:16] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:16] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:16] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:16] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:16] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 13/389 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:18] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:19] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:19] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 3/392 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/520 variables, and 392 constraints, problems are : Problem set: 42 solved, 399 unsolved in 30055 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/198 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 136/136 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 399 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 42 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/200 constraints. Problems are: Problem set: 42 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 99/299 constraints. Problems are: Problem set: 42 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/299 constraints. Problems are: Problem set: 42 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 7/198 variables, 49/348 constraints. Problems are: Problem set: 42 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 7/355 constraints. Problems are: Problem set: 42 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 37/392 constraints. Problems are: Problem set: 42 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/392 constraints. Problems are: Problem set: 42 solved, 399 unsolved
At refinement iteration 8 (OVERLAPS) 322/520 variables, 198/590 constraints. Problems are: Problem set: 42 solved, 399 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 42/632 constraints. Problems are: Problem set: 42 solved, 399 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 399/1031 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:36] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:42] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:42] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:43] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:43] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:43] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:43] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:43] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:43] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:43] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:44] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:44] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:44] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:44] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:44] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:45] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:45] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:46] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:46] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:47] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 20/1051 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 1051 constraints, problems are : Problem set: 42 solved, 399 unsolved in 30018 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 399/441 constraints, Known Traps: 156/156 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60250ms problems are : Problem set: 42 solved, 399 unsolved
Search for dead transitions found 42 dead transitions in 60261ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/198 places, 406/448 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:47:49] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60962 ms. Remains : 198/198 places, 406/448 transitions.
[2025-06-02 17:47:49] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
// Phase 1: matrix 294 rows 198 cols
[2025-06-02 17:47:49] [INFO ] Computed 58 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 3157 ms. (316 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 863 ms. (1157 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2025-06-02 17:47:53] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:47:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:47:53] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2025-06-02 17:47:53] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-06-02 17:47:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 17:47:53] [INFO ] [Real]Added 35 Read/Feed constraints in 10 ms returned sat
[2025-06-02 17:47: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 17:47:53] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2025-06-02 17:47:53] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-02 17:47:53] [INFO ] [Nat]Added 35 Read/Feed constraints in 15 ms returned sat
[2025-06-02 17:47:53] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 18 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:54] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:54] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 12 ms to minimize.
[2025-06-02 17:47:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2025-06-02 17:47:54] [INFO ] Added : 129 causal constraints over 27 iterations in 1000 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-02 17:47:55] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:47:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:47:55] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-06-02 17:47:55] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:47:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:47:55] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 17:47:55] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:47:55] [INFO ] Redundant transitions in 3 ms returned []
Running 399 sub problems to find dead transitions.
[2025-06-02 17:47:55] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:47:55] [INFO ] Invariant cache hit.
[2025-06-02 17:47:55] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 7/198 variables, 49/249 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:01] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:01] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:01] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:01] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:01] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:01] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:03] [INFO ] Deduced a trap composed of 15 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 17:48:03] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:03] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:03] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:03] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:03] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:03] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:03] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:03] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:03] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:04] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:04] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:04] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:04] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:04] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:04] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:05] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:05] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:05] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:05] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:05] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:05] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:05] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:07] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:07] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:07] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:08] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:08] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:08] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:08] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:08] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:08] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:08] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:09] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:09] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:09] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:09] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:09] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:09] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:09] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:09] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:10] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:10] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/316 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:10] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:11] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:11] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:11] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:11] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:11] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:11] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:11] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:11] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:11] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:12] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:12] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:12] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:12] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:12] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:12] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:12] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:12] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:13] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:13] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:13] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:13] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:14] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:14] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:14] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:14] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:14] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:14] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:15] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:15] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:15] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:15] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:15] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:15] [INFO ] Deduced a trap composed of 7 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 17:48:15] [INFO ] Deduced a trap composed of 7 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 17:48:15] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:15] [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 17:48:16] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:16] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:18] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:19] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:19] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:19] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:19] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:19] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:19] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:20] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:20] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:20] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:20] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:21] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:21] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:21] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:21] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:21] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:21] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:22] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:22] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:22] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:25] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:25] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:25] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:25] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:25] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:25] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/492 variables, and 382 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30020 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/198 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 126/126 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 94/294 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 7/198 variables, 49/343 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 7/350 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 32/382 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:30] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:30] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:30] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:30] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:30] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:31] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:31] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:31] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:31] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:31] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:31] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:31] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:32] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:32] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:32] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:32] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:32] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:32] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:32] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:33] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/402 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:34] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:35] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:35] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:35] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:36] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:36] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:36] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:36] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:37] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:37] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:39] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 7/413 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:41] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:42] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:43] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:43] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:44] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:44] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:45] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 5/420 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 13 (OVERLAPS) 294/492 variables, 198/618 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 35/653 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 399/1052 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 1052 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30020 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 164/164 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60790 ms. Remains : 198/198 places, 406/406 transitions.
RANDOM walk for 40000 steps (8 resets) in 1175 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
[2025-06-02 17:48:56] [INFO ] Flatten gal took : 143 ms
[2025-06-02 17:48:56] [INFO ] Flatten gal took : 34 ms
[2025-06-02 17:48:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18023987315301161725.gal : 17 ms
[2025-06-02 17:48:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6771832762838805424.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/ReachabilityCardinality18023987315301161725.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6771832762838805424.prop' '--nowitness' '--gen-order' 'FOLLOW'
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
Loading property file /tmp/ReachabilityCardinality6771832762838805424.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 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 50
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :50 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 56
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :56 after 65
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :65 after 78
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :78 after 216
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :216 after 1132
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1132 after 3248
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3248 after 18441
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18441 after 66653
Interrupted probabilistic random walk after 722623 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 2
Probabilistic random walk after 722623 steps, saw 322963 distinct states, run finished after 3004 ms. (steps per millisecond=240 ) properties seen :0
[2025-06-02 17:48:59] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:48:59] [INFO ] Invariant cache hit.
[2025-06-02 17:48:59] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/168 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/462 variables, 168/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 35/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/492 variables, 30/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 30/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 9/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/492 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 489 constraints, problems are : Problem set: 0 solved, 2 unsolved in 289 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/168 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/462 variables, 168/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 35/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/492 variables, 30/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 30/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 9/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:00] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/492 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 492 constraints, problems are : Problem set: 0 solved, 2 unsolved in 645 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 949ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 975 ms.
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 198/198 places, 406/406 transitions.
RANDOM walk for 40000 steps (8 resets) in 296 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :66653 after 366929
Interrupted probabilistic random walk after 603238 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 2
Probabilistic random walk after 603238 steps, saw 274743 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
[2025-06-02 17:49:04] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:49:04] [INFO ] Invariant cache hit.
[2025-06-02 17:49:04] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/168 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/462 variables, 168/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 35/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/492 variables, 30/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 30/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 9/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/492 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 489 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/168 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/462 variables, 168/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 35/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/492 variables, 30/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 30/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 9/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:05] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/492 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 492 constraints, problems are : Problem set: 0 solved, 2 unsolved in 496 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 748ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 687 ms.
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-02 17:49:06] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:49:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:49:06] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-02 17:49:06] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:49:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:49:06] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 17:49:06] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:49:06] [INFO ] Redundant transitions in 17 ms returned []
Running 399 sub problems to find dead transitions.
[2025-06-02 17:49:06] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:49:06] [INFO ] Invariant cache hit.
[2025-06-02 17:49:06] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :366929 after 670068
At refinement iteration 3 (OVERLAPS) 7/198 variables, 49/249 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:12] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:12] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:12] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:12] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:12] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:12] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:13] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:14] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:14] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:14] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:14] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:14] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:14] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:14] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:14] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:14] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:15] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:15] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:15] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:15] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:15] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:15] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:15] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:16] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:16] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:16] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:16] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:16] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:16] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:18] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:18] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:18] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:18] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:18] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:19] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:19] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:19] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:19] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:19] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:19] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:19] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:19] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:20] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:20] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:20] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:20] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:20] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:20] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:20] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/316 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:21] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:21] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:21] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:21] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:22] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:22] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:22] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:22] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:22] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:22] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:22] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:22] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:22] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:23] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:23] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:23] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:23] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:23] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:23] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:23] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:24] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:24] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:24] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:24] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:24] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:25] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:25] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:25] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:25] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:25] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:25] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:26] [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 17:49:26] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:26] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:26] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:26] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:26] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:26] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:26] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:26] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 399 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :670068 after 3.25256e+06
[2025-06-02 17:49:29] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:29] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:29] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:30] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:30] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:30] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:31] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:32] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:32] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:33] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:33] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:33] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:33] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:33] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:33] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:33] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:34] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:34] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:34] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:34] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:37] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 10 ms to minimize.
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 30184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30868 ms. Remains : 198/198 places, 406/406 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 198 transition count 294
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 112 place count 198 transition count 245
Deduced a syphon composed of 49 places in 1 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 252 place count 107 transition count 245
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 280 place count 93 transition count 231
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 294 place count 86 transition count 273
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 86 transition count 273
Applied a total of 301 rules in 61 ms. Remains 86 /198 variables (removed 112) and now considering 273/406 (removed 133) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 273 rows 86 cols
[2025-06-02 17:49:37] [INFO ] Computed 16 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:49:37] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 17:49:37] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:49:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 17:49:37] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 17:49:37] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 17:49:37] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 17:49:37] [INFO ] Flatten gal took : 23 ms
[2025-06-02 17:49:37] [INFO ] Flatten gal took : 20 ms
[2025-06-02 17:49:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5776065650482835254.gal : 7 ms
[2025-06-02 17:49:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11788205970578860633.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/ReachabilityCardinality5776065650482835254.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11788205970578860633.prop' '--nowitness' '--gen-order' 'FOLLOW'
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
Loading property file /tmp/ReachabilityCardinality11788205970578860633.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 113
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :113 after 186
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :186 after 1737
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1737 after 2550
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2550 after 29862
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :29862 after 115925
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :115925 after 1.15942e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.15942e+06 after 4.9509e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.9509e+06 after 3.35036e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3.35036e+07 after 7.80709e+07
Detected timeout of ITS tools.
[2025-06-02 17:49:46] [INFO ] Flatten gal took : 25 ms
[2025-06-02 17:49:46] [INFO ] Applying decomposition
[2025-06-02 17:49:46] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5487694701253427691.txt' '-o' '/tmp/graph5487694701253427691.bin' '-w' '/tmp/graph5487694701253427691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5487694701253427691.bin' '-l' '-1' '-v' '-w' '/tmp/graph5487694701253427691.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:49:47] [INFO ] Decomposing Gal with order
[2025-06-02 17:49:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:49:47] [INFO ] Removed a total of 553 redundant transitions.
[2025-06-02 17:49:47] [INFO ] Flatten gal took : 99 ms
[2025-06-02 17:49:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 252 labels/synchronizations in 28 ms.
[2025-06-02 17:49:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16074973911429355060.gal : 5 ms
[2025-06-02 17:49:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5100089915512121540.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/ReachabilityCardinality16074973911429355060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5100089915512121540.prop' '--nowitness' '--gen-order' 'FOLLOW'
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
Loading property file /tmp/ReachabilityCardinality5100089915512121540.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 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :16 after 50
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50 after 58
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :58 after 78
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :78 after 96
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :96 after 196
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :196 after 589
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :589 after 1112
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1112 after 3134
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3134 after 12213
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :12213 after 29590
Detected timeout of ITS tools.
[2025-06-02 17:49:52] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:49:52] [INFO ] Applying decomposition
[2025-06-02 17:49:52] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4179529171276487371.txt' '-o' '/tmp/graph4179529171276487371.bin' '-w' '/tmp/graph4179529171276487371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4179529171276487371.bin' '-l' '-1' '-v' '-w' '/tmp/graph4179529171276487371.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:49:52] [INFO ] Decomposing Gal with order
[2025-06-02 17:49:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:49:52] [INFO ] Removed a total of 373 redundant transitions.
[2025-06-02 17:49:52] [INFO ] Flatten gal took : 51 ms
[2025-06-02 17:49:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 202 labels/synchronizations in 13 ms.
[2025-06-02 17:49:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5722386723972479583.gal : 2 ms
[2025-06-02 17:49:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15893385892973687245.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/ReachabilityCardinality5722386723972479583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15893385892973687245.prop' '--nowitness' '--gen-order' 'FOLLOW'
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
Loading property file /tmp/ReachabilityCardinality15893385892973687245.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 109
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :109 after 2830
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2830 after 9774
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :9774 after 68443
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :68443 after 2.18022e+07
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,1.11279e+09,0.463767,22748,2,4894,17,81228,6,0,567,99376,0
Total reachable state count : 1112785774
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.464993,22876,2,87,17,81228,7,0,582,99376,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.465779,22876,2,87,17,81228,8,0,596,99376,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 16118 ms.
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:[6] Max Struct:[7]
Starting property specific reduction for LamportFastMutEx-PT-7-UpperBounds-01
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2025-06-02 17:49:53] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
// Phase 1: matrix 294 rows 198 cols
[2025-06-02 17:49:53] [INFO ] Computed 58 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2025-06-02 17:49:53] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:49:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:49:53] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2025-06-02 17:49:53] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-06-02 17:49:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 17:49:53] [INFO ] [Real]Added 35 Read/Feed constraints in 6 ms returned sat
[2025-06-02 17:49:53] [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 17:49:53] [INFO ] [Nat]Absence check using 58 positive place invariants in 15 ms returned sat
[2025-06-02 17:49:53] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-02 17:49:53] [INFO ] [Nat]Added 35 Read/Feed constraints in 8 ms returned sat
[2025-06-02 17:49:53] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 21 ms.
[2025-06-02 17:49:54] [INFO ] Added : 101 causal constraints over 21 iterations in 500 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[7]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 198/198 places, 406/406 transitions.
[2025-06-02 17:49:54] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 17:49:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[7]
FORMULA LamportFastMutEx-PT-7-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 2929 ms. (341 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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 )
[2025-06-02 17:49:57] [INFO ] Flatten gal took : 40 ms
[2025-06-02 17:49:57] [INFO ] Flatten gal took : 26 ms
[2025-06-02 17:49:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7555281812412852056.gal : 4 ms
[2025-06-02 17:49:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11825985267419488788.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/ReachabilityCardinality7555281812412852056.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11825985267419488788.prop' '--nowitness' '--gen-order' 'FOLLOW'
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
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:[]
Ending property specific reduction for LamportFastMutEx-PT-7-UpperBounds-01 in 4310 ms.
[2025-06-02 17:49:57] [INFO ] Flatten gal took : 21 ms
Total runtime 225224 ms.
BK_STOP 1748886597583
--------------------
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-7"
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-7, 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-174876423200693"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-7.tgz
mv LamportFastMutEx-PT-7 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;