Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748952640157

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-03 12:10:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 12:10:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 12:10:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 12:10:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 12:10:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 552 ms
[2025-06-03 12:10:42] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2025-06-03 12:10:42] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2025-06-03 12:10:42] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2025-06-03 12:10:42] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2025-06-03 12:10:42] [INFO ] Computed 7 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 10, 10, 0, 0, 0, 0] Max Struct:[10, 1, 1, 10, 1, 1, 1, 1, 1, 1, 10, 10, 1, 10, 10, 10]
FORMULA SafeBus-COL-10-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-03 12:10:42] [INFO ] Invariant cache hit.
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 12:10:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 12:10:42] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 12:10:42] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Added 3 Read/Feed constraints in 11 ms returned sat
[2025-06-03 12:10:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:42] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:42] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 130 ms.
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:42] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:42] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:42] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:42] [INFO ] Added : 12 causal constraints over 5 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:42] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:42] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:42] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 12:10:42] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:43] [INFO ] Added : 9 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 4 positive place invariants in 18 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:43] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:43] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:43] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-03 12:10:43] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 10, 1, 1, 1, 1, 10, 10, 10]
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2025-06-03 12:10:43] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 61 ms.
[2025-06-03 12:10:43] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 20 places and 20 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 10, 1, 1, 1, 1, 10, 10, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 10, 1, 1, 1, 1, 10, 10, 10]
[2025-06-03 12:10:43] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-03 12:10:43] [INFO ] Computed 45 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 10, 1, 1, 1, 1, 10, 10, 10]
RANDOM walk for 10000 steps (2 resets) in 210 ms. (47 steps per ms)
FORMULA SafeBus-COL-10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 61 ms. (483 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 9, 9] Max Struct:[10, 10, 10]
[2025-06-03 12:10:43] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 12:10:43] [INFO ] Invariant cache hit.
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 6 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2025-06-03 12:10:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 8 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2025-06-03 12:10:44] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:10:44] [INFO ] [Nat]Added 111 Read/Feed constraints in 225 ms returned sat
[2025-06-03 12:10:44] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 114 ms.
[2025-06-03 12:10:45] [INFO ] Added : 0 causal constraints over 0 iterations in 183 ms. Result :sat
Minimization took 531 ms.
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 9 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-06-03 12:10:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 8 ms returned sat
[2025-06-03 12:10:46] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2025-06-03 12:10:46] [INFO ] [Nat]Added 111 Read/Feed constraints in 492 ms returned sat
[2025-06-03 12:10:46] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 71 ms.
[2025-06-03 12:10:46] [INFO ] Added : 0 causal constraints over 0 iterations in 137 ms. Result :sat
Minimization took 541 ms.
[2025-06-03 12:10:47] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2025-06-03 12:10:47] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 7 ms returned sat
[2025-06-03 12:10:47] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-06-03 12:10:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2025-06-03 12:10:47] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 19 ms returned sat
[2025-06-03 12:10:47] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2025-06-03 12:10:48] [INFO ] [Nat]Added 111 Read/Feed constraints in 301 ms returned sat
[2025-06-03 12:10:48] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 73 ms.
[2025-06-03 12:10:48] [INFO ] Added : 0 causal constraints over 0 iterations in 153 ms. Result :sat
Minimization took 530 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 9, 9] Max Struct:[10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 9, 9] Max Struct:[10, 10, 10]
Support contains 30 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 243 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 306/306 places, 1631/1631 transitions.
[2025-06-03 12:10:49] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 12:10:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 9, 9] Max Struct:[10, 10, 10]
RANDOM walk for 1000000 steps (2 resets) in 5288 ms. (189 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 4259 ms. (704 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 9, 9] Max Struct:[10, 10, 10]
[2025-06-03 12:10:58] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 12:10:58] [INFO ] Invariant cache hit.
[2025-06-03 12:10:58] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2025-06-03 12:10:58] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 8 ms returned sat
[2025-06-03 12:10:58] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-06-03 12:10:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2025-06-03 12:10:58] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 11 ms returned sat
[2025-06-03 12:10:59] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2025-06-03 12:10:59] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:10:59] [INFO ] [Nat]Added 111 Read/Feed constraints in 273 ms returned sat
[2025-06-03 12:10:59] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 20 ms to minimize.
[2025-06-03 12:11:00] [INFO ] Deduced a trap composed of 79 places in 365 ms of which 3 ms to minimize.
[2025-06-03 12:11:00] [INFO ] Deduced a trap composed of 90 places in 319 ms of which 2 ms to minimize.
[2025-06-03 12:11:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1043 ms
[2025-06-03 12:11:00] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2025-06-03 12:11:00] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 8 ms returned sat
[2025-06-03 12:11:00] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2025-06-03 12:11:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2025-06-03 12:11:00] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 7 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Added 111 Read/Feed constraints in 463 ms returned sat
[2025-06-03 12:11:01] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 59 ms.
[2025-06-03 12:11:01] [INFO ] Added : 0 causal constraints over 0 iterations in 114 ms. Result :sat
Minimization took 986 ms.
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 7 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-06-03 12:11:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 7 ms returned sat
[2025-06-03 12:11:03] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2025-06-03 12:11:03] [INFO ] [Nat]Added 111 Read/Feed constraints in 283 ms returned sat
[2025-06-03 12:11:03] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 49 ms.
[2025-06-03 12:11:03] [INFO ] Added : 0 causal constraints over 0 iterations in 111 ms. Result :sat
Minimization took 934 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 9, 9] Max Struct:[9, 10, 10]
FORMULA SafeBus-COL-10-UpperBounds-00 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 9] Max Struct:[10, 10]
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 114 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 306/306 places, 1631/1631 transitions.
[2025-06-03 12:11:04] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 12:11:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9, 9] Max Struct:[10, 10]
RANDOM walk for 1000000 steps (2 resets) in 5025 ms. (198 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 2849 ms. (701 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 9] Max Struct:[10, 10]
[2025-06-03 12:11:12] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 12:11:12] [INFO ] Invariant cache hit.
[2025-06-03 12:11:12] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2025-06-03 12:11:12] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 8 ms returned sat
[2025-06-03 12:11:12] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-06-03 12:11:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2025-06-03 12:11:13] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 8 ms returned sat
[2025-06-03 12:11:13] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2025-06-03 12:11:13] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:11:13] [INFO ] [Nat]Added 111 Read/Feed constraints in 462 ms returned sat
[2025-06-03 12:11:13] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 56 ms.
[2025-06-03 12:11:13] [INFO ] Added : 0 causal constraints over 0 iterations in 113 ms. Result :sat
Minimization took 976 ms.
[2025-06-03 12:11:14] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2025-06-03 12:11:14] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 7 ms returned sat
[2025-06-03 12:11:15] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2025-06-03 12:11:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2025-06-03 12:11:15] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 7 ms returned sat
[2025-06-03 12:11:15] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-03 12:11:15] [INFO ] [Nat]Added 111 Read/Feed constraints in 285 ms returned sat
[2025-06-03 12:11:15] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 52 ms.
[2025-06-03 12:11:15] [INFO ] Added : 0 causal constraints over 0 iterations in 106 ms. Result :sat
Minimization took 932 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 9] Max Struct:[10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 9] Max Struct:[10, 10]
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 178 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 134 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2025-06-03 12:11:17] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 12:11:17] [INFO ] Invariant cache hit.
[2025-06-03 12:11:17] [INFO ] Implicit Places using invariants in 446 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 456 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 355 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 949 ms. Remains : 296/306 places, 1631/1631 transitions.
[2025-06-03 12:11:18] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2025-06-03 12:11:18] [INFO ] Computed 35 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[9, 9] Max Struct:[10, 10]
RANDOM walk for 1000000 steps (2 resets) in 4703 ms. (212 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 2694 ms. (742 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 9] Max Struct:[10, 10]
[2025-06-03 12:11:25] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 12:11:25] [INFO ] Invariant cache hit.
[2025-06-03 12:11:25] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 12:11:25] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 6 ms returned sat
[2025-06-03 12:11:25] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-06-03 12:11:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-06-03 12:11:25] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 7 ms returned sat
[2025-06-03 12:11:25] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2025-06-03 12:11:25] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:11:26] [INFO ] [Nat]Added 111 Read/Feed constraints in 544 ms returned sat
[2025-06-03 12:11:26] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 52 ms.
[2025-06-03 12:11:26] [INFO ] Added : 1 causal constraints over 1 iterations in 150 ms. Result :sat
Minimization took 1145 ms.
[2025-06-03 12:11:27] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2025-06-03 12:11:27] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2025-06-03 12:11:28] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-06-03 12:11:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-06-03 12:11:28] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 6 ms returned sat
[2025-06-03 12:11:28] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2025-06-03 12:11:28] [INFO ] [Nat]Added 111 Read/Feed constraints in 416 ms returned sat
[2025-06-03 12:11:28] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 75 ms.
[2025-06-03 12:11:28] [INFO ] Added : 1 causal constraints over 1 iterations in 146 ms. Result :sat
Minimization took 1139 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 9] Max Struct:[10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 9] Max Struct:[10, 10]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 95 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 296/296 places, 1631/1631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 96 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2025-06-03 12:11:30] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 12:11:30] [INFO ] Invariant cache hit.
[2025-06-03 12:11:31] [INFO ] Implicit Places using invariants in 418 ms returned []
[2025-06-03 12:11:31] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 12:11:31] [INFO ] Invariant cache hit.
[2025-06-03 12:11:31] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:11:32] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2025-06-03 12:11:32] [INFO ] Redundant transitions in 93 ms returned []
Running 1621 sub problems to find dead transitions.
[2025-06-03 12:11:33] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 12:11:33] [INFO ] Invariant cache hit.
[2025-06-03 12:11:33] [INFO ] State equation strengthened by 111 read => feed constraints.
Problem TDEAD91 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD991 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 10 solved, 1611 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2025-06-03 12:11:46] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2025-06-03 12:11:46] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 2 ms to minimize.
[2025-06-03 12:11:46] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2025-06-03 12:11:46] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2025-06-03 12:11:47] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
[2025-06-03 12:11:47] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 1 ms to minimize.
[2025-06-03 12:11:55] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 2 ms to minimize.
[2025-06-03 12:11:55] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 1 ms to minimize.
[2025-06-03 12:11:55] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2025-06-03 12:11:55] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2025-06-03 12:11:56] [INFO ] Deduced a trap composed of 73 places in 201 ms of which 2 ms to minimize.
[2025-06-03 12:11:57] [INFO ] Deduced a trap composed of 57 places in 204 ms of which 2 ms to minimize.
[2025-06-03 12:11:57] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
[2025-06-03 12:11:57] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 1 ms to minimize.
[2025-06-03 12:11:57] [INFO ] Deduced a trap composed of 57 places in 201 ms of which 2 ms to minimize.
[2025-06-03 12:12:00] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 2 ms to minimize.
[2025-06-03 12:12:00] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 1 ms to minimize.
[2025-06-03 12:12:01] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2025-06-03 12:12:01] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 2 ms to minimize.
[2025-06-03 12:12:01] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2025-06-03 12:12:17] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2025-06-03 12:12:17] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2025-06-03 12:12:17] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2025-06-03 12:12:18] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2025-06-03 12:12:19] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 2 ms to minimize.
[2025-06-03 12:12:19] [INFO ] Deduced a trap composed of 57 places in 201 ms of which 2 ms to minimize.
[2025-06-03 12:12:19] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 2 ms to minimize.
[2025-06-03 12:12:22] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 2 ms to minimize.
[2025-06-03 12:12:22] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
[2025-06-03 12:12:22] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2025-06-03 12:12:22] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 2 ms to minimize.
[2025-06-03 12:12:23] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 2 ms to minimize.
[2025-06-03 12:12:23] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2025-06-03 12:12:23] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2025-06-03 12:12:23] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2025-06-03 12:12:23] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2025-06-03 12:12:23] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2025-06-03 12:12:23] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2025-06-03 12:12:24] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 19/74 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 74 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 39/39 constraints]
After SMT, in 64552ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64582ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/296 places, 1531/1631 transitions.
Applied a total of 0 rules in 83 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-03 12:12:37] [INFO ] Redundant transitions in 25 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67128 ms. Remains : 296/296 places, 1531/1631 transitions.
[2025-06-03 12:12:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:12:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9, 9] Max Struct:[10, 10]
RANDOM walk for 1000000 steps (2 resets) in 4408 ms. (226 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 2535 ms. (788 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 9] Max Struct:[10, 10]
[2025-06-03 12:12:44] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:12:44] [INFO ] Invariant cache hit.
[2025-06-03 12:12:44] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2025-06-03 12:12:44] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 9 ms returned sat
[2025-06-03 12:12:44] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2025-06-03 12:12:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:12:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 12:12:44] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2025-06-03 12:12:45] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2025-06-03 12:12:45] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:12:45] [INFO ] [Nat]Added 111 Read/Feed constraints in 309 ms returned sat
[2025-06-03 12:12:45] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 59 ms.
[2025-06-03 12:12:45] [INFO ] Added : 1 causal constraints over 1 iterations in 138 ms. Result :sat
Minimization took 1260 ms.
[2025-06-03 12:12:46] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 12:12:47] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 6 ms returned sat
[2025-06-03 12:12:47] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-06-03 12:12:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:12:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 12:12:47] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 5 ms returned sat
[2025-06-03 12:12:47] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-03 12:12:47] [INFO ] [Nat]Added 111 Read/Feed constraints in 245 ms returned sat
[2025-06-03 12:12:47] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 48 ms.
[2025-06-03 12:12:47] [INFO ] Added : 1 causal constraints over 1 iterations in 130 ms. Result :sat
Minimization took 1148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 9] Max Struct:[10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 9] Max Struct:[10, 10]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 80 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 79 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-03 12:12:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:12:49] [INFO ] Invariant cache hit.
[2025-06-03 12:12:49] [INFO ] Implicit Places using invariants in 362 ms returned []
[2025-06-03 12:12:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:12:49] [INFO ] Invariant cache hit.
[2025-06-03 12:12:49] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:12:51] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2025-06-03 12:12:51] [INFO ] Redundant transitions in 24 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-03 12:12:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:12:51] [INFO ] Invariant cache hit.
[2025-06-03 12:12:51] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:13:03] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 2 ms to minimize.
[2025-06-03 12:13:04] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 1 ms to minimize.
[2025-06-03 12:13:11] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 1 ms to minimize.
[2025-06-03 12:13:11] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2025-06-03 12:13:12] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 2 ms to minimize.
[2025-06-03 12:13:12] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 2 ms to minimize.
[2025-06-03 12:13:12] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 2 ms to minimize.
[2025-06-03 12:13:13] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2025-06-03 12:13:13] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 2 ms to minimize.
[2025-06-03 12:13:13] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 2 ms to minimize.
[2025-06-03 12:13:13] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 2 ms to minimize.
[2025-06-03 12:13:14] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 2 ms to minimize.
[2025-06-03 12:13:16] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 2 ms to minimize.
[2025-06-03 12:13:17] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 2 ms to minimize.
[2025-06-03 12:13:17] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 4 ms to minimize.
[2025-06-03 12:13:17] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 2 ms to minimize.
[2025-06-03 12:13:17] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 2 ms to minimize.
[2025-06-03 12:13:17] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2025-06-03 12:13:18] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 1 ms to minimize.
[2025-06-03 12:13:18] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:13:26] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 2 ms to minimize.
[2025-06-03 12:13:26] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 2 ms to minimize.
[2025-06-03 12:13:26] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 1 ms to minimize.
[2025-06-03 12:13:35] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2025-06-03 12:13:35] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 2 ms to minimize.
[2025-06-03 12:13:35] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 2 ms to minimize.
[2025-06-03 12:13:36] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2025-06-03 12:13:37] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 2 ms to minimize.
[2025-06-03 12:13:37] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
[2025-06-03 12:13:37] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2025-06-03 12:13:40] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 1 ms to minimize.
[2025-06-03 12:13:40] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2025-06-03 12:13:40] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2025-06-03 12:13:40] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2025-06-03 12:13:40] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2025-06-03 12:13:40] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2025-06-03 12:13:40] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 1 ms to minimize.
[2025-06-03 12:13:40] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:13:50] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 2 ms to minimize.
[2025-06-03 12:13:51] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 2 ms to minimize.
[2025-06-03 12:13:51] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 2 ms to minimize.
[2025-06-03 12:13:52] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 2 ms to minimize.
[2025-06-03 12:13:52] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63616ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63631ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65742 ms. Remains : 296/296 places, 1531/1531 transitions.
[2025-06-03 12:13:55] [INFO ] Flatten gal took : 396 ms
RANDOM walk for 40000 steps (8 resets) in 1706 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
[2025-06-03 12:13:55] [INFO ] Flatten gal took : 219 ms
BEST_FIRST walk for 40003 steps (8 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
[2025-06-03 12:13:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11839692226549858619.gal : 36 ms
[2025-06-03 12:13:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17749615270537443044.prop : 2 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11839692226549858619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17749615270537443044.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 4/4 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17749615270537443044.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 16
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :16 after 40
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :40 after 59
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :59 after 123
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :123 after 529
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :529 after 719
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :719 after 3023
Interrupted probabilistic random walk after 224466 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 4
Probabilistic random walk after 224466 steps, saw 114786 distinct states, run finished after 3004 ms. (steps per millisecond=74 ) properties seen :0
[2025-06-03 12:13:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:13:59] [INFO ] Invariant cache hit.
[2025-06-03 12:13:59] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 234/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-03 12:13:59] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2025-06-03 12:13:59] [INFO ] Deduced a trap composed of 179 places in 116 ms of which 2 ms to minimize.
[2025-06-03 12:13:59] [INFO ] Deduced a trap composed of 182 places in 111 ms of which 1 ms to minimize.
[2025-06-03 12:13:59] [INFO ] Deduced a trap composed of 183 places in 107 ms of which 2 ms to minimize.
[2025-06-03 12:13:59] [INFO ] Deduced a trap composed of 177 places in 109 ms of which 1 ms to minimize.
[2025-06-03 12:13:59] [INFO ] Deduced a trap composed of 168 places in 126 ms of which 2 ms to minimize.
[2025-06-03 12:14:00] [INFO ] Deduced a trap composed of 172 places in 138 ms of which 2 ms to minimize.
[2025-06-03 12:14:00] [INFO ] Deduced a trap composed of 177 places in 124 ms of which 2 ms to minimize.
[2025-06-03 12:14:00] [INFO ] Deduced a trap composed of 172 places in 111 ms of which 2 ms to minimize.
[2025-06-03 12:14:00] [INFO ] Deduced a trap composed of 176 places in 106 ms of which 1 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :3023 after 5212
[2025-06-03 12:14:00] [INFO ] Deduced a trap composed of 168 places in 105 ms of which 2 ms to minimize.
[2025-06-03 12:14:00] [INFO ] Deduced a trap composed of 173 places in 114 ms of which 1 ms to minimize.
[2025-06-03 12:14:00] [INFO ] Deduced a trap composed of 161 places in 112 ms of which 1 ms to minimize.
[2025-06-03 12:14:00] [INFO ] Deduced a trap composed of 173 places in 113 ms of which 1 ms to minimize.
[2025-06-03 12:14:01] [INFO ] Deduced a trap composed of 168 places in 115 ms of which 2 ms to minimize.
[2025-06-03 12:14:01] [INFO ] Deduced a trap composed of 177 places in 113 ms of which 1 ms to minimize.
[2025-06-03 12:14:01] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 1 ms to minimize.
[2025-06-03 12:14:01] [INFO ] Deduced a trap composed of 177 places in 117 ms of which 2 ms to minimize.
[2025-06-03 12:14:01] [INFO ] Deduced a trap composed of 180 places in 106 ms of which 2 ms to minimize.
[2025-06-03 12:14:01] [INFO ] Deduced a trap composed of 184 places in 104 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-03 12:14:01] [INFO ] Deduced a trap composed of 161 places in 104 ms of which 2 ms to minimize.
[2025-06-03 12:14:01] [INFO ] Deduced a trap composed of 181 places in 112 ms of which 2 ms to minimize.
[2025-06-03 12:14:01] [INFO ] Deduced a trap composed of 179 places in 109 ms of which 2 ms to minimize.
[2025-06-03 12:14:02] [INFO ] Deduced a trap composed of 180 places in 108 ms of which 2 ms to minimize.
[2025-06-03 12:14:02] [INFO ] Deduced a trap composed of 160 places in 123 ms of which 2 ms to minimize.
[2025-06-03 12:14:02] [INFO ] Deduced a trap composed of 179 places in 115 ms of which 2 ms to minimize.
[2025-06-03 12:14:02] [INFO ] Deduced a trap composed of 174 places in 110 ms of which 2 ms to minimize.
[2025-06-03 12:14:02] [INFO ] Deduced a trap composed of 166 places in 110 ms of which 1 ms to minimize.
[2025-06-03 12:14:02] [INFO ] Deduced a trap composed of 174 places in 122 ms of which 1 ms to minimize.
[2025-06-03 12:14:02] [INFO ] Deduced a trap composed of 176 places in 120 ms of which 2 ms to minimize.
[2025-06-03 12:14:02] [INFO ] Deduced a trap composed of 181 places in 119 ms of which 2 ms to minimize.
[2025-06-03 12:14:03] [INFO ] Deduced a trap composed of 176 places in 109 ms of which 2 ms to minimize.
[2025-06-03 12:14:03] [INFO ] Deduced a trap composed of 174 places in 107 ms of which 1 ms to minimize.
[2025-06-03 12:14:03] [INFO ] Deduced a trap composed of 173 places in 109 ms of which 2 ms to minimize.
[2025-06-03 12:14:03] [INFO ] Deduced a trap composed of 180 places in 124 ms of which 1 ms to minimize.
[2025-06-03 12:14:03] [INFO ] Deduced a trap composed of 168 places in 111 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/255 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/293 variables, 21/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-03 12:14:03] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2025-06-03 12:14:04] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/938 variables, and 71 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 234/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-03 12:14:04] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2025-06-03 12:14:04] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2025-06-03 12:14:04] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 1 ms to minimize.
[2025-06-03 12:14:04] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 1 ms to minimize.
[2025-06-03 12:14:04] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/255 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 38/293 variables, 21/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-03 12:14:05] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 1 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :5212 after 20392
[2025-06-03 12:14:05] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/294 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 641/935 variables, 294/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/935 variables, 110/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/935 variables, 4/487 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2025-06-03 12:14:06] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 2 ms to minimize.
[2025-06-03 12:14:06] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2025-06-03 12:14:06] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 1 ms to minimize.
[2025-06-03 12:14:06] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 1 ms to minimize.
[2025-06-03 12:14:07] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2025-06-03 12:14:07] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2025-06-03 12:14:07] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/935 variables, 7/494 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/935 variables, 0/494 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/938 variables, 2/496 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/938 variables, 1/497 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/938 variables, 1/498 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/938 variables, 0/498 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/938 variables, 0/498 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 498 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3830 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 296/296 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 52/52 constraints]
After SMT, in 8882ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 105 ms.
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 79 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 296/296 places, 1531/1531 transitions.
RANDOM walk for 40000 steps (8 resets) in 384 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 290989 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 2
Probabilistic random walk after 290989 steps, saw 147399 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2025-06-03 12:14:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:14:11] [INFO ] Invariant cache hit.
[2025-06-03 12:14:11] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 244/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 12:14:11] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2025-06-03 12:14:11] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 1 ms to minimize.
[2025-06-03 12:14:11] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2025-06-03 12:14:12] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2025-06-03 12:14:12] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/255 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/293 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 641/935 variables, 294/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 110/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/938 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/938 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/938 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/938 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 447 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1328 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 296/296 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 244/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/255 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/293 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :20392 after 41601
At refinement iteration 10 (OVERLAPS) 641/935 variables, 294/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 110/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/935 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/938 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/938 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/938 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/938 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 449 constraints, problems are : Problem set: 0 solved, 2 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 296/296 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 2102ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 205 ms.
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 92 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 80 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-03 12:14:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:14:13] [INFO ] Invariant cache hit.
[2025-06-03 12:14:14] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-03 12:14:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:14:14] [INFO ] Invariant cache hit.
[2025-06-03 12:14:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:14:15] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
[2025-06-03 12:14:15] [INFO ] Redundant transitions in 22 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-03 12:14:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:14:15] [INFO ] Invariant cache hit.
[2025-06-03 12:14:15] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:14:28] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 3 ms to minimize.
[2025-06-03 12:14:29] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2025-06-03 12:14:36] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2025-06-03 12:14:36] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 2 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :41601 after 180136
[2025-06-03 12:14:37] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 1 ms to minimize.
[2025-06-03 12:14:37] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 2 ms to minimize.
[2025-06-03 12:14:37] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 2 ms to minimize.
[2025-06-03 12:14:38] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2025-06-03 12:14:38] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 2 ms to minimize.
[2025-06-03 12:14:38] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 2 ms to minimize.
[2025-06-03 12:14:39] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2025-06-03 12:14:39] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 2 ms to minimize.
[2025-06-03 12:14:41] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 2 ms to minimize.
[2025-06-03 12:14:42] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 2 ms to minimize.
[2025-06-03 12:14:42] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 2 ms to minimize.
[2025-06-03 12:14:42] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 2 ms to minimize.
[2025-06-03 12:14:42] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 2 ms to minimize.
[2025-06-03 12:14:42] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2025-06-03 12:14:43] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
[2025-06-03 12:14:43] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Detected timeout of ITS tools.
[2025-06-03 12:14:46] [INFO ] Flatten gal took : 78 ms
[2025-06-03 12:14:46] [INFO ] Applying decomposition
[2025-06-03 12:14:46] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph75553298475479365.txt' '-o' '/tmp/graph75553298475479365.bin' '-w' '/tmp/graph75553298475479365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph75553298475479365.bin' '-l' '-1' '-v' '-w' '/tmp/graph75553298475479365.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:14:46] [INFO ] Decomposing Gal with order
[2025-06-03 12:14:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:14:46] [INFO ] Removed a total of 313 redundant transitions.
[2025-06-03 12:14:46] [INFO ] Flatten gal took : 229 ms
[2025-06-03 12:14:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 15 ms.
[2025-06-03 12:14:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15982367939379804874.gal : 14 ms
[2025-06-03 12:14:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13027900285578971968.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15982367939379804874.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13027900285578971968.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13027900285578971968.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 24
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :24 after 44
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :44 after 75
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:14:51] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2025-06-03 12:14:51] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 1 ms to minimize.
[2025-06-03 12:14:51] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2025-06-03 12:15:00] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 2 ms to minimize.
[2025-06-03 12:15:00] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2025-06-03 12:15:00] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 2 ms to minimize.
[2025-06-03 12:15:01] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2025-06-03 12:15:01] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 2 ms to minimize.
[2025-06-03 12:15:02] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 1 ms to minimize.
[2025-06-03 12:15:02] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 1 ms to minimize.
[2025-06-03 12:15:05] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2025-06-03 12:15:05] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2025-06-03 12:15:05] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2025-06-03 12:15:05] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2025-06-03 12:15:05] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2025-06-03 12:15:05] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2025-06-03 12:15:05] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2025-06-03 12:15:06] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:15:15] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 2 ms to minimize.
[2025-06-03 12:15:17] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 2 ms to minimize.
[2025-06-03 12:15:17] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 5 ms to minimize.
[2025-06-03 12:15:17] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 2 ms to minimize.
[2025-06-03 12:15:17] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 64061ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66248 ms. Remains : 296/296 places, 1531/1531 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 889 transitions
Reduce isomorphic transitions removed 889 transitions.
Iterating post reduction 0 with 889 rules applied. Total rules applied 889 place count 296 transition count 642
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 979 place count 206 transition count 462
Iterating global reduction 1 with 90 rules applied. Total rules applied 1069 place count 206 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 1072 place count 204 transition count 461
Graph (trivial) has 31 edges and 204 vertex of which 12 / 204 are part of one of the 1 SCC in 2 ms
Free SCC test removed 11 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 1073 place count 193 transition count 461
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 1184 place count 193 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1204 place count 183 transition count 340
Applied a total of 1204 rules in 54 ms. Remains 183 /296 variables (removed 113) and now considering 340/1531 (removed 1191) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 340 rows 183 cols
[2025-06-03 12:15:20] [INFO ] Computed 34 invariants in 4 ms
[2025-06-03 12:15:20] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-03 12:15:20] [INFO ] [Real]Absence check using 13 positive and 21 generalized place invariants in 8 ms returned sat
[2025-06-03 12:15:20] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-03 12:15:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-03 12:15:20] [INFO ] [Nat]Absence check using 13 positive and 21 generalized place invariants in 15 ms returned sat
[2025-06-03 12:15:20] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-03 12:15:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 12:15:20] [INFO ] After 37ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-03 12:15:20] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-03 12:15:20] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-03 12:15:20] [INFO ] Flatten gal took : 16 ms
[2025-06-03 12:15:20] [INFO ] Flatten gal took : 14 ms
[2025-06-03 12:15:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13993149361837109653.gal : 3 ms
[2025-06-03 12:15:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1128265268627070911.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13993149361837109653.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1128265268627070911.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1128265268627070911.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 65
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :65 after 161
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :161 after 357
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :357 after 1047
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1047 after 3219
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3219 after 9265
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9265 after 27158
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :27158 after 71570
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :71570 after 102864
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :102864 after 332583
Detected timeout of ITS tools.
[2025-06-03 12:15:35] [INFO ] Flatten gal took : 15 ms
[2025-06-03 12:15:35] [INFO ] Applying decomposition
[2025-06-03 12:15:35] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8757735952660859586.txt' '-o' '/tmp/graph8757735952660859586.bin' '-w' '/tmp/graph8757735952660859586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8757735952660859586.bin' '-l' '-1' '-v' '-w' '/tmp/graph8757735952660859586.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:15:35] [INFO ] Decomposing Gal with order
[2025-06-03 12:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:15:35] [INFO ] Removed a total of 354 redundant transitions.
[2025-06-03 12:15:35] [INFO ] Flatten gal took : 37 ms
[2025-06-03 12:15:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 5 ms.
[2025-06-03 12:15:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3157637176151192574.gal : 3 ms
[2025-06-03 12:15:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5313597707051115499.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3157637176151192574.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5313597707051115499.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5313597707051115499.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 22
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :22 after 68
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :68 after 187
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :187 after 223
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :223 after 1263
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1263 after 2453
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2453 after 16426
Detected timeout of ITS tools.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :16426 after 24453
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :24453 after 84281
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30884 ms.
FORMULA SafeBus-COL-10-UpperBounds-13 9 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[9] Max Struct:[10]
Starting property specific reduction for SafeBus-COL-10-UpperBounds-15
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2025-06-03 12:15:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2025-06-03 12:15:50] [INFO ] Computed 35 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2 resets) in 51 ms. (192 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[10]
[2025-06-03 12:15:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:15:50] [INFO ] Invariant cache hit.
[2025-06-03 12:15:51] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 12:15:51] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 6 ms returned sat
[2025-06-03 12:15:51] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-06-03 12:15:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:15:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 12:15:51] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 6 ms returned sat
[2025-06-03 12:15:51] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2025-06-03 12:15:51] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:15:51] [INFO ] [Nat]Added 111 Read/Feed constraints in 244 ms returned sat
[2025-06-03 12:15:51] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 47 ms.
[2025-06-03 12:15:51] [INFO ] Added : 1 causal constraints over 1 iterations in 130 ms. Result :sat
Minimization took 632 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[10]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 87 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 296/296 places, 1531/1531 transitions.
[2025-06-03 12:15:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:15:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[10]
RANDOM walk for 1000000 steps (2 resets) in 4370 ms. (228 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1532 ms. (652 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[10]
[2025-06-03 12:15:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:15:58] [INFO ] Invariant cache hit.
[2025-06-03 12:15:58] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 12:15:58] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 6 ms returned sat
[2025-06-03 12:15:58] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-06-03 12:15:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:15:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 12:15:58] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 14 ms returned sat
[2025-06-03 12:15:58] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2025-06-03 12:15:58] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:15:59] [INFO ] [Nat]Added 111 Read/Feed constraints in 248 ms returned sat
[2025-06-03 12:15:59] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 46 ms.
[2025-06-03 12:15:59] [INFO ] Added : 1 causal constraints over 1 iterations in 136 ms. Result :sat
Minimization took 1156 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[10]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 79 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 79 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-03 12:16:00] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:16:00] [INFO ] Invariant cache hit.
[2025-06-03 12:16:01] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-06-03 12:16:01] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:16:01] [INFO ] Invariant cache hit.
[2025-06-03 12:16:01] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:16:02] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2025-06-03 12:16:02] [INFO ] Redundant transitions in 24 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-03 12:16:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:16:02] [INFO ] Invariant cache hit.
[2025-06-03 12:16:02] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:16:14] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 2 ms to minimize.
[2025-06-03 12:16:15] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2025-06-03 12:16:23] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 2 ms to minimize.
[2025-06-03 12:16:23] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2025-06-03 12:16:23] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 2 ms to minimize.
[2025-06-03 12:16:24] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2025-06-03 12:16:24] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2025-06-03 12:16:25] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 2 ms to minimize.
[2025-06-03 12:16:25] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 2 ms to minimize.
[2025-06-03 12:16:25] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 2 ms to minimize.
[2025-06-03 12:16:25] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 2 ms to minimize.
[2025-06-03 12:16:26] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 1 ms to minimize.
[2025-06-03 12:16:28] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 1 ms to minimize.
[2025-06-03 12:16:28] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 2 ms to minimize.
[2025-06-03 12:16:29] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 2 ms to minimize.
[2025-06-03 12:16:29] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 2 ms to minimize.
[2025-06-03 12:16:29] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 1 ms to minimize.
[2025-06-03 12:16:29] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 2 ms to minimize.
[2025-06-03 12:16:30] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 2 ms to minimize.
[2025-06-03 12:16:30] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:16:37] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
[2025-06-03 12:16:38] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 2 ms to minimize.
[2025-06-03 12:16:38] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2025-06-03 12:16:46] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 2 ms to minimize.
[2025-06-03 12:16:47] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2025-06-03 12:16:47] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2025-06-03 12:16:48] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 1 ms to minimize.
[2025-06-03 12:16:48] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 2 ms to minimize.
[2025-06-03 12:16:48] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2025-06-03 12:16:48] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2025-06-03 12:16:51] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2025-06-03 12:16:51] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2025-06-03 12:16:51] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2025-06-03 12:16:51] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2025-06-03 12:16:52] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2025-06-03 12:16:52] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2025-06-03 12:16:52] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2025-06-03 12:16:52] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:17:02] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 2 ms to minimize.
[2025-06-03 12:17:03] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 1 ms to minimize.
[2025-06-03 12:17:03] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 2 ms to minimize.
[2025-06-03 12:17:03] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 2 ms to minimize.
[2025-06-03 12:17:03] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63618ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63631ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65770 ms. Remains : 296/296 places, 1531/1531 transitions.
[2025-06-03 12:17:06] [INFO ] Flatten gal took : 137 ms
RANDOM walk for 40000 steps (8 resets) in 411 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
[2025-06-03 12:17:06] [INFO ] Flatten gal took : 95 ms
[2025-06-03 12:17:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15926648796788612888.gal : 18 ms
[2025-06-03 12:17:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6440687609758553336.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15926648796788612888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6440687609758553336.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6440687609758553336.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 16
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :16 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 59
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :59 after 123
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :123 after 529
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :529 after 719
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :719 after 3023
Interrupted probabilistic random walk after 288378 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 2
Probabilistic random walk after 288378 steps, saw 146163 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2025-06-03 12:17:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:17:09] [INFO ] Invariant cache hit.
[2025-06-03 12:17:09] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 244/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 12:17:10] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2025-06-03 12:17:10] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
[2025-06-03 12:17:10] [INFO ] Deduced a trap composed of 41 places in 289 ms of which 1 ms to minimize.
[2025-06-03 12:17:10] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2025-06-03 12:17:10] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3023 after 5212
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/255 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/293 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 641/935 variables, 294/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 110/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/938 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/938 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/938 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/938 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 447 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 296/296 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 244/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/255 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/293 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 641/935 variables, 294/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 110/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/935 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/938 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/938 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/938 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/938 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 449 constraints, problems are : Problem set: 0 solved, 2 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 296/296 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 2302ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 79 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 296/296 places, 1531/1531 transitions.
RANDOM walk for 40000 steps (8 resets) in 374 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5212 after 20392
Interrupted probabilistic random walk after 289531 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 2
Probabilistic random walk after 289531 steps, saw 146696 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2025-06-03 12:17:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:17:15] [INFO ] Invariant cache hit.
[2025-06-03 12:17:15] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 244/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 12:17:15] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2025-06-03 12:17:16] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 1 ms to minimize.
[2025-06-03 12:17:16] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2025-06-03 12:17:16] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2025-06-03 12:17:16] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/255 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/293 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 641/935 variables, 294/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 110/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/938 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/938 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/938 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/938 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 447 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 296/296 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 244/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/255 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/293 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 641/935 variables, 294/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 110/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/935 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/938 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/938 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/938 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/938 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 449 constraints, problems are : Problem set: 0 solved, 2 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 296/296 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1965ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 110 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 89 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-03 12:17:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:17:18] [INFO ] Invariant cache hit.
[2025-06-03 12:17:18] [INFO ] Implicit Places using invariants in 371 ms returned []
[2025-06-03 12:17:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:17:18] [INFO ] Invariant cache hit.
[2025-06-03 12:17:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 12:17:20] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
[2025-06-03 12:17:20] [INFO ] Redundant transitions in 24 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-03 12:17:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 12:17:20] [INFO ] Invariant cache hit.
[2025-06-03 12:17:20] [INFO ] State equation strengthened by 111 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :20392 after 41601
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:17:32] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 2 ms to minimize.
[2025-06-03 12:17:34] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2025-06-03 12:17:41] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 2 ms to minimize.
[2025-06-03 12:17:41] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 2 ms to minimize.
[2025-06-03 12:17:42] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 1 ms to minimize.
[2025-06-03 12:17:42] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 2 ms to minimize.
[2025-06-03 12:17:42] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 1 ms to minimize.
[2025-06-03 12:17:43] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2025-06-03 12:17:43] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2025-06-03 12:17:43] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 2 ms to minimize.
[2025-06-03 12:17:44] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 1 ms to minimize.
[2025-06-03 12:17:44] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 2 ms to minimize.
[2025-06-03 12:17:46] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 1 ms to minimize.
[2025-06-03 12:17:47] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 1 ms to minimize.
[2025-06-03 12:17:47] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 2 ms to minimize.
[2025-06-03 12:17:47] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 2 ms to minimize.
[2025-06-03 12:17:47] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 2 ms to minimize.
[2025-06-03 12:17:48] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2025-06-03 12:17:48] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2025-06-03 12:17:48] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :41601 after 180136
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 12:17:56] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 1 ms to minimize.
[2025-06-03 12:17:56] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 1 ms to minimize.
[2025-06-03 12:17:56] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-06-03 12:17:57] [INFO ] Flatten gal took : 55 ms
[2025-06-03 12:17:57] [INFO ] Applying decomposition
[2025-06-03 12:17:57] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3134584155870822682.txt' '-o' '/tmp/graph3134584155870822682.bin' '-w' '/tmp/graph3134584155870822682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3134584155870822682.bin' '-l' '-1' '-v' '-w' '/tmp/graph3134584155870822682.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:17:57] [INFO ] Decomposing Gal with order
[2025-06-03 12:17:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:17:57] [INFO ] Removed a total of 336 redundant transitions.
[2025-06-03 12:17:57] [INFO ] Flatten gal took : 114 ms
[2025-06-03 12:17:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 373 labels/synchronizations in 32 ms.
[2025-06-03 12:17:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2204324164036731129.gal : 8 ms
[2025-06-03 12:17:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4928013956226191425.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2204324164036731129.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4928013956226191425.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4928013956226191425.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5861
[2025-06-03 12:18:05] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 2 ms to minimize.
[2025-06-03 12:18:05] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 2 ms to minimize.
[2025-06-03 12:18:05] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2025-06-03 12:18:07] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2025-06-03 12:18:07] [INFO ] Deduced a trap composed of 49 places in 343 ms of which 2 ms to minimize.
[2025-06-03 12:18:08] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2025-06-03 12:18:08] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 2 ms to minimize.
[2025-06-03 12:18:10] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2025-06-03 12:18:10] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 2 ms to minimize.
[2025-06-03 12:18:11] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2025-06-03 12:18:11] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 1 ms to minimize.
[2025-06-03 12:18:11] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2025-06-03 12:18:11] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2025-06-03 12:18:11] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 1 ms to minimize.
[2025-06-03 12:18:11] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5861 after 187301
[2025-06-03 12:18:22] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 2 ms to minimize.
[2025-06-03 12:18:23] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 2 ms to minimize.
[2025-06-03 12:18:23] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 2 ms to minimize.
[2025-06-03 12:18:23] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 1 ms to minimize.
[2025-06-03 12:18:23] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 64312ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64328ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66553 ms. Remains : 296/296 places, 1531/1531 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 889 transitions
Reduce isomorphic transitions removed 889 transitions.
Iterating post reduction 0 with 889 rules applied. Total rules applied 889 place count 296 transition count 642
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 979 place count 206 transition count 462
Iterating global reduction 1 with 90 rules applied. Total rules applied 1069 place count 206 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 1072 place count 204 transition count 461
Graph (trivial) has 31 edges and 204 vertex of which 12 / 204 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 1073 place count 193 transition count 461
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 1184 place count 193 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1204 place count 183 transition count 340
Applied a total of 1204 rules in 21 ms. Remains 183 /296 variables (removed 113) and now considering 340/1531 (removed 1191) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 340 rows 183 cols
[2025-06-03 12:18:24] [INFO ] Computed 34 invariants in 2 ms
[2025-06-03 12:18:24] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-03 12:18:24] [INFO ] [Real]Absence check using 13 positive and 21 generalized place invariants in 8 ms returned sat
[2025-06-03 12:18:24] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-03 12:18:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-03 12:18:24] [INFO ] [Nat]Absence check using 13 positive and 21 generalized place invariants in 15 ms returned sat
[2025-06-03 12:18:25] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-03 12:18:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 12:18:25] [INFO ] After 31ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-03 12:18:25] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-03 12:18:25] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-03 12:18:25] [INFO ] Flatten gal took : 11 ms
[2025-06-03 12:18:25] [INFO ] Flatten gal took : 11 ms
[2025-06-03 12:18:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6582459531341050973.gal : 2 ms
[2025-06-03 12:18:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6576306723116894839.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6582459531341050973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6576306723116894839.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6576306723116894839.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 65
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :65 after 161
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :161 after 357
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :357 after 1047
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1047 after 3219
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3219 after 9265
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9265 after 27158
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :27158 after 71570
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :71570 after 102864
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :102864 after 332583
Detected timeout of ITS tools.
[2025-06-03 12:18:40] [INFO ] Flatten gal took : 18 ms
[2025-06-03 12:18:40] [INFO ] Applying decomposition
[2025-06-03 12:18:40] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12400492081734670998.txt' '-o' '/tmp/graph12400492081734670998.bin' '-w' '/tmp/graph12400492081734670998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12400492081734670998.bin' '-l' '-1' '-v' '-w' '/tmp/graph12400492081734670998.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:18:40] [INFO ] Decomposing Gal with order
[2025-06-03 12:18:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:18:40] [INFO ] Removed a total of 159 redundant transitions.
[2025-06-03 12:18:40] [INFO ] Flatten gal took : 27 ms
[2025-06-03 12:18:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 8 ms.
[2025-06-03 12:18:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8888193509729539946.gal : 3 ms
[2025-06-03 12:18:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10944831643840204141.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8888193509729539946.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10944831643840204141.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10944831643840204141.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 31
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :31 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 89
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :89 after 206
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :206 after 500
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :500 after 1588
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1588 after 4348
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4348 after 25026
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :25026 after 68443
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :68443 after 115926
Detected timeout of ITS tools.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :115926 after 401354
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30794 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[9] Max Struct:[10]
Ending property specific reduction for SafeBus-COL-10-UpperBounds-15 in 184525 ms.
[2025-06-03 12:18:55] [INFO ] Flatten gal took : 49 ms
[2025-06-03 12:18:55] [INFO ] Applying decomposition
[2025-06-03 12:18:55] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2208191496946880750.txt' '-o' '/tmp/graph2208191496946880750.bin' '-w' '/tmp/graph2208191496946880750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2208191496946880750.bin' '-l' '-1' '-v' '-w' '/tmp/graph2208191496946880750.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:18:55] [INFO ] Decomposing Gal with order
[2025-06-03 12:18:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:18:55] [INFO ] Removed a total of 2472 redundant transitions.
[2025-06-03 12:18:55] [INFO ] Flatten gal took : 169 ms
[2025-06-03 12:18:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 663 labels/synchronizations in 37 ms.
[2025-06-03 12:18:55] [INFO ] Time to serialize gal into /tmp/UpperBounds8855920205437103566.gal : 6 ms
[2025-06-03 12:18:55] [INFO ] Time to serialize properties into /tmp/UpperBounds16444186752047787886.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8855920205437103566.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16444186752047787886.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds16444186752047787886.prop.
ITS-tools command line returned an error code 137
[2025-06-03 12:26:58] [INFO ] Applying decomposition
[2025-06-03 12:26:58] [INFO ] Flatten gal took : 52 ms
[2025-06-03 12:26:58] [INFO ] Decomposing Gal with order
[2025-06-03 12:26:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:26:58] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cable_free in partition [AMC_0],[AMC_1, wait_ack_1],[AMC_2, wait_ack_2],[AMC_3, wait_ack_3],[AMC_4, wait_ack_4],[AMC_5, wait_ack_5],[AMC_6, wait_ack_6],[AMC_7, wait_ack_7],[AMC_8, wait_ack_8],[AMC_9, wait_ack_9],[AMC_10, wait_ack_10],[AMC_11],[AMC_12, wait_ack_12],[AMC_13, wait_ack_13],[AMC_14, wait_ack_14],[AMC_15, wait_ack_15],[AMC_16, wait_ack_16],[AMC_17, wait_ack_17],[AMC_18, wait_ack_18],[AMC_19, wait_ack_19],[AMC_20, wait_ack_20],[AMC_21, wait_ack_21],[AMC_22],[AMC_23, wait_ack_23],[AMC_24, wait_ack_24],[AMC_25, wait_ack_25],[AMC_26, wait_ack_26],[AMC_27, wait_ack_27],[AMC_28, wait_ack_28],[AMC_29, wait_ack_29],[AMC_30, wait_ack_30],[AMC_31, wait_ack_31],[AMC_32, wait_ack_32],[AMC_33],[AMC_34, wait_ack_34],[AMC_35, wait_ack_35],[AMC_36, wait_ack_36],[AMC_37, wait_ack_37],[AMC_38, wait_ack_38],[AMC_39, wait_ack_39],[AMC_40, wait_ack_40],[AMC_41, wait_ack_41],[AMC_42, wait_ack_42],[AMC_43, wait_ack_43],[AMC_44],[AMC_45, wait_ack_45],[AMC_46, wait_ack_46],[AMC_47, wait_ack_47],[AMC_48, wait_ack_48],[AMC_49, wait_ack_49],[AMC_50, wait_ack_50],[AMC_51, wait_ack_51],[AMC_52, wait_ack_52],[AMC_53, wait_ack_53],[AMC_54, wait_ack_54],[AMC_55],[AMC_56, wait_ack_56],[AMC_57, wait_ack_57],[AMC_58, wait_ack_58],[AMC_59, wait_ack_59],[AMC_60, wait_ack_60],[AMC_61, wait_ack_61],[AMC_62, wait_ack_62],[AMC_63, wait_ack_63],[AMC_64, wait_ack_64],[AMC_65, wait_ack_65],[AMC_66],[AMC_67, wait_ack_67],[AMC_68, wait_ack_68],[AMC_69, wait_ack_69],[AMC_70, wait_ack_70],[AMC_71, wait_ack_71],[AMC_72, wait_ack_72],[AMC_73, wait_ack_73],[AMC_74, wait_ack_74],[AMC_75, wait_ack_75],[AMC_76, wait_ack_76],[AMC_77],[AMC_78, wait_ack_78],[AMC_79, wait_ack_79],[AMC_80, wait_ack_80],[AMC_81, wait_ack_81],[AMC_82, wait_ack_82],[AMC_83, wait_ack_83],[AMC_84, wait_ack_84],[AMC_85, wait_ack_85],[AMC_86, wait_ack_86],[AMC_87, wait_ack_87],[AMC_88],[AMC_89, wait_ack_89],[AMC_90, wait_ack_90],[AMC_91, wait_ack_91],[AMC_92, wait_ack_92],[AMC_93, wait_ack_93],[AMC_94, wait_ack_94],[AMC_95, wait_ack_95],[AMC_96, wait_ack_96],[AMC_97, wait_ack_97],[AMC_98, wait_ack_98],[AMC_99],[Cpt2_0, Cpt1_0, cable_used_0, FMC_0, listen_0, RMC_0, PMC_0, MSG_0, wait_msg_0, loop_em_0],[Cpt2_1, Cpt1_1, cable_used_1, FMC_1, listen_1, RMC_1, PMC_1, MSG_1, wait_msg_1, loop_em_1],[Cpt2_2, Cpt1_2, cable_used_2, FMC_2, listen_2, RMC_2, PMC_2, MSG_2, wait_msg_2, loop_em_2],[Cpt2_3, Cpt1_3, cable_used_3, FMC_3, listen_3, RMC_3, PMC_3, MSG_3, wait_msg_3, loop_em_3],[Cpt2_4, Cpt1_4, cable_used_4, FMC_4, listen_4, RMC_4, PMC_4, MSG_4, wait_msg_4, loop_em_4],[Cpt2_5, Cpt1_5, cable_used_5, FMC_5, listen_5, RMC_5, PMC_5, MSG_5, wait_msg_5, loop_em_5],[Cpt2_6, Cpt1_6, cable_used_6, FMC_6, listen_6, RMC_6, PMC_6, MSG_6, wait_msg_6, loop_em_6],[Cpt2_7, Cpt1_7, cable_used_7, FMC_7, listen_7, RMC_7, PMC_7, MSG_7, wait_msg_7, loop_em_7],[Cpt2_8, Cpt1_8, cable_used_8, FMC_8, listen_8, RMC_8, PMC_8, MSG_8, wait_msg_8, loop_em_8],[Cpt2_9, Cpt1_9, cable_used_9, FMC_9, listen_9, RMC_9, PMC_9, MSG_9, wait_msg_9, loop_em_9],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-03 12:26:58] [INFO ] Flatten gal took : 53 ms
[2025-06-03 12:26:58] [INFO ] Time to serialize gal into /tmp/UpperBounds9342066723754725212.gal : 8 ms
[2025-06-03 12:26:58] [INFO ] Time to serialize properties into /tmp/UpperBounds18155879779669597773.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9342066723754725212.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18155879779669597773.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds18155879779669597773.prop.
ITS-tools command line returned an error code 137
[2025-06-03 12:34:25] [INFO ] Flatten gal took : 74 ms
[2025-06-03 12:34:25] [INFO ] Input system was already deterministic with 1531 transitions.
[2025-06-03 12:34:25] [INFO ] Transformed 296 places.
[2025-06-03 12:34:25] [INFO ] Transformed 1531 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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
[2025-06-03 12:34:55] [INFO ] Time to serialize gal into /tmp/UpperBounds9285415269650629777.gal : 8 ms
[2025-06-03 12:34:55] [INFO ] Time to serialize properties into /tmp/UpperBounds13925606971775034532.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9285415269650629777.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13925606971775034532.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13925606971775034532.prop.
ITS-tools command line returned an error code 137
Total runtime 1901272 ms.

BK_STOP 1748954542779

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="SafeBus-COL-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is SafeBus-COL-10, 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 r195-tall-174889278200091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 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 ;