Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r195-tall-174889278300092.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-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r195-tall-174889278300092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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-15-UpperBounds-00
FORMULA_NAME SafeBus-COL-15-UpperBounds-01
FORMULA_NAME SafeBus-COL-15-UpperBounds-02
FORMULA_NAME SafeBus-COL-15-UpperBounds-03
FORMULA_NAME SafeBus-COL-15-UpperBounds-04
FORMULA_NAME SafeBus-COL-15-UpperBounds-05
FORMULA_NAME SafeBus-COL-15-UpperBounds-06
FORMULA_NAME SafeBus-COL-15-UpperBounds-07
FORMULA_NAME SafeBus-COL-15-UpperBounds-08
FORMULA_NAME SafeBus-COL-15-UpperBounds-09
FORMULA_NAME SafeBus-COL-15-UpperBounds-10
FORMULA_NAME SafeBus-COL-15-UpperBounds-11
FORMULA_NAME SafeBus-COL-15-UpperBounds-12
FORMULA_NAME SafeBus-COL-15-UpperBounds-13
FORMULA_NAME SafeBus-COL-15-UpperBounds-14
FORMULA_NAME SafeBus-COL-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748952642189

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-03 12:10:43] [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:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 12:10:43] [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:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 12:10:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 568 ms
[2025-06-03 12:10:44] [INFO ] Detected 1 constant HL places corresponding to 15 PT places.
[2025-06-03 12:10:44] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 636 PT places and 59206.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2025-06-03 12:10:44] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2025-06-03 12:10:44] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2025-06-03 12:10:44] [INFO ] Computed 7 invariants in 12 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 15, 1, 0] Max Struct:[1, 15, 1, 5, 15, 1, 3, 15, 15, 1, 1, 1, 15, 15, 1, 1]
FORMULA SafeBus-COL-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-13 15 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-03 12:10:44] [INFO ] Invariant cache hit.
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 12:10:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 12:10:44] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[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 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:44] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:44] [INFO ] Added : 12 causal constraints over 5 iterations in 25 ms. Result :sat
Minimization took 10 ms.
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Added 3 Read/Feed constraints in 2 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 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:44] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:44] [INFO ] Added : 8 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Added 3 Read/Feed constraints in 1 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 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:44] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:44] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Added 3 Read/Feed constraints in 0 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 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:44] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:44] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:44] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[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 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:44] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:44] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:44] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:44] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:45] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:45] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Added 3 Read/Feed constraints in 1 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 4 positive place invariants in 5 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:45] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Added 3 Read/Feed constraints in 0 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 4 positive place invariants in 32 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 11 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:45] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 9 ms.
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:45] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[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 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:45] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Added 3 Read/Feed constraints in 1 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 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:45] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Added 3 Read/Feed constraints in 0 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 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:45] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Real]Added 3 Read/Feed constraints in 1 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 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:45] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:45] [INFO ] Added : 9 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 15, 5, 15, 1, 3, 15, 15, 1, 1, 15, 1]
Domain [It(15), It(15)] of place AMC breaks symmetries in sort It
[2025-06-03 12:10:45] [INFO ] Unfolded HLPN to a Petri net with 636 places and 4801 transitions 34264 arcs in 100 ms.
[2025-06-03 12:10:45] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 30 places and 30 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 15, 5, 15, 1, 3, 15, 15, 1, 1, 15, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 15, 5, 15, 1, 3, 15, 15, 1, 1, 15, 1]
[2025-06-03 12:10:45] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2025-06-03 12:10:45] [INFO ] Computed 65 invariants in 77 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 15, 5, 15, 1, 3, 15, 15, 1, 1, 15, 1]
RANDOM walk for 10000 steps (2 resets) in 378 ms. (26 steps per ms)
FORMULA SafeBus-COL-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-07 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-04 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 254 ms. (196 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 1, 14, 14] Max Struct:[15, 5, 3, 15, 15]
[2025-06-03 12:10:46] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-03 12:10:46] [INFO ] Invariant cache hit.
[2025-06-03 12:10:46] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2025-06-03 12:10:46] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2025-06-03 12:10:47] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2025-06-03 12:10:47] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-03 12:10:47] [INFO ] [Real]Added 241 Read/Feed constraints in 93 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 31 positive place invariants in 13 ms returned sat
[2025-06-03 12:10:47] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2025-06-03 12:10:47] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2025-06-03 12:10:48] [INFO ] [Nat]Added 241 Read/Feed constraints in 534 ms returned sat
[2025-06-03 12:10:48] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 272 ms.
[2025-06-03 12:10:48] [INFO ] Added : 0 causal constraints over 0 iterations in 406 ms. Result :sat
Minimization took 921 ms.
[2025-06-03 12:10:49] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2025-06-03 12:10:49] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned unsat
[2025-06-03 12:10:50] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2025-06-03 12:10:50] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 11 ms returned unsat
[2025-06-03 12:10:50] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-03 12:10:50] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 20 ms returned sat
[2025-06-03 12:10:50] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2025-06-03 12:10:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-03 12:10:50] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 32 ms returned sat
[2025-06-03 12:10:51] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2025-06-03 12:10:51] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:10:52] [INFO ] [Nat]Added 241 Read/Feed constraints in 1056 ms returned unknown
[2025-06-03 12:10:52] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2025-06-03 12:10:52] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 16 ms returned sat
[2025-06-03 12:10:52] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2025-06-03 12:10:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-03 12:10:52] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2025-06-03 12:10:53] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2025-06-03 12:10:53] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:10:54] [INFO ] [Nat]Added 241 Read/Feed constraints in 1067 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 1, 14, 14] Max Struct:[15, 1, 1, 15, 15]
FORMULA SafeBus-COL-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 14, 14] Max Struct:[15, 15, 15]
Support contains 45 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1239 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1261 ms. Remains : 606/606 places, 4771/4771 transitions.
[2025-06-03 12:10:55] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-03 12:10:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 14, 14] Max Struct:[15, 15, 15]
RANDOM walk for 1000000 steps (2 resets) in 12800 ms. (78 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 8131 ms. (368 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 14, 14] Max Struct:[15, 15, 15]
[2025-06-03 12:11:16] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-03 12:11:16] [INFO ] Invariant cache hit.
[2025-06-03 12:11:16] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-03 12:11:16] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 17 ms returned sat
[2025-06-03 12:11:17] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2025-06-03 12:11:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2025-06-03 12:11:17] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2025-06-03 12:11:17] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2025-06-03 12:11:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-03 12:11:19] [INFO ] [Nat]Added 241 Read/Feed constraints in 1175 ms returned sat
[2025-06-03 12:11:19] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 183 ms.
[2025-06-03 12:11:19] [INFO ] Added : 0 causal constraints over 0 iterations in 300 ms. Result :sat
Minimization took 3148 ms.
[2025-06-03 12:11:22] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-03 12:11:22] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 16 ms returned sat
[2025-06-03 12:11:23] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2025-06-03 12:11:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-03 12:11:23] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 16 ms returned sat
[2025-06-03 12:11:23] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-06-03 12:11:25] [INFO ] [Nat]Added 241 Read/Feed constraints in 1538 ms returned sat
[2025-06-03 12:11:25] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 173 ms.
[2025-06-03 12:11:25] [INFO ] Added : 0 causal constraints over 0 iterations in 282 ms. Result :sat
Minimization took 3735 ms.
[2025-06-03 12:11:29] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2025-06-03 12:11:29] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2025-06-03 12:11:30] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2025-06-03 12:11:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2025-06-03 12:11:30] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 16 ms returned sat
[2025-06-03 12:11:30] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2025-06-03 12:11:35] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:11:37] [INFO ] [Nat]Added 241 Read/Feed constraints in 6481 ms returned sat
[2025-06-03 12:11:37] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 181 ms.
[2025-06-03 12:11:37] [INFO ] Added : 0 causal constraints over 0 iterations in 312 ms. Result :sat
Minimization took 3776 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11, 14, 14] Max Struct:[15, 15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 14, 14] Max Struct:[15, 15, 15]
Support contains 45 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 979 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 979 ms. Remains : 606/606 places, 4771/4771 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1125 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2025-06-03 12:11:45] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-03 12:11:45] [INFO ] Invariant cache hit.
[2025-06-03 12:11:46] [INFO ] Implicit Places using invariants in 1292 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1305 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 591/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1156 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3588 ms. Remains : 591/606 places, 4771/4771 transitions.
[2025-06-03 12:11:47] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2025-06-03 12:11:47] [INFO ] Computed 50 invariants in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[11, 14, 14] Max Struct:[15, 15, 15]
RANDOM walk for 1000000 steps (2 resets) in 12193 ms. (82 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 7794 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 14, 14] Max Struct:[15, 15, 15]
[2025-06-03 12:12:07] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-03 12:12:07] [INFO ] Invariant cache hit.
[2025-06-03 12:12:07] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2025-06-03 12:12:07] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2025-06-03 12:12:08] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2025-06-03 12:12:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:12:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 12:12:08] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2025-06-03 12:12:09] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2025-06-03 12:12:09] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-03 12:12:10] [INFO ] [Nat]Added 241 Read/Feed constraints in 1194 ms returned sat
[2025-06-03 12:12:10] [INFO ] Deduced a trap composed of 172 places in 604 ms of which 32 ms to minimize.
[2025-06-03 12:12:11] [INFO ] Deduced a trap composed of 153 places in 630 ms of which 6 ms to minimize.
[2025-06-03 12:12:12] [INFO ] Deduced a trap composed of 204 places in 522 ms of which 4 ms to minimize.
[2025-06-03 12:12:12] [INFO ] Deduced a trap composed of 202 places in 506 ms of which 3 ms to minimize.
[2025-06-03 12:12:13] [INFO ] Deduced a trap composed of 204 places in 522 ms of which 3 ms to minimize.
[2025-06-03 12:12:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 3076 ms
[2025-06-03 12:12:13] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 12:12:13] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned sat
[2025-06-03 12:12:13] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2025-06-03 12:12:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:12:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 12:12:14] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2025-06-03 12:12:14] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2025-06-03 12:12:18] [INFO ] [Nat]Added 241 Read/Feed constraints in 3587 ms returned sat
[2025-06-03 12:12:18] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 151 ms.
[2025-06-03 12:12:18] [INFO ] Added : 0 causal constraints over 0 iterations in 258 ms. Result :sat
Minimization took 5475 ms.
[2025-06-03 12:12:24] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-03 12:12:24] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2025-06-03 12:12:24] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2025-06-03 12:12:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:12:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 12:12:24] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2025-06-03 12:12:25] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2025-06-03 12:12:28] [INFO ] [Nat]Added 241 Read/Feed constraints in 3230 ms returned sat
[2025-06-03 12:12:28] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 171 ms.
[2025-06-03 12:12:28] [INFO ] Added : 1 causal constraints over 1 iterations in 345 ms. Result :sat
Minimization took 5230 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 14, 14] Max Struct:[14, 15, 15]
FORMULA SafeBus-COL-15-UpperBounds-01 14 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 14] Max Struct:[15, 15]
Support contains 30 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 1022 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1022 ms. Remains : 591/591 places, 4771/4771 transitions.
[2025-06-03 12:12:34] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-03 12:12:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[14, 14] Max Struct:[15, 15]
RANDOM walk for 1000000 steps (2 resets) in 11844 ms. (84 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 5385 ms. (371 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 14] Max Struct:[15, 15]
[2025-06-03 12:12:52] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-03 12:12:52] [INFO ] Invariant cache hit.
[2025-06-03 12:12:52] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 12:12:52] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2025-06-03 12:12:52] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2025-06-03 12:12:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:12:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 12:12:52] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2025-06-03 12:12:53] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2025-06-03 12:12:53] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-03 12:12:56] [INFO ] [Nat]Added 241 Read/Feed constraints in 3436 ms returned sat
[2025-06-03 12:12:57] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 216 ms.
[2025-06-03 12:12:57] [INFO ] Added : 0 causal constraints over 0 iterations in 325 ms. Result :sat
Minimization took 6331 ms.
[2025-06-03 12:13:03] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 12:13:03] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2025-06-03 12:13:04] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2025-06-03 12:13:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:13:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 12:13:04] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 22 ms returned sat
[2025-06-03 12:13:04] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2025-06-03 12:13:08] [INFO ] [Nat]Added 241 Read/Feed constraints in 3150 ms returned sat
[2025-06-03 12:13:08] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 151 ms.
[2025-06-03 12:13:08] [INFO ] Added : 1 causal constraints over 1 iterations in 320 ms. Result :sat
Minimization took 6400 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 14] Max Struct:[15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 14] Max Struct:[15, 15]
Support contains 30 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 926 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 926 ms. Remains : 591/591 places, 4771/4771 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 926 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2025-06-03 12:13:16] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-03 12:13:16] [INFO ] Invariant cache hit.
[2025-06-03 12:13:17] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2025-06-03 12:13:17] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-03 12:13:17] [INFO ] Invariant cache hit.
[2025-06-03 12:13:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-03 12:13:24] [INFO ] Implicit Places using invariants and state equation in 6404 ms returned []
Implicit Place search using SMT with State Equation took 7591 ms to find 0 implicit places.
[2025-06-03 12:13:24] [INFO ] Redundant transitions in 377 ms returned []
Running 4756 sub problems to find dead transitions.
[2025-06-03 12:13:24] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-03 12:13:24] [INFO ] Invariant cache hit.
[2025-06-03 12:13:24] [INFO ] State equation strengthened by 241 read => feed constraints.
Problem TDEAD211 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2911 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3361 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 15 solved, 4741 unsolved
SMT process timed out in 59791ms, After SMT, problems are : Problem set: 15 solved, 4741 unsolved
Search for dead transitions found 15 dead transitions in 59869ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 591/591 places, 4756/4771 transitions.
Applied a total of 0 rules in 964 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2025-06-03 12:14:25] [INFO ] Redundant transitions in 289 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70072 ms. Remains : 591/591 places, 4756/4771 transitions.
[2025-06-03 12:14:25] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:14:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[14, 14] Max Struct:[15, 15]
RANDOM walk for 1000000 steps (2 resets) in 11668 ms. (85 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 5408 ms. (369 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 14] Max Struct:[15, 15]
[2025-06-03 12:14:42] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:14:42] [INFO ] Invariant cache hit.
[2025-06-03 12:14:42] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2025-06-03 12:14:42] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2025-06-03 12:14:43] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2025-06-03 12:14:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:14:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 12:14:43] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2025-06-03 12:14:44] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2025-06-03 12:14:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-03 12:14:46] [INFO ] [Nat]Added 241 Read/Feed constraints in 2333 ms returned sat
[2025-06-03 12:14:46] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 165 ms.
[2025-06-03 12:14:46] [INFO ] Added : 0 causal constraints over 0 iterations in 275 ms. Result :sat
Minimization took 6383 ms.
[2025-06-03 12:14:53] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-03 12:14:53] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2025-06-03 12:14:53] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2025-06-03 12:14:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:14:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 12:14:53] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2025-06-03 12:14:54] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2025-06-03 12:14:58] [INFO ] [Nat]Added 241 Read/Feed constraints in 3855 ms returned sat
[2025-06-03 12:14:58] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 173 ms.
[2025-06-03 12:14:58] [INFO ] Added : 0 causal constraints over 0 iterations in 287 ms. Result :sat
Minimization took 5246 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 14] Max Struct:[15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 14] Max Struct:[15, 15]
Support contains 30 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 976 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 976 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 899 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2025-06-03 12:15:05] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:15:05] [INFO ] Invariant cache hit.
[2025-06-03 12:15:06] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2025-06-03 12:15:06] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:15:06] [INFO ] Invariant cache hit.
[2025-06-03 12:15:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-03 12:15:13] [INFO ] Implicit Places using invariants and state equation in 7008 ms returned []
Implicit Place search using SMT with State Equation took 8104 ms to find 0 implicit places.
[2025-06-03 12:15:13] [INFO ] Redundant transitions in 253 ms returned []
Running 4741 sub problems to find dead transitions.
[2025-06-03 12:15:14] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:15:14] [INFO ] Invariant cache hit.
[2025-06-03 12:15:14] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 61078ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 61124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70398 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 1868 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 4/4 properties
[2025-06-03 12:16:16] [INFO ] Flatten gal took : 830 ms
[2025-06-03 12:16:16] [INFO ] Flatten gal took : 356 ms
[2025-06-03 12:16:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12942588949145964508.gal : 90 ms
[2025-06-03 12:16:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10121581653575599750.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/ReachabilityCardinality12942588949145964508.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10121581653575599750.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/ReachabilityCardinality10121581653575599750.prop.
Interrupted probabilistic random walk after 96218 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 96218 steps, saw 57358 distinct states, run finished after 3005 ms. (steps per millisecond=32 ) properties seen :0
[2025-06-03 12:16:19] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:16:19] [INFO ] Invariant cache hit.
[2025-06-03 12:16:19] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 499/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-03 12:16:19] [INFO ] Deduced a trap composed of 46 places in 385 ms of which 4 ms to minimize.
[2025-06-03 12:16:20] [INFO ] Deduced a trap composed of 61 places in 364 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 12
[2025-06-03 12:16:20] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 32
[2025-06-03 12:16:20] [INFO ] Deduced a trap composed of 61 places in 370 ms of which 3 ms to minimize.
[2025-06-03 12:16:21] [INFO ] Deduced a trap composed of 61 places in 360 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :32 after 46
[2025-06-03 12:16:21] [INFO ] Deduced a trap composed of 61 places in 346 ms of which 3 ms to minimize.
[2025-06-03 12:16:22] [INFO ] Deduced a trap composed of 61 places in 340 ms of which 3 ms to minimize.
[2025-06-03 12:16:22] [INFO ] Deduced a trap composed of 61 places in 343 ms of which 3 ms to minimize.
[2025-06-03 12:16:22] [INFO ] Deduced a trap composed of 61 places in 337 ms of which 3 ms to minimize.
[2025-06-03 12:16:23] [INFO ] Deduced a trap composed of 61 places in 385 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :46 after 152
[2025-06-03 12:16:23] [INFO ] Deduced a trap composed of 336 places in 300 ms of which 3 ms to minimize.
[2025-06-03 12:16:23] [INFO ] Deduced a trap composed of 333 places in 301 ms of which 3 ms to minimize.
[2025-06-03 12:16:24] [INFO ] Deduced a trap composed of 342 places in 299 ms of which 3 ms to minimize.
[2025-06-03 12:16:24] [INFO ] Deduced a trap composed of 354 places in 290 ms of which 3 ms to minimize.
SMT process timed out in 5287ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 1017 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1018 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 1038 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :152 after 292
Interrupted probabilistic random walk after 107085 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 4
Probabilistic random walk after 107085 steps, saw 63429 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
[2025-06-03 12:16:29] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:16:29] [INFO ] Invariant cache hit.
[2025-06-03 12:16:29] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 499/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-03 12:16:29] [INFO ] Deduced a trap composed of 46 places in 351 ms of which 3 ms to minimize.
[2025-06-03 12:16:30] [INFO ] Deduced a trap composed of 61 places in 347 ms of which 3 ms to minimize.
[2025-06-03 12:16:30] [INFO ] Deduced a trap composed of 61 places in 346 ms of which 3 ms to minimize.
[2025-06-03 12:16:30] [INFO ] Deduced a trap composed of 61 places in 348 ms of which 3 ms to minimize.
[2025-06-03 12:16:31] [INFO ] Deduced a trap composed of 61 places in 377 ms of which 3 ms to minimize.
[2025-06-03 12:16:31] [INFO ] Deduced a trap composed of 61 places in 349 ms of which 3 ms to minimize.
[2025-06-03 12:16:31] [INFO ] Deduced a trap composed of 61 places in 343 ms of which 3 ms to minimize.
[2025-06-03 12:16:32] [INFO ] Deduced a trap composed of 61 places in 341 ms of which 3 ms to minimize.
[2025-06-03 12:16:32] [INFO ] Deduced a trap composed of 61 places in 348 ms of which 3 ms to minimize.
[2025-06-03 12:16:32] [INFO ] Deduced a trap composed of 61 places in 345 ms of which 3 ms to minimize.
[2025-06-03 12:16:33] [INFO ] Deduced a trap composed of 336 places in 330 ms of which 3 ms to minimize.
[2025-06-03 12:16:33] [INFO ] Deduced a trap composed of 333 places in 303 ms of which 3 ms to minimize.
[2025-06-03 12:16:34] [INFO ] Deduced a trap composed of 342 places in 296 ms of which 3 ms to minimize.
[2025-06-03 12:16:34] [INFO ] Deduced a trap composed of 354 places in 300 ms of which 3 ms to minimize.
[2025-06-03 12:16:34] [INFO ] Deduced a trap composed of 354 places in 304 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :292 after 1076
[2025-06-03 12:16:34] [INFO ] Deduced a trap composed of 358 places in 301 ms of which 6 ms to minimize.
[2025-06-03 12:16:35] [INFO ] Deduced a trap composed of 349 places in 305 ms of which 3 ms to minimize.
[2025-06-03 12:16:35] [INFO ] Deduced a trap composed of 342 places in 299 ms of which 3 ms to minimize.
[2025-06-03 12:16:35] [INFO ] Deduced a trap composed of 331 places in 289 ms of which 3 ms to minimize.
[2025-06-03 12:16:36] [INFO ] Deduced a trap composed of 342 places in 337 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-03 12:16:36] [INFO ] Deduced a trap composed of 321 places in 323 ms of which 3 ms to minimize.
[2025-06-03 12:16:36] [INFO ] Deduced a trap composed of 354 places in 292 ms of which 3 ms to minimize.
[2025-06-03 12:16:37] [INFO ] Deduced a trap composed of 357 places in 294 ms of which 3 ms to minimize.
[2025-06-03 12:16:37] [INFO ] Deduced a trap composed of 358 places in 299 ms of which 3 ms to minimize.
[2025-06-03 12:16:37] [INFO ] Deduced a trap composed of 358 places in 323 ms of which 3 ms to minimize.
[2025-06-03 12:16:38] [INFO ] Deduced a trap composed of 358 places in 321 ms of which 3 ms to minimize.
[2025-06-03 12:16:38] [INFO ] Deduced a trap composed of 357 places in 299 ms of which 4 ms to minimize.
[2025-06-03 12:16:38] [INFO ] Deduced a trap composed of 358 places in 307 ms of which 3 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/530 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 58/588 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/589 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1411/2000 variables, 589/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 240/906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2000 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/2003 variables, 2/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2003 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/2003 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2003/2003 variables, and 910 constraints, problems are : Problem set: 0 solved, 4 unsolved in 11021 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 499/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-03 12:16:40] [INFO ] Deduced a trap composed of 46 places in 353 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/530 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 58/588 variables, 31/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/589 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1411/2000 variables, 589/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 240/907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/2000 variables, 4/911 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2025-06-03 12:16:43] [INFO ] Deduced a trap composed of 53 places in 564 ms of which 3 ms to minimize.
[2025-06-03 12:16:44] [INFO ] Deduced a trap composed of 65 places in 565 ms of which 3 ms to minimize.
[2025-06-03 12:16:44] [INFO ] Deduced a trap composed of 31 places in 562 ms of which 5 ms to minimize.
[2025-06-03 12:16:45] [INFO ] Deduced a trap composed of 71 places in 559 ms of which 4 ms to minimize.
[2025-06-03 12:16:46] [INFO ] Deduced a trap composed of 49 places in 558 ms of which 4 ms to minimize.
[2025-06-03 12:16:46] [INFO ] Deduced a trap composed of 50 places in 566 ms of which 3 ms to minimize.
[2025-06-03 12:16:47] [INFO ] Deduced a trap composed of 45 places in 569 ms of which 4 ms to minimize.
[2025-06-03 12:16:48] [INFO ] Deduced a trap composed of 45 places in 566 ms of which 4 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1076 after 4724
At refinement iteration 14 (INCLUDED_ONLY) 0/2000 variables, 8/919 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2000 variables, 0/919 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/2003 variables, 2/921 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 1/922 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2003 variables, 1/923 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2003 variables, 0/923 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2003 variables, 0/923 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2003/2003 variables, and 923 constraints, problems are : Problem set: 2 solved, 2 unsolved in 8653 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 37/37 constraints]
After SMT, in 19778ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 396 ms.
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 1015 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1015 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 759 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 141151 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 141151 steps, saw 82083 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2025-06-03 12:16:53] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:16:53] [INFO ] Invariant cache hit.
[2025-06-03 12:16:53] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 514/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 12:16:54] [INFO ] Deduced a trap composed of 46 places in 373 ms of which 10 ms to minimize.
[2025-06-03 12:16:54] [INFO ] Deduced a trap composed of 61 places in 355 ms of which 3 ms to minimize.
[2025-06-03 12:16:55] [INFO ] Deduced a trap composed of 61 places in 352 ms of which 3 ms to minimize.
[2025-06-03 12:16:55] [INFO ] Deduced a trap composed of 61 places in 360 ms of which 3 ms to minimize.
[2025-06-03 12:16:55] [INFO ] Deduced a trap composed of 61 places in 380 ms of which 4 ms to minimize.
[2025-06-03 12:16:56] [INFO ] Deduced a trap composed of 61 places in 380 ms of which 3 ms to minimize.
[2025-06-03 12:16:56] [INFO ] Deduced a trap composed of 61 places in 353 ms of which 3 ms to minimize.
[2025-06-03 12:16:56] [INFO ] Deduced a trap composed of 61 places in 361 ms of which 4 ms to minimize.
[2025-06-03 12:16:57] [INFO ] Deduced a trap composed of 61 places in 352 ms of which 3 ms to minimize.
[2025-06-03 12:16:57] [INFO ] Deduced a trap composed of 61 places in 346 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 58/588 variables, 31/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/589 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1411/2000 variables, 589/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2000 variables, 240/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/2003 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2003 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2003 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2003 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2003/2003 variables, and 892 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5112 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 514/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 12:16:59] [INFO ] Deduced a trap composed of 61 places in 354 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/530 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 58/588 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/589 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1411/2000 variables, 589/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 240/889 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2000 variables, 2/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2000 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/2003 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2003 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2003 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2003/2003 variables, and 895 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 7857ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 167 ms.
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 896 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 896 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 909 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2025-06-03 12:17:03] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:17:03] [INFO ] Invariant cache hit.
[2025-06-03 12:17:04] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2025-06-03 12:17:04] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:17:04] [INFO ] Invariant cache hit.
[2025-06-03 12:17:05] [INFO ] State equation strengthened by 241 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-03 12:17:07] [INFO ] Flatten gal took : 227 ms
[2025-06-03 12:17:07] [INFO ] Applying decomposition
[2025-06-03 12:17:07] [INFO ] Flatten gal took : 217 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/graph4615320586267300983.txt' '-o' '/tmp/graph4615320586267300983.bin' '-w' '/tmp/graph4615320586267300983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4615320586267300983.bin' '-l' '-1' '-v' '-w' '/tmp/graph4615320586267300983.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:17:07] [INFO ] Decomposing Gal with order
[2025-06-03 12:17:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:17:08] [INFO ] Removed a total of 747 redundant transitions.
[2025-06-03 12:17:08] [INFO ] Flatten gal took : 637 ms
[2025-06-03 12:17:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 728 labels/synchronizations in 45 ms.
[2025-06-03 12:17:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1117290224170500450.gal : 40 ms
[2025-06-03 12:17:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2357907472962311546.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/ReachabilityCardinality1117290224170500450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2357907472962311546.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/ReachabilityCardinality2357907472962311546.prop.
[2025-06-03 12:17:11] [INFO ] Implicit Places using invariants and state equation in 7061 ms returned []
Implicit Place search using SMT with State Equation took 8211 ms to find 0 implicit places.
[2025-06-03 12:17:12] [INFO ] Redundant transitions in 185 ms returned []
Running 4741 sub problems to find dead transitions.
[2025-06-03 12:17:12] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-03 12:17:12] [INFO ] Invariant cache hit.
[2025-06-03 12:17:12] [INFO ] State equation strengthened by 241 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2962
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2962 after 3010
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3010 after 3046
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3046 after 3226
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3226 after 3730

BK_STOP 1748953050392

--------------------
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-15"
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-15, 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-174889278300092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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