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.r146-tall-177961074300661.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 HealthRecord-PT-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300661
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.3K Mar 7 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 13:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 13:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 13:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 125K 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 HealthRecord-PT-16-UpperBounds-00
FORMULA_NAME HealthRecord-PT-16-UpperBounds-01
FORMULA_NAME HealthRecord-PT-16-UpperBounds-02
FORMULA_NAME HealthRecord-PT-16-UpperBounds-03
FORMULA_NAME HealthRecord-PT-16-UpperBounds-04
FORMULA_NAME HealthRecord-PT-16-UpperBounds-05
FORMULA_NAME HealthRecord-PT-16-UpperBounds-06
FORMULA_NAME HealthRecord-PT-16-UpperBounds-07
FORMULA_NAME HealthRecord-PT-16-UpperBounds-08
FORMULA_NAME HealthRecord-PT-16-UpperBounds-09
FORMULA_NAME HealthRecord-PT-16-UpperBounds-10
FORMULA_NAME HealthRecord-PT-16-UpperBounds-11
FORMULA_NAME HealthRecord-PT-16-UpperBounds-12
FORMULA_NAME HealthRecord-PT-16-UpperBounds-13
FORMULA_NAME HealthRecord-PT-16-UpperBounds-14
FORMULA_NAME HealthRecord-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779737834191

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 19:37:15] [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 19:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:37:15] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2026-05-25 19:37:15] [INFO ] Transformed 453 places.
[2026-05-25 19:37:15] [INFO ] Transformed 594 transitions.
[2026-05-25 19:37:15] [INFO ] Found NUPN structural information;
[2026-05-25 19:37:15] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3252694117516288209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9064947458462318371.kers'
[2026-05-25 19:37:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3252694117516288209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9064947458462318371.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 594 rows 453 cols 1333 entries
Finished phase 1 with 437 SingleSign rule and 2 generalized
[2026-05-25 19:37:15] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9064947458462318371.kers
Total runtime 3 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (62 resets) in 42 ms. (232 steps per ms)
FORMULA HealthRecord-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110008 steps (191 resets) in 87 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 19:37:15] [INFO ] Invariant cache hit.
[2026-05-25 19:37:15] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2026-05-25 19:37:16] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 9 ms returned sat
[2026-05-25 19:37:16] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2026-05-25 19:37:16] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 36 ms.
[2026-05-25 19:37:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2026-05-25 19:37:16] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-25 19:37:16] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2026-05-25 19:37:16] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 30 ms.
[2026-05-25 19:37:18] [INFO ] Added : 223 causal constraints over 45 iterations in 1855 ms. Result :sat
Minimization took 185 ms.
[2026-05-25 19:37:18] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:18] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 19:37:19] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2026-05-25 19:37:19] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 34 ms.
[2026-05-25 19:37:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-25 19:37:19] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 19:37:19] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2026-05-25 19:37:19] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 35 ms.
[2026-05-25 19:37:21] [INFO ] Added : 232 causal constraints over 47 iterations in 1501 ms. Result :sat
Minimization took 116 ms.
[2026-05-25 19:37:21] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-25 19:37:21] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-25 19:37:21] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2026-05-25 19:37:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:22] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-25 19:37:22] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2026-05-25 19:37:22] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 32 ms.
[2026-05-25 19:37:23] [INFO ] Added : 219 causal constraints over 45 iterations in 1757 ms. Result :sat
Minimization took 241 ms.
[2026-05-25 19:37:24] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-25 19:37:24] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 19:37:24] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2026-05-25 19:37:24] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2026-05-25 19:37:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:25] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 19:37:25] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2026-05-25 19:37:25] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 34 ms.
[2026-05-25 19:37:26] [INFO ] Added : 220 causal constraints over 44 iterations in 1352 ms. Result :sat
Minimization took 122 ms.
[2026-05-25 19:37:26] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:26] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-25 19:37:26] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2026-05-25 19:37:26] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 30 ms.
[2026-05-25 19:37:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:27] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-25 19:37:27] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-25 19:37:27] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 31 ms.
[2026-05-25 19:37:29] [INFO ] Added : 221 causal constraints over 45 iterations in 1667 ms. Result :sat
Minimization took 118 ms.
[2026-05-25 19:37:29] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-25 19:37:29] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 19:37:29] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-05-25 19:37:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:29] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 19:37:29] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2026-05-25 19:37:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2026-05-25 19:37:30] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 25 ms.
[2026-05-25 19:37:31] [INFO ] Added : 241 causal constraints over 49 iterations in 1825 ms. Result :sat
Minimization took 118 ms.
[2026-05-25 19:37:32] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:32] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-25 19:37:32] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2026-05-25 19:37:32] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 27 ms.
[2026-05-25 19:37:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-25 19:37:32] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 6 ms returned sat
[2026-05-25 19:37:32] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2026-05-25 19:37:32] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2026-05-25 19:37:34] [INFO ] Added : 231 causal constraints over 47 iterations in 1706 ms. Result :sat
Minimization took 119 ms.
[2026-05-25 19:37:34] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-25 19:37:34] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 19:37:34] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2026-05-25 19:37:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:35] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 19:37:35] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2026-05-25 19:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2026-05-25 19:37:35] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 25 ms.
[2026-05-25 19:37:37] [INFO ] Added : 231 causal constraints over 47 iterations in 1752 ms. Result :sat
Minimization took 121 ms.
[2026-05-25 19:37:37] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:37] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-25 19:37:37] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2026-05-25 19:37:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-25 19:37:37] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 19:37:38] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2026-05-25 19:37:38] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 29 ms.
[2026-05-25 19:37:39] [INFO ] Added : 226 causal constraints over 46 iterations in 1503 ms. Result :sat
Minimization took 121 ms.
[2026-05-25 19:37:39] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:39] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 19:37:39] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2026-05-25 19:37:40] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 25 ms.
[2026-05-25 19:37:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 19:37:40] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2026-05-25 19:37:40] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2026-05-25 19:37:40] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 25 ms.
[2026-05-25 19:37:42] [INFO ] Added : 267 causal constraints over 55 iterations in 2060 ms. Result :sat
Minimization took 179 ms.
[2026-05-25 19:37:43] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-25 19:37:43] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-25 19:37:43] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2026-05-25 19:37:43] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2026-05-25 19:37:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:37:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-25 19:37:43] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-25 19:37:43] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2026-05-25 19:37:43] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 20 ms.
[2026-05-25 19:37:45] [INFO ] Added : 221 causal constraints over 45 iterations in 1562 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 526 edges and 453 vertex of which 47 / 453 are part of one of the 16 SCC in 8 ms
Free SCC test removed 31 places
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 822 edges and 422 vertex of which 408 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 408 transition count 317
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 252 rules applied. Total rules applied 475 place count 187 transition count 286
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 490 place count 174 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 492 place count 172 transition count 284
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 492 place count 172 transition count 275
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 510 place count 163 transition count 275
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 567 place count 106 transition count 162
Iterating global reduction 4 with 57 rules applied. Total rules applied 624 place count 106 transition count 162
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 631 place count 99 transition count 148
Iterating global reduction 4 with 7 rules applied. Total rules applied 638 place count 99 transition count 148
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 643 place count 94 transition count 143
Iterating global reduction 4 with 5 rules applied. Total rules applied 648 place count 94 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 649 place count 94 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 651 place count 92 transition count 138
Iterating global reduction 5 with 2 rules applied. Total rules applied 653 place count 92 transition count 138
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 655 place count 90 transition count 134
Iterating global reduction 5 with 2 rules applied. Total rules applied 657 place count 90 transition count 134
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 659 place count 88 transition count 130
Iterating global reduction 5 with 2 rules applied. Total rules applied 661 place count 88 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 662 place count 88 transition count 129
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 714 place count 62 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 720 place count 62 transition count 97
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 730 place count 57 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 731 place count 57 transition count 141
Free-agglomeration rule applied 17 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 748 place count 57 transition count 122
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 765 place count 40 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 768 place count 40 transition count 119
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 779 place count 40 transition count 119
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 788 place count 40 transition count 119
Applied a total of 788 rules in 103 ms. Remains 40 /453 variables (removed 413) and now considering 119/594 (removed 475) transitions.
Running 103 sub problems to find dead transitions.
[2026-05-25 19:37:46] [INFO ] Flow matrix only has 105 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3919546883351414102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1683278002694025825.kers'
[2026-05-25 19:37:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3919546883351414102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1683278002694025825.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 105 rows 38 cols 458 entries
Finished phase 1 with 32 SingleSign rule and 2 generalized
[2026-05-25 19:37:46] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1683278002694025825.kers
Total runtime 0 ms.
[2026-05-25 19:37:46] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 5 (OVERLAPS) 105/145 variables, 40/48 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 14/62 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/62 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 1/63 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/63 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/63 constraints. Problems are: Problem set: 11 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 63 constraints, problems are : Problem set: 11 solved, 92 unsolved in 3616 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 11 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 4/40 variables, 1/6 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/8 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 105/145 variables, 40/48 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 14/62 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 92/154 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/155 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/155 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/155 constraints. Problems are: Problem set: 11 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 155 constraints, problems are : Problem set: 11 solved, 92 unsolved in 5411 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 92/103 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9135ms problems are : Problem set: 11 solved, 92 unsolved
Search for dead transitions found 11 dead transitions in 9149ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 40/453 places, 108/594 transitions.
Graph (complete) has 143 edges and 40 vertex of which 37 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 107
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 1 with 2 rules applied. Total rules applied 4 place count 36 transition count 106
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 36 transition count 106
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 36 transition count 106
Applied a total of 11 rules in 15 ms. Remains 36 /40 variables (removed 4) and now considering 106/108 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9288 ms. Remains : 36/453 places, 106/594 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13725052595491354888.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13101673111838375084.kers'
[2026-05-25 19:37:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13725052595491354888.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13101673111838375084.kers]
Normalized transition count is 92 out of 106 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 92 rows 34 cols 366 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-25 19:37:55] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13101673111838375084.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (50091 resets) in 773 ms. (1291 steps per ms)
FORMULA HealthRecord-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (20998 resets) in 407 ms. (2450 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 41084 ms.

BK_STOP 1779737876405

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="HealthRecord-PT-16"
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 HealthRecord-PT-16, 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 r146-tall-177961074300661"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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