fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r184-tall-174889264700709
Last Updated
June 24, 2025

About the Execution of ITS-Tools for SafeBus-COL-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 24338.00 0.00 0.00 1 1 1 1 1 1 3 3 3 2 1 3 2 2 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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-03-UpperBounds-00
FORMULA_NAME SafeBus-COL-03-UpperBounds-01
FORMULA_NAME SafeBus-COL-03-UpperBounds-02
FORMULA_NAME SafeBus-COL-03-UpperBounds-03
FORMULA_NAME SafeBus-COL-03-UpperBounds-04
FORMULA_NAME SafeBus-COL-03-UpperBounds-05
FORMULA_NAME SafeBus-COL-03-UpperBounds-06
FORMULA_NAME SafeBus-COL-03-UpperBounds-07
FORMULA_NAME SafeBus-COL-03-UpperBounds-08
FORMULA_NAME SafeBus-COL-03-UpperBounds-09
FORMULA_NAME SafeBus-COL-03-UpperBounds-10
FORMULA_NAME SafeBus-COL-03-UpperBounds-11
FORMULA_NAME SafeBus-COL-03-UpperBounds-12
FORMULA_NAME SafeBus-COL-03-UpperBounds-13
FORMULA_NAME SafeBus-COL-03-UpperBounds-14
FORMULA_NAME SafeBus-COL-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749150229813

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-05 19:03:50] [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-05 19:03:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 19:03:51] [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-05 19:03:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 19:03:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2025-06-05 19:03:51] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2025-06-05 19:03:51] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2025-06-05 19:03:51] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2025-06-05 19:03:51] [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-05 19:03:51] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 1, 0, 0, 1, 3, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 5, 1, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1]
FORMULA SafeBus-COL-03-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-05 19:03:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:51] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-05 19:03:51] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 19:03:51] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-05 19:03:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-05 19:03:51] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:51] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:51] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-05 19:03:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-06-05 19:03:51] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-05 19:03:51] [INFO ] Added : 8 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:51] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 8 ms returned sat
[2025-06-05 19:03:51] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-05 19:03:51] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-05 19:03:51] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-05 19:03:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 19:03:52] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:03:52] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-05 19:03:52] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-05 19:03:52] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:03:52] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:03:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:03:52] [INFO ] Added : 8 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:03:52] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 19:03:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:03:52] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 7 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 19:03:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:03:52] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 19:03:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-05 19:03:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:03:52] [INFO ] Added : 12 causal constraints over 5 iterations in 12 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] Max Struct:[1, 1, 5, 3, 3, 3, 3, 3, 3, 1, 1]
Domain [It(3), It(3)] of place AMC breaks symmetries in sort It
[2025-06-05 19:03:52] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 16 ms.
[2025-06-05 19:03:52] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 6 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[1, 1, 5, 3, 3, 3, 3, 3, 3, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 5, 3, 3, 3, 3, 3, 3, 1, 1]
[2025-06-05 19:03:52] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-05 19:03:52] [INFO ] Computed 17 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 5, 3, 3, 3, 3, 3, 3, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 40 ms. (243 steps per ms)
FORMULA SafeBus-COL-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-03-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-03-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 105 ms. (471 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 1, 2, 2] Max Struct:[5, 3, 3, 3, 3]
[2025-06-05 19:03:53] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-05 19:03:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 5 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 1 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-05 19:03:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 19:03:53] [INFO ] [Real]Added 13 Read/Feed constraints in 4 ms returned sat
[2025-06-05 19:03:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:53] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:53] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
[2025-06-05 19:03:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 122 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-05 19:03:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2025-06-05 19:03:53] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 11 ms.
[2025-06-05 19:03:53] [INFO ] Added : 14 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-05 19:03:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:03:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 19:03:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2025-06-05 19:03:53] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 7 ms.
[2025-06-05 19:03:53] [INFO ] Added : 19 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 1, 2, 2] Max Struct:[1, 2, 1, 3, 3]
FORMULA SafeBus-COL-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[3, 3]
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 10 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 54/54 places, 91/91 transitions.
[2025-06-05 19:03:53] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-05 19:03:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[3, 3]
RANDOM walk for 1000000 steps (2 resets) in 1247 ms. (801 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1096 ms. (1823 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[3, 3]
[2025-06-05 19:03:56] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-05 19:03:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:03:56] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:56] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:56] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-05 19:03:56] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 19:03:56] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-05 19:03:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:03:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:56] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:56] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-05 19:03:56] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2025-06-05 19:03:56] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 5 ms.
[2025-06-05 19:03:56] [INFO ] Added : 14 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:03:56] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:56] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:56] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-05 19:03:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:03:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:56] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:56] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-05 19:03:56] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2025-06-05 19:03:56] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 4 ms.
[2025-06-05 19:03:56] [INFO ] Added : 19 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[3, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[3, 3]
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-05 19:03:56] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-05 19:03:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:03:56] [INFO ] Implicit Places using invariants in 60 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 72 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/54 places, 91/91 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 94
Applied a total of 6 rules in 10 ms. Remains 48 /51 variables (removed 3) and now considering 94/91 (removed -3) transitions.
[2025-06-05 19:03:56] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
// Phase 1: matrix 71 rows 48 cols
[2025-06-05 19:03:56] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:03:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-05 19:03:56] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-05 19:03:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:03:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 19:03:57] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/54 places, 94/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 276 ms. Remains : 48/54 places, 94/91 transitions.
[2025-06-05 19:03:57] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-05 19:03:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[3, 3]
RANDOM walk for 1000000 steps (2 resets) in 1159 ms. (862 steps per ms)
BEST_FIRST walk for 2000000 steps (4 resets) in 975 ms. (2049 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[3, 3]
[2025-06-05 19:03:59] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-05 19:03:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:03:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-05 19:03:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 19:03:59] [INFO ] [Real]Added 13 Read/Feed constraints in 4 ms returned sat
[2025-06-05 19:03:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:03:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2025-06-05 19:03:59] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 5 ms.
[2025-06-05 19:03:59] [INFO ] Added : 14 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:03:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Real]Added 13 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:03:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:03:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-05 19:03:59] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2025-06-05 19:03:59] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 5 ms.
[2025-06-05 19:03:59] [INFO ] Added : 15 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[3, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[3, 3]
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 48/48 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2025-06-05 19:03:59] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-05 19:03:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:03:59] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 19:03:59] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-05 19:03:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:03:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 19:03:59] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:03:59] [INFO ] Redundant transitions in 2 ms returned []
Running 91 sub problems to find dead transitions.
[2025-06-05 19:03:59] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-05 19:03:59] [INFO ] Invariant cache hit.
[2025-06-05 19:03:59] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 9/14 constraints. Problems are: Problem set: 9 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 10/24 constraints. Problems are: Problem set: 9 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:00] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/25 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/73 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 13/86 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/86 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/86 constraints. Problems are: Problem set: 9 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 86 constraints, problems are : Problem set: 9 solved, 82 unsolved in 2849 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 9/14 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 11/25 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 71/119 variables, 48/73 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 13/86 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 82/168 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/168 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/168 constraints. Problems are: Problem set: 9 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 168 constraints, problems are : Problem set: 9 solved, 82 unsolved in 2870 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/91 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5795ms problems are : Problem set: 9 solved, 82 unsolved
Search for dead transitions found 9 dead transitions in 5802ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 48/48 places, 85/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:04:05] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5979 ms. Remains : 48/48 places, 85/94 transitions.
[2025-06-05 19:04:05] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-05 19:04:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[3, 3]
RANDOM walk for 1000000 steps (2 resets) in 1057 ms. (945 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 943 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[3, 3]
[2025-06-05 19:04:07] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-05 19:04:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:04:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-05 19:04:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 19:04:07] [INFO ] [Real]Added 13 Read/Feed constraints in 3 ms returned sat
[2025-06-05 19:04:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:04:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:07] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 5 ms to minimize.
[2025-06-05 19:04:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-06-05 19:04:07] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 4 ms.
[2025-06-05 19:04:07] [INFO ] Added : 17 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:04:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-05 19:04:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:04:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-05 19:04:07] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:08] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
[2025-06-05 19:04:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2025-06-05 19:04:08] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 5 ms.
[2025-06-05 19:04:08] [INFO ] Added : 25 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[3, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[3, 3]
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2025-06-05 19:04:08] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-05 19:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:04:08] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 19:04:08] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-05 19:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:04:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 19:04:08] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:04:08] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-05 19:04:08] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-05 19:04:08] [INFO ] Invariant cache hit.
[2025-06-05 19:04:08] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:08] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:08] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:08] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:08] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:08] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:08] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:08] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:08] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:09] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/73 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 13/86 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 86 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2136 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:04:10] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/74 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 82/169 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 169 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2915 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5084ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 5089ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5238 ms. Remains : 48/48 places, 85/85 transitions.
[2025-06-05 19:04:13] [INFO ] Flatten gal took : 36 ms
[2025-06-05 19:04:13] [INFO ] Flatten gal took : 39 ms
[2025-06-05 19:04:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17456434682792942059.gal : 15 ms
[2025-06-05 19:04:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8076888885188966969.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17456434682792942059.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8076888885188966969.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8076888885188966969.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 15
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :15 after 27
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :27 after 54
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :54 after 79
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :79 after 164
RANDOM walk for 40000 steps (8 resets) in 788 ms. (50 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :164 after 596
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :596 after 1564
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4182,0.090055,7312,2,1052,14,11873,10,0,284,10680,0
Total reachable state count : 4182

Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.091126,7440,1,0,14,11873,10,0,290,10680,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.091884,7440,1,0,14,11873,10,0,295,10680,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.09247,7440,1,0,14,11873,10,0,300,10680,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.093169,7440,1,0,14,11873,10,0,305,10680,0
BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
Probably explored full state space saw : 4182 states, properties seen :0
Probabilistic random walk after 15882 steps, saw 4182 distinct states, run finished after 102 ms. (steps per millisecond=155 ) properties seen :0
Explored full state space saw : 4182 states, properties seen :0
Exhaustive walk after 15882 steps, saw 4182 distinct states, run finished after 65 ms. (steps per millisecond=244 ) properties seen :0
FORMULA SafeBus-COL-03-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
FORMULA SafeBus-COL-03-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 23170 ms.

BK_STOP 1749150254151

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-COL-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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