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

About the Execution of LTSMin+red for ShieldRVs-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
905.216 168779.00 228842.00 496.70 FTT?T?TFTTTFTTTT 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-171683762000839.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-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000839
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 17:59 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 256K 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-040A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717269120121

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-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:12:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:12:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:12:01] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-06-01 19:12:01] [INFO ] Transformed 563 places.
[2024-06-01 19:12:01] [INFO ] Transformed 763 transitions.
[2024-06-01 19:12:01] [INFO ] Found NUPN structural information;
[2024-06-01 19:12:01] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (72 resets) in 1939 ms. (20 steps per ms) remains 7/16 properties
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 6/7 properties
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 608 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 5/6 properties
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1068 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 4/5 properties
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 4/4 properties
// Phase 1: matrix 763 rows 563 cols
[2024-06-01 19:12:03] [INFO ] Computed 161 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 242/407 variables, 109/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 242/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 156/563 variables, 52/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 156/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 763/1326 variables, 563/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 1287 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1101 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 242/407 variables, 109/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 242/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:12:04] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:12:04] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:12:04] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:12:04] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:12:04] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:12:04] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:12:04] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 6/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 156/563 variables, 52/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 156/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:12:06] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-06-01 19:12:06] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:12:06] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:12:06] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 14/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 763/1326 variables, 563/1308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1326 variables, 4/1312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:12:07] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:12:07] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:12:07] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:12:07] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:12:07] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:12:08] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:12:08] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:12:08] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:12:08] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:12:08] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:12:08] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:12:08] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:12:09] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1326 variables, 13/1325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 1325 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5012 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 34/34 constraints]
After SMT, in 6309ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 165 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Partial Free-agglomeration rule applied 60 times.
Drop transitions (Partial Free agglomeration) removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 563 transition count 763
Applied a total of 60 rules in 93 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 563/563 places, 763/763 transitions.
RANDOM walk for 40000 steps (80 resets) in 541 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 238443 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 4
Probabilistic random walk after 238443 steps, saw 52518 distinct states, run finished after 3005 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 763 rows 563 cols
[2024-06-01 19:12:12] [INFO ] Computed 161 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 242/407 variables, 109/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 242/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 156/563 variables, 52/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 156/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 763/1326 variables, 563/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 1287 constraints, problems are : Problem set: 0 solved, 4 unsolved in 828 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 242/407 variables, 109/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 242/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 3/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 156/563 variables, 52/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 156/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 14 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:12:15] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:12:15] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:12:15] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:12:15] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:12:15] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:12:15] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:12:15] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 19:12:15] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 17/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 763/1326 variables, 563/1307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1326 variables, 4/1311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:12:16] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:12:16] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 22 ms to minimize.
[2024-06-01 19:12:16] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:12:16] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:12:16] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:12:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:12:17] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:12:17] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:12:17] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:12:17] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:12:17] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:12:17] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:12:17] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1326 variables, 13/1324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:12:18] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1326 variables, 1/1325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:12:18] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:12:18] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:12:19] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:12:19] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:12:19] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:12:19] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:12:19] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:12:19] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:12:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1326 variables, 9/1334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1326 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1326 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 1334 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7731 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 43/43 constraints]
After SMT, in 8687ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 2186 ms.
Support contains 116 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 562 transition count 762
Applied a total of 9 rules in 81 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 562/563 places, 762/763 transitions.
RANDOM walk for 40000 steps (81 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 266214 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 266214 steps, saw 62186 distinct states, run finished after 3004 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 762 rows 562 cols
[2024-06-01 19:12:27] [INFO ] Computed 161 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 199/315 variables, 84/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 199/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 247/562 variables, 77/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 247/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 762/1324 variables, 562/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 1285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 468 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 199/315 variables, 84/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 199/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:12:27] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:12:27] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 247/562 variables, 77/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 247/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:12:28] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:12:29] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:12:29] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:12:29] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:12:29] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:12:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:12:29] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:12:29] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 762/1324 variables, 562/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1324 variables, 2/1311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:12:30] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:12:30] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:12:30] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:12:30] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:12:30] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:12:30] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:12:30] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:12:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:12:31] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:12:31] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:12:31] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:12:31] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:12:31] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:12:31] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:12:31] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1324 variables, 15/1326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1324 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:12:32] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/1324 variables, 1/1327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1324 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:12:32] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/1324 variables, 1/1328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:12:33] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/1324 variables, 1/1329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1324 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1324 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1329 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6524 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 42/42 constraints]
After SMT, in 7049ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1266 ms.
Support contains 116 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 30 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-06-01 19:12:35] [INFO ] Invariant cache hit.
[2024-06-01 19:12:35] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-06-01 19:12:35] [INFO ] Invariant cache hit.
[2024-06-01 19:12:36] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2024-06-01 19:12:36] [INFO ] Redundant transitions in 113 ms returned [173]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 760 sub problems to find dead transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-06-01 19:12:36] [INFO ] Computed 161 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:12:55] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-06-01 19:12:55] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:12:55] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-06-01 19:12:55] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
[2024-06-01 19:12:55] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:12:55] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:12:56] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:12:56] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:12:56] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:12:56] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:12:56] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:12:56] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:12:57] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:12:57] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:12:57] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:12:57] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:12:57] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:12:57] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:12:57] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:12:58] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:12:58] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 2 ms to minimize.
[2024-06-01 19:12:58] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-06-01 19:12:58] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 4 ms to minimize.
[2024-06-01 19:12:58] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:12:59] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:12:59] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:12:59] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:12:59] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:12:59] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:12:59] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:12:59] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:13:00] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:13:00] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:13:00] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:13:00] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:13:00] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:13:00] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:13:00] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:13:00] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:13:01] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/763 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:13:01] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:13:01] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:13:01] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:13:01] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:13:01] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:13:02] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:13:02] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:13:02] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:13:02] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:13:02] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:13:02] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:13:02] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:13:02] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:13:03] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:13:03] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 3 ms to minimize.
[2024-06-01 19:13:03] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:13:03] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 3 ms to minimize.
[2024-06-01 19:13:03] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:13:03] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:13:03] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1323 variables, and 783 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30039 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:13:13] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:13:13] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:13:13] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:13:13] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:13:13] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:13:13] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:13:14] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:13:14] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:13:14] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:13:14] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:13:14] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:13:14] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:13:14] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:13:15] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:13:15] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:13:15] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:13:15] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:13:15] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:13:15] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-06-01 19:13:15] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/803 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:13:15] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:13:16] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:13:16] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:13:16] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:13:16] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:13:16] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:13:16] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:13:16] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:13:16] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/823 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:13:18] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:13:18] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:13:18] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:13:18] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:13:18] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:13:18] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:13:20] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/843 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:13:20] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:13:20] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:13:20] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:13:20] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:13:20] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-06-01 19:13:21] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:13:21] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:13:21] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:13:21] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:13:21] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:13:21] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:13:21] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:13:21] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:13:21] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:13:22] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:13:22] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:13:22] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:13:22] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:13:22] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:13:22] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 20/863 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:13:23] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:13:23] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-06-01 19:13:23] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:13:23] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:13:23] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:13:23] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:13:23] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:13:25] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 20/883 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:13:25] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:13:26] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:13:26] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:13:26] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2024-06-01 19:13:26] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:13:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:13:26] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:13:26] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 19:13:26] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:13:26] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:13:26] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:13:27] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:13:27] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:13:27] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:13:27] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:13:27] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:13:27] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:13:27] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:13:27] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:13:27] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 20/903 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:13:28] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:13:28] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2024-06-01 19:13:28] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:13:28] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:13:28] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:13:28] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-06-01 19:13:28] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:13:28] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:13:28] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:13:28] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:13:29] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:13:29] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:13:29] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:13:29] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:13:29] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:13:30] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:13:30] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:13:30] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:13:30] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:13:30] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:13:31] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:13:31] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:13:32] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:13:32] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:13:32] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:13:32] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:13:32] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:13:32] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:13:32] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:13:32] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:13:32] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:13:32] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:13:33] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:13:33] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:13:33] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:13:33] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:13:33] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:13:33] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:13:33] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:13:33] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 20/943 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:13:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:13:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:13:35] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:13:35] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:13:35] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:13:35] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:13:35] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:13:35] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:13:35] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:13:35] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:13:35] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:13:36] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:13:36] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:13:36] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:13:36] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-06-01 19:13:36] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:13:36] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:13:36] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:13:36] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:13:36] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
SMT process timed out in 60446ms, After SMT, problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60456ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/562 places, 761/762 transitions.
Applied a total of 0 rules in 43 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61513 ms. Remains : 562/562 places, 761/762 transitions.
RANDOM walk for 40000 steps (80 resets) in 352 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 255942 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 255942 steps, saw 60413 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2024-06-01 19:13:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 199/315 variables, 84/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 199/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 247/562 variables, 77/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 247/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 761/1323 variables, 562/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1323 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1323 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 1285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 459 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 199/315 variables, 84/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 199/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:13:40] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:13:41] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 247/562 variables, 77/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 247/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:13:41] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:13:41] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:13:41] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:13:41] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:13:41] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:13:41] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:13:41] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:13:41] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:13:42] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:13:43] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:13:43] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:13:43] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:13:43] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:13:43] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:13:43] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:13:43] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:13:43] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 9/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 761/1323 variables, 562/1316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1323 variables, 2/1318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:13:44] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:13:44] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1323 variables, 2/1320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:13:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:13:44] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:13:44] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:13:45] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1323 variables, 4/1324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1323 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1323 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 1324 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4991 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 37/37 constraints]
After SMT, in 5491ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1208 ms.
Support contains 116 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 19 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 562/562 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 17 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-06-01 19:13:47] [INFO ] Invariant cache hit.
[2024-06-01 19:13:47] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 19:13:47] [INFO ] Invariant cache hit.
[2024-06-01 19:13:47] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2024-06-01 19:13:48] [INFO ] Redundant transitions in 72 ms returned []
Running 760 sub problems to find dead transitions.
[2024-06-01 19:13:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 2 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 2 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 2 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 2 ms to minimize.
[2024-06-01 19:14:08] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 2 ms to minimize.
[2024-06-01 19:14:08] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-06-01 19:14:08] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:14:08] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 2 ms to minimize.
[2024-06-01 19:14:08] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:14:08] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:14:09] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-06-01 19:14:09] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:14:09] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:14:09] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:14:09] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:10] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 2 ms to minimize.
[2024-06-01 19:14:10] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 2 ms to minimize.
[2024-06-01 19:14:10] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
[2024-06-01 19:14:10] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:14:10] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:14:10] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:14:11] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:14:11] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:14:11] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-06-01 19:14:11] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:14:11] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:14:11] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:14:12] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:14:12] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:14:12] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:14:12] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:14:12] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2024-06-01 19:14:12] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:14:12] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:14:12] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/763 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:13] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:14:13] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:14:13] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:14:13] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:14:13] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:14:13] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:14:13] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:14:14] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 3 ms to minimize.
[2024-06-01 19:14:14] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 19:14:14] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:14:14] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:14:14] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:14:14] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:14:14] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:14:15] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:14:15] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:14:15] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 3 ms to minimize.
[2024-06-01 19:14:15] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:14:15] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:14:15] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1323 variables, and 783 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30019 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-06-01 19:14:25] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:14:26] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:14:26] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:14:26] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:14:26] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:14:26] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:14:26] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:14:27] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:14:27] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/803 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:27] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:14:27] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:14:27] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:14:27] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:14:28] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:14:28] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:14:28] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:14:28] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:14:28] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:14:28] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:14:29] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:14:29] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:14:29] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:14:29] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-06-01 19:14:29] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:14:29] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:14:29] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:14:29] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:14:30] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:14:30] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/823 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:30] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:14:30] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:14:30] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:14:30] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:14:31] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:14:31] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:14:31] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:14:31] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:14:31] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-06-01 19:14:31] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:14:31] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:14:31] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:14:32] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:14:32] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:14:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:14:32] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
[2024-06-01 19:14:32] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:14:32] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:14:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:14:32] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/843 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:32] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:14:32] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:14:33] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:14:33] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:14:33] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:14:33] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:14:33] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:14:33] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:14:33] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:14:34] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 20/863 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:35] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:14:35] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:14:35] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:14:35] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-06-01 19:14:35] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:14:35] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:14:36] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:14:36] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:14:36] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:14:36] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:14:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:14:36] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:14:36] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:14:36] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:14:36] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:14:37] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:14:37] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:14:37] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:14:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:14:37] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 20/883 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:37] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:14:37] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:14:38] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:14:38] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:14:38] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:14:38] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:14:38] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:14:38] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:14:38] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:14:39] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:14:39] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:14:39] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:14:39] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:14:39] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-06-01 19:14:39] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:14:39] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:14:40] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:14:40] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:14:40] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:14:40] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 20/903 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:41] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:14:41] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:14:41] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:14:41] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:14:41] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:14:41] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:14:41] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:14:42] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:14:42] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:14:42] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:14:42] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:14:42] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:14:42] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:14:42] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:14:43] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:14:43] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:14:43] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:14:43] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:14:43] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:14:43] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:44] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:14:45] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:14:45] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:14:45] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:14:45] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:14:45] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:14:45] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:14:45] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:14:46] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:14:46] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:14:46] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:14:46] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:14:46] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:14:46] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:14:46] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:14:46] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:14:47] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:14:47] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:14:47] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:14:47] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 20/943 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:14:47] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:14:47] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:14:47] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:14:47] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:14:48] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/1323 variables, and 948 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30024 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 0/760 constraints, Known Traps: 225/225 constraints]
After SMT, in 60334ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61317 ms. Remains : 562/562 places, 761/761 transitions.
[2024-06-01 19:14:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 19:14:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 562 places, 761 transitions and 3808 arcs took 9 ms.
[2024-06-01 19:14:48] [INFO ] Flatten gal took : 126 ms
Total runtime 167381 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-040A-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-040A-ReachabilityFireability-2024-05

BK_STOP 1717269288900

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-040A"
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-040A, 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-171683762000839"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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