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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 46K 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 1717193841144

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-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:17:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:17:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:17:22] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-31 22:17:22] [INFO ] Transformed 117 places.
[2024-05-31 22:17:22] [INFO ] Transformed 218 transitions.
[2024-05-31 22:17:22] [INFO ] Found NUPN structural information;
[2024-05-31 22:17:22] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 163 ms.
Graph (trivial) has 178 edges and 117 vertex of which 14 / 117 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Structural test allowed to assert that 30 places are NOT stable. Took 19 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (3069 resets) in 1552 ms. (25 steps per ms) remains 26/87 properties
BEST_FIRST walk for 4004 steps (43 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (42 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (41 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (41 resets) in 32 ms. (121 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4003 steps (40 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (41 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (42 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (43 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (44 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (43 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (39 resets) in 11 ms. (333 steps per ms) remains 20/24 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (42 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (40 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (41 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (42 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (42 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
[2024-05-31 22:17:23] [INFO ] Flow matrix only has 191 transitions (discarded 15 similar events)
// Phase 1: matrix 191 rows 110 cols
[2024-05-31 22:17:23] [INFO ] Computed 14 invariants in 10 ms
[2024-05-31 22:17:23] [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) 56/76 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 56/84 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 34/110 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 34/124 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 190/300 variables, 110/234 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 1/301 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/301 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 235 constraints, problems are : Problem set: 0 solved, 20 unsolved in 834 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 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) 56/76 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 56/84 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 13 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 5 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 2 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 3 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 34/110 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 34/142 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:17:25] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 2 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 2 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 10/165 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/110 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 8 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/110 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/110 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/110 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/110 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/110 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (OVERLAPS) 190/300 variables, 110/296 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/300 variables, 20/316 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/300 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/300 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (OVERLAPS) 1/301 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/301 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 318 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5007 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 63/63 constraints]
After SMT, in 5913ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 206/206 transitions.
Graph (complete) has 401 edges and 110 vertex of which 103 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 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 103 transition count 184
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 14 rules applied. Total rules applied 30 place count 97 transition count 176
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 33 place count 95 transition count 175
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 33 place count 95 transition count 171
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 44 place count 88 transition count 171
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 76 place count 56 transition count 107
Iterating global reduction 3 with 32 rules applied. Total rules applied 108 place count 56 transition count 107
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 52 transition count 99
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 52 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 52 transition count 97
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 126 place count 48 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 48 transition count 119
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 147 place count 48 transition count 119
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 164 place count 48 transition count 119
Applied a total of 164 rules in 46 ms. Remains 48 /110 variables (removed 62) and now considering 119/206 (removed 87) transitions.
Running 111 sub problems to find dead transitions.
[2024-05-31 22:17:29] [INFO ] Flow matrix only has 118 transitions (discarded 1 similar events)
// Phase 1: matrix 118 rows 48 cols
[2024-05-31 22:17:29] [INFO ] Computed 4 invariants in 2 ms
[2024-05-31 22:17:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 2/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 4 (OVERLAPS) 118/166 variables, 48/52 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 20/72 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/72 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/72 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 72 constraints, problems are : Problem set: 18 solved, 93 unsolved in 1308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 2/47 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 3/4 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 118/166 variables, 48/52 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 20/72 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 93/165 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 2/167 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/167 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/166 variables, 2/169 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/169 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 0/166 variables, 0/169 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 169 constraints, problems are : Problem set: 18 solved, 93 unsolved in 3379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 4/4 constraints]
After SMT, in 4802ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 4804ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 48/110 places, 101/206 transitions.
Graph (complete) has 153 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 47 transition count 101
Applied a total of 3 rules in 11 ms. Remains 47 /48 variables (removed 1) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4876 ms. Remains : 47/110 places, 101/206 transitions.
RANDOM walk for 351555 steps (115320 resets) in 1641 ms. (214 steps per ms) remains 0/20 properties
Able to resolve query StableMarking after proving 89 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 12663 ms.
ITS solved all properties within timeout

BK_STOP 1717193854975

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

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