Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200597.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is HealthRecord-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 68K May 29 14:32 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-08-UpperBounds-00
FORMULA_NAME HealthRecord-PT-08-UpperBounds-01
FORMULA_NAME HealthRecord-PT-08-UpperBounds-02
FORMULA_NAME HealthRecord-PT-08-UpperBounds-03
FORMULA_NAME HealthRecord-PT-08-UpperBounds-04
FORMULA_NAME HealthRecord-PT-08-UpperBounds-05
FORMULA_NAME HealthRecord-PT-08-UpperBounds-06
FORMULA_NAME HealthRecord-PT-08-UpperBounds-07
FORMULA_NAME HealthRecord-PT-08-UpperBounds-08
FORMULA_NAME HealthRecord-PT-08-UpperBounds-09
FORMULA_NAME HealthRecord-PT-08-UpperBounds-10
FORMULA_NAME HealthRecord-PT-08-UpperBounds-11
FORMULA_NAME HealthRecord-PT-08-UpperBounds-12
FORMULA_NAME HealthRecord-PT-08-UpperBounds-13
FORMULA_NAME HealthRecord-PT-08-UpperBounds-14
FORMULA_NAME HealthRecord-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749000515027

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 01:28:37] [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]
[2025-06-04 01:28:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:28:38] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2025-06-04 01:28:38] [INFO ] Transformed 156 places.
[2025-06-04 01:28:38] [INFO ] Transformed 326 transitions.
[2025-06-04 01:28:38] [INFO ] Found NUPN structural information;
[2025-06-04 01:28:38] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 398 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 1, 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]
FORMULA HealthRecord-PT-08-UpperBounds-02 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]
[2025-06-04 01:28:38] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2025-06-04 01:28:38] [INFO ] Computed 18 invariants in 32 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 (569 resets) in 116 ms. (85 steps per ms)
FORMULA HealthRecord-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (448 resets) in 117 ms. (508 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-04 01:28:38] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
[2025-06-04 01:28:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:38] [INFO ] [Real]Absence check using 10 positive place invariants in 26 ms returned sat
[2025-06-04 01:28:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2025-06-04 01:28:39] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2025-06-04 01:28:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:28:39] [INFO ] [Real]Added 1 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:39] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 24 ms to minimize.
[2025-06-04 01:28:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 26 ms returned sat
[2025-06-04 01:28:39] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2025-06-04 01:28:40] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2025-06-04 01:28:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:40] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 11 ms to minimize.
[2025-06-04 01:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2025-06-04 01:28:40] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 60 ms.
[2025-06-04 01:28:40] [INFO ] Added : 25 causal constraints over 6 iterations in 346 ms. Result :sat
Minimization took 225 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:40] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 01:28:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-04 01:28:41] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2025-06-04 01:28:41] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 01:28:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-04 01:28:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-04 01:28:41] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2025-06-04 01:28:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-04 01:28:41] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 50 ms.
[2025-06-04 01:28:41] [INFO ] Added : 19 causal constraints over 5 iterations in 244 ms. Result :sat
Minimization took 193 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:42] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-04 01:28:42] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-04 01:28:42] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-06-04 01:28:42] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-04 01:28:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 21 ms returned sat
[2025-06-04 01:28:42] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-04 01:28:42] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-04 01:28:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-04 01:28:42] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 54 ms.
[2025-06-04 01:28:42] [INFO ] Added : 19 causal constraints over 5 iterations in 229 ms. Result :sat
Minimization took 175 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:43] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-04 01:28:43] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2025-06-04 01:28:43] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2025-06-04 01:28:43] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 01:28:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 01:28:43] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-04 01:28:43] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-06-04 01:28:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 01:28:43] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 46 ms.
[2025-06-04 01:28:43] [INFO ] Added : 19 causal constraints over 5 iterations in 222 ms. Result :sat
Minimization took 203 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:44] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2025-06-04 01:28:44] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2025-06-04 01:28:44] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2025-06-04 01:28:44] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:44] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 10 ms to minimize.
[2025-06-04 01:28:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-04 01:28:44] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2025-06-04 01:28:44] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2025-06-04 01:28:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2025-06-04 01:28:44] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 40 ms.
[2025-06-04 01:28:45] [INFO ] Added : 23 causal constraints over 6 iterations in 264 ms. Result :sat
Minimization took 217 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:45] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 01:28:45] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-04 01:28:45] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-06-04 01:28:45] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:45] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 12 ms to minimize.
[2025-06-04 01:28:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:28:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-04 01:28:46] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 01:28:46] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-06-04 01:28:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 01:28:46] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 46 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:28:46] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 8 ms to minimize.
[2025-06-04 01:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2025-06-04 01:28:46] [INFO ] Added : 31 causal constraints over 8 iterations in 496 ms. Result :sat
Minimization took 243 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-08-UpperBounds-06 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 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 300/300 transitions.
Graph (trivial) has 237 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 650 edges and 150 vertex of which 118 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 118 transition count 148
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 188 place count 41 transition count 71
Iterating global reduction 1 with 77 rules applied. Total rules applied 265 place count 41 transition count 71
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 265 place count 41 transition count 65
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 277 place count 35 transition count 65
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 287 place count 25 transition count 53
Iterating global reduction 1 with 10 rules applied. Total rules applied 297 place count 25 transition count 53
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 306 place count 25 transition count 44
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 308 place count 23 transition count 41
Iterating global reduction 2 with 2 rules applied. Total rules applied 310 place count 23 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 311 place count 23 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 22 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 22 transition count 39
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 316 place count 22 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 318 place count 21 transition count 35
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 319 place count 21 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 320 place count 20 transition count 33
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 13 edges and 17 vertex of which 8 / 17 are part of one of the 1 SCC in 1 ms
Free SCC test removed 7 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 4 with 6 rules applied. Total rules applied 326 place count 10 transition count 31
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 347 place count 9 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 348 place count 9 transition count 10
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 6 with 2 rules applied. Total rules applied 350 place count 8 transition count 9
Applied a total of 350 rules in 111 ms. Remains 8 /156 variables (removed 148) and now considering 9/300 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 8/156 places, 9/300 transitions.
// Phase 1: matrix 9 rows 8 cols
[2025-06-04 01:28:47] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (125034 resets) in 756 ms. (1321 steps per ms)
FORMULA HealthRecord-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (58805 resets) in 429 ms. (2325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-04 01:28:48] [INFO ] Flatten gal took : 30 ms
[2025-06-04 01:28:48] [INFO ] Flatten gal took : 4 ms
[2025-06-04 01:28:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16246370708233482412.gal : 6 ms
[2025-06-04 01:28:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9846178946510957266.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16246370708233482412.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9846178946510957266.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 11440 ms.

BK_STOP 1749000529115

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-08"
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-5832"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-08, 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 r100-smll-174867008200597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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