fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683761900815
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldRVs-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
578.247 108628.00 151974.00 269.00 T?T?FTFFFT?TTFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.6K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 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 244K 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 ShieldRVs-PT-020B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2023-03
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717266517219

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:28:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 18:28:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:28:38] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-01 18:28:38] [INFO ] Transformed 803 places.
[2024-06-01 18:28:38] [INFO ] Transformed 903 transitions.
[2024-06-01 18:28:38] [INFO ] Found NUPN structural information;
[2024-06-01 18:28:38] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (44 resets) in 1796 ms. (22 steps per ms) remains 9/16 properties
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
// Phase 1: matrix 903 rows 803 cols
[2024-06-01 18:28:39] [INFO ] Computed 81 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ShieldRVs-PT-020B-ReachabilityFireability-2024-13 is UNSAT
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 519/799 variables, 80/360 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/799 variables, 519/879 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 0/879 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 4/803 variables, 1/880 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/803 variables, 4/884 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/803 variables, 0/884 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 903/1706 variables, 803/1687 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1706 variables, 0/1687 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1706 variables, 0/1687 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1706/1706 variables, and 1687 constraints, problems are : Problem set: 1 solved, 8 unsolved in 2048 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 803/803 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 539/799 variables, 80/340 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/799 variables, 539/879 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 18:28:42] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 32 ms to minimize.
[2024-06-01 18:28:42] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 3 ms to minimize.
[2024-06-01 18:28:43] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 3 ms to minimize.
[2024-06-01 18:28:43] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2024-06-01 18:28:43] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2024-06-01 18:28:43] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 18:28:43] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 3 ms to minimize.
[2024-06-01 18:28:43] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-01 18:28:43] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-06-01 18:28:43] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:28:43] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:28:44] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-06-01 18:28:44] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:28:44] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:28:44] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2024-06-01 18:28:44] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:28:44] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:28:44] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:28:44] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:28:44] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 20/899 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 18:28:45] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-06-01 18:28:45] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-06-01 18:28:45] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-06-01 18:28:45] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-06-01 18:28:45] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-06-01 18:28:45] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-06-01 18:28:45] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-06-01 18:28:45] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-06-01 18:28:46] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 18:28:46] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 2 ms to minimize.
[2024-06-01 18:28:46] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-06-01 18:28:46] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-01 18:28:46] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-06-01 18:28:46] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 5 ms to minimize.
[2024-06-01 18:28:46] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-06-01 18:28:46] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-06-01 18:28:46] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-06-01 18:28:46] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-06-01 18:28:47] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-06-01 18:28:47] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
SMT process timed out in 7274ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 260 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 803 transition count 863
Reduce places removed 40 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 47 rules applied. Total rules applied 87 place count 763 transition count 856
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 94 place count 756 transition count 856
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 94 place count 756 transition count 792
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 222 place count 692 transition count 792
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 305 place count 609 transition count 709
Iterating global reduction 3 with 83 rules applied. Total rules applied 388 place count 609 transition count 709
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 388 place count 609 transition count 695
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 416 place count 595 transition count 695
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 596 place count 505 transition count 605
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 609 place count 505 transition count 605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 610 place count 504 transition count 604
Applied a total of 610 rules in 195 ms. Remains 504 /803 variables (removed 299) and now considering 604/903 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 504/803 places, 604/903 transitions.
RANDOM walk for 40000 steps (70 resets) in 712 ms. (56 steps per ms) remains 6/8 properties
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
// Phase 1: matrix 604 rows 504 cols
[2024-06-01 18:28:47] [INFO ] Computed 81 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 249/502 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/504 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 604/1108 variables, 504/585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1108 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1108 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1108/1108 variables, and 585 constraints, problems are : Problem set: 0 solved, 6 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 249/502 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 18:28:49] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-06-01 18:28:49] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 18:28:49] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-06-01 18:28:49] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-06-01 18:28:49] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-01 18:28:49] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-06-01 18:28:49] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-06-01 18:28:49] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 18:28:49] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:28:50] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:28:50] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 3 ms to minimize.
[2024-06-01 18:28:50] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-01 18:28:50] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:28:50] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 3 ms to minimize.
[2024-06-01 18:28:50] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 4 ms to minimize.
[2024-06-01 18:28:50] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 6 ms to minimize.
[2024-06-01 18:28:50] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 18:28:50] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-06-01 18:28:50] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:28:51] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:28:52] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-06-01 18:28:53] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:28:54] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:28:55] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:28:56] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:28:57] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:28:57] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:28:57] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
Problem ShieldRVs-PT-020B-ReachabilityFireability-2024-15 is UNSAT
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/180 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:28:57] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 18:28:57] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:28:57] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:28:57] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 4/184 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:28:57] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:28:57] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 2/186 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/504 variables, 1/187 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 604/1108 variables, 504/691 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1108 variables, 5/696 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:28:59] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:28:59] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:00] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:29:00] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:29:00] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:29:00] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:29:00] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:29:00] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:29:00] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-06-01 18:29:00] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-06-01 18:29:01] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:29:01] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:29:01] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:29:01] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:29:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:29:01] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:29:01] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:29:01] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:29:02] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:29:02] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1108 variables, 20/716 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:29:02] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:29:02] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:29:02] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-06-01 18:29:02] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:29:03] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:03] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:29:03] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:29:03] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-01 18:29:03] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1108 variables, 9/725 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:29:04] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:29:04] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:29:04] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:29:05] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:29:05] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:29:05] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:29:05] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:29:05] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-01 18:29:05] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:29:05] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:29:06] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-06-01 18:29:06] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1108 variables, 12/737 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:29:06] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:07] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1108 variables, 2/739 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:29:07] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1108 variables, 1/740 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:29:08] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-06-01 18:29:08] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:29:08] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:29:09] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:29:09] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:29:09] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:29:09] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:29:09] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:29:09] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1108 variables, 9/749 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:29:10] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:29:10] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:29:11] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:29:11] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1108 variables, 4/753 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:29:12] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1108 variables, 1/754 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:29:12] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:29:12] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:29:12] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1108 variables, 3/757 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1108 variables, 0/757 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 18:29:14] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:29:14] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:29:14] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:29:15] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/1108 variables, 4/761 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1108 variables, 0/761 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/1108 variables, 0/761 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1108/1108 variables, and 761 constraints, problems are : Problem set: 1 solved, 5 unsolved in 28733 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 171/171 constraints]
After SMT, in 29686ms problems are : Problem set: 1 solved, 5 unsolved
Parikh walk visited 0 properties in 3292 ms.
Support contains 205 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 604/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 504 transition count 600
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 500 transition count 598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 498 transition count 598
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 12 place count 498 transition count 586
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 36 place count 486 transition count 586
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 39 place count 483 transition count 583
Iterating global reduction 3 with 3 rules applied. Total rules applied 42 place count 483 transition count 583
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 76 place count 466 transition count 566
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 81 place count 466 transition count 566
Applied a total of 81 rules in 68 ms. Remains 466 /504 variables (removed 38) and now considering 566/604 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 466/504 places, 566/604 transitions.
RANDOM walk for 40000 steps (78 resets) in 239 ms. (166 steps per ms) remains 3/5 properties
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
// Phase 1: matrix 566 rows 466 cols
[2024-06-01 18:29:21] [INFO ] Computed 81 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 294/464 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/466 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 566/1032 variables, 466/547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1032 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1032/1032 variables, and 547 constraints, problems are : Problem set: 0 solved, 3 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 466/466 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/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 294/464 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:21] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:29:22] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 3 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:29:23] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 18:29:24] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:29:25] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 7/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:29:26] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/466 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 566/1032 variables, 466/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1032 variables, 3/624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:28] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-06-01 18:29:28] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-06-01 18:29:28] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-06-01 18:29:28] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:29:28] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 18:29:28] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:29:29] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:29] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-06-01 18:29:29] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:29:29] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:29:29] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:29:29] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1032 variables, 12/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:30] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:29:30] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:29:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1032 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:31] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1032 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1032 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1032 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1032/1032 variables, and 640 constraints, problems are : Problem set: 0 solved, 3 unsolved in 10534 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 90/90 constraints]
After SMT, in 11065ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1489 ms.
Support contains 170 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 566/566 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 466 transition count 561
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 461 transition count 561
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 461 transition count 555
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 455 transition count 555
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 454 transition count 554
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 454 transition count 554
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 62 place count 435 transition count 535
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 435 transition count 535
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 434 transition count 534
Applied a total of 64 rules in 74 ms. Remains 434 /466 variables (removed 32) and now considering 534/566 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 434/466 places, 534/566 transitions.
RANDOM walk for 40000 steps (84 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 577863 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 3
Probabilistic random walk after 577863 steps, saw 110159 distinct states, run finished after 3004 ms. (steps per millisecond=192 ) properties seen :0
// Phase 1: matrix 534 rows 434 cols
[2024-06-01 18:29:37] [INFO ] Computed 81 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 262/432 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/434 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 534/968 variables, 434/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/968 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/968 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 968/968 variables, and 515 constraints, problems are : Problem set: 0 solved, 3 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 434/434 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/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 262/432 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:37] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:29:37] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:37] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:29:37] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:29:38] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:29:39] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/432 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:29:40] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:29:41] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:29:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:29:41] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 15/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/434 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 534/968 variables, 434/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:42] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:29:42] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:29:42] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:29:42] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-06-01 18:29:42] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2024-06-01 18:29:42] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:42] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/968 variables, 7/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:43] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:29:43] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:29:43] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:29:43] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:43] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:29:44] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:29:44] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-06-01 18:29:44] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:29:44] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:29:44] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-01 18:29:44] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:29:44] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:29:44] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:29:44] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:29:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:29:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/968 variables, 16/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:45] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 18:29:45] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:29:46] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:29:46] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:29:46] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:29:46] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:29:46] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:29:46] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-06-01 18:29:46] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:29:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:29:47] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:29:47] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-01 18:29:47] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 18:29:47] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/968 variables, 14/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:47] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:29:47] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:29:47] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:29:48] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:29:48] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 18:29:48] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/968 variables, 6/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:48] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:29:48] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/968 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/968 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:49] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-06-01 18:29:49] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:29:49] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:29:49] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/968 variables, 4/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/968 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:50] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/968 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:51] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-06-01 18:29:51] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:29:51] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/968 variables, 3/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:51] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/968 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:29:52] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/968 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/968 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/968 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 968/968 variables, and 628 constraints, problems are : Problem set: 0 solved, 3 unsolved in 15904 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 110/110 constraints]
After SMT, in 16397ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1117 ms.
Support contains 170 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 534/534 transitions.
Applied a total of 0 rules in 22 ms. Remains 434 /434 variables (removed 0) and now considering 534/534 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 434/434 places, 534/534 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 534/534 transitions.
Applied a total of 0 rules in 11 ms. Remains 434 /434 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2024-06-01 18:29:54] [INFO ] Invariant cache hit.
[2024-06-01 18:29:54] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 18:29:54] [INFO ] Invariant cache hit.
[2024-06-01 18:29:55] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-06-01 18:29:55] [INFO ] Redundant transitions in 61 ms returned []
Running 531 sub problems to find dead transitions.
[2024-06-01 18:29:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (OVERLAPS) 3/434 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 18:30:02] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:30:03] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 18:30:03] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:30:03] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:30:03] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:30:03] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:30:03] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 18:30:06] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:30:06] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 18:30:06] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-06-01 18:30:06] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:30:06] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:30:07] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:30:08] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 18:30:08] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:30:08] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:30:08] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:30:08] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:30:08] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:30:08] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:30:08] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:30:09] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:30:10] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:30:11] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:30:11] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:30:11] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:30:11] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:30:11] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 18:30:14] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:30:14] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 18:30:15] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:30:16] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:30:16] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:30:16] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-06-01 18:30:16] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:30:16] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:30:16] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 18:30:16] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:30:16] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:30:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 18:30:18] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 18:30:18] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:30:18] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 18:30:18] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-01 18:30:18] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 18:30:19] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 18:30:19] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:30:19] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 18:30:19] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 18:30:19] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-01 18:30:19] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 18:30:19] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-06-01 18:30:19] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-06-01 18:30:19] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:30:20] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 18:30:24] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:30:24] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:30:24] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:30:25] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:30:25] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:30:25] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:30:25] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
SMT process timed out in 30142ms, After SMT, problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 30150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30709 ms. Remains : 434/434 places, 534/534 transitions.
[2024-06-01 18:30:25] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 18:30:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 434 places, 534 transitions and 2166 arcs took 6 ms.
[2024-06-01 18:30:25] [INFO ] Flatten gal took : 73 ms
Total runtime 107303 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 : ShieldRVs-PT-020B-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldRVs-PT-020B-ReachabilityFireability-2023-03
Could not compute solution for formula : ShieldRVs-PT-020B-ReachabilityFireability-2024-10

BK_STOP 1717266625847

--------------------
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 ShieldRVs-PT-020B-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/2230/inv_0_
rfs formula name ShieldRVs-PT-020B-ReachabilityFireability-2023-03
rfs formula type EF
rfs formula formula --invariant=/tmp/2230/inv_1_
rfs formula name ShieldRVs-PT-020B-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/2230/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="ShieldRVs-PT-020B"
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 ShieldRVs-PT-020B, 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-171683761900815"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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