About the Execution of ITS-Tools for HealthRecord-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 409.867 | 5752.00 | 11189.00 | 72.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-177961074300581.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-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300581
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.2K Mar 7 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 7 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 7 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 7 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Mar 7 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:42 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 67K 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-06-UpperBounds-00
FORMULA_NAME HealthRecord-PT-06-UpperBounds-01
FORMULA_NAME HealthRecord-PT-06-UpperBounds-02
FORMULA_NAME HealthRecord-PT-06-UpperBounds-03
FORMULA_NAME HealthRecord-PT-06-UpperBounds-04
FORMULA_NAME HealthRecord-PT-06-UpperBounds-05
FORMULA_NAME HealthRecord-PT-06-UpperBounds-06
FORMULA_NAME HealthRecord-PT-06-UpperBounds-07
FORMULA_NAME HealthRecord-PT-06-UpperBounds-08
FORMULA_NAME HealthRecord-PT-06-UpperBounds-09
FORMULA_NAME HealthRecord-PT-06-UpperBounds-10
FORMULA_NAME HealthRecord-PT-06-UpperBounds-11
FORMULA_NAME HealthRecord-PT-06-UpperBounds-12
FORMULA_NAME HealthRecord-PT-06-UpperBounds-13
FORMULA_NAME HealthRecord-PT-06-UpperBounds-14
FORMULA_NAME HealthRecord-PT-06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779735927153
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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 19:05:28] [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:05:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:05:28] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2026-05-25 19:05:28] [INFO ] Transformed 154 places.
[2026-05-25 19:05:28] [INFO ] Transformed 319 transitions.
[2026-05-25 19:05:28] [INFO ] Found NUPN structural information;
[2026-05-25 19:05:28] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 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-17752387895769808787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16665478194074776323.kers'
[2026-05-25 19:05:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17752387895769808787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16665478194074776323.kers]
Normalized transition count is 281 out of 294 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 281 rows 147 cols 738 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-05-25 19:05:28] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16665478194074776323.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 (500 resets) in 46 ms. (212 steps per ms)
FORMULA HealthRecord-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (325 resets) in 50 ms. (980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-25 19:05:28] [INFO ] Flow matrix only has 282 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-6960367767812997688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2282106762117976426.kers'
[2026-05-25 19:05:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6960367767812997688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2282106762117976426.kers]
Normalized transition count is 281 out of 282 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 281 rows 147 cols 738 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-05-25 19:05:28] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2282106762117976426.kers
Total runtime 2 ms.
[2026-05-25 19:05:28] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2026-05-25 19:05:28] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-25 19:05:28] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-25 19:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:05:29] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:05:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:05:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-25 19:05:29] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:05:29] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 19:05:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2026-05-25 19:05:29] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 21 ms.
[2026-05-25 19:05:29] [INFO ] Added : 15 causal constraints over 3 iterations in 106 ms. Result :sat
Minimization took 50 ms.
[2026-05-25 19:05:29] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:05:29] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:05:29] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-25 19:05:29] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:05:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:05:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:05:29] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:05:29] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-25 19:05:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:05:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2026-05-25 19:05:30] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 35 ms.
[2026-05-25 19:05:30] [INFO ] Added : 15 causal constraints over 3 iterations in 94 ms. Result :sat
Minimization took 45 ms.
[2026-05-25 19:05:30] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:05:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:05:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-25 19:05:30] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 15 ms.
[2026-05-25 19:05:30] [INFO ] Added : 16 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 44 ms.
[2026-05-25 19:05:30] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:05:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:05:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-25 19:05:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:05:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 209 ms
[2026-05-25 19:05:31] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 29 ms.
[2026-05-25 19:05:31] [INFO ] Added : 20 causal constraints over 4 iterations in 111 ms. Result :sat
Minimization took 55 ms.
[2026-05-25 19:05:31] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:05:31] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-25 19:05:31] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-25 19:05:31] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:05:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:05:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:05:31] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:05:31] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2026-05-25 19:05:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-25 19:05:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2026-05-25 19:05:31] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 19 ms.
[2026-05-25 19:05:31] [INFO ] Added : 16 causal constraints over 4 iterations in 84 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 294/294 transitions.
Graph (trivial) has 230 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 6 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 636 edges and 147 vertex of which 113 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 105 place count 113 transition count 143
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 177 place count 41 transition count 71
Iterating global reduction 1 with 72 rules applied. Total rules applied 249 place count 41 transition count 71
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 249 place count 41 transition count 68
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 255 place count 38 transition count 68
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 264 place count 29 transition count 59
Iterating global reduction 1 with 9 rules applied. Total rules applied 273 place count 29 transition count 59
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 282 place count 29 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 284 place count 27 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 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 287 place count 27 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 288 place count 26 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 289 place count 26 transition count 45
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 292 place count 26 transition count 42
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 298 place count 23 transition count 39
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 299 place count 23 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 300 place count 22 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 301 place count 21 transition count 37
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 305 place count 21 transition count 33
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 307 place count 20 transition count 32
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 308 place count 19 transition count 31
Iterating global reduction 5 with 1 rules applied. Total rules applied 309 place count 19 transition count 31
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 312 place count 19 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 313 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 314 place count 18 transition count 27
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 315 place count 18 transition count 27
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 316 place count 18 transition count 26
Applied a total of 316 rules in 53 ms. Remains 18 /154 variables (removed 136) and now considering 26/294 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 18/154 places, 26/294 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4710210713934208464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6558889528608235996.kers'
[2026-05-25 19:05:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4710210713934208464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6558889528608235996.kers]
Normalized transition count is 22 out of 26 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 22 rows 16 cols 48 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-25 19:05:31] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6558889528608235996.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (77067 resets) in 629 ms. (1587 steps per ms)
FORMULA HealthRecord-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (24930 resets) in 288 ms. (3460 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4578 ms.
BK_STOP 1779735932905
--------------------
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-06"
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-06, 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-177961074300581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-06.tgz
mv HealthRecord-PT-06 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 '
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 ;
