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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 239K 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 ShieldRVt-PT-020B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717276413086

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:13:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:13:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:13:34] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-01 21:13:34] [INFO ] Transformed 1003 places.
[2024-06-01 21:13:34] [INFO ] Transformed 1003 transitions.
[2024-06-01 21:13:34] [INFO ] Found NUPN structural information;
[2024-06-01 21:13:34] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1522 ms. (26 steps per ms) remains 4/15 properties
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
// Phase 1: matrix 1003 rows 1003 cols
[2024-06-01 21:13:35] [INFO ] Computed 81 invariants in 29 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 914/993 variables, 80/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/993 variables, 914/1073 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/993 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/1003 variables, 1/1074 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 10/1084 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1003/2006 variables, 1003/2087 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2006 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2006 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2006/2006 variables, and 2087 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1105 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 914/993 variables, 80/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/993 variables, 914/1073 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:13:37] [INFO ] Deduced a trap composed of 37 places in 290 ms of which 41 ms to minimize.
[2024-06-01 21:13:37] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 6 ms to minimize.
[2024-06-01 21:13:37] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 4 ms to minimize.
[2024-06-01 21:13:38] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 4 ms to minimize.
[2024-06-01 21:13:38] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 4 ms to minimize.
[2024-06-01 21:13:38] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 5 ms to minimize.
[2024-06-01 21:13:38] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 5 ms to minimize.
[2024-06-01 21:13:39] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 4 ms to minimize.
[2024-06-01 21:13:39] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 4 ms to minimize.
[2024-06-01 21:13:39] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 4 ms to minimize.
[2024-06-01 21:13:39] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 3 ms to minimize.
[2024-06-01 21:13:39] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 3 ms to minimize.
[2024-06-01 21:13:39] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 3 ms to minimize.
[2024-06-01 21:13:40] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 4 ms to minimize.
[2024-06-01 21:13:40] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 4 ms to minimize.
[2024-06-01 21:13:40] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 4 ms to minimize.
[2024-06-01 21:13:40] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 4 ms to minimize.
[2024-06-01 21:13:40] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 4 ms to minimize.
[2024-06-01 21:13:41] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-06-01 21:13:41] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/993 variables, 20/1093 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:13:41] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 4 ms to minimize.
[2024-06-01 21:13:41] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 3 ms to minimize.
[2024-06-01 21:13:41] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
[2024-06-01 21:13:41] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 3 ms to minimize.
SMT process timed out in 6298ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 266 place count 1003 transition count 737
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 268 rules applied. Total rules applied 534 place count 737 transition count 735
Reduce places removed 1 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 19 rules applied. Total rules applied 553 place count 736 transition count 717
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 571 place count 718 transition count 717
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 571 place count 718 transition count 639
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 727 place count 640 transition count 639
Discarding 110 places :
Symmetric choice reduction at 4 with 110 rule applications. Total rules 837 place count 530 transition count 529
Iterating global reduction 4 with 110 rules applied. Total rules applied 947 place count 530 transition count 529
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 947 place count 530 transition count 489
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1027 place count 490 transition count 489
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 1 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 4 with 334 rules applied. Total rules applied 1361 place count 323 transition count 322
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1447 place count 280 transition count 349
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1453 place count 280 transition count 343
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1459 place count 274 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1462 place count 274 transition count 340
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1463 place count 274 transition count 340
Applied a total of 1463 rules in 215 ms. Remains 274 /1003 variables (removed 729) and now considering 340/1003 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 274/1003 places, 340/1003 transitions.
RANDOM walk for 40000 steps (8 resets) in 748 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 138 ms. (287 steps per ms) remains 3/4 properties
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 340 rows 274 cols
[2024-06-01 21:13:42] [INFO ] Computed 81 invariants in 3 ms
[2024-06-01 21:13:42] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 212/270 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/274 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 340/614 variables, 274/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 119/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/614 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 474 constraints, problems are : Problem set: 0 solved, 3 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 274/274 constraints, ReadFeed: 119/119 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 212/270 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/274 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 340/614 variables, 274/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 119/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 3/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/614 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/614 variables, and 489 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1398 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 274/274 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 1771ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 421 ms.
Support contains 58 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 340/340 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 274 transition count 332
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 266 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 265 transition count 331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 265 transition count 329
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 263 transition count 329
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 50 place count 249 transition count 315
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 246 transition count 316
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 246 transition count 316
Applied a total of 57 rules in 40 ms. Remains 246 /274 variables (removed 28) and now considering 316/340 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 246/274 places, 316/340 transitions.
RANDOM walk for 40000 steps (8 resets) in 282 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 405318 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 3
Probabilistic random walk after 405318 steps, saw 242312 distinct states, run finished after 3004 ms. (steps per millisecond=134 ) properties seen :0
// Phase 1: matrix 316 rows 246 cols
[2024-06-01 21:13:48] [INFO ] Computed 81 invariants in 1 ms
[2024-06-01 21:13:48] [INFO ] State equation strengthened by 128 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 185/243 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/246 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 316/562 variables, 246/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 128/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/562 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 455 constraints, problems are : Problem set: 0 solved, 3 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 246/246 constraints, ReadFeed: 128/128 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 185/243 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:13:48] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-01 21:13:48] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-06-01 21:13:48] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:13:48] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 3/246 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 316/562 variables, 246/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 128/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 3/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/562 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 462 constraints, problems are : Problem set: 0 solved, 3 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 246/246 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 1268ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1132 ms.
Support contains 58 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 316/316 transitions.
Applied a total of 0 rules in 8 ms. Remains 246 /246 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 246/246 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 316/316 transitions.
Applied a total of 0 rules in 8 ms. Remains 246 /246 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2024-06-01 21:13:50] [INFO ] Invariant cache hit.
[2024-06-01 21:13:50] [INFO ] Implicit Places using invariants in 123 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 245/246 places, 316/316 transitions.
Applied a total of 0 rules in 7 ms. Remains 245 /245 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 147 ms. Remains : 245/246 places, 316/316 transitions.
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 420612 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 3
Probabilistic random walk after 420612 steps, saw 253555 distinct states, run finished after 3002 ms. (steps per millisecond=140 ) properties seen :0
// Phase 1: matrix 316 rows 245 cols
[2024-06-01 21:13:53] [INFO ] Computed 80 invariants in 9 ms
[2024-06-01 21:13:53] [INFO ] State equation strengthened by 126 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 185/243 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/245 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 316/561 variables, 245/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 126/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 451 constraints, problems are : Problem set: 0 solved, 3 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 245/245 constraints, ReadFeed: 126/126 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 185/243 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:13:54] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:13:54] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-06-01 21:13:54] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:13:54] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-06-01 21:13:54] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:13:54] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/245 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 316/561 variables, 245/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 126/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:13:54] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-06-01 21:13:55] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/561 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 462 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 245/245 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 1501ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 916 ms.
Support contains 58 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 316/316 transitions.
Applied a total of 0 rules in 9 ms. Remains 245 /245 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 245/245 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 316/316 transitions.
Applied a total of 0 rules in 9 ms. Remains 245 /245 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2024-06-01 21:13:56] [INFO ] Invariant cache hit.
[2024-06-01 21:13:56] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 21:13:56] [INFO ] Invariant cache hit.
[2024-06-01 21:13:56] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-06-01 21:13:56] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-06-01 21:13:56] [INFO ] Redundant transitions in 21 ms returned []
Running 315 sub problems to find dead transitions.
[2024-06-01 21:13:56] [INFO ] Invariant cache hit.
[2024-06-01 21:13:56] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-01 21:13:59] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:13:59] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:13:59] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:13:59] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:13:59] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:13:59] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:14:00] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:14:00] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 8 ms to minimize.
[2024-06-01 21:14:00] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:14:00] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:14:00] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:14:00] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:14:01] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-01 21:14:01] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-01 21:14:02] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (OVERLAPS) 316/561 variables, 245/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 126/466 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 466 constraints, problems are : Problem set: 0 solved, 315 unsolved in 18372 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 245/245 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 15/95 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-01 21:14:16] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-01 21:14:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 316/561 variables, 245/342 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 126/468 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 315/783 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-01 21:14:24] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:14:26] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 2/785 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-01 21:14:31] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 786 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 245/245 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 20/20 constraints]
After SMT, in 48477ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 48481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49025 ms. Remains : 245/245 places, 316/316 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 245 transition count 308
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 19 place count 245 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 27 place count 245 transition count 300
Applied a total of 27 rules in 22 ms. Remains 245 /245 variables (removed 0) and now considering 300/316 (removed 16) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 300 rows 245 cols
[2024-06-01 21:14:45] [INFO ] Computed 80 invariants in 1 ms
[2024-06-01 21:14:45] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 21:14:45] [INFO ] [Nat]Absence check using 80 positive place invariants in 18 ms returned sat
[2024-06-01 21:14:45] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-01 21:14:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 21:14:45] [INFO ] After 75ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 21:14:45] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:14:45] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 21:14:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2024-06-01 21:14:45] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:14:45] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-06-01 21:14:45] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:14:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 174 ms
TRAPS : Iteration 1
[2024-06-01 21:14:46] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 21:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-06-01 21:14:46] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
TRAPS : Iteration 2
[2024-06-01 21:14:46] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:14:46] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:14:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
TRAPS : Iteration 3
[2024-06-01 21:14:46] [INFO ] After 951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 21:14:46] [INFO ] After 1266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1370 ms.
[2024-06-01 21:14:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 21:14:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 245 places, 316 transitions and 1463 arcs took 5 ms.
[2024-06-01 21:14:46] [INFO ] Flatten gal took : 55 ms
Total runtime 72572 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 : ShieldRVt-PT-020B-ReachabilityCardinality-2024-03
Could not compute solution for formula : ShieldRVt-PT-020B-ReachabilityCardinality-2024-05
Could not compute solution for formula : ShieldRVt-PT-020B-ReachabilityCardinality-2024-07

BK_STOP 1717276487094

--------------------
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 ShieldRVt-PT-020B-ReachabilityCardinality-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/801/inv_0_
rfs formula name ShieldRVt-PT-020B-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/801/inv_1_
rfs formula name ShieldRVt-PT-020B-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/801/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="ShieldRVt-PT-020B"
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 ShieldRVt-PT-020B, 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-171683762300990"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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