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.r528-tall-171683761600678.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 ShieldPPPt-PT-050A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 337K May 18 16:43 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 ShieldPPPt-PT-050A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717259758177

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:35:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:35:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:35:59] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-06-01 16:35:59] [INFO ] Transformed 1253 places.
[2024-06-01 16:35:59] [INFO ] Transformed 903 transitions.
[2024-06-01 16:35:59] [INFO ] Found NUPN structural information;
[2024-06-01 16:35:59] [INFO ] Parsed PT model containing 1253 places and 903 transitions and 3606 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2078 ms. (19 steps per ms) remains 9/12 properties
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 492 ms. (81 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 264 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1173 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1239 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 482 ms. (82 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 238 ms. (167 steps per ms) remains 9/9 properties
// Phase 1: matrix 902 rows 1253 cols
[2024-06-01 16:36:01] [INFO ] Computed 551 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 241/406 variables, 168/333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 241/574 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 847/1253 variables, 383/957 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 847/1804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 902/2155 variables, 1253/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2155 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2155/2155 variables, and 3057 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1879 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 241/406 variables, 168/333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 241/574 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 847/1253 variables, 383/957 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 847/1804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 902/2155 variables, 1253/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 9/3066 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2155 variables, 0/3066 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/2155 variables, 0/3066 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2155/2155 variables, and 3066 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5011 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 7037ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 21548 ms.
Support contains 165 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 901
Partial Free-agglomeration rule applied 134 times.
Drop transitions (Partial Free agglomeration) removed 134 transitions
Iterating global reduction 0 with 134 rules applied. Total rules applied 136 place count 1252 transition count 901
Applied a total of 136 rules in 283 ms. Remains 1252 /1253 variables (removed 1) and now considering 901/902 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 1252/1253 places, 901/902 transitions.
RANDOM walk for 40000 steps (8 resets) in 1142 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 412 ms. (96 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 349 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 396 ms. (100 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 138528 steps, run timeout after 3002 ms. (steps per millisecond=46 ) properties seen :6 out of 9
Probabilistic random walk after 138528 steps, saw 135713 distinct states, run finished after 3006 ms. (steps per millisecond=46 ) properties seen :6
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 901 rows 1252 cols
[2024-06-01 16:36:35] [INFO ] Computed 551 invariants in 5 ms
[2024-06-01 16:36:35] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 164/256 variables, 105/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 164/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 996/1252 variables, 446/807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 996/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 901/2153 variables, 1252/3055 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2153 variables, 35/3090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2153 variables, 0/3090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2153 variables, 0/3090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2153/2153 variables, and 3090 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1107 ms.
Refiners :[Domain max(s): 1252/1252 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1252/1252 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 164/256 variables, 105/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 164/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 996/1252 variables, 446/807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 996/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 901/2153 variables, 1252/3055 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2153 variables, 35/3090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2153 variables, 3/3093 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:36:37] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2153 variables, 1/3094 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2153 variables, 0/3094 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2153 variables, 0/3094 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2153/2153 variables, and 3094 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2620 ms.
Refiners :[Domain max(s): 1252/1252 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1252/1252 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3783ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 4612 ms.
Support contains 12 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 901/901 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions (Partial Free agglomeration) removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 1252 transition count 901
Applied a total of 61 rules in 136 ms. Remains 1252 /1252 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 1252/1252 places, 901/901 transitions.
RANDOM walk for 40000 steps (8 resets) in 466 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 245150 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 245150 steps, saw 236396 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 901 rows 1252 cols
[2024-06-01 16:36:46] [INFO ] Computed 551 invariants in 4 ms
[2024-06-01 16:36:46] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/38 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1214/1252 variables, 536/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 1214/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 901/2153 variables, 1252/3055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2153 variables, 52/3107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2153 variables, 0/3107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2153 variables, 0/3107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2153/2153 variables, and 3107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 618 ms.
Refiners :[Domain max(s): 1252/1252 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1252/1252 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/38 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1214/1252 variables, 536/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 1214/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 901/2153 variables, 1252/3055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2153 variables, 52/3107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2153 variables, 1/3108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2153 variables, 0/3108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2153 variables, 0/3108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2153/2153 variables, and 3108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 860 ms.
Refiners :[Domain max(s): 1252/1252 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1252/1252 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1502ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 45250 steps, including 178 resets, run visited all 1 properties in 394 ms. (steps per millisecond=114 )
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 398 ms.
All properties solved without resorting to model-checking.
Total runtime 49518 ms.
ITS solved all properties within timeout

BK_STOP 1717259808884

--------------------
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="ShieldPPPt-PT-050A"
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 ShieldPPPt-PT-050A, 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 r528-tall-171683761600678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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