Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r111-smll-174867015900083.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 gold2024
Input is HealthRecord-PT-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015900083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 125K 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-16-UpperBounds-00
FORMULA_NAME HealthRecord-PT-16-UpperBounds-01
FORMULA_NAME HealthRecord-PT-16-UpperBounds-02
FORMULA_NAME HealthRecord-PT-16-UpperBounds-03
FORMULA_NAME HealthRecord-PT-16-UpperBounds-04
FORMULA_NAME HealthRecord-PT-16-UpperBounds-05
FORMULA_NAME HealthRecord-PT-16-UpperBounds-06
FORMULA_NAME HealthRecord-PT-16-UpperBounds-07
FORMULA_NAME HealthRecord-PT-16-UpperBounds-08
FORMULA_NAME HealthRecord-PT-16-UpperBounds-09
FORMULA_NAME HealthRecord-PT-16-UpperBounds-10
FORMULA_NAME HealthRecord-PT-16-UpperBounds-11
FORMULA_NAME HealthRecord-PT-16-UpperBounds-12
FORMULA_NAME HealthRecord-PT-16-UpperBounds-13
FORMULA_NAME HealthRecord-PT-16-UpperBounds-14
FORMULA_NAME HealthRecord-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748785834575

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:50: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-01 13:50:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:50:37] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2025-06-01 13:50:37] [INFO ] Transformed 453 places.
[2025-06-01 13:50:37] [INFO ] Transformed 594 transitions.
[2025-06-01 13:50:37] [INFO ] Found NUPN structural information;
[2025-06-01 13:50:37] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 560 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 594 rows 453 cols
[2025-06-01 13:50:37] [INFO ] Computed 14 invariants in 45 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 (9 resets) in 73 ms. (135 steps per ms)
FORMULA HealthRecord-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (124 resets) in 128 ms. (542 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-06-01 13:50:38] [INFO ] Invariant cache hit.
[2025-06-01 13:50:38] [INFO ] [Real]Absence check using 8 positive place invariants in 36 ms returned sat
[2025-06-01 13:50:38] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2025-06-01 13:50:39] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2025-06-01 13:50:39] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 125 ms.
[2025-06-01 13:50:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 30 ms returned sat
[2025-06-01 13:50:40] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2025-06-01 13:50:41] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2025-06-01 13:50:41] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 93 ms.
[2025-06-01 13:50:44] [INFO ] Added : 229 causal constraints over 46 iterations in 2824 ms. Result :sat
Minimization took 541 ms.
[2025-06-01 13:50:44] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-06-01 13:50:44] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2025-06-01 13:50:45] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2025-06-01 13:50:45] [INFO ] Deduced a trap composed of 91 places in 304 ms of which 68 ms to minimize.
[2025-06-01 13:50:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-06-01 13:50:45] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2025-06-01 13:50:45] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2025-06-01 13:50:46] [INFO ] Deduced a trap composed of 91 places in 238 ms of which 5 ms to minimize.
[2025-06-01 13:50:46] [INFO ] Deduced a trap composed of 94 places in 241 ms of which 5 ms to minimize.
[2025-06-01 13:50:46] [INFO ] Deduced a trap composed of 98 places in 281 ms of which 4 ms to minimize.
[2025-06-01 13:50:47] [INFO ] Deduced a trap composed of 116 places in 221 ms of which 5 ms to minimize.
[2025-06-01 13:50:47] [INFO ] Deduced a trap composed of 97 places in 230 ms of which 6 ms to minimize.
[2025-06-01 13:50:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1389 ms
[2025-06-01 13:50:47] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 63 ms.
[2025-06-01 13:50:50] [INFO ] Added : 231 causal constraints over 47 iterations in 2754 ms. Result :sat
Minimization took 403 ms.
[2025-06-01 13:50:50] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2025-06-01 13:50:50] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 15 ms returned sat
[2025-06-01 13:50:51] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2025-06-01 13:50:51] [INFO ] Deduced a trap composed of 92 places in 309 ms of which 5 ms to minimize.
[2025-06-01 13:50:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 28 ms returned sat
[2025-06-01 13:50:51] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 22 ms returned sat
[2025-06-01 13:50:52] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2025-06-01 13:50:52] [INFO ] Deduced a trap composed of 92 places in 332 ms of which 6 ms to minimize.
[2025-06-01 13:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2025-06-01 13:50:52] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 78 ms.
[2025-06-01 13:50:55] [INFO ] Added : 227 causal constraints over 46 iterations in 2709 ms. Result :sat
Minimization took 592 ms.
[2025-06-01 13:50:56] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2025-06-01 13:50:56] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2025-06-01 13:50:56] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2025-06-01 13:50:56] [INFO ] Deduced a trap composed of 93 places in 296 ms of which 5 ms to minimize.
[2025-06-01 13:50:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 29 ms returned sat
[2025-06-01 13:50:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 15 ms returned sat
[2025-06-01 13:50:57] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2025-06-01 13:50:57] [INFO ] Deduced a trap composed of 93 places in 266 ms of which 5 ms to minimize.
[2025-06-01 13:50:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2025-06-01 13:50:57] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 76 ms.
[2025-06-01 13:51:00] [INFO ] Added : 231 causal constraints over 47 iterations in 2192 ms. Result :sat
Minimization took 579 ms.
[2025-06-01 13:51:00] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2025-06-01 13:51:00] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 11 ms returned sat
[2025-06-01 13:51:01] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2025-06-01 13:51:01] [INFO ] Deduced a trap composed of 96 places in 259 ms of which 4 ms to minimize.
[2025-06-01 13:51:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:51:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2025-06-01 13:51:01] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2025-06-01 13:51:01] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-06-01 13:51:02] [INFO ] Deduced a trap composed of 96 places in 265 ms of which 4 ms to minimize.
[2025-06-01 13:51:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2025-06-01 13:51:02] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 60 ms.
[2025-06-01 13:51:04] [INFO ] Added : 249 causal constraints over 50 iterations in 2343 ms. Result :sat
Minimization took 603 ms.
[2025-06-01 13:51:05] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2025-06-01 13:51:05] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2025-06-01 13:51:05] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2025-06-01 13:51:05] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 73 ms.
[2025-06-01 13:51:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:51:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 26 ms returned sat
[2025-06-01 13:51:06] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 15 ms returned sat
[2025-06-01 13:51:07] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2025-06-01 13:51:07] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 72 ms.
[2025-06-01 13:51:08] [INFO ] Added : 56 causal constraints over 12 iterations in 763 ms. Result :sat
Minimization took 634 ms.
[2025-06-01 13:51:08] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2025-06-01 13:51:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 15 ms returned sat
[2025-06-01 13:51:09] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2025-06-01 13:51:09] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 73 ms.
[2025-06-01 13:51:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:51:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 26 ms returned sat
[2025-06-01 13:51:09] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 15 ms returned sat
[2025-06-01 13:51:10] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2025-06-01 13:51:10] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 70 ms.
[2025-06-01 13:51:13] [INFO ] Deduced a trap composed of 131 places in 261 ms of which 5 ms to minimize.
[2025-06-01 13:51:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2025-06-01 13:51:13] [INFO ] Added : 221 causal constraints over 45 iterations in 3204 ms. Result :sat
Minimization took 606 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 523 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 9 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 820 edges and 421 vertex of which 380 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.4 ms
Discarding 41 places :
Also discarding 28 output transitions
Drop transitions (Output transitions of discarded places.) removed 28 transitions
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 311 rules applied. Total rules applied 313 place count 380 transition count 203
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 244 rules applied. Total rules applied 557 place count 164 transition count 175
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 571 place count 152 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 573 place count 150 transition count 173
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 573 place count 150 transition count 159
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 601 place count 136 transition count 159
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 654 place count 83 transition count 106
Iterating global reduction 4 with 53 rules applied. Total rules applied 707 place count 83 transition count 106
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 707 place count 83 transition count 101
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 717 place count 78 transition count 101
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 724 place count 71 transition count 94
Iterating global reduction 4 with 7 rules applied. Total rules applied 731 place count 71 transition count 94
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 737 place count 65 transition count 88
Iterating global reduction 4 with 6 rules applied. Total rules applied 743 place count 65 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 745 place count 65 transition count 86
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 747 place count 63 transition count 82
Iterating global reduction 5 with 2 rules applied. Total rules applied 749 place count 63 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 750 place count 62 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 751 place count 62 transition count 81
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 771 place count 52 transition count 71
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 777 place count 49 transition count 85
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 780 place count 49 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 781 place count 48 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 782 place count 48 transition count 81
Free-agglomeration rule applied 13 times.
Iterating global reduction 5 with 13 rules applied. Total rules applied 795 place count 48 transition count 68
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 808 place count 35 transition count 68
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 810 place count 33 transition count 62
Iterating global reduction 6 with 2 rules applied. Total rules applied 812 place count 33 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 813 place count 33 transition count 61
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 814 place count 33 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 815 place count 33 transition count 60
Applied a total of 815 rules in 184 ms. Remains 33 /453 variables (removed 420) and now considering 60/594 (removed 534) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 33/453 places, 60/594 transitions.
[2025-06-01 13:51:14] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 33 cols
[2025-06-01 13:51:14] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (103977 resets) in 1568 ms. (637 steps per ms)
FORMULA HealthRecord-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (22843 resets) in 465 ms. (2145 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-01 13:51:16] [INFO ] Flatten gal took : 61 ms
[2025-06-01 13:51:16] [INFO ] Flatten gal took : 21 ms
[2025-06-01 13:51:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11200173360997227605.gal : 13 ms
[2025-06-01 13:51:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13648324796936651337.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11200173360997227605.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13648324796936651337.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 39785 ms.

BK_STOP 1748785876934

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is HealthRecord-PT-16, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-smll-174867015900083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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