fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074300621
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for HealthRecord-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
436.104 6590.00 12830.00 121.80 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 8.0K Mar 7 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 7 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 7 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 7 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K Mar 7 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:44 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 70K 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-11-UpperBounds-00
FORMULA_NAME HealthRecord-PT-11-UpperBounds-01
FORMULA_NAME HealthRecord-PT-11-UpperBounds-02
FORMULA_NAME HealthRecord-PT-11-UpperBounds-03
FORMULA_NAME HealthRecord-PT-11-UpperBounds-04
FORMULA_NAME HealthRecord-PT-11-UpperBounds-05
FORMULA_NAME HealthRecord-PT-11-UpperBounds-06
FORMULA_NAME HealthRecord-PT-11-UpperBounds-07
FORMULA_NAME HealthRecord-PT-11-UpperBounds-08
FORMULA_NAME HealthRecord-PT-11-UpperBounds-09
FORMULA_NAME HealthRecord-PT-11-UpperBounds-10
FORMULA_NAME HealthRecord-PT-11-UpperBounds-11
FORMULA_NAME HealthRecord-PT-11-UpperBounds-12
FORMULA_NAME HealthRecord-PT-11-UpperBounds-13
FORMULA_NAME HealthRecord-PT-11-UpperBounds-14
FORMULA_NAME HealthRecord-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779736801130

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 19:20:02] [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:20:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:20:02] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2026-05-25 19:20:02] [INFO ] Transformed 159 places.
[2026-05-25 19:20:02] [INFO ] Transformed 334 transitions.
[2026-05-25 19:20:02] [INFO ] Found NUPN structural information;
[2026-05-25 19:20:02] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
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, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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:[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-8898925596217827313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12820370351639728486.kers'
[2026-05-25 19:20:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8898925596217827313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12820370351639728486.kers]
Normalized transition count is 294 out of 307 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 294 rows 152 cols 778 entries
Finished phase 1 with 139 SingleSign rule and 2 generalized
[2026-05-25 19:20:02] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12820370351639728486.kers
Total runtime 2 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (674 resets) in 40 ms. (243 steps per ms)
FORMULA HealthRecord-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (693 resets) in 65 ms. (1060 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-25 19:20:02] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14909845393258005932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-361028346540676189.kers'
[2026-05-25 19:20:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14909845393258005932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-361028346540676189.kers]
Normalized transition count is 294 out of 295 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 294 rows 152 cols 778 entries
Finished phase 1 with 139 SingleSign rule and 2 generalized
[2026-05-25 19:20:02] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-361028346540676189.kers
Total runtime 1 ms.
[2026-05-25 19:20:02] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2026-05-25 19:20:02] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 9 ms returned sat
[2026-05-25 19:20:02] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-25 19:20:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:20:03] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:20:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:20:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-25 19:20:03] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:20:03] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 19:20:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:20:03] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 34 ms.
[2026-05-25 19:20:03] [INFO ] Added : 20 causal constraints over 5 iterations in 164 ms. Result :sat
Minimization took 55 ms.
[2026-05-25 19:20:03] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:20:03] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 19:20:03] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-25 19:20:03] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2026-05-25 19:20:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:20:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:20:03] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:20:03] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:20:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:20:03] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 34 ms.
[2026-05-25 19:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2026-05-25 19:20:04] [INFO ] Added : 26 causal constraints over 6 iterations in 221 ms. Result :sat
Minimization took 50 ms.
[2026-05-25 19:20:04] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:20:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:20:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:20:04] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 24 ms.
[2026-05-25 19:20:04] [INFO ] Added : 17 causal constraints over 4 iterations in 96 ms. Result :sat
Minimization took 49 ms.
[2026-05-25 19:20:04] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:20:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:20:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:20:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:20:04] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 19 ms.
[2026-05-25 19:20:04] [INFO ] Added : 22 causal constraints over 6 iterations in 114 ms. Result :sat
Minimization took 51 ms.
[2026-05-25 19:20:05] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:20:05] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 18 ms.
[2026-05-25 19:20:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:20:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:20:05] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 18 ms.
[2026-05-25 19:20:05] [INFO ] Added : 18 causal constraints over 5 iterations in 109 ms. Result :sat
Minimization took 57 ms.
[2026-05-25 19:20:05] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:20:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:20:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:20:05] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 17 ms.
[2026-05-25 19:20:05] [INFO ] Added : 22 causal constraints over 6 iterations in 106 ms. Result :sat
Minimization took 46 ms.
[2026-05-25 19:20:06] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:20:06] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:20:06] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:20:06] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:20:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:20:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:20:06] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:20:06] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:20:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2026-05-25 19:20:06] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 18 ms.
[2026-05-25 19:20:06] [INFO ] Added : 24 causal constraints over 5 iterations in 105 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 239 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 667 edges and 154 vertex of which 124 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Drop transitions (Empty/Sink Transition effects.) removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 124 transition count 156
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 194 place count 45 transition count 77
Iterating global reduction 1 with 79 rules applied. Total rules applied 273 place count 45 transition count 77
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 273 place count 45 transition count 72
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 283 place count 40 transition count 72
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 295 place count 28 transition count 56
Iterating global reduction 1 with 12 rules applied. Total rules applied 307 place count 28 transition count 56
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 316 place count 28 transition count 47
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 318 place count 26 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 320 place count 26 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 321 place count 26 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 322 place count 25 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 25 transition count 42
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 326 place count 25 transition count 39
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 332 place count 22 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 333 place count 22 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 21 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 20 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 339 place count 20 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 5 with 2 rules applied. Total rules applied 341 place count 19 transition count 29
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 342 place count 18 transition count 28
Iterating global reduction 5 with 1 rules applied. Total rules applied 343 place count 18 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 346 place count 18 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 347 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 348 place count 17 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 17 transition count 24
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 350 place count 17 transition count 23
Applied a total of 350 rules in 49 ms. Remains 17 /159 variables (removed 142) and now considering 23/307 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 17/159 places, 23/307 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14671444996805937189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7766368484464968453.kers'
[2026-05-25 19:20:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14671444996805937189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7766368484464968453.kers]
Normalized transition count is 19 out of 23 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 19 rows 15 cols 44 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 19:20:06] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7766368484464968453.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (72400 resets) in 671 ms. (1488 steps per ms)
FORMULA HealthRecord-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (26389 resets) in 300 ms. (3322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 5434 ms.

BK_STOP 1779736807720

--------------------
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="HealthRecord-PT-11"
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-11, 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-177961074300621"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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