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.r498-tall-171640617900453.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-04, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640617900453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 20:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 20:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 20:07 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 50K 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717193902216

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:18:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:18:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:18:23] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-31 22:18:23] [INFO ] Transformed 123 places.
[2024-05-31 22:18:23] [INFO ] Transformed 239 transitions.
[2024-05-31 22:18:23] [INFO ] Found NUPN structural information;
[2024-05-31 22:18:23] [INFO ] Parsed PT model containing 123 places and 239 transitions and 617 arcs in 174 ms.
Graph (trivial) has 190 edges and 123 vertex of which 8 / 123 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Structural test allowed to assert that 27 places are NOT stable. Took 19 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (3520 resets) in 2091 ms. (19 steps per ms) remains 32/96 properties
BEST_FIRST walk for 4003 steps (46 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (47 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (45 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (47 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (49 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (49 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (48 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (50 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (48 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (45 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (46 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (41 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (46 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (46 resets) in 11 ms. (333 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4004 steps (48 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (45 resets) in 13 ms. (285 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (45 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (46 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
[2024-05-31 22:18:24] [INFO ] Flow matrix only has 215 transitions (discarded 12 similar events)
// Phase 1: matrix 215 rows 119 cols
[2024-05-31 22:18:24] [INFO ] Computed 14 invariants in 15 ms
[2024-05-31 22:18:24] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 51/79 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 51/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 40/119 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 40/133 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 214/333 variables, 119/252 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 1/334 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 0/334 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 253 constraints, problems are : Problem set: 0 solved, 28 unsolved in 906 ms.
Refiners :[Domain max(s): 119/119 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 51/79 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 51/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-31 22:18:25] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 12 ms to minimize.
[2024-05-31 22:18:25] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:18:25] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:18:25] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 40/119 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 13/166 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 214/333 variables, 119/285 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 28/313 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/333 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 17 (OVERLAPS) 1/334 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-31 22:18:28] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/334 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-31 22:18:28] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 5 ms to minimize.
[2024-05-31 22:18:28] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:18:28] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/334 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/334 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 21 (OVERLAPS) 0/334 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 318 constraints, problems are : Problem set: 0 solved, 28 unsolved in 4055 ms.
Refiners :[Domain max(s): 119/119 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 37/37 constraints]
After SMT, in 5030ms problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 24 different solutions.
Parikh walk visited 25 properties in 1791 ms.
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 227/227 transitions.
Graph (complete) has 443 edges and 119 vertex of which 112 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 112 transition count 211
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 109 transition count 206
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 107 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 107 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 106 transition count 204
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 78 place count 51 transition count 94
Iterating global reduction 3 with 55 rules applied. Total rules applied 133 place count 51 transition count 94
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 143 place count 41 transition count 74
Iterating global reduction 3 with 10 rules applied. Total rules applied 153 place count 41 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 157 place count 41 transition count 70
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 160 place count 38 transition count 61
Iterating global reduction 4 with 3 rules applied. Total rules applied 163 place count 38 transition count 61
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 166 place count 35 transition count 55
Iterating global reduction 4 with 3 rules applied. Total rules applied 169 place count 35 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 172 place count 35 transition count 52
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 182 place count 30 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 30 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 184 place count 30 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 185 place count 29 transition count 73
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 187 place count 29 transition count 129
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 191 place count 27 transition count 127
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 192 place count 26 transition count 96
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 26 transition count 96
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 194 place count 25 transition count 94
Iterating global reduction 7 with 1 rules applied. Total rules applied 195 place count 25 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 199 place count 25 transition count 90
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 206 place count 25 transition count 90
Applied a total of 206 rules in 72 ms. Remains 25 /119 variables (removed 94) and now considering 90/227 (removed 137) transitions.
Running 74 sub problems to find dead transitions.
[2024-05-31 22:18:31] [INFO ] Flow matrix only has 70 transitions (discarded 20 similar events)
// Phase 1: matrix 70 rows 25 cols
[2024-05-31 22:18:31] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 22:18:31] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
At refinement iteration 4 (OVERLAPS) 70/95 variables, 25/32 constraints. Problems are: Problem set: 8 solved, 66 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 11/43 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/43 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/43 constraints. Problems are: Problem set: 10 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 43 constraints, problems are : Problem set: 10 solved, 64 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 6/7 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 70/95 variables, 25/32 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 11/43 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 64/107 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/107 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/107 constraints. Problems are: Problem set: 10 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 107 constraints, problems are : Problem set: 10 solved, 64 unsolved in 1098 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 64/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 1916ms problems are : Problem set: 10 solved, 64 unsolved
Search for dead transitions found 10 dead transitions in 1920ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/119 places, 80/227 transitions.
Graph (complete) has 80 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 24 /25 variables (removed 1) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2014 ms. Remains : 24/119 places, 80/227 transitions.
RANDOM walk for 5030 steps (838 resets) in 147 ms. (33 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 98 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 10133 ms.
ITS solved all properties within timeout

BK_STOP 1717193913591

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -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-04"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-04, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r498-tall-171640617900453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-04.tgz
mv HealthRecord-PT-04 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;