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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 25K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 11:27 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 52K 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-003B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717242355069

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:45:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:45:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:45:56] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-01 11:45:56] [INFO ] Transformed 207 places.
[2024-06-01 11:45:56] [INFO ] Transformed 192 transitions.
[2024-06-01 11:45:56] [INFO ] Found NUPN structural information;
[2024-06-01 11:45:56] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (71 resets) in 1533 ms. (26 steps per ms) remains 3/12 properties
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 602 ms. (66 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 291 ms. (136 steps per ms) remains 3/3 properties
// Phase 1: matrix 192 rows 207 cols
[2024-06-01 11:45:57] [INFO ] Computed 34 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem ShieldPPPs-PT-003B-ReachabilityCardinality-2024-01 is UNSAT
FORMULA ShieldPPPs-PT-003B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 153/207 variables, 34/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 153/241 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/241 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 192/399 variables, 207/448 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/399 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 448 constraints, problems are : Problem set: 1 solved, 2 unsolved in 374 ms.
Refiners :[Domain max(s): 207/207 constraints, Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 160/188 variables, 30/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 160/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 11:45:57] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 8 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 3 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 5/223 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/207 variables, 4/227 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 19/246 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 192/399 variables, 207/453 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:45:59] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 8/463 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 11:45:59] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:45:59] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 2/465 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/465 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/399 variables, 0/465 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 465 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1714 ms.
Refiners :[Domain max(s): 207/207 constraints, Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 15/15 constraints]
After SMT, in 2174ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 274 ms.
Support contains 28 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 207 transition count 177
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 192 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 191 transition count 176
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 32 place count 191 transition count 164
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 56 place count 179 transition count 164
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 71 place count 164 transition count 149
Iterating global reduction 3 with 15 rules applied. Total rules applied 86 place count 164 transition count 149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 86 place count 164 transition count 145
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 94 place count 160 transition count 145
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 172 place count 121 transition count 106
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 184 place count 121 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 185 place count 120 transition count 105
Applied a total of 185 rules in 104 ms. Remains 120 /207 variables (removed 87) and now considering 105/192 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 120/207 places, 105/192 transitions.
RANDOM walk for 40000 steps (94 resets) in 1245 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (19 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (17 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 995201 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 2
Probabilistic random walk after 995201 steps, saw 174793 distinct states, run finished after 3007 ms. (steps per millisecond=330 ) properties seen :0
// Phase 1: matrix 105 rows 120 cols
[2024-06-01 11:46:03] [INFO ] Computed 34 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/109 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/116 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 105/221 variables, 116/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/225 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/225 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 120/120 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/109 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/116 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 105/221 variables, 116/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/225 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:46:04] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/225 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 164 constraints, problems are : Problem set: 0 solved, 2 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 726ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 28 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 105/105 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 120/120 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 105/105 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-06-01 11:46:04] [INFO ] Invariant cache hit.
[2024-06-01 11:46:04] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 11:46:04] [INFO ] Invariant cache hit.
[2024-06-01 11:46:04] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-01 11:46:04] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-01 11:46:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 4/120 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 0 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 3 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:46:05] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:46:06] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:46:06] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 105/225 variables, 120/173 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:46:06] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:46:06] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:46:06] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:46:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:46:07] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:46:07] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:46:07] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:46:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:46:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 9/182 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:46:07] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:46:07] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/225 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 184 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4762 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 4/120 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 25/64 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:46:09] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:46:09] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:46:09] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 105/225 variables, 120/187 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 101/288 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:46:11] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
[2024-06-01 11:46:11] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:46:11] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:46:11] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 292 constraints, problems are : Problem set: 0 solved, 101 unsolved in 12201 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 37/37 constraints]
After SMT, in 17005ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 17007ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17204 ms. Remains : 120/120 places, 105/105 transitions.
[2024-06-01 11:46:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-01 11:46:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 120 places, 105 transitions and 378 arcs took 3 ms.
[2024-06-01 11:46:21] [INFO ] Flatten gal took : 36 ms
Total runtime 25518 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-003B-ReachabilityCardinality-2024-11
Could not compute solution for formula : ShieldPPPs-PT-003B-ReachabilityCardinality-2024-15

BK_STOP 1717242381905

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldPPPs-PT-003B-ReachabilityCardinality-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/703/inv_0_
rfs formula name ShieldPPPs-PT-003B-ReachabilityCardinality-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/703/inv_1_
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-003B"
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 ShieldPPPs-PT-003B, 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-171683761000398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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