Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 72K 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 QuasiCertifProtocol-COL-10-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749123295822

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-05 11:34:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 11:34:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 11:34:57] [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 11:34:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 11:34:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 552 ms
[2025-06-05 11:34:57] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2025-06-05 11:34:57] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2025-06-05 11:34:57] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 26 rows 30 cols
[2025-06-05 11:34:57] [INFO ] Computed 5 invariants in 9 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 6, 11, +inf, 1, 1, +inf, 1, +inf, 1, 6, +inf, 121, +inf, 11, 1]
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-05 11:34:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:57] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2025-06-05 11:34:57] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-05 11:34:57] [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 11:34:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-05 11:34:58] [INFO ] Added : 8 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 9 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-05 11:34:58] [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 11:34:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 11:34:58] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 11 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-05 11:34:58] [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 11:34:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-05 11:34:58] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 11:34:58] [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 11:34:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 11:34:58] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-05 11:34:58] [INFO ] Added : 5 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2025-06-05 11:34:58] [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 11:34:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 11:34:58] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-05 11:34:58] [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 11:34:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-05 11:34:58] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 11:34:58] [INFO ] Added : 13 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 12 ms.
[2025-06-05 11:34:58] [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 11:34:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-05 11:34:58] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-05 11:34:58] [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 11:34:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 11:34:58] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 11:34:58] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 11:34:58] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 11:34:58] [INFO ] Added : 13 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2025-06-05 11:34:58] [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 11:34:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-05 11:34:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-05 11:34:59] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 11:34:59] [INFO ] Added : 13 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 11:34:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-05 11:34:59] [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 11:34:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 11:34:59] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-05 11:34:59] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 11:34:59] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:59] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-05 11:34:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-05 11:34:59] [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 11:34:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-05 11:34:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-05 11:34:59] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 11:34:59] [INFO ] Added : 12 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-05 11:34:59] [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 11:34:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 11:34:59] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-05 11:34:59] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 11:34:59] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:59] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-05 11:34:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-05 11:34:59] [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 11:34:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 11:34:59] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-05 11:34:59] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 11:34:59] [INFO ] Added : 12 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:34:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 11:34:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-05 11:34:59] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 11:34:59] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 6, 11, +inf, 1, +inf, 1, +inf, 1, 6, +inf, 121, +inf, 11, 1]
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2025-06-05 11:34:59] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 21 ms.
[2025-06-05 11:34:59] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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, 0, 0, 0] Max Struct:[11, 6, 11, +inf, 1, +inf, 1, +inf, 1, 6, +inf, 121, +inf, 11, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 6, 11, +inf, 1, +inf, 1, +inf, 1, 6, +inf, 121, +inf, 11, 1]
// Phase 1: matrix 176 rows 550 cols
[2025-06-05 11:34:59] [INFO ] Computed 375 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 6, 11, +inf, 1, +inf, 1, +inf, 1, 6, +inf, 121, +inf, 11, 1]
RANDOM walk for 10000 steps (691 resets) in 87 ms. (113 steps per ms)
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120010 steps (946 resets) in 250 ms. (478 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0] Max Struct:[11, 11, +inf, 1, +inf, +inf, 1, 6, +inf, 121, +inf, 11]
[2025-06-05 11:34:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:00] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2025-06-05 11:35:00] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 54 ms returned sat
[2025-06-05 11:35:00] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2025-06-05 11:35:00] [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 11:35:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-05 11:35:00] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 47 ms returned sat
[2025-06-05 11:35:00] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2025-06-05 11:35:00] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2025-06-05 11:35:00] [INFO ] Added : 47 causal constraints over 10 iterations in 207 ms. Result :sat
Minimization took 513 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:01] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-05 11:35:01] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 52 ms returned sat
[2025-06-05 11:35:01] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2025-06-05 11:35:01] [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 11:35:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 11:35:02] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 48 ms returned sat
[2025-06-05 11:35:02] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-06-05 11:35:02] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2025-06-05 11:35:02] [INFO ] Added : 42 causal constraints over 9 iterations in 168 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:02] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2025-06-05 11:35:03] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 54 ms returned sat
[2025-06-05 11:35:03] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2025-06-05 11:35:03] [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 11:35:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2025-06-05 11:35:03] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 52 ms returned sat
[2025-06-05 11:35:03] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2025-06-05 11:35:03] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2025-06-05 11:35:03] [INFO ] Added : 44 causal constraints over 9 iterations in 171 ms. Result :sat
Minimization took 520 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:04] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-05 11:35:04] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 52 ms returned sat
[2025-06-05 11:35:04] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-06-05 11:35:04] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 9 ms.
[2025-06-05 11:35:04] [INFO ] Added : 21 causal constraints over 5 iterations in 133 ms. Result :sat
Minimization took 485 ms.
[2025-06-05 11:35:05] [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 11:35:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2025-06-05 11:35:05] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 55 ms returned sat
[2025-06-05 11:35:05] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2025-06-05 11:35:05] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2025-06-05 11:35:05] [INFO ] Added : 21 causal constraints over 5 iterations in 120 ms. Result :sat
Minimization took 448 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:06] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2025-06-05 11:35:06] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 55 ms returned sat
[2025-06-05 11:35:06] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2025-06-05 11:35:06] [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 11:35:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-05 11:35:06] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 49 ms returned sat
[2025-06-05 11:35:06] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-05 11:35:06] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2025-06-05 11:35:07] [INFO ] Added : 42 causal constraints over 9 iterations in 175 ms. Result :sat
Minimization took 503 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:07] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 11:35:07] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 48 ms returned sat
[2025-06-05 11:35:07] [INFO ] [Real]Absence check using state equation in 88 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:07] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 11:35:07] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 53 ms returned sat
[2025-06-05 11:35:08] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-06-05 11:35:08] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2025-06-05 11:35:08] [INFO ] Added : 41 causal constraints over 9 iterations in 206 ms. Result :sat
Minimization took 499 ms.
[2025-06-05 11:35:08] [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 11:35:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-05 11:35:09] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 51 ms returned sat
[2025-06-05 11:35:09] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2025-06-05 11:35:09] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2025-06-05 11:35:09] [INFO ] Added : 41 causal constraints over 9 iterations in 166 ms. Result :sat
Minimization took 471 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:09] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 11:35:09] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 58 ms returned sat
[2025-06-05 11:35:10] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-06-05 11:35:10] [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 11:35:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-05 11:35:10] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 49 ms returned sat
[2025-06-05 11:35:10] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2025-06-05 11:35:10] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2025-06-05 11:35:10] [INFO ] Added : 49 causal constraints over 10 iterations in 330 ms. Result :sat
Minimization took 504 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:11] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 11:35:11] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 50 ms returned sat
[2025-06-05 11:35:11] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-06-05 11:35:11] [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 11:35:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-05 11:35:11] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 47 ms returned sat
[2025-06-05 11:35:11] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2025-06-05 11:35:11] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 18 ms.
[2025-06-05 11:35:12] [INFO ] Added : 13 causal constraints over 3 iterations in 83 ms. Result :sat
Minimization took 477 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:12] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 11:35:12] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 49 ms returned sat
[2025-06-05 11:35:12] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2025-06-05 11:35:12] [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 11:35:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 11:35:13] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 48 ms returned sat
[2025-06-05 11:35:13] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2025-06-05 11:35:13] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 16 ms.
[2025-06-05 11:35:13] [INFO ] Added : 55 causal constraints over 11 iterations in 226 ms. Result :sat
Minimization took 477 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:14] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 11:35:14] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 49 ms returned sat
[2025-06-05 11:35:14] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-06-05 11:35:14] [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 11:35:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 11:35:14] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 49 ms returned sat
[2025-06-05 11:35:14] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-05 11:35:14] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 17 ms.
[2025-06-05 11:35:14] [INFO ] Added : 24 causal constraints over 5 iterations in 110 ms. Result :sat
Minimization took 464 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 11:35:15] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 11:35:15] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 50 ms returned sat
[2025-06-05 11:35:15] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2025-06-05 11:35:15] [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 11:35:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-05 11:35:15] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 49 ms returned sat
[2025-06-05 11:35:15] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-06-05 11:35:16] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2025-06-05 11:35:16] [INFO ] Added : 57 causal constraints over 12 iterations in 287 ms. Result :sat
Minimization took 480 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0] Max Struct:[11, 11, +inf, 1, +inf, 11, 1, 6, +inf, 121, +inf, 11]
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-08 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-14 11 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-12 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-02 11 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-00 11 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[121, 11, 3, 11, 11] Max Struct:[+inf, +inf, 6, +inf, +inf]
Support contains 155 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 261 are kept as prefixes of interest. Removing 289 places using SCC suffix rule.2 ms
Discarding 289 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 239 transition count 72
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 105 place count 239 transition count 59
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 1 with 47 rules applied. Total rules applied 152 place count 205 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 152 place count 205 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 155 place count 203 transition count 58
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 165 place count 193 transition count 48
Iterating global reduction 1 with 10 rules applied. Total rules applied 175 place count 193 transition count 48
Applied a total of 175 rules in 38 ms. Remains 193 /550 variables (removed 357) and now considering 48/176 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 193/550 places, 48/176 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 48 rows 193 cols
[2025-06-05 11:35:17] [INFO ] Computed 145 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[121, 11, 3, 11, 11] Max Struct:[1331, +inf, 6, 121, 121]
RANDOM walk for 1000000 steps (18090 resets) in 5998 ms. (166 steps per ms)
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000002 steps (10545 resets) in 9976 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[121, 11, 11, 11] Max Struct:[1331, +inf, 121, 121]
[2025-06-05 11:35:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 11:35:33] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-05 11:35:33] [INFO ] [Real]Absence check using 13 positive and 132 generalized place invariants in 26 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 11:35:33] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 11:35:33] [INFO ] [Real]Absence check using 13 positive and 132 generalized place invariants in 17 ms returned sat
[2025-06-05 11:35:33] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 11:35:33] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 11:35:33] [INFO ] [Real]Absence check using 13 positive and 132 generalized place invariants in 18 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 11:35:33] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-05 11:35:33] [INFO ] [Real]Absence check using 13 positive and 132 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[121, 11, 11, 11] Max Struct:[121, 11, 11, 11]
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-13 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-11 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-06 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-03 121 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-05 11:35:33] [INFO ] Flatten gal took : 35 ms
[2025-06-05 11:35:33] [INFO ] Flatten gal took : 13 ms
[2025-06-05 11:35:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6248865079942249791.gal : 8 ms
[2025-06-05 11:35:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8910276835047353223.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6248865079942249791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8910276835047353223.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 36583 ms.

BK_STOP 1749123333647

--------------------
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="QuasiCertifProtocol-COL-10"
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 QuasiCertifProtocol-COL-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254600741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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