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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 52K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 11:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 13 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 13 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 447K 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 ShieldPPPs-PT-050A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717250886173

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:08:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:08:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:08:07] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-06-01 14:08:07] [INFO ] Transformed 1553 places.
[2024-06-01 14:08:07] [INFO ] Transformed 1303 transitions.
[2024-06-01 14:08:07] [INFO ] Found NUPN structural information;
[2024-06-01 14:08:07] [INFO ] Parsed PT model containing 1553 places and 1303 transitions and 5006 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (9 resets) in 1857 ms. (21 steps per ms) remains 3/16 properties
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1089 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 659 ms. (60 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 716 ms. (55 steps per ms) remains 3/3 properties
// Phase 1: matrix 1303 rows 1553 cols
[2024-06-01 14:08:09] [INFO ] Computed 551 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 266/403 variables, 127/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 266/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1150/1553 variables, 424/954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 1150/2104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1553 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2856 variables, 1553/3657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2856 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2856 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2856/2856 variables, and 3657 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1372 ms.
Refiners :[Domain max(s): 1553/1553 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1553/1553 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/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 266/403 variables, 127/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 266/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1150/1553 variables, 424/954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 1150/2104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1553 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2856 variables, 1553/3657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2856 variables, 3/3660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2856 variables, 0/3660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2856 variables, 0/3660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2856/2856 variables, and 3660 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4016 ms.
Refiners :[Domain max(s): 1553/1553 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1553/1553 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 5532ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6426 ms.
Support contains 137 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Partial Free-agglomeration rule applied 380 times.
Drop transitions (Partial Free agglomeration) removed 380 transitions
Iterating global reduction 0 with 380 rules applied. Total rules applied 380 place count 1553 transition count 1303
Applied a total of 380 rules in 274 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 1553/1553 places, 1303/1303 transitions.
RANDOM walk for 40000 steps (8 resets) in 902 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 379 ms. (105 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 145022 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 3
Probabilistic random walk after 145022 steps, saw 140424 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 1303 rows 1553 cols
[2024-06-01 14:08:25] [INFO ] Computed 551 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 266/403 variables, 127/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 266/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1114/1517 variables, 406/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1517 variables, 1114/2050 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1517 variables, 0/2050 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 36/1553 variables, 18/2068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1553 variables, 36/2104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1553 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1303/2856 variables, 1553/3657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2856 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2856 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2856/2856 variables, and 3657 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1165 ms.
Refiners :[Domain max(s): 1553/1553 constraints, Positive P Invariants (semi-flows): 533/533 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1553/1553 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/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 266/403 variables, 127/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 266/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 11 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1114/1517 variables, 406/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1517 variables, 1114/2053 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1517 variables, 4/2057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1517 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 36/1553 variables, 18/2075 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1553 variables, 36/2111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1553 variables, 1/2112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1553 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1303/2856 variables, 1553/3665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2856 variables, 3/3668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:08:46] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 3 ms to minimize.
[2024-06-01 14:08:46] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:08:47] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:08:47] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:08:47] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:08:47] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:08:49] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:08:49] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:08:49] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:08:49] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2856 variables, 18/3686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2856 variables, 0/3686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/2856 variables, 0/3686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2856/2856 variables, and 3686 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29191 ms.
Refiners :[Domain max(s): 1553/1553 constraints, Positive P Invariants (semi-flows): 533/533 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1553/1553 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 26/26 constraints]
After SMT, in 30498ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6727 ms.
Support contains 137 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 81 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 58 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2024-06-01 14:09:02] [INFO ] Invariant cache hit.
[2024-06-01 14:09:03] [INFO ] Implicit Places using invariants in 965 ms returned []
[2024-06-01 14:09:03] [INFO ] Invariant cache hit.
[2024-06-01 14:09:05] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2848 ms to find 0 implicit places.
[2024-06-01 14:09:05] [INFO ] Redundant transitions in 92 ms returned []
Running 1302 sub problems to find dead transitions.
[2024-06-01 14:09:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1552 variables, 18/1570 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1570 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30039 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/533 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1552 variables, 18/1570 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1552 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
At refinement iteration 3 (OVERLAPS) 1/1553 variables, 533/2103 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1553 variables, 1/2104 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
[2024-06-01 14:10:06] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 4 ms to minimize.
SMT process timed out in 60693ms, After SMT, problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60711ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63729 ms. Remains : 1553/1553 places, 1303/1303 transitions.
[2024-06-01 14:10:06] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 14:10:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1553 places, 1303 transitions and 6060 arcs took 15 ms.
[2024-06-01 14:10:06] [INFO ] Flatten gal took : 220 ms
Total runtime 119196 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldPPPs-PT-050A-ReachabilityFireability-2024-06
Could not compute solution for formula : ShieldPPPs-PT-050A-ReachabilityFireability-2024-12
Could not compute solution for formula : ShieldPPPs-PT-050A-ReachabilityFireability-2024-14

BK_STOP 1717251006772

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldPPPs-PT-050A-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/621/inv_0_
rfs formula name ShieldPPPs-PT-050A-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/621/inv_1_
rfs formula name ShieldPPPs-PT-050A-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/621/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldPPPs-PT-050A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050A.tgz
mv ShieldPPPs-PT-050A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;