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-171640604000719.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604000719
=====================================================================

--------------------
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

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

=== Now, execution of the tool begins

BK_START 1717200875157

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-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:14:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:14:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:14:36] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-06-01 00:14:36] [INFO ] Transformed 121 places.
[2024-06-01 00:14:36] [INFO ] Transformed 232 transitions.
[2024-06-01 00:14:36] [INFO ] Found NUPN structural information;
[2024-06-01 00:14:36] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
RANDOM walk for 40000 steps (2684 resets) in 1577 ms. (25 steps per ms) remains 12/16 properties
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (402 resets) in 298 ms. (133 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (392 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (403 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (319 resets) in 435 ms. (91 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (418 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (400 resets) in 228 ms. (174 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (318 resets) in 244 ms. (163 steps per ms) remains 11/12 properties
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (408 resets) in 585 ms. (68 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (252 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (351 resets) in 269 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (421 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
[2024-06-01 00:14:37] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
// Phase 1: matrix 217 rows 121 cols
[2024-06-01 00:14:38] [INFO ] Computed 14 invariants in 15 ms
[2024-06-01 00:14:38] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem HealthRecord-PT-03-ReachabilityFireability-2024-08 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-03-ReachabilityFireability-2024-10 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-03-ReachabilityFireability-2024-15 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 28/99 variables, 8/79 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 28/107 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/107 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 22/121 variables, 6/113 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 22/135 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Problem HealthRecord-PT-03-ReachabilityFireability-2024-04 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 216/337 variables, 121/256 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/256 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/338 variables, 1/257 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 0/257 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/338 variables, 0/257 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 257 constraints, problems are : Problem set: 4 solved, 7 unsolved in 642 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem HealthRecord-PT-03-ReachabilityFireability-2024-07 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 40/94 variables, 8/62 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 40/102 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-01 00:14:38] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 13 ms to minimize.
[2024-06-01 00:14:38] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:14:38] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 5/107 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 5/112 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/113 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/113 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 27/121 variables, 6/119 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 27/146 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
Problem HealthRecord-PT-03-ReachabilityFireability-2024-06 is UNSAT
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 2/148 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/148 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 216/337 variables, 121/269 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 5/274 constraints. Problems are: Problem set: 6 solved, 5 unsolved
[2024-06-01 00:14:39] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 1/275 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 0/275 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/338 variables, 1/276 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/338 variables, 0/276 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/338 variables, 0/276 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 276 constraints, problems are : Problem set: 6 solved, 5 unsolved in 1624 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/11 constraints, Known Traps: 14/14 constraints]
After SMT, in 2395ms problems are : Problem set: 6 solved, 5 unsolved
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 231 ms.
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 225/225 transitions.
Graph (trivial) has 176 edges and 121 vertex of which 8 / 121 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 431 edges and 117 vertex of which 109 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output 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 4 rules applied. Total rules applied 6 place count 109 transition count 204
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 16 place count 105 transition count 198
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 19 place count 103 transition count 197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 103 transition count 195
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 24 place count 100 transition count 195
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 76 place count 48 transition count 91
Iterating global reduction 3 with 52 rules applied. Total rules applied 128 place count 48 transition count 91
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 138 place count 38 transition count 71
Iterating global reduction 3 with 10 rules applied. Total rules applied 148 place count 38 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 152 place count 38 transition count 67
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 155 place count 35 transition count 58
Iterating global reduction 4 with 3 rules applied. Total rules applied 158 place count 35 transition count 58
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 32 transition count 52
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 32 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 167 place count 32 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 169 place count 31 transition count 48
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 179 place count 26 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 26 transition count 117
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 183 place count 25 transition count 115
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 24 transition count 90
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 24 transition count 90
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 23 transition count 87
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 23 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 191 place count 23 transition count 83
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 200 place count 23 transition count 83
Applied a total of 200 rules in 108 ms. Remains 23 /121 variables (removed 98) and now considering 83/225 (removed 142) transitions.
Running 67 sub problems to find dead transitions.
[2024-06-01 00:14:40] [INFO ] Flow matrix only has 69 transitions (discarded 14 similar events)
// Phase 1: matrix 69 rows 23 cols
[2024-06-01 00:14:40] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 00:14:40] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 3 (OVERLAPS) 69/92 variables, 23/28 constraints. Problems are: Problem set: 2 solved, 65 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 12/40 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/92 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 40 constraints, problems are : Problem set: 4 solved, 63 unsolved in 626 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 69/92 variables, 23/28 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 12/40 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 63/103 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/103 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/103 constraints. Problems are: Problem set: 4 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 103 constraints, problems are : Problem set: 4 solved, 63 unsolved in 1041 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 63/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 1762ms problems are : Problem set: 4 solved, 63 unsolved
Search for dead transitions found 4 dead transitions in 1765ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/121 places, 79/225 transitions.
Graph (complete) has 78 edges and 23 vertex of which 22 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 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 22 transition count 79
Applied a total of 8 rules in 8 ms. Remains 22 /23 variables (removed 1) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1904 ms. Remains : 22/121 places, 79/225 transitions.
RANDOM walk for 17342 steps (4335 resets) in 460 ms. (37 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-03-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6358 ms.
ITS solved all properties within timeout

BK_STOP 1717200882775

--------------------
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-03"
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-03, 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-171640604000719"
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 [ "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 ;