Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025600051.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is MultiCrashLeafsetExtension-PT-S16C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 12K Mar 7 19:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 19:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 19:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 19:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 15 11:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 11:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 15 11:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 19:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 7 19:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 11:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 15 11:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 4.1M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779942956205

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:35:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 04:35:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:35:58] [INFO ] Load time of PNML (sax parser for PT used): 443 ms
[2026-05-28 04:35:58] [INFO ] Transformed 4260 places.
[2026-05-28 04:35:58] [INFO ] Transformed 6027 transitions.
[2026-05-28 04:35:58] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 611 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 38 ms.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-28 04:35:58] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2026-05-28 04:35:59] [INFO ] Computed 497 invariants in 388 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 51, 1, 17, 51, 17, 51, 51, 17, 1, 17, 17, 17, 17, 17, 17]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (239 resets) in 220 ms. (45 steps per ms)
BEST_FIRST walk for 150011 steps (915 resets) in 640 ms. (234 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1] Max Struct:[51, 1, 17, 51, 17, 51, 51, 17, 1, 17, 17, 17, 17, 17, 17]
[2026-05-28 04:36:00] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
[2026-05-28 04:36:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:01] [INFO ] [Real]Absence check using 46 positive place invariants in 111 ms returned sat
[2026-05-28 04:36:01] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 137 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:02] [INFO ] [Real]Absence check using 46 positive place invariants in 66 ms returned sat
[2026-05-28 04:36:02] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 202 ms returned sat
[2026-05-28 04:36:05] [INFO ] [Real]Absence check using state equation in 3438 ms returned sat
[2026-05-28 04:36:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:06] [INFO ] [Nat]Absence check using 46 positive place invariants in 124 ms returned sat
[2026-05-28 04:36:06] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 146 ms returned sat
[2026-05-28 04:36:10] [INFO ] [Nat]Absence check using state equation in 3549 ms returned sat
[2026-05-28 04:36:10] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2026-05-28 04:36:10] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:36:11] [INFO ] [Nat]Added 1634 Read/Feed constraints in 498 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:11] [INFO ] [Real]Absence check using 46 positive place invariants in 56 ms returned sat
[2026-05-28 04:36:11] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 136 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:12] [INFO ] [Real]Absence check using 46 positive place invariants in 45 ms returned sat
[2026-05-28 04:36:12] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 145 ms returned sat
[2026-05-28 04:36:15] [INFO ] [Real]Absence check using state equation in 2903 ms returned sat
[2026-05-28 04:36:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:16] [INFO ] [Nat]Absence check using 46 positive place invariants in 56 ms returned sat
[2026-05-28 04:36:16] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 186 ms returned sat
[2026-05-28 04:36:20] [INFO ] [Nat]Absence check using state equation in 3622 ms returned sat
[2026-05-28 04:36:20] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:36:20] [INFO ] [Nat]Added 1634 Read/Feed constraints in 679 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:21] [INFO ] [Real]Absence check using 46 positive place invariants in 43 ms returned sat
[2026-05-28 04:36:21] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 107 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:21] [INFO ] [Real]Absence check using 46 positive place invariants in 49 ms returned sat
[2026-05-28 04:36:22] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 172 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:22] [INFO ] [Real]Absence check using 46 positive place invariants in 46 ms returned sat
[2026-05-28 04:36:22] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 213 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:23] [INFO ] [Real]Absence check using 46 positive place invariants in 68 ms returned sat
[2026-05-28 04:36:23] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 227 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:24] [INFO ] [Real]Absence check using 46 positive place invariants in 48 ms returned sat
[2026-05-28 04:36:24] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 153 ms returned sat
[2026-05-28 04:36:27] [INFO ] [Real]Absence check using state equation in 3241 ms returned sat
[2026-05-28 04:36:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:28] [INFO ] [Nat]Absence check using 46 positive place invariants in 47 ms returned sat
[2026-05-28 04:36:28] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 172 ms returned sat
[2026-05-28 04:36:32] [INFO ] [Nat]Absence check using state equation in 3512 ms returned sat
[2026-05-28 04:36:32] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:36:33] [INFO ] [Nat]Added 1634 Read/Feed constraints in 826 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:33] [INFO ] [Real]Absence check using 46 positive place invariants in 45 ms returned sat
[2026-05-28 04:36:33] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 121 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:34] [INFO ] [Real]Absence check using 46 positive place invariants in 42 ms returned sat
[2026-05-28 04:36:34] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 187 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:34] [INFO ] [Real]Absence check using 46 positive place invariants in 42 ms returned sat
[2026-05-28 04:36:35] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 188 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:35] [INFO ] [Real]Absence check using 46 positive place invariants in 47 ms returned sat
[2026-05-28 04:36:35] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 144 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:36] [INFO ] [Real]Absence check using 46 positive place invariants in 116 ms returned sat
[2026-05-28 04:36:36] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 177 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:37] [INFO ] [Real]Absence check using 46 positive place invariants in 42 ms returned sat
[2026-05-28 04:36:37] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 144 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1] Max Struct:[1, 1, 1, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 51, 1]
Support contains 3 out of 4260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.12 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1087 transitions
Trivial Post-agglo rules discarded 1087 transitions
Performed 1087 trivial Post agglomeration. Transition count delta: 1087
Iterating post reduction 0 with 1087 rules applied. Total rules applied 1088 place count 4232 transition count 4940
Reduce places removed 1087 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1088 rules applied. Total rules applied 2176 place count 3145 transition count 4939
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2177 place count 3144 transition count 4939
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 2177 place count 3144 transition count 4803
Deduced a syphon composed of 136 places in 3 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 2449 place count 3008 transition count 4803
Discarding 951 places :
Symmetric choice reduction at 3 with 951 rule applications. Total rules 3400 place count 2057 transition count 3852
Iterating global reduction 3 with 951 rules applied. Total rules applied 4351 place count 2057 transition count 3852
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 4351 place count 2057 transition count 3845
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4365 place count 2050 transition count 3845
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 4602 place count 1813 transition count 2897
Iterating global reduction 3 with 237 rules applied. Total rules applied 4839 place count 1813 transition count 2897
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 4873 place count 1796 transition count 2880
Free-agglomeration rule (complex) applied 160 times.
Iterating global reduction 3 with 160 rules applied. Total rules applied 5033 place count 1796 transition count 3431
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 3 with 160 rules applied. Total rules applied 5193 place count 1636 transition count 3431
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 5210 place count 1636 transition count 3431
Applied a total of 5210 rules in 1457 ms. Remains 1636 /4260 variables (removed 2624) and now considering 3431/6027 (removed 2596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1467 ms. Remains : 1636/4260 places, 3431/6027 transitions.
[2026-05-28 04:36:38] [INFO ] Flow matrix only has 3034 transitions (discarded 397 similar events)
// Phase 1: matrix 3034 rows 1636 cols
[2026-05-28 04:36:38] [INFO ] Computed 469 invariants in 77 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
RANDOM walk for 1000000 steps (39543 resets) in 12950 ms. (77 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (13765 resets) in 6081 ms. (328 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[2, 1]
[2026-05-28 04:36:57] [INFO ] Flow matrix only has 3034 transitions (discarded 397 similar events)
[2026-05-28 04:36:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:36:58] [INFO ] [Real]Absence check using 33 positive place invariants in 107 ms returned sat
[2026-05-28 04:36:58] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 112 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:36:58] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2026-05-28 04:36:58] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 82 ms returned sat
[2026-05-28 04:36:59] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2026-05-28 04:36:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:36:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 54 ms returned sat
[2026-05-28 04:36:59] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 67 ms returned sat
[2026-05-28 04:37:00] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2026-05-28 04:37:00] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2026-05-28 04:37:02] [INFO ] [Nat]Added 1634 Read/Feed constraints in 1629 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:37:04] [INFO ] Deduced a trap composed of 159 places in 1466 ms of which 254 ms to minimize.
[2026-05-28 04:37:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1826 ms
[2026-05-28 04:37:04] [INFO ] Computed and/alt/rep : 1543/3345/1543 causal constraints (skipped 1474 transitions) in 334 ms.
[2026-05-28 04:37:05] [INFO ] Added : 12 causal constraints over 3 iterations in 1399 ms. Result :sat
Minimization took 6268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1636 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node15ThinksNode5ShouldBeNodeMasterToReplaceNode11) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1636/1636 places, 3429/3429 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1635 transition count 3427
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1634 transition count 3425
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 1633 transition count 3423
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 1632 transition count 3421
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 1631 transition count 3419
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 1630 transition count 3417
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 7 place count 1630 transition count 3416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 8 place count 1629 transition count 3416
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 9 place count 1628 transition count 3415
Iterating global reduction 7 with 1 rules applied. Total rules applied 10 place count 1628 transition count 3415
Applied a total of 10 rules in 424 ms. Remains 1628 /1636 variables (removed 8) and now considering 3415/3429 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 1628/1636 places, 3415/3429 transitions.
[2026-05-28 04:37:12] [INFO ] Flow matrix only has 3018 transitions (discarded 397 similar events)
// Phase 1: matrix 3018 rows 1628 cols
[2026-05-28 04:37:12] [INFO ] Computed 469 invariants in 75 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (39548 resets) in 13638 ms. (73 steps per ms)
BEST_FIRST walk for 1000001 steps (6883 resets) in 3058 ms. (326 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:37:29] [INFO ] Flow matrix only has 3018 transitions (discarded 397 similar events)
[2026-05-28 04:37:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:29] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2026-05-28 04:37:29] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 156 ms returned sat
[2026-05-28 04:37:30] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2026-05-28 04:37:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2026-05-28 04:37:30] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 97 ms returned sat
[2026-05-28 04:37:31] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2026-05-28 04:37:31] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-28 04:37:33] [INFO ] [Nat]Added 1627 Read/Feed constraints in 1716 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:37:34] [INFO ] Deduced a trap composed of 130 places in 1336 ms of which 186 ms to minimize.
[2026-05-28 04:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1582 ms
[2026-05-28 04:37:35] [INFO ] Computed and/alt/rep : 1528/3322/1528 causal constraints (skipped 1473 transitions) in 450 ms.
[2026-05-28 04:37:36] [INFO ] Added : 14 causal constraints over 3 iterations in 1479 ms. Result :sat
Minimization took 5414 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 3415/3415 transitions.
Applied a total of 0 rules in 143 ms. Remains 1628 /1628 variables (removed 0) and now considering 3415/3415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 1628/1628 places, 3415/3415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 3415/3415 transitions.
Applied a total of 0 rules in 90 ms. Remains 1628 /1628 variables (removed 0) and now considering 3415/3415 (removed 0) transitions.
[2026-05-28 04:37:42] [INFO ] Flow matrix only has 3018 transitions (discarded 397 similar events)
[2026-05-28 04:37:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:37:46] [INFO ] Implicit Places using invariants in 4125 ms returned [4, 7, 9, 10, 11, 12, 13, 17, 23, 31, 41, 53, 67, 82, 96, 97, 98, 99, 100, 112, 122, 130, 136, 140, 142, 153, 159, 161, 162, 163, 164, 165, 167, 171, 177, 185, 195, 207, 220, 232, 233, 234, 235, 236, 246, 254, 260, 264, 266, 268, 279, 285, 287, 288, 289, 290, 291, 293, 295, 299, 305, 313, 323, 334, 344, 345, 346, 347, 348, 356, 362, 366, 368, 370, 372, 383, 389, 391, 392, 393, 394, 395, 397, 399, 401, 405, 411, 419, 428, 436, 437, 438, 439, 440, 446, 450, 452, 454, 456, 458, 469, 475, 477, 478, 479, 480, 481, 483, 485, 487, 489, 493, 499, 506, 512, 513, 514, 515, 516, 520, 522, 524, 526, 528, 530, 541, 547, 549, 550, 551, 552, 553, 555, 557, 559, 561, 563, 567, 572, 576, 577, 578, 579, 580, 582, 584, 586, 588, 590, 592, 603, 609, 611, 612, 613, 614, 615, 617, 619, 621, 623, 625, 627, 630, 632, 633, 634, 635, 636, 638, 640, 642, 644, 646, 648, 659, 665, 667, 668, 669, 670, 671, 673, 675, 677, 679, 681, 683, 685, 687, 688, 689, 690, 691, 693, 695, 697, 699, 701, 703, 714, 716, 719, 721, 722, 723, 724, 725, 727, 729, 731, 733, 735, 737, 739, 741, 742, 743, 744, 745, 747, 749, 751, 753, 755, 757, 768, 774, 776, 777, 778, 779, 780, 782, 784, 786, 788, 790, 792, 794, 796, 797, 798, 799, 800, 802, 804, 806, 808, 810, 812, 823, 829, 831, 832, 833, 834, 835, 837, 839, 841, 843, 845, 847, 849, 852, 853, 854, 855, 856, 858, 860, 862, 864, 866, 868, 879, 885, 887, 888, 889, 890, 891, 893, 895, 897, 899, 901, 903, 907, 912, 913, 914, 915, 916, 920, 922, 924, 926, 928, 930, 941, 947, 949, 950, 951, 952, 953, 955, 957, 959, 961, 963, 967, 973, 980, 981, 982, 983, 984, 990, 994, 996, 998, 1000, 1002, 1013, 1019, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1033, 1037, 1043, 1051, 1060, 1061, 1062, 1063, 1064, 1072, 1078, 1082, 1084, 1086, 1088, 1099, 1105, 1107, 1108, 1109, 1110, 1111, 1113, 1115, 1117, 1121, 1127, 1135, 1145, 1156, 1157, 1158, 1159, 1160, 1170, 1178, 1184, 1188, 1190, 1192, 1203, 1209, 1211, 1212, 1213, 1214, 1215, 1217, 1219, 1223, 1229, 1237, 1247, 1259, 1272, 1273, 1274, 1275, 1276, 1288, 1298, 1301, 1307, 1311, 1313, 1324, 1326, 1329, 1331, 1332, 1333, 1334, 1335, 1337, 1341, 1347, 1355, 1365, 1377, 1391, 1406, 1407, 1408, 1409, 1410, 1424, 1436, 1446, 1454, 1460, 1464, 1475]
[2026-05-28 04:37:46] [INFO ] Actually due to overlaps returned [153, 279, 383, 469, 541, 603, 659, 714, 768, 823, 879, 941, 1013, 1099, 1203, 1324, 1475, 4, 9, 10, 11, 12, 96, 97, 98, 99, 161, 162, 163, 164, 232, 233, 234, 235, 287, 288, 289, 290, 344, 345, 346, 347, 391, 392, 393, 394, 436, 437, 438, 439, 477, 478, 479, 480, 512, 513, 514, 515, 549, 550, 551, 552, 576, 577, 578, 579, 611, 612, 613, 614, 632, 633, 634, 635, 667, 668, 669, 670, 687, 688, 689, 690, 716, 721, 722, 723, 724, 741, 742, 743, 744, 776, 777, 778, 779, 796, 797, 798, 799, 831, 832, 833, 834, 852, 853, 854, 855, 887, 888, 889, 890, 912, 913, 914, 915, 949, 950, 951, 952, 980, 981, 982, 983, 1021, 1022, 1023, 1024, 1060, 1061, 1062, 1063, 1107, 1108, 1109, 1110, 1156, 1157, 1158, 1159, 1211, 1212, 1213, 1214, 1272, 1273, 1274, 1275, 1326, 1331, 1332, 1333, 1334, 1406, 1407, 1408, 1409]
Discarding 156 places :
Implicit Place search using SMT only with invariants took 4155 ms to find 156 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1472/1628 places, 3415/3415 transitions.
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 128 place count 1344 transition count 3287
Iterating global reduction 0 with 128 rules applied. Total rules applied 256 place count 1344 transition count 3287
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 384 place count 1216 transition count 3159
Iterating global reduction 0 with 128 rules applied. Total rules applied 512 place count 1216 transition count 3159
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 515 place count 1216 transition count 3156
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 518 place count 1213 transition count 3156
Applied a total of 518 rules in 296 ms. Remains 1213 /1472 variables (removed 259) and now considering 3156/3415 (removed 259) transitions.
[2026-05-28 04:37:46] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
// Phase 1: matrix 2759 rows 1213 cols
[2026-05-28 04:37:46] [INFO ] Computed 313 invariants in 63 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:37:50] [INFO ] Implicit Places using invariants in 3336 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 148, 150, 152, 156, 162, 170, 180, 192, 205, 217, 227, 235, 241, 245, 247, 249, 257, 259, 261, 263, 267, 273, 281, 291, 302, 312, 320, 326, 330, 332, 334, 336, 344, 346, 348, 350, 352, 356, 362, 370, 379, 387, 393, 397, 399, 401, 403, 405, 413, 415, 417, 419, 421, 423, 427, 433, 440, 446, 450, 452, 454, 456, 458, 460, 468, 470, 472, 474, 476, 478, 480, 484, 489, 493, 495, 497, 499, 501, 503, 505, 513, 515, 517, 519, 521, 523, 525, 527, 530, 532, 534, 536, 538, 540, 542, 544, 552, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 588, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 625, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 663, 665, 667, 669, 671, 673, 675, 677, 679, 682, 684, 686, 688, 690, 692, 694, 702, 704, 706, 708, 710, 712, 714, 716, 720, 725, 729, 731, 733, 735, 737, 739, 747, 749, 751, 753, 755, 757, 759, 763, 769, 776, 782, 786, 788, 790, 792, 794, 802, 804, 806, 808, 810, 812, 816, 822, 830, 839, 847, 853, 857, 859, 861, 863, 871, 873, 875, 877, 879, 883, 889, 897, 907, 918, 928, 936, 942, 946, 948, 950, 958, 960, 962, 964, 968, 974, 982, 992, 1004, 1017, 1029, 1039, 1042, 1048, 1052, 1054, 1060, 1062, 1064, 1068, 1074, 1082, 1092, 1104, 1118, 1133, 1147, 1159, 1169, 1177, 1183, 1187]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 3350 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 941/1628 places, 3156/3415 transitions.
Applied a total of 0 rules in 109 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8008 ms. Remains : 941/1628 places, 3156/3415 transitions.
[2026-05-28 04:37:50] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
// Phase 1: matrix 2759 rows 941 cols
[2026-05-28 04:37:50] [INFO ] Computed 41 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (42674 resets) in 12399 ms. (80 steps per ms)
BEST_FIRST walk for 1000001 steps (4667 resets) in 2079 ms. (480 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:38:04] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:38:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:38:04] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2026-05-28 04:38:04] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 4 ms returned sat
[2026-05-28 04:38:05] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2026-05-28 04:38:05] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-28 04:38:05] [INFO ] [Real]Added 1627 Read/Feed constraints in 220 ms returned sat
[2026-05-28 04:38:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:38:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2026-05-28 04:38:06] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-28 04:38:06] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2026-05-28 04:38:08] [INFO ] [Nat]Added 1627 Read/Feed constraints in 1332 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:08] [INFO ] Deduced a trap composed of 129 places in 729 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:09] [INFO ] Deduced a trap composed of 50 places in 676 ms of which 64 ms to minimize.
[2026-05-28 04:38:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1765 ms
[2026-05-28 04:38:10] [INFO ] Computed and/alt/rep : 1318/1894/1318 causal constraints (skipped 1379 transitions) in 226 ms.
[2026-05-28 04:38:10] [INFO ] Added : 13 causal constraints over 4 iterations in 1074 ms. Result :sat
Minimization took 5386 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 85 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 941/941 places, 3156/3156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 72 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
[2026-05-28 04:38:16] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:38:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:38:17] [INFO ] Implicit Places using invariants in 1258 ms returned []
[2026-05-28 04:38:17] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:38:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:38:18] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-28 04:38:48] [INFO ] Performed 647/941 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:38:58] [INFO ] Implicit Places using invariants and state equation in 40402 ms returned []
Implicit Place search using SMT with State Equation took 41679 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:38:58] [INFO ] Redundant transitions in 238 ms returned []
Running 3094 sub problems to find dead transitions.
[2026-05-28 04:38:58] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:38:58] [INFO ] Invariant cache hit.
[2026-05-28 04:38:58] [INFO ] State equation strengthened by 1627 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/938 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3094 unsolved
SMT process timed out in 33817ms, After SMT, problems are : Problem set: 0 solved, 3094 unsolved
Search for dead transitions found 0 dead transitions in 33882ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75908 ms. Remains : 941/941 places, 3156/3156 transitions.
RANDOM walk for 40000 steps (1704 resets) in 1652 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (185 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (185 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
[2026-05-28 04:39:33] [INFO ] Flatten gal took : 344 ms
[2026-05-28 04:39:33] [INFO ] Flatten gal took : 124 ms
[2026-05-28 04:39:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2063430597140869514.gal : 55 ms
[2026-05-28 04:39:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8884273328202808815.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/ReachabilityCardinality2063430597140869514.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8884273328202808815.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 ...328
Loading property file /tmp/ReachabilityCardinality8884273328202808815.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :24 after 28
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :28 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 138
Interrupted probabilistic random walk after 60045 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 60045 steps, saw 25006 distinct states, run finished after 3005 ms. (steps per millisecond=19 ) properties seen :0
[2026-05-28 04:39:36] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:39:36] [INFO ] Invariant cache hit.
[2026-05-28 04:39:36] [INFO ] State equation strengthened by 1627 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :138 after 225
[2026-05-28 04:39:36] [INFO ] Deduced a trap composed of 113 places in 618 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :225 after 533
[2026-05-28 04:39:37] [INFO ] Deduced a trap composed of 64 places in 843 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :533 after 753
[2026-05-28 04:39:38] [INFO ] Deduced a trap composed of 71 places in 918 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:39] [INFO ] Deduced a trap composed of 95 places in 755 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :753 after 1289
[2026-05-28 04:39:40] [INFO ] Deduced a trap composed of 95 places in 863 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:41] [INFO ] Deduced a trap composed of 64 places in 866 ms of which 62 ms to minimize.
SMT process timed out in 5242ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 79 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 941/941 places, 3156/3156 transitions.
RANDOM walk for 40000 steps (1704 resets) in 850 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (183 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (185 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 68039 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 68039 steps, saw 28297 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-28 04:39:44] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:39:44] [INFO ] Invariant cache hit.
[2026-05-28 04:39:44] [INFO ] State equation strengthened by 1627 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1289 after 2450
[2026-05-28 04:39:45] [INFO ] Deduced a trap composed of 113 places in 706 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:46] [INFO ] Deduced a trap composed of 64 places in 685 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:47] [INFO ] Deduced a trap composed of 71 places in 608 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:47] [INFO ] Deduced a trap composed of 95 places in 855 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:48] [INFO ] Deduced a trap composed of 95 places in 734 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:49] [INFO ] Deduced a trap composed of 64 places in 620 ms of which 62 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/905 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/933 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/933 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/941 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/941 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2759/3700 variables, 941/988 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3700 variables, 1627/2615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3700 variables, 0/2615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3700 variables, 0/2615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3700/3700 variables, and 2615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6395 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 941/941 constraints, ReadFeed: 1627/1627 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:52] [INFO ] Deduced a trap composed of 161 places in 648 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:52] [INFO ] Deduced a trap composed of 135 places in 633 ms of which 113 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/905 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:53] [INFO ] Deduced a trap composed of 5 places in 560 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2450 after 5051
[2026-05-28 04:39:54] [INFO ] Deduced a trap composed of 27 places in 690 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:54] [INFO ] Deduced a trap composed of 27 places in 626 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:55] [INFO ] Deduced a trap composed of 52 places in 612 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:56] [INFO ] Deduced a trap composed of 52 places in 633 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:56] [INFO ] Deduced a trap composed of 53 places in 626 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:56] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:57] [INFO ] Deduced a trap composed of 48 places in 559 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:58] [INFO ] Deduced a trap composed of 48 places in 596 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:58] [INFO ] Deduced a trap composed of 48 places in 586 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:59] [INFO ] Deduced a trap composed of 48 places in 512 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:59] [INFO ] Deduced a trap composed of 48 places in 498 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:00] [INFO ] Deduced a trap composed of 49 places in 517 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:00] [INFO ] Deduced a trap composed of 49 places in 596 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:01] [INFO ] Deduced a trap composed of 49 places in 617 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:02] [INFO ] Deduced a trap composed of 49 places in 697 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:03] [INFO ] Deduced a trap composed of 49 places in 688 ms of which 45 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 28/933 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/941 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:03] [INFO ] Deduced a trap composed of 47 places in 640 ms of which 62 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/941 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/941 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2759/3700 variables, 941/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3700 variables, 1627/2635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3700 variables, 2/2637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3700 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/3700 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3700/3700 variables, and 2637 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16218 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 941/941 constraints, ReadFeed: 1627/1627 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22653ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 134 ms.
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 122 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 941/941 places, 3156/3156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 92 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
[2026-05-28 04:40:07] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:40:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:40:09] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2026-05-28 04:40:09] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:40:09] [INFO ] State equation strengthened by 1627 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5051 after 9646
Detected timeout of ITS tools.
[2026-05-28 04:40:23] [INFO ] Flatten gal took : 109 ms
[2026-05-28 04:40:23] [INFO ] Applying decomposition
[2026-05-28 04:40:23] [INFO ] Flatten gal took : 105 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/graph18031803446584196154.txt' '-o' '/tmp/graph18031803446584196154.bin' '-w' '/tmp/graph18031803446584196154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18031803446584196154.bin' '-l' '-1' '-v' '-w' '/tmp/graph18031803446584196154.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:40:24] [INFO ] Decomposing Gal with order
[2026-05-28 04:40:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:40:24] [INFO ] Removed a total of 4960 redundant transitions.
[2026-05-28 04:40:25] [INFO ] Flatten gal took : 769 ms
[2026-05-28 04:40:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2624 labels/synchronizations in 242 ms.
[2026-05-28 04:40:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality701788145583914466.gal : 46 ms
[2026-05-28 04:40:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5783256252945161831.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/ReachabilityCardinality701788145583914466.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5783256252945161831.prop' '--nowitness'

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 ...306
Loading property file /tmp/ReachabilityCardinality5783256252945161831.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 98
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :98 after 589
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :589 after 1758
[2026-05-28 04:40:40] [INFO ] Performed 590/941 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1758 after 3723
[2026-05-28 04:40:53] [INFO ] Implicit Places using invariants and state equation in 44610 ms returned []
Implicit Place search using SMT with State Equation took 45956 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:40:53] [INFO ] Redundant transitions in 208 ms returned []
Running 3094 sub problems to find dead transitions.
[2026-05-28 04:40:54] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:40:54] [INFO ] Invariant cache hit.
[2026-05-28 04:40:54] [INFO ] State equation strengthened by 1627 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3723 after 5997
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/938 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3094 unsolved
SMT process timed out in 33461ms, After SMT, problems are : Problem set: 0 solved, 3094 unsolved
Search for dead transitions found 0 dead transitions in 33471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79754 ms. Remains : 941/941 places, 3156/3156 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:41:27] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:41:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (426 resets) in 141 ms. (70 steps per ms)
BEST_FIRST walk for 10001 steps (46 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:41:27] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:41:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:41:27] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2026-05-28 04:41:27] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-28 04:41:28] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2026-05-28 04:41:28] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-28 04:41:28] [INFO ] [Real]Added 1627 Read/Feed constraints in 144 ms returned sat
[2026-05-28 04:41:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:41:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2026-05-28 04:41:28] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 6 ms returned sat
[2026-05-28 04:41:29] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2026-05-28 04:41:30] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:41:30] [INFO ] [Nat]Added 1627 Read/Feed constraints in 891 ms returned sat
[2026-05-28 04:41:31] [INFO ] Computed and/alt/rep : 1318/1894/1318 causal constraints (skipped 1379 transitions) in 330 ms.
[2026-05-28 04:41:31] [INFO ] Added : 10 causal constraints over 2 iterations in 931 ms. Result :sat
Minimization took 597 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 124 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 941/941 places, 3156/3156 transitions.
[2026-05-28 04:41:32] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:41:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (42673 resets) in 12460 ms. (80 steps per ms)
BEST_FIRST walk for 1000001 steps (4677 resets) in 1978 ms. (505 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:41:46] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:41:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:41:47] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2026-05-28 04:41:47] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-28 04:41:47] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2026-05-28 04:41:47] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-28 04:41:47] [INFO ] [Real]Added 1627 Read/Feed constraints in 209 ms returned sat
[2026-05-28 04:41:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:41:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2026-05-28 04:41:48] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-28 04:41:48] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2026-05-28 04:41:50] [INFO ] [Nat]Added 1627 Read/Feed constraints in 1892 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:51] [INFO ] Deduced a trap composed of 129 places in 531 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:51] [INFO ] Deduced a trap composed of 50 places in 628 ms of which 64 ms to minimize.
[2026-05-28 04:41:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1617 ms
[2026-05-28 04:41:52] [INFO ] Computed and/alt/rep : 1318/1894/1318 causal constraints (skipped 1379 transitions) in 173 ms.
[2026-05-28 04:41:53] [INFO ] Added : 13 causal constraints over 4 iterations in 998 ms. Result :sat
Minimization took 6975 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 91 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 941/941 places, 3156/3156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 86 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
[2026-05-28 04:42:00] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:42:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:42:01] [INFO ] Implicit Places using invariants in 1248 ms returned []
[2026-05-28 04:42:01] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:42:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:42:02] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-28 04:42:33] [INFO ] Performed 643/941 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:42:43] [INFO ] Implicit Places using invariants and state equation in 41868 ms returned []
Implicit Place search using SMT with State Equation took 43134 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:42:43] [INFO ] Redundant transitions in 139 ms returned []
Running 3094 sub problems to find dead transitions.
[2026-05-28 04:42:43] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:42:43] [INFO ] Invariant cache hit.
[2026-05-28 04:42:43] [INFO ] State equation strengthened by 1627 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/938 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3094 unsolved
SMT process timed out in 34005ms, After SMT, problems are : Problem set: 0 solved, 3094 unsolved
Search for dead transitions found 0 dead transitions in 34014ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77390 ms. Remains : 941/941 places, 3156/3156 transitions.
[2026-05-28 04:43:17] [INFO ] Flatten gal took : 182 ms
[2026-05-28 04:43:17] [INFO ] Flatten gal took : 145 ms
[2026-05-28 04:43:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1909592799509432670.gal : 19 ms
[2026-05-28 04:43:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6572463610401103930.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/ReachabilityCardinality1909592799509432670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6572463610401103930.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 ...328
RANDOM walk for 40000 steps (1705 resets) in 1373 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (184 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (186 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6572463610401103930.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :24 after 28
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :28 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 138
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :138 after 225
Interrupted probabilistic random walk after 66581 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 66581 steps, saw 27702 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-28 04:43:21] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:43:21] [INFO ] Invariant cache hit.
[2026-05-28 04:43:21] [INFO ] State equation strengthened by 1627 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :225 after 533
[2026-05-28 04:43:21] [INFO ] Deduced a trap composed of 113 places in 548 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:22] [INFO ] Deduced a trap composed of 64 places in 599 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :533 after 753
[2026-05-28 04:43:23] [INFO ] Deduced a trap composed of 71 places in 706 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:23] [INFO ] Deduced a trap composed of 95 places in 587 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:24] [INFO ] Deduced a trap composed of 95 places in 544 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :753 after 1289
[2026-05-28 04:43:25] [INFO ] Deduced a trap composed of 64 places in 570 ms of which 64 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/905 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/933 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/933 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/941 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/941 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3700/3700 variables, and 988 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 941/941 constraints, ReadFeed: 0/1627 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:26] [INFO ] Deduced a trap composed of 161 places in 580 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:27] [INFO ] Deduced a trap composed of 135 places in 645 ms of which 122 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/905 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:28] [INFO ] Deduced a trap composed of 5 places in 627 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:29] [INFO ] Deduced a trap composed of 27 places in 548 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:29] [INFO ] Deduced a trap composed of 27 places in 528 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:30] [INFO ] Deduced a trap composed of 52 places in 531 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:30] [INFO ] Deduced a trap composed of 52 places in 812 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:31] [INFO ] Deduced a trap composed of 53 places in 619 ms of which 76 ms to minimize.
SMT process timed out in 10434ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 76 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 941/941 places, 3156/3156 transitions.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1289 after 2450
RANDOM walk for 40000 steps (1706 resets) in 700 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (183 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (186 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 66217 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 66217 steps, saw 27559 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-28 04:43:34] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:43:34] [INFO ] Invariant cache hit.
[2026-05-28 04:43:34] [INFO ] State equation strengthened by 1627 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:35] [INFO ] Deduced a trap composed of 113 places in 487 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:36] [INFO ] Deduced a trap composed of 64 places in 536 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:36] [INFO ] Deduced a trap composed of 71 places in 504 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:37] [INFO ] Deduced a trap composed of 95 places in 504 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:37] [INFO ] Deduced a trap composed of 95 places in 621 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:38] [INFO ] Deduced a trap composed of 64 places in 569 ms of which 61 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/905 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/933 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/933 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/941 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/941 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2759/3700 variables, 941/988 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3700 variables, 1627/2615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3700 variables, 0/2615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3700 variables, 0/2615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3700/3700 variables, and 2615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4747 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 941/941 constraints, ReadFeed: 1627/1627 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:40] [INFO ] Deduced a trap composed of 161 places in 565 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:41] [INFO ] Deduced a trap composed of 135 places in 556 ms of which 111 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/905 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:41] [INFO ] Deduced a trap composed of 5 places in 454 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:42] [INFO ] Deduced a trap composed of 27 places in 490 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:42] [INFO ] Deduced a trap composed of 27 places in 563 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:43] [INFO ] Deduced a trap composed of 52 places in 476 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2450 after 5051
[2026-05-28 04:43:43] [INFO ] Deduced a trap composed of 52 places in 487 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:44] [INFO ] Deduced a trap composed of 53 places in 502 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:44] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:45] [INFO ] Deduced a trap composed of 48 places in 563 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:45] [INFO ] Deduced a trap composed of 48 places in 470 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:46] [INFO ] Deduced a trap composed of 48 places in 470 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:46] [INFO ] Deduced a trap composed of 48 places in 510 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:47] [INFO ] Deduced a trap composed of 48 places in 605 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:47] [INFO ] Deduced a trap composed of 49 places in 543 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:48] [INFO ] Deduced a trap composed of 49 places in 472 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:48] [INFO ] Deduced a trap composed of 49 places in 496 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:49] [INFO ] Deduced a trap composed of 49 places in 618 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:49] [INFO ] Deduced a trap composed of 49 places in 492 ms of which 42 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 28/933 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/941 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:50] [INFO ] Deduced a trap composed of 47 places in 479 ms of which 60 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/941 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/941 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2759/3700 variables, 941/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3700 variables, 1627/2635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3700 variables, 2/2637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3700 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/3700 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3700/3700 variables, and 2637 constraints, problems are : Problem set: 0 solved, 2 unsolved in 13592 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 941/941 constraints, ReadFeed: 1627/1627 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18367ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 71 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 941/941 places, 3156/3156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 72 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
[2026-05-28 04:43:53] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:43:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:43:54] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2026-05-28 04:43:54] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:43:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:43:55] [INFO ] State equation strengthened by 1627 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5051 after 9646
Detected timeout of ITS tools.
[2026-05-28 04:44:08] [INFO ] Flatten gal took : 123 ms
[2026-05-28 04:44:08] [INFO ] Applying decomposition
[2026-05-28 04:44:08] [INFO ] Flatten gal took : 80 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/graph11885960666317544441.txt' '-o' '/tmp/graph11885960666317544441.bin' '-w' '/tmp/graph11885960666317544441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11885960666317544441.bin' '-l' '-1' '-v' '-w' '/tmp/graph11885960666317544441.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:44:08] [INFO ] Decomposing Gal with order
[2026-05-28 04:44:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:44:08] [INFO ] Removed a total of 5017 redundant transitions.
[2026-05-28 04:44:08] [INFO ] Flatten gal took : 373 ms
[2026-05-28 04:44:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2307 labels/synchronizations in 128 ms.
[2026-05-28 04:44:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9154490355843504234.gal : 22 ms
[2026-05-28 04:44:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4410347535310048007.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/ReachabilityCardinality9154490355843504234.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4410347535310048007.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality4410347535310048007.prop.
[2026-05-28 04:44:25] [INFO ] Performed 560/941 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:44:42] [INFO ] Implicit Places using invariants and state equation in 47882 ms returned []
Implicit Place search using SMT with State Equation took 49066 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:44:42] [INFO ] Redundant transitions in 117 ms returned []
Running 3094 sub problems to find dead transitions.
[2026-05-28 04:44:42] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-28 04:44:42] [INFO ] Invariant cache hit.
[2026-05-28 04:44:42] [INFO ] State equation strengthened by 1627 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/938 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3094 unsolved
SMT process timed out in 34178ms, After SMT, problems are : Problem set: 0 solved, 3094 unsolved
Search for dead transitions found 0 dead transitions in 34185ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83484 ms. Remains : 941/941 places, 3156/3156 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09 in 229482 ms.
[2026-05-28 04:45:17] [INFO ] Flatten gal took : 82 ms
[2026-05-28 04:45:17] [INFO ] Applying decomposition
[2026-05-28 04:45:17] [INFO ] Flatten gal took : 81 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/graph337012853169486665.txt' '-o' '/tmp/graph337012853169486665.bin' '-w' '/tmp/graph337012853169486665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph337012853169486665.bin' '-l' '-1' '-v' '-w' '/tmp/graph337012853169486665.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:45:17] [INFO ] Decomposing Gal with order
[2026-05-28 04:45:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:45:17] [INFO ] Removed a total of 4967 redundant transitions.
[2026-05-28 04:45:17] [INFO ] Flatten gal took : 383 ms
[2026-05-28 04:45:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2644 labels/synchronizations in 99 ms.
[2026-05-28 04:45:18] [INFO ] Time to serialize gal into /tmp/UpperBounds12872666136815052314.gal : 21 ms
[2026-05-28 04:45:18] [INFO ] Time to serialize properties into /tmp/UpperBounds8191336120638833151.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/UpperBounds12872666136815052314.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8191336120638833151.prop' '--nowitness'

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 ...284
Loading property file /tmp/UpperBounds8191336120638833151.prop.
Detected timeout of ITS tools.
[2026-05-28 05:08:28] [INFO ] Flatten gal took : 750 ms
[2026-05-28 05:08:38] [INFO ] Time to serialize gal into /tmp/UpperBounds7097335457371289562.gal : 118 ms
[2026-05-28 05:08:38] [INFO ] Time to serialize properties into /tmp/UpperBounds12828227204452945465.prop : 10 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/UpperBounds7097335457371289562.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12828227204452945465.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 ...305
Loading property file /tmp/UpperBounds12828227204452945465.prop.
ITS-tools command line returned an error code 137
[2026-05-28 05:30:30] [INFO ] Flatten gal took : 579 ms
[2026-05-28 05:30:33] [INFO ] Input system was already deterministic with 3156 transitions.
[2026-05-28 05:30:33] [INFO ] Transformed 941 places.
[2026-05-28 05:30:33] [INFO ] Transformed 3156 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-28 05:30:34] [INFO ] Time to serialize gal into /tmp/UpperBounds869721592568987943.gal : 150 ms
[2026-05-28 05:30:34] [INFO ] Time to serialize properties into /tmp/UpperBounds9972015529580637354.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/UpperBounds869721592568987943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9972015529580637354.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...348
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9972015529580637354.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
++ sed s/.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="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is MultiCrashLeafsetExtension-PT-S16C04, 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 r191-oct2-177969025600051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;