Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640604200799.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-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604200799
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 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 71K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717201576228

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:26:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:26:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:26:17] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-06-01 00:26:17] [INFO ] Transformed 161 places.
[2024-06-01 00:26:17] [INFO ] Transformed 341 transitions.
[2024-06-01 00:26:17] [INFO ] Found NUPN structural information;
[2024-06-01 00:26:17] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
RANDOM walk for 40000 steps (3098 resets) in 1768 ms. (22 steps per ms) remains 11/16 properties
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (458 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (428 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (437 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (254 resets) in 475 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (434 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (440 resets) in 72 ms. (548 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (437 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (433 resets) in 62 ms. (634 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (427 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (450 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (264 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
[2024-06-01 00:26:18] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2024-06-01 00:26:18] [INFO ] Computed 18 invariants in 20 ms
[2024-06-01 00:26:18] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem HealthRecord-PT-13-ReachabilityFireability-2024-01 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-13-ReachabilityFireability-2024-11 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 38/137 variables, 10/109 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 38/147 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/148 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem HealthRecord-PT-13-ReachabilityFireability-2024-12 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 24/161 variables, 7/155 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 24/179 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 300/461 variables, 161/340 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/340 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/462 variables, 1/341 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/341 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/341 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 341 constraints, problems are : Problem set: 3 solved, 8 unsolved in 798 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 43/132 variables, 10/99 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 43/142 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/143 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-01 00:26:19] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 15 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 12/155 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 2/157 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 29/161 variables, 7/164 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 29/193 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 4 ms to minimize.
[2024-06-01 00:26:20] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 2 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
Problem HealthRecord-PT-13-ReachabilityFireability-2024-03 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
Problem HealthRecord-PT-13-ReachabilityFireability-2024-04 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:26:21] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
Problem HealthRecord-PT-13-ReachabilityFireability-2024-03 is UNSAT
Problem HealthRecord-PT-13-ReachabilityFireability-2024-04 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 20/213 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 7/220 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 2/222 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 3/225 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-01 00:26:23] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 1/226 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/161 variables, 0/226 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 300/461 variables, 161/387 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/461 variables, 6/393 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-01 00:26:23] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/461 variables, 1/394 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/461 variables, 0/394 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 1/462 variables, 1/395 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 0/395 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/462 variables, 0/395 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 395 constraints, problems are : Problem set: 5 solved, 6 unsolved in 4809 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/11 constraints, Known Traps: 48/48 constraints]
After SMT, in 5796ms problems are : Problem set: 5 solved, 6 unsolved
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 293 ms.
Support contains 33 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 69 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 681 edges and 157 vertex of which 148 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 148 transition count 291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 147 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 146 transition count 289
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 77 place count 76 transition count 150
Iterating global reduction 3 with 70 rules applied. Total rules applied 147 place count 76 transition count 150
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 154 place count 69 transition count 136
Iterating global reduction 3 with 7 rules applied. Total rules applied 161 place count 69 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 165 place count 69 transition count 132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 68 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 68 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 67 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 67 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 170 place count 67 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 172 place count 67 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 172 place count 67 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 65 transition count 122
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 65 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 180 place count 63 transition count 120
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 193 place count 63 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 194 place count 62 transition count 119
Applied a total of 194 rules in 65 ms. Remains 62 /161 variables (removed 99) and now considering 119/313 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 62/161 places, 119/313 transitions.
RANDOM walk for 40000 steps (3112 resets) in 1100 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (526 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 448178 steps, run visited all 1 properties in 444 ms. (steps per millisecond=1009 )
Probabilistic random walk after 448178 steps, saw 67525 distinct states, run finished after 448 ms. (steps per millisecond=1000 ) properties seen :1
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 8424 ms.
ITS solved all properties within timeout

BK_STOP 1717201585818

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-13"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-13, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640604200799"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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