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.r504-tall-171649613100582.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 Medical-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649613100582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:27 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 3.1M 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 Medical-PT-18-ReachabilityCardinality-2023-00
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-01
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-02
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-03
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-04
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-05
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-06
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-07
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-08
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-09
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-10
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-11
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-12
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-13
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-14
FORMULA_NAME Medical-PT-18-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717230140196

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:22:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:22:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:22:21] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2024-06-01 08:22:21] [INFO ] Transformed 312 places.
[2024-06-01 08:22:21] [INFO ] Transformed 5431 transitions.
[2024-06-01 08:22:21] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 242 places in 23 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-18-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (158 resets) in 762 ms. (52 steps per ms) remains 2/3 properties
FORMULA Medical-PT-18-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (24 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
[2024-06-01 08:22:22] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2024-06-01 08:22:22] [INFO ] Computed 10 invariants in 13 ms
[2024-06-01 08:22:22] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/51 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 100/151 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/160 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 61/221 variables, 21/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 29/250 variables, 15/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/251 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/251 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/251 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/251 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 135 constraints, problems are : Problem set: 0 solved, 2 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/51 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 100/151 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/160 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:22:22] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 61/221 variables, 21/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 29/250 variables, 15/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/250 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/250 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/250 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/251 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/251 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 138 constraints, problems are : Problem set: 0 solved, 2 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 655ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 347 ms.
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 67 transition count 224
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 61 transition count 222
Applied a total of 13 rules in 44 ms. Remains 61 /69 variables (removed 8) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 61/69 places, 222/227 transitions.
RANDOM walk for 40037 steps (8 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 534094 steps, run timeout after 3005 ms. (steps per millisecond=177 ) properties seen :0 out of 2
Probabilistic random walk after 534094 steps, saw 303348 distinct states, run finished after 3018 ms. (steps per millisecond=176 ) properties seen :0
[2024-06-01 08:22:26] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2024-06-01 08:22:26] [INFO ] Computed 8 invariants in 4 ms
[2024-06-01 08:22:26] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/51 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/171 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 49/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/172 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 51/223 variables, 22/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 14/237 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/237 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/237 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/237 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/237 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/51 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/171 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 49/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/172 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/223 variables, 22/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/223 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/223 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 14/237 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/237 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/237 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 128 constraints, problems are : Problem set: 0 solved, 2 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 8 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-06-01 08:22:26] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-06-01 08:22:26] [INFO ] Invariant cache hit.
[2024-06-01 08:22:27] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 08:22:27] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-06-01 08:22:27] [INFO ] Invariant cache hit.
[2024-06-01 08:22:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 08:22:27] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-01 08:22:27] [INFO ] Redundant transitions in 7 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-01 08:22:27] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-06-01 08:22:27] [INFO ] Invariant cache hit.
[2024-06-01 08:22:27] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 08:22:27] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 127 constraints, problems are : Problem set: 0 solved, 221 unsolved in 4573 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 221/348 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-06-01 08:22:33] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:22:33] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:22:34] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-06-01 08:22:35] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:22:35] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:22:35] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:22:35] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:22:35] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 5/356 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-06-01 08:22:37] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:22:37] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:22:37] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 3/359 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/359 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/359 constraints. Problems are: Problem set: 43 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 359 constraints, problems are : Problem set: 43 solved, 178 unsolved in 10047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 12/12 constraints]
After SMT, in 14830ms problems are : Problem set: 43 solved, 178 unsolved
Search for dead transitions found 43 dead transitions in 14841ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 179/222 transitions.
Reduce places removed 10 places and 65 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 51 transition count 114
Reduce places removed 6 places and 31 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 45 transition count 83
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 43 transition count 72
Reduce places removed 3 places and 12 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 21 place count 40 transition count 60
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 22 place count 39 transition count 56
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 22 rules in 4 ms. Remains 39 /61 variables (removed 22) and now considering 56/179 (removed 123) transitions.
[2024-06-01 08:22:42] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 39 cols
[2024-06-01 08:22:42] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 08:22:42] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 08:22:42] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-06-01 08:22:42] [INFO ] Invariant cache hit.
[2024-06-01 08:22:42] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 08:22:42] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 39/61 places, 56/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15204 ms. Remains : 39/61 places, 56/222 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA Medical-PT-18-ReachabilityCardinality-2023-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 20921 ms.
ITS solved all properties within timeout

BK_STOP 1717230162246

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="Medical-PT-18"
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 Medical-PT-18, 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 r504-tall-171649613100582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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