fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r496-tall-171640604100734
Last Updated
July 7, 2024

About the Execution of LTSMin+red for HealthRecord-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
349.684 8247.00 20275.00 50.40 FTTFFTTFTTTTFTFF normal

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-171640604100734.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-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604100734
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 11K Apr 12 19:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 19:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 19:54 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 51K 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-05-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-05-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717201013180

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:16:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:16:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:16:54] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-06-01 00:16:54] [INFO ] Transformed 125 places.
[2024-06-01 00:16:54] [INFO ] Transformed 246 transitions.
[2024-06-01 00:16:54] [INFO ] Found NUPN structural information;
[2024-06-01 00:16:54] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (3678 resets) in 1670 ms. (23 steps per ms) remains 10/12 properties
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (499 resets) in 345 ms. (115 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (487 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (494 resets) in 1052 ms. (37 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (494 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (495 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (502 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (487 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (497 resets) in 43 ms. (909 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (491 resets) in 91 ms. (434 steps per ms) remains 9/10 properties
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (475 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
[2024-06-01 00:16:55] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2024-06-01 00:16:55] [INFO ] Computed 14 invariants in 13 ms
[2024-06-01 00:16:55] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 25/110 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 15/125 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 15/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem HealthRecord-PT-05-ReachabilityCardinality-2024-14 is UNSAT
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 228/353 variables, 125/264 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/264 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/354 variables, 1/265 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 265 constraints, problems are : Problem set: 1 solved, 8 unsolved in 835 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem HealthRecord-PT-05-ReachabilityCardinality-2024-02 is UNSAT
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-05-ReachabilityCardinality-2024-08 is UNSAT
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 37/101 variables, 8/72 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 37/109 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-06-01 00:16:56] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 12 ms to minimize.
[2024-06-01 00:16:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
[2024-06-01 00:16:57] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:16:57] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:16:57] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:16:57] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:16:57] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:16:57] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 8/117 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 24/125 variables, 6/123 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 24/147 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-06-01 00:16:57] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
Problem HealthRecord-PT-05-ReachabilityCardinality-2024-03 is UNSAT
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 00:16:57] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 2/149 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/149 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 228/353 variables, 125/274 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 5/279 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 00:16:57] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:16:57] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/281 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/281 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/354 variables, 1/282 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 00:16:58] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 1/283 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 00:16:58] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:16:58] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/354 variables, 2/285 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 00:16:58] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 0 ms to minimize.
[2024-06-01 00:16:58] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:16:58] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:16:58] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:16:58] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 5/290 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 00:16:58] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/354 variables, 1/291 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/354 variables, 0/291 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/354 variables, 0/291 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 291 constraints, problems are : Problem set: 4 solved, 5 unsolved in 2336 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 21/21 constraints]
After SMT, in 3282ms problems are : Problem set: 4 solved, 5 unsolved
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 435 ms.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 237/237 transitions.
Graph (trivial) has 178 edges and 125 vertex of which 6 / 125 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 457 edges and 122 vertex of which 115 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 115 transition count 219
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 112 transition count 214
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 16 place count 110 transition count 213
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 73 place count 53 transition count 99
Iterating global reduction 3 with 57 rules applied. Total rules applied 130 place count 53 transition count 99
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 139 place count 44 transition count 81
Iterating global reduction 3 with 9 rules applied. Total rules applied 148 place count 44 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 44 transition count 78
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 41 transition count 69
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 41 transition count 69
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 160 place count 38 transition count 63
Iterating global reduction 4 with 3 rules applied. Total rules applied 163 place count 38 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 166 place count 38 transition count 60
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 168 place count 37 transition count 59
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 178 place count 32 transition count 83
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 180 place count 32 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 182 place count 30 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 30 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 184 place count 29 transition count 80
Applied a total of 184 rules in 59 ms. Remains 29 /125 variables (removed 96) and now considering 80/237 (removed 157) transitions.
Running 64 sub problems to find dead transitions.
[2024-06-01 00:16:59] [INFO ] Flow matrix only has 70 transitions (discarded 10 similar events)
// Phase 1: matrix 70 rows 29 cols
[2024-06-01 00:16:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 00:16:59] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 2/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Problem TDEAD79 is UNSAT
At refinement iteration 4 (OVERLAPS) 70/99 variables, 29/36 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 14/50 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 50 constraints, problems are : Problem set: 1 solved, 63 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 29/29 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 2/28 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/29 variables, 6/7 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 70/99 variables, 29/36 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 14/50 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 63/113 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 113 constraints, problems are : Problem set: 1 solved, 63 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 29/29 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 63/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1632ms problems are : Problem set: 1 solved, 63 unsolved
Search for dead transitions found 1 dead transitions in 1633ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 29/125 places, 79/237 transitions.
Graph (complete) has 100 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 28 transition count 69
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 1 with 2 rules applied. Total rules applied 13 place count 27 transition count 68
Applied a total of 13 rules in 4 ms. Remains 27 /29 variables (removed 2) and now considering 68/79 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1710 ms. Remains : 27/125 places, 68/237 transitions.
RANDOM walk for 18090 steps (2332 resets) in 296 ms. (60 steps per ms) remains 0/2 properties
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7062 ms.
ITS solved all properties within timeout

BK_STOP 1717201021427

--------------------
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 ReachabilityCardinality -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-05"
export BK_EXAMINATION="ReachabilityCardinality"
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-05, examination is ReachabilityCardinality"
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-171640604100734"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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