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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.3K Mar 7 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 13:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 13:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 13:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 7 13:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 13:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 13:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:43 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 69K 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-10-UpperBounds-00
FORMULA_NAME HealthRecord-PT-10-UpperBounds-01
FORMULA_NAME HealthRecord-PT-10-UpperBounds-02
FORMULA_NAME HealthRecord-PT-10-UpperBounds-03
FORMULA_NAME HealthRecord-PT-10-UpperBounds-04
FORMULA_NAME HealthRecord-PT-10-UpperBounds-05
FORMULA_NAME HealthRecord-PT-10-UpperBounds-06
FORMULA_NAME HealthRecord-PT-10-UpperBounds-07
FORMULA_NAME HealthRecord-PT-10-UpperBounds-08
FORMULA_NAME HealthRecord-PT-10-UpperBounds-09
FORMULA_NAME HealthRecord-PT-10-UpperBounds-10
FORMULA_NAME HealthRecord-PT-10-UpperBounds-11
FORMULA_NAME HealthRecord-PT-10-UpperBounds-12
FORMULA_NAME HealthRecord-PT-10-UpperBounds-13
FORMULA_NAME HealthRecord-PT-10-UpperBounds-14
FORMULA_NAME HealthRecord-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779736619006

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 19:17:00] [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:17:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:17:00] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2026-05-25 19:17:00] [INFO ] Transformed 158 places.
[2026-05-25 19:17:00] [INFO ] Transformed 333 transitions.
[2026-05-25 19:17:00] [INFO ] Found NUPN structural information;
[2026-05-25 19:17:00] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 156 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, 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-3791451631302861906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16134225224917675740.kers'
[2026-05-25 19:17:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3791451631302861906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16134225224917675740.kers]
Normalized transition count is 293 out of 306 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 293 rows 151 cols 774 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-05-25 19:17:00] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16134225224917675740.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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (626 resets) in 41 ms. (238 steps per ms)
FORMULA HealthRecord-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (732 resets) in 82 ms. (1084 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 19:17:00] [INFO ] Flow matrix only has 294 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-1436887189061048456.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6022544721145132440.kers'
[2026-05-25 19:17:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1436887189061048456.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6022544721145132440.kers]
Normalized transition count is 293 out of 294 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 293 rows 151 cols 774 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-05-25 19:17:00] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6022544721145132440.kers
Total runtime 2 ms.
[2026-05-25 19:17:00] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-25 19:17:00] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 7 ms returned sat
[2026-05-25 19:17:00] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2026-05-25 19:17:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:17:00] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2026-05-25 19:17:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:17:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:17:01] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 35 ms.
[2026-05-25 19:17:01] [INFO ] Added : 13 causal constraints over 3 iterations in 113 ms. Result :sat
Minimization took 53 ms.
[2026-05-25 19:17:01] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:17:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:17:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:17:01] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 24 ms.
[2026-05-25 19:17:01] [INFO ] Added : 14 causal constraints over 3 iterations in 82 ms. Result :sat
Minimization took 48 ms.
[2026-05-25 19:17:01] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:17:01] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 18 ms.
[2026-05-25 19:17:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:17:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:17:01] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:17:02] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 17 ms.
[2026-05-25 19:17:02] [INFO ] Added : 20 causal constraints over 5 iterations in 104 ms. Result :sat
Minimization took 45 ms.
[2026-05-25 19:17:02] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:17:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:17:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:17:02] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 19 ms.
[2026-05-25 19:17:02] [INFO ] Added : 17 causal constraints over 4 iterations in 85 ms. Result :sat
Minimization took 46 ms.
[2026-05-25 19:17:02] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:17:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:17:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-25 19:17:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:17:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2026-05-25 19:17:03] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 28 ms.
[2026-05-25 19:17:03] [INFO ] Added : 14 causal constraints over 3 iterations in 93 ms. Result :sat
Minimization took 55 ms.
[2026-05-25 19:17:03] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:17:03] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:17:03] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-25 19:17:03] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:17:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:17:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2026-05-25 19:17:03] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:17:03] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-25 19:17:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:17:03] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 17 ms.
[2026-05-25 19:17:03] [INFO ] Added : 15 causal constraints over 3 iterations in 85 ms. Result :sat
Minimization took 51 ms.
[2026-05-25 19:17:03] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:17:03] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:17:03] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-25 19:17:03] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:17:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:17:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:17:03] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:17:04] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 16 ms.
[2026-05-25 19:17:04] [INFO ] Added : 15 causal constraints over 3 iterations in 76 ms. Result :sat
Minimization took 47 ms.
[2026-05-25 19:17:04] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Real]Added 1 Read/Feed constraints in 15 ms returned sat
[2026-05-25 19:17:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:17:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:17:04] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 16 ms.
[2026-05-25 19:17:04] [INFO ] Added : 15 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 51 ms.
[2026-05-25 19:17:04] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-25 19:17:04] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:17:04] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 19 ms.
[2026-05-25 19:17:04] [INFO ] Added : 15 causal constraints over 3 iterations in 93 ms. Result :sat
Minimization took 45 ms.
[2026-05-25 19:17:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:17:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:17:05] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 19:17:05] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:17:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:17:05] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 15 ms.
[2026-05-25 19:17:05] [INFO ] Added : 17 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA HealthRecord-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Graph (trivial) has 237 edges and 158 vertex of which 10 / 158 are part of one of the 5 SCC in 181 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 664 edges and 153 vertex of which 123 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 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 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 123 transition count 156
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 192 place count 45 transition count 78
Iterating global reduction 1 with 78 rules applied. Total rules applied 270 place count 45 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 270 place count 45 transition count 73
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 280 place count 40 transition count 73
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 292 place count 28 transition count 57
Iterating global reduction 1 with 12 rules applied. Total rules applied 304 place count 28 transition count 57
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 313 place count 28 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 314 place count 27 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 315 place count 27 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 316 place count 27 transition count 46
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 3 with 6 rules applied. Total rules applied 322 place count 24 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 24 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 324 place count 23 transition count 41
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 20 vertex of which 10 / 20 are part of one of the 1 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 330 place count 11 transition count 39
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 356 place count 10 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 357 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 359 place count 9 transition count 12
Applied a total of 359 rules in 230 ms. Remains 9 /158 variables (removed 149) and now considering 12/306 (removed 294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 9/158 places, 12/306 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9295604405917723650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3344094511568977795.kers'
[2026-05-25 19:17:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9295604405917723650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3344094511568977795.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 9 cols 21 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-25 19:17:05] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3344094511568977795.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (130407 resets) in 417 ms. (2392 steps per ms)
FORMULA HealthRecord-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (52610 resets) in 254 ms. (3921 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 6102 ms.

BK_STOP 1779736626346

--------------------
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-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074300613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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