Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640604300821.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
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 r496-tall-171640604300821
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 125K May 18 16:42 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

here is the order used to build the result vector(from text 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 1717201762057

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:29:23] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-01 00:29:23] [INFO ] Transformed 453 places.
[2024-06-01 00:29:23] [INFO ] Transformed 594 transitions.
[2024-06-01 00:29:23] [INFO ] Found NUPN structural information;
[2024-06-01 00:29:23] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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
[2024-06-01 00:29:23] [INFO ] Computed 14 invariants in 20 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 (97 resets) in 51 ms. (192 steps per ms)
FORMULA HealthRecord-PT-16-UpperBounds-14 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-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100008 steps (158 resets) in 81 ms. (1219 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 00:29:23] [INFO ] Invariant cache hit.
[2024-06-01 00:29:23] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-06-01 00:29:23] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2024-06-01 00:29:24] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-06-01 00:29:24] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 45 ms.
[2024-06-01 00:29:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:29:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-01 00:29:24] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2024-06-01 00:29:24] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-06-01 00:29:24] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 37 ms.
[2024-06-01 00:29:25] [INFO ] Added : 56 causal constraints over 12 iterations in 459 ms. Result :sat
Minimization took 452 ms.
[2024-06-01 00:29:26] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-01 00:29:26] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 11 ms returned sat
[2024-06-01 00:29:26] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-06-01 00:29:26] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 36 ms.
[2024-06-01 00:29:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:29:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-01 00:29:26] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 00:29:26] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-06-01 00:29:26] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 38 ms.
[2024-06-01 00:29:27] [INFO ] Added : 51 causal constraints over 11 iterations in 393 ms. Result :sat
Minimization took 439 ms.
[2024-06-01 00:29:27] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-01 00:29:27] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2024-06-01 00:29:27] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-06-01 00:29:28] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 17 ms to minimize.
[2024-06-01 00:29:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:29:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-01 00:29:28] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2024-06-01 00:29:28] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-01 00:29:28] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:29:28] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 3 ms to minimize.
[2024-06-01 00:29:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2024-06-01 00:29:28] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2024-06-01 00:29:29] [INFO ] Added : 94 causal constraints over 19 iterations in 603 ms. Result :sat
Minimization took 443 ms.
[2024-06-01 00:29:29] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 00:29:29] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 00:29:29] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-06-01 00:29:30] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 5 ms to minimize.
[2024-06-01 00:29:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:29:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-01 00:29:30] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 00:29:30] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-06-01 00:29:30] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
[2024-06-01 00:29:30] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 2 ms to minimize.
[2024-06-01 00:29:30] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-06-01 00:29:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 457 ms
[2024-06-01 00:29:30] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 34 ms.
[2024-06-01 00:29:31] [INFO ] Added : 89 causal constraints over 18 iterations in 585 ms. Result :sat
Minimization took 431 ms.
[2024-06-01 00:29:32] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 00:29:32] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 00:29:32] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-06-01 00:29:32] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 32 ms.
[2024-06-01 00:29:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:29:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-01 00:29:32] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2024-06-01 00:29:32] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-06-01 00:29:32] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 34 ms.
[2024-06-01 00:29:34] [INFO ] Added : 232 causal constraints over 47 iterations in 1543 ms. Result :sat
Minimization took 441 ms.
[2024-06-01 00:29:34] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 00:29:34] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 00:29:34] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-06-01 00:29:34] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 31 ms.
[2024-06-01 00:29:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:29:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 00:29:35] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 00:29:35] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-06-01 00:29:35] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 30 ms.
[2024-06-01 00:29:37] [INFO ] Added : 238 causal constraints over 48 iterations in 1588 ms. Result :sat
Minimization took 444 ms.
[2024-06-01 00:29:37] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 00:29:37] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 00:29:37] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-06-01 00:29:37] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 29 ms.
[2024-06-01 00:29:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:29:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 00:29:38] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 00:29:38] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-06-01 00:29:38] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2024-06-01 00:29:39] [INFO ] Added : 233 causal constraints over 47 iterations in 1467 ms. Result :sat
Minimization took 444 ms.
[2024-06-01 00:29:40] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-01 00:29:40] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 00:29:40] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-06-01 00:29:40] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 29 ms.
[2024-06-01 00:29:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:29:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-01 00:29:40] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 00:29:40] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-06-01 00:29:40] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2024-06-01 00:29:42] [INFO ] Added : 199 causal constraints over 40 iterations in 1270 ms. Result :sat
Minimization took 446 ms.
[2024-06-01 00:29:42] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-01 00:29:42] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 00:29:42] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-06-01 00:29:43] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-06-01 00:29:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:29:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-01 00:29:43] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 00:29:43] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-06-01 00:29:43] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-06-01 00:29:43] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 5 ms to minimize.
[2024-06-01 00:29:43] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-06-01 00:29:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 432 ms
[2024-06-01 00:29:43] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 33 ms.
[2024-06-01 00:29:44] [INFO ] Added : 91 causal constraints over 19 iterations in 595 ms. Result :sat
Minimization took 432 ms.
[2024-06-01 00:29:44] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 00:29:44] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 00:29:45] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-06-01 00:29:45] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 29 ms.
[2024-06-01 00:29:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:29:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-01 00:29:45] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2024-06-01 00:29:45] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-06-01 00:29:45] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2024-06-01 00:29:47] [INFO ] Added : 233 causal constraints over 47 iterations in 1467 ms. Result :sat
Minimization took 447 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 532 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 5 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.2 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 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 318 rules applied. Total rules applied 320 place count 380 transition count 196
Reduce places removed 222 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 250 rules applied. Total rules applied 570 place count 158 transition count 168
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 582 place count 146 transition count 168
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 582 place count 146 transition count 155
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 608 place count 133 transition count 155
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 667 place count 74 transition count 96
Iterating global reduction 3 with 59 rules applied. Total rules applied 726 place count 74 transition count 96
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 726 place count 74 transition count 89
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 740 place count 67 transition count 89
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 750 place count 57 transition count 79
Iterating global reduction 3 with 10 rules applied. Total rules applied 760 place count 57 transition count 79
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 767 place count 50 transition count 72
Iterating global reduction 3 with 7 rules applied. Total rules applied 774 place count 50 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 777 place count 50 transition count 69
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 784 place count 43 transition count 60
Iterating global reduction 4 with 7 rules applied. Total rules applied 791 place count 43 transition count 60
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 796 place count 43 transition count 55
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 798 place count 41 transition count 53
Iterating global reduction 5 with 2 rules applied. Total rules applied 800 place count 41 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 801 place count 41 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 817 place count 33 transition count 44
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 825 place count 29 transition count 59
Free-agglomeration rule applied 5 times with reduction of 1 identical transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 830 place count 29 transition count 53
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 835 place count 24 transition count 53
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 836 place count 24 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 837 place count 24 transition count 53
Applied a total of 837 rules in 69 ms. Remains 24 /453 variables (removed 429) and now considering 53/594 (removed 541) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 24/453 places, 53/594 transitions.
[2024-06-01 00:29:47] [INFO ] Flow matrix only has 44 transitions (discarded 9 similar events)
// Phase 1: matrix 44 rows 24 cols
[2024-06-01 00:29:47] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (81431 resets) in 1038 ms. (962 steps per ms)
FORMULA HealthRecord-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (25517 resets) in 354 ms. (2816 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 26188 ms.
ITS solved all properties within timeout

BK_STOP 1717201789448

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
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 r496-tall-171640604300821"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;