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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K 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 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Apr 12 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 20:11 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 49K 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 1717193885161

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-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:18:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:18:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:18:06] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-31 22:18:06] [INFO ] Transformed 121 places.
[2024-05-31 22:18:06] [INFO ] Transformed 232 transitions.
[2024-05-31 22:18:06] [INFO ] Found NUPN structural information;
[2024-05-31 22:18:06] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 164 ms.
Graph (trivial) has 186 edges and 121 vertex of which 10 / 121 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Structural test allowed to assert that 28 places are NOT stable. Took 19 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (3361 resets) in 1955 ms. (20 steps per ms) remains 26/93 properties
BEST_FIRST walk for 4002 steps (43 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (45 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (46 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (44 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (45 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (43 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (44 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (43 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (49 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (45 resets) in 10 ms. (363 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4003 steps (43 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (43 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (47 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
[2024-05-31 22:18:07] [INFO ] Flow matrix only has 207 transitions (discarded 13 similar events)
// Phase 1: matrix 207 rows 116 cols
[2024-05-31 22:18:07] [INFO ] Computed 14 invariants in 8 ms
[2024-05-31 22:18:07] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 57/77 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 57/85 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 39/116 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 39/130 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 206/322 variables, 116/246 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 1/323 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/323 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 247 constraints, problems are : Problem set: 0 solved, 20 unsolved in 763 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 57/77 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 57/85 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 11 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:08] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 39/116 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 4 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 16/170 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:18:10] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:11] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/116 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:11] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:18:11] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:11] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/116 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:11] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/116 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:11] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/116 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/116 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 206/322 variables, 116/298 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/322 variables, 20/318 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:18:11] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/322 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/322 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 1/323 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/323 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 25 (OVERLAPS) 0/323 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 320 constraints, problems are : Problem set: 0 solved, 20 unsolved in 4402 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 53/53 constraints]
After SMT, in 5216ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 13 different solutions.
Parikh walk visited 17 properties in 787 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 220/220 transitions.
Graph (complete) has 429 edges and 116 vertex of which 109 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 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 109 transition count 202
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 10 rules applied. Total rules applied 22 place count 105 transition count 196
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 25 place count 103 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 25 place count 103 transition count 193
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 100 transition count 193
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 82 place count 48 transition count 89
Iterating global reduction 3 with 52 rules applied. Total rules applied 134 place count 48 transition count 89
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 144 place count 38 transition count 69
Iterating global reduction 3 with 10 rules applied. Total rules applied 154 place count 38 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 158 place count 38 transition count 65
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 35 transition count 56
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 35 transition count 56
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 167 place count 32 transition count 50
Iterating global reduction 4 with 3 rules applied. Total rules applied 170 place count 32 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 173 place count 32 transition count 47
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 183 place count 27 transition count 71
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 184 place count 27 transition count 70
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 185 place count 27 transition count 115
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 188 place count 26 transition count 113
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 189 place count 25 transition count 88
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 25 transition count 88
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 191 place count 24 transition count 85
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 24 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 196 place count 24 transition count 81
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 204 place count 24 transition count 81
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 211 place count 24 transition count 81
Applied a total of 211 rules in 48 ms. Remains 24 /116 variables (removed 92) and now considering 81/220 (removed 139) transitions.
Running 65 sub problems to find dead transitions.
[2024-05-31 22:18:13] [INFO ] Flow matrix only has 67 transitions (discarded 14 similar events)
// Phase 1: matrix 67 rows 24 cols
[2024-05-31 22:18:13] [INFO ] Computed 6 invariants in 5 ms
[2024-05-31 22:18:13] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 4 (OVERLAPS) 67/91 variables, 24/30 constraints. Problems are: Problem set: 8 solved, 57 unsolved
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 11/41 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 41 constraints, problems are : Problem set: 10 solved, 55 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 5/6 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 67/91 variables, 24/30 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 11/41 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 55/96 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/96 constraints. Problems are: Problem set: 10 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/96 constraints. Problems are: Problem set: 10 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 96 constraints, problems are : Problem set: 10 solved, 55 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 55/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1529ms problems are : Problem set: 10 solved, 55 unsolved
Search for dead transitions found 10 dead transitions in 1533ms
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 : 24/116 places, 71/220 transitions.
Graph (complete) has 75 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 23 /24 variables (removed 1) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1600 ms. Remains : 23/116 places, 71/220 transitions.
RANDOM walk for 12571 steps (3122 resets) in 421 ms. (29 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 95 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 8837 ms.
ITS solved all properties within timeout

BK_STOP 1717193895234

--------------------
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-03"
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-03, 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-171640617900448"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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