Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107700101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is IBMB2S565S3960-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 11K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.1K Mar 15 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 15 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 127K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779728433869

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 17:00:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 17:00:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:00:36] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2026-05-25 17:00:36] [INFO ] Transformed 273 places.
[2026-05-25 17:00:36] [INFO ] Transformed 179 transitions.
[2026-05-25 17:00:36] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12698897169587795356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-739888591979272004.kers'
[2026-05-25 17:00:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12698897169587795356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-739888591979272004.kers]
Culling duplicate invariants (modulo rational): removing 91 columns.
Culled 91 columns in 0 ms.
// Phase 1: matrix 179 rows 182 cols 390 entries
Finished phase 1 with 168 SingleSign rule and 4 generalized
[2026-05-25 17:00:36] [INFO ] Computed 101 invariants in 3 ms
Computed 101 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-739888591979272004.kers
Total runtime 5 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, 0] Max Struct:[7, 93, 93, 93, 7, 93, 93, 93, 93, 7, 93, 93, 93, 93, 93, +inf]
RANDOM walk for 10003 steps (42 resets) in 47 ms. (208 steps per ms)
BEST_FIRST walk for 160014 steps (110 resets) in 347 ms. (459 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 7, 6, 1, 1, 7, 4, 4, 3, 1, 1, 4, 1, 7, 4, 5] Max Struct:[7, 93, 93, 93, 7, 93, 93, 93, 93, 7, 93, 93, 93, 93, 93, +inf]
[2026-05-25 17:00:37] [INFO ] Invariant cache hit.
[2026-05-25 17:00:37] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2026-05-25 17:00:38] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 78 ms returned sat
[2026-05-25 17:00:38] [INFO ] [Real]Absence check using state equation in 225 ms returned unsat
[2026-05-25 17:00:38] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2026-05-25 17:00:38] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 70 ms returned sat
[2026-05-25 17:00:38] [INFO ] [Real]Absence check using state equation in 234 ms returned unsat
[2026-05-25 17:00:38] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2026-05-25 17:00:38] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 49 ms returned sat
[2026-05-25 17:00:39] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2026-05-25 17:00:39] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 41 ms.
[2026-05-25 17:00:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:00:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2026-05-25 17:00:39] [INFO ] [Nat]Absence check using 3 positive and 98 generalized place invariants in 47 ms returned sat
[2026-05-25 17:00:40] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2026-05-25 17:00:40] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 30 ms.
[2026-05-25 17:00:40] [INFO ] Added : 33 causal constraints over 7 iterations in 298 ms. Result :sat
Minimization took 173 ms.
[2026-05-25 17:00:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 17:00:40] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 29 ms returned sat
[2026-05-25 17:00:40] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-05-25 17:00:40] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 18 ms.
[2026-05-25 17:00:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:00:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:41] [INFO ] [Nat]Absence check using 3 positive and 98 generalized place invariants in 40 ms returned sat
[2026-05-25 17:00:41] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2026-05-25 17:00:41] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 24 ms.
[2026-05-25 17:00:42] [INFO ] Added : 120 causal constraints over 25 iterations in 739 ms. Result :sat
Minimization took 339 ms.
[2026-05-25 17:00:42] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:42] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 48 ms returned sat
[2026-05-25 17:00:43] [INFO ] [Real]Absence check using state equation in 162 ms returned unsat
[2026-05-25 17:00:43] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:43] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 48 ms returned sat
[2026-05-25 17:00:43] [INFO ] [Real]Absence check using state equation in 180 ms returned unsat
[2026-05-25 17:00:43] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:43] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 46 ms returned sat
[2026-05-25 17:00:43] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2026-05-25 17:00:43] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 24 ms.
[2026-05-25 17:00:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:00:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:44] [INFO ] [Nat]Absence check using 3 positive and 98 generalized place invariants in 37 ms returned sat
[2026-05-25 17:00:44] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2026-05-25 17:00:44] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 24 ms.
[2026-05-25 17:00:45] [INFO ] Added : 114 causal constraints over 24 iterations in 620 ms. Result :sat
Minimization took 206 ms.
[2026-05-25 17:00:45] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:45] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 45 ms returned sat
[2026-05-25 17:00:45] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2026-05-25 17:00:45] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 23 ms.
[2026-05-25 17:00:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:00:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:46] [INFO ] [Nat]Absence check using 3 positive and 98 generalized place invariants in 45 ms returned sat
[2026-05-25 17:00:46] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2026-05-25 17:00:46] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 17:00:47] [INFO ] Added : 113 causal constraints over 24 iterations in 671 ms. Result :sat
Minimization took 284 ms.
[2026-05-25 17:00:47] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:47] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 44 ms returned sat
[2026-05-25 17:00:47] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2026-05-25 17:00:47] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 22 ms.
[2026-05-25 17:00:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:00:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:48] [INFO ] [Nat]Absence check using 3 positive and 98 generalized place invariants in 49 ms returned sat
[2026-05-25 17:00:48] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2026-05-25 17:00:48] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 22 ms.
[2026-05-25 17:00:49] [INFO ] Added : 141 causal constraints over 29 iterations in 825 ms. Result :sat
Minimization took 501 ms.
[2026-05-25 17:00:50] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:50] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 44 ms returned sat
[2026-05-25 17:00:50] [INFO ] [Real]Absence check using state equation in 163 ms returned unsat
[2026-05-25 17:00:50] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:50] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 35 ms returned sat
[2026-05-25 17:00:50] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2026-05-25 17:00:50] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 23 ms.
[2026-05-25 17:00:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:00:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:51] [INFO ] [Nat]Absence check using 3 positive and 98 generalized place invariants in 43 ms returned sat
[2026-05-25 17:00:51] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2026-05-25 17:00:51] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 17:00:52] [INFO ] Added : 128 causal constraints over 26 iterations in 744 ms. Result :sat
Minimization took 344 ms.
[2026-05-25 17:00:52] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:53] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 44 ms returned sat
[2026-05-25 17:00:53] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2026-05-25 17:00:53] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 17:00:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:00:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2026-05-25 17:00:53] [INFO ] [Nat]Absence check using 3 positive and 98 generalized place invariants in 42 ms returned sat
[2026-05-25 17:00:53] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2026-05-25 17:00:53] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 19 ms.
[2026-05-25 17:00:54] [INFO ] Added : 119 causal constraints over 24 iterations in 482 ms. Result :sat
Minimization took 325 ms.
[2026-05-25 17:00:54] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2026-05-25 17:00:54] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 40 ms returned sat
[2026-05-25 17:00:55] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2026-05-25 17:00:55] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 17:00:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:00:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2026-05-25 17:00:55] [INFO ] [Nat]Absence check using 3 positive and 98 generalized place invariants in 42 ms returned sat
[2026-05-25 17:00:55] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2026-05-25 17:00:55] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 17:00:56] [INFO ] Added : 114 causal constraints over 23 iterations in 577 ms. Result :sat
Minimization took 241 ms.
[2026-05-25 17:00:56] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2026-05-25 17:00:56] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 40 ms returned sat
[2026-05-25 17:00:56] [INFO ] [Real]Absence check using state equation in 155 ms returned unsat
[2026-05-25 17:00:57] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:57] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 39 ms returned sat
[2026-05-25 17:00:57] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2026-05-25 17:00:57] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 17:00:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:00:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:57] [INFO ] [Nat]Absence check using 3 positive and 98 generalized place invariants in 47 ms returned sat
[2026-05-25 17:00:57] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2026-05-25 17:00:57] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 17:00:58] [INFO ] Added : 60 causal constraints over 13 iterations in 361 ms. Result :sat
Minimization took 227 ms.
[2026-05-25 17:00:58] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2026-05-25 17:00:58] [INFO ] [Real]Absence check using 3 positive and 98 generalized place invariants in 41 ms returned sat
[2026-05-25 17:00:58] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2026-05-25 17:00:58] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 16 ms.
[2026-05-25 17:00:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:00:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-25 17:00:59] [INFO ] [Nat]Absence check using 3 positive and 98 generalized place invariants in 39 ms returned sat
[2026-05-25 17:00:59] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2026-05-25 17:00:59] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 16 ms.
[2026-05-25 17:00:59] [INFO ] Added : 37 causal constraints over 8 iterations in 198 ms. Result :sat
Minimization took 154 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 7, 6, 1, 1, 7, 4, 4, 3, 1, 1, 4, 1, 7, 4, 5] Max Struct:[1, 7, 93, 93, 1, 7, 93, 93, 93, 1, 93, 93, 93, 7, 93, +inf]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 3, 7, 7, 3, 3, 7, 3, 7, 7] Max Struct:[93, 93, 93, 93, 93, 93, 93, 93, 93, +inf]
Support contains 10 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 179/179 transitions.
Graph (complete) has 415 edges and 273 vertex of which 231 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Ensure Unique test removed 82 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 164 rules applied. Total rules applied 165 place count 149 transition count 74
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 80 rules applied. Total rules applied 245 place count 75 transition count 68
Reduce places removed 3 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 253 place count 72 transition count 63
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 258 place count 67 transition count 63
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 258 place count 67 transition count 44
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 298 place count 46 transition count 44
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 303 place count 41 transition count 39
Iterating global reduction 4 with 5 rules applied. Total rules applied 308 place count 41 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 326 place count 31 transition count 31
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 327 place count 30 transition count 30
Iterating global reduction 4 with 1 rules applied. Total rules applied 328 place count 30 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 330 place count 29 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 29 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 332 place count 28 transition count 28
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 334 place count 28 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 335 place count 28 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 336 place count 27 transition count 27
Applied a total of 336 rules in 79 ms. Remains 27 /273 variables (removed 246) and now considering 27/179 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 27/273 places, 27/179 transitions.
findPositiveTsemiflow completed in 14 ms - Net is bounded UNSAT
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13085923213460843760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8806405946900394278.kers'
[2026-05-25 17:01:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13085923213460843760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8806405946900394278.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 27 rows 27 cols 63 entries
Finished phase 1 with 20 SingleSign rule and 4 generalized
[2026-05-25 17:01:00] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8806405946900394278.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[7, 3, 7, 7, 3, 3, 7, 3, 7, 7] Max Struct:[93, 93, 93, 93, 93, 93, 93, 93, 93, +inf]
RANDOM walk for 1000003 steps (10478 resets) in 590 ms. (1692 steps per ms)
BEST_FIRST walk for 10000010 steps (22870 resets) in 3729 ms. (2680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 3, 7, 7, 5, 3, 7, 3, 7, 7] Max Struct:[93, 93, 93, 93, 93, 93, 93, 93, 93, +inf]
[2026-05-25 17:01:05] [INFO ] Invariant cache hit.
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 17:01:05] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[7, 3, 7, 7, 5, 3, 7, 3, 7, 7] Max Struct:[7, 3, 7, 7, 5, 3, 7, 3, 7, 7]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 29219 ms.

BK_STOP 1779728465657

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="IBMB2S565S3960-PT-none"
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-5973"
echo " Executing tool itstools"
echo " Input is IBMB2S565S3960-PT-none, 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 r162-smll-177961107700101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none 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 ;