Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398500551.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500551
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 148K May 18 16:42 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 BusinessProcesses-PT-13-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716306369592

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:46:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:46:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:46:11] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-21 15:46:11] [INFO ] Transformed 593 places.
[2024-05-21 15:46:11] [INFO ] Transformed 536 transitions.
[2024-05-21 15:46:11] [INFO ] Found NUPN structural information;
[2024-05-21 15:46:11] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
RANDOM walk for 40000 steps (282 resets) in 2020 ms. (19 steps per ms) remains 11/16 properties
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (52 resets) in 246 ms. (161 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 387 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (52 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (60 resets) in 270 ms. (147 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (52 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (36 resets) in 325 ms. (122 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (51 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (48 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (54 resets) in 280 ms. (142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (41 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
// Phase 1: matrix 528 rows 585 cols
[2024-05-21 15:46:13] [INFO ] Computed 95 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 331/495 variables, 57/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 331/552 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 90/585 variables, 38/590 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 90/680 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/680 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-08 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 528/1113 variables, 585/1265 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 0/1265 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1113 variables, 0/1265 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 1265 constraints, problems are : Problem set: 4 solved, 7 unsolved in 1924 ms.
Refiners :[Domain max(s): 585/585 constraints, Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 351/482 variables, 56/187 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 351/538 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 24 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:46:17] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 4 ms to minimize.
[2024-05-21 15:46:17] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:46:17] [INFO ] Deduced a trap composed of 116 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:46:17] [INFO ] Deduced a trap composed of 117 places in 149 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 20/558 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-21 15:46:17] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:46:17] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:46:17] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 3 ms to minimize.
[2024-05-21 15:46:17] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:46:17] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:46:18] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:46:18] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 3 ms to minimize.
[2024-05-21 15:46:18] [INFO ] Deduced a trap composed of 140 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:46:18] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:46:18] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:46:18] [INFO ] Deduced a trap composed of 140 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:46:18] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 150 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 5 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:46:20] [INFO ] Deduced a trap composed of 116 places in 139 ms of which 4 ms to minimize.
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-15 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 20/578 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-05-21 15:46:20] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
SMT process timed out in 7205ms, After SMT, problems are : Problem set: 5 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (complete) has 1197 edges and 585 vertex of which 579 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 579 transition count 482
Reduce places removed 45 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 62 rules applied. Total rules applied 108 place count 534 transition count 465
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 125 place count 517 transition count 465
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 125 place count 517 transition count 366
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 332 place count 409 transition count 366
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 391 place count 350 transition count 307
Iterating global reduction 3 with 59 rules applied. Total rules applied 450 place count 350 transition count 307
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 450 place count 350 transition count 305
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 454 place count 348 transition count 305
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 552 place count 299 transition count 256
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 556 place count 299 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 557 place count 298 transition count 255
Applied a total of 557 rules in 167 ms. Remains 298 /585 variables (removed 287) and now considering 255/528 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 298/585 places, 255/528 transitions.
RANDOM walk for 40000 steps (621 resets) in 582 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (130 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (131 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (139 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (138 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 695569 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :4 out of 6
Probabilistic random walk after 695569 steps, saw 116225 distinct states, run finished after 3009 ms. (steps per millisecond=231 ) properties seen :4
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 255 rows 298 cols
[2024-05-21 15:46:23] [INFO ] Computed 81 invariants in 11 ms
[2024-05-21 15:46:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/233 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/236 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/286 variables, 27/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/288 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 255/543 variables, 288/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/553 variables, 10/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/553 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 380 constraints, problems are : Problem set: 0 solved, 2 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 298/298 constraints, ReadFeed: 1/1 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/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/233 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:46:24] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:46:24] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:46:24] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:46:24] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 3 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 4 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 3 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/236 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 50/286 variables, 27/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:46:27] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:46:28] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:46:28] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:46:28] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:46:28] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:46:28] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:46:28] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:46:28] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:46:28] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:46:28] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 1 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 10 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:46:31] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:46:31] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:46:31] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/288 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 255/543 variables, 288/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/543 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/543 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 10/553 variables, 10/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/553 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:46:31] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:46:32] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:46:32] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:46:32] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:46:32] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:46:32] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:46:32] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:46:33] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:46:33] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:46:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:46:33] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 11/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:46:33] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:46:34] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:46:34] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:46:34] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:46:34] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:46:34] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:46:34] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:46:35] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:46:35] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:46:35] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/553 variables, 10/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/553 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/553 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11791 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 298/298 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 95/95 constraints]
After SMT, in 12358ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 210 ms.
Support contains 77 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 255/255 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 298 transition count 254
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 297 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 296 transition count 253
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 4 place count 296 transition count 242
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 28 place count 283 transition count 242
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 282 transition count 241
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 282 transition count 241
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 64 place count 265 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 264 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 264 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 264 transition count 227
Applied a total of 68 rules in 70 ms. Remains 264 /298 variables (removed 34) and now considering 227/255 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 264/298 places, 227/255 transitions.
RANDOM walk for 40000 steps (819 resets) in 389 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (183 resets) in 481 ms. (82 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1058065 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 1
Probabilistic random walk after 1058065 steps, saw 172310 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
// Phase 1: matrix 227 rows 264 cols
[2024-05-21 15:46:39] [INFO ] Computed 79 invariants in 7 ms
[2024-05-21 15:46:39] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/203 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/206 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/253 variables, 26/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/254 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 227/481 variables, 254/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/491 variables, 10/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/491 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 264/264 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/203 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:46:40] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:46:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:46:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/206 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 47/253 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:46:40] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:46:40] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/254 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 227/481 variables, 254/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/481 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/491 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/491 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 355 constraints, problems are : Problem set: 0 solved, 1 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 264/264 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1066ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 77 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 227/227 transitions.
Applied a total of 0 rules in 13 ms. Remains 264 /264 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 264/264 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 227/227 transitions.
Applied a total of 0 rules in 13 ms. Remains 264 /264 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-21 15:46:40] [INFO ] Invariant cache hit.
[2024-05-21 15:46:41] [INFO ] Implicit Places using invariants in 187 ms returned [12, 19, 39, 41, 68, 70, 72, 74, 76, 78, 80, 82, 84, 209, 213, 237]
[2024-05-21 15:46:41] [INFO ] Actually due to overlaps returned [12, 19, 39, 68, 74, 78, 82, 209, 213, 237]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 200 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 254/264 places, 227/227 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 248 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 248 transition count 215
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 246 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 246 transition count 207
Applied a total of 16 rules in 21 ms. Remains 246 /254 variables (removed 8) and now considering 207/227 (removed 20) transitions.
// Phase 1: matrix 207 rows 246 cols
[2024-05-21 15:46:41] [INFO ] Computed 69 invariants in 5 ms
[2024-05-21 15:46:41] [INFO ] Implicit Places using invariants in 139 ms returned [65, 67]
[2024-05-21 15:46:41] [INFO ] Actually due to overlaps returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 245/264 places, 207/227 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 206
Applied a total of 2 rules in 13 ms. Remains 244 /245 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 244 cols
[2024-05-21 15:46:41] [INFO ] Computed 68 invariants in 3 ms
[2024-05-21 15:46:41] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 15:46:41] [INFO ] Invariant cache hit.
[2024-05-21 15:46:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 15:46:41] [INFO ] Implicit Places using invariants and state equation in 297 ms returned [168, 170, 172]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 428 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 241/264 places, 206/227 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 240 transition count 205
Applied a total of 2 rules in 13 ms. Remains 240 /241 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 240 cols
[2024-05-21 15:46:41] [INFO ] Computed 65 invariants in 3 ms
[2024-05-21 15:46:41] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 15:46:41] [INFO ] Invariant cache hit.
[2024-05-21 15:46:42] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:46:42] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 240/264 places, 205/227 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1245 ms. Remains : 240/264 places, 205/227 transitions.
RANDOM walk for 40000 steps (820 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (179 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1101100 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :0 out of 1
Probabilistic random walk after 1101100 steps, saw 178322 distinct states, run finished after 3001 ms. (steps per millisecond=366 ) properties seen :0
[2024-05-21 15:46:45] [INFO ] Invariant cache hit.
[2024-05-21 15:46:45] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/207 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/233 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 205/438 variables, 233/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 7/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/445 variables, 7/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/445 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 240/240 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:46:45] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:46:45] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:46:45] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:46:46] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:46:46] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:46:46] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:46:46] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:46:46] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:46:46] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:46:46] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:46:46] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-21 15:46:46] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:46:47] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:46:47] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:46:47] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/207 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/233 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:46:47] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 205/438 variables, 233/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 7/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/445 variables, 7/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:46:47] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:46:47] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:46:48] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/445 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2760 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 240/240 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 3059ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 77 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 240/240 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 205/205 transitions.
Applied a total of 0 rules in 8 ms. Remains 240 /240 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-21 15:46:48] [INFO ] Invariant cache hit.
[2024-05-21 15:46:48] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 15:46:48] [INFO ] Invariant cache hit.
[2024-05-21 15:46:48] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:46:48] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-05-21 15:46:48] [INFO ] Redundant transitions in 7 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-21 15:46:48] [INFO ] Invariant cache hit.
[2024-05-21 15:46:48] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 3/240 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 15:46:51] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:46:51] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:46:51] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:46:51] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:46:51] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:46:52] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:46:53] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:46:54] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 15:46:55] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:46:55] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:46:55] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-21 15:46:55] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:46:55] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:46:55] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:46:55] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:46:55] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:46:55] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:46:56] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:46:56] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:46:56] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:46:56] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:46:56] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:46:56] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 4 ms to minimize.
[2024-05-21 15:46:56] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 5 ms to minimize.
[2024-05-21 15:46:56] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:46:56] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:46:56] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:46:57] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 15:46:58] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:46:58] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:46:58] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:46:58] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:46:58] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:46:58] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:46:58] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:46:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 3 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:47:00] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:47:00] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 20/145 constraints. Problems are: Problem set: 3 solved, 199 unsolved
[2024-05-21 15:47:00] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:47:00] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:47:00] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:47:00] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:47:00] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:47:00] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:47:00] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 5 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:47:01] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 20/165 constraints. Problems are: Problem set: 3 solved, 199 unsolved
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:47:02] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:47:03] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:47:03] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:47:03] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:47:03] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:47:03] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:47:03] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:47:03] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:47:03] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:47:03] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 20/185 constraints. Problems are: Problem set: 3 solved, 199 unsolved
[2024-05-21 15:47:04] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:47:04] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:47:04] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:47:04] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:47:04] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:47:05] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:47:05] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:47:05] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:47:05] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:47:05] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:47:05] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:47:05] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:47:05] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:47:05] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:47:06] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:47:06] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:47:06] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:47:06] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:47:06] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:47:06] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 20/205 constraints. Problems are: Problem set: 3 solved, 199 unsolved
[2024-05-21 15:47:06] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:47:06] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:47:06] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:47:07] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:47:08] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:47:08] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:47:08] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:47:08] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:47:08] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:47:08] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 20/225 constraints. Problems are: Problem set: 8 solved, 194 unsolved
[2024-05-21 15:47:09] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:47:09] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:47:09] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:47:09] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:47:09] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:47:09] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:47:09] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:47:09] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:47:09] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:47:09] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:47:10] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:47:10] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-21 15:47:10] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:47:10] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:47:10] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:47:10] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:47:10] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:47:10] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:47:10] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:47:10] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 20/245 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:11] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:47:12] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:47:12] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:47:12] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:47:12] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:47:12] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:47:12] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:47:12] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:47:12] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:47:12] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:47:13] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:47:13] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:47:13] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:47:13] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:47:13] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:47:13] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:47:13] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:47:13] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:47:13] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:47:13] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 20/265 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:14] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:47:14] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:47:14] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:47:14] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:47:14] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:47:14] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:47:15] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:47:16] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:47:16] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 20/285 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:16] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:47:16] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:47:16] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:47:16] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:47:17] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:47:18] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:47:18] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:47:18] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:47:18] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:47:18] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 20/305 constraints. Problems are: Problem set: 11 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/445 variables, and 305 constraints, problems are : Problem set: 11 solved, 191 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/240 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 240/240 constraints]
Escalating to Integer solving :Problem set: 11 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 11 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 11 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 3/240 variables, 49/62 constraints. Problems are: Problem set: 11 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 3/65 constraints. Problems are: Problem set: 11 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 240/305 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:20] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:47:20] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:47:20] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:47:20] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:47:20] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:47:21] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:47:21] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:47:21] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 1 ms to minimize.
[2024-05-21 15:47:21] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:47:21] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:47:21] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:47:21] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:47:22] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:47:22] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:47:22] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:47:22] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:47:22] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:47:22] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 1 ms to minimize.
[2024-05-21 15:47:22] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:47:22] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 20/325 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:23] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:47:23] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:47:23] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:47:23] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:47:23] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:47:24] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 4 ms to minimize.
[2024-05-21 15:47:25] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:47:25] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:47:25] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 1 ms to minimize.
[2024-05-21 15:47:25] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 20/345 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:25] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:47:26] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:47:26] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:47:26] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:47:26] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:47:26] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:47:26] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:47:27] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:47:27] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:47:27] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2024-05-21 15:47:27] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:47:27] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:47:27] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 4 ms to minimize.
[2024-05-21 15:47:28] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:47:28] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:47:28] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:47:28] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:47:28] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:47:28] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:47:29] [INFO ] Deduced a trap composed of 56 places in 1188 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 20/365 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:30] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:47:31] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:47:31] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
[2024-05-21 15:47:31] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:47:31] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-21 15:47:32] [INFO ] Deduced a trap composed of 55 places in 358 ms of which 2 ms to minimize.
[2024-05-21 15:47:32] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:47:32] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:47:32] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:47:32] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:47:32] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:47:32] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 1 ms to minimize.
[2024-05-21 15:47:33] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:47:33] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:47:33] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 1 ms to minimize.
[2024-05-21 15:47:33] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:47:33] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:47:33] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:47:33] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:47:33] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 20/385 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:34] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:47:34] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 1 ms to minimize.
[2024-05-21 15:47:34] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:47:34] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 3 ms to minimize.
[2024-05-21 15:47:34] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:47:34] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:47:34] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:47:34] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:47:34] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:47:35] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:47:36] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:47:36] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 1 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 20/405 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:38] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 1 ms to minimize.
[2024-05-21 15:47:38] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:47:38] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 1 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:47:40] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:47:40] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:47:40] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:47:40] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 1 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 1 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 20/425 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 1 ms to minimize.
[2024-05-21 15:47:44] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 4 ms to minimize.
[2024-05-21 15:47:44] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-05-21 15:47:45] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:47:45] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:47:45] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 20/445 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-05-21 15:47:46] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:47:46] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:47:47] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:47:47] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:47:47] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:47:47] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 1 ms to minimize.
[2024-05-21 15:47:47] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:47:47] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:47:48] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:47:48] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:47:48] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-21 15:47:48] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 1 ms to minimize.
[2024-05-21 15:47:48] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 15:47:48] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:47:48] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:47:49] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
SMT process timed out in 60140ms, After SMT, problems are : Problem set: 11 solved, 191 unsolved
Search for dead transitions found 14 dead transitions in 60145ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 240/240 places, 191/205 transitions.
Applied a total of 0 rules in 14 ms. Remains 240 /240 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-21 15:47:49] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60647 ms. Remains : 240/240 places, 191/205 transitions.
RANDOM walk for 40000 steps (824 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (177 resets) in 291 ms. (137 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1171589 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :0 out of 1
Probabilistic random walk after 1171589 steps, saw 188003 distinct states, run finished after 3005 ms. (steps per millisecond=389 ) properties seen :0
// Phase 1: matrix 191 rows 240 cols
[2024-05-21 15:47:52] [INFO ] Computed 66 invariants in 13 ms
[2024-05-21 15:47:52] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/207 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/233 variables, 17/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 191/424 variables, 233/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/431 variables, 7/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/431 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 240/240 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:47:52] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:47:52] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/207 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/233 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 191/424 variables, 233/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/431 variables, 7/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/431 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 240/240 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1718ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 77 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 191/191 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 240/240 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 191/191 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-21 15:47:54] [INFO ] Invariant cache hit.
[2024-05-21 15:47:54] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 15:47:54] [INFO ] Invariant cache hit.
[2024-05-21 15:47:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:47:54] [INFO ] Implicit Places using invariants and state equation in 278 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 388 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 239/240 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 402 ms. Remains : 239/240 places, 191/191 transitions.
RANDOM walk for 40000 steps (827 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (181 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1340325 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 1
Probabilistic random walk after 1340325 steps, saw 208772 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
// Phase 1: matrix 191 rows 239 cols
[2024-05-21 15:47:57] [INFO ] Computed 65 invariants in 4 ms
[2024-05-21 15:47:57] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/207 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/232 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 191/423 variables, 232/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 7/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/430 variables, 7/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/430 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 239/239 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/207 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/232 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 191/423 variables, 232/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 7/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/430 variables, 7/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:47:59] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/430 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 319 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 239/239 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1661ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 77 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 239/239 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 191/191 transitions.
Applied a total of 0 rules in 20 ms. Remains 239 /239 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-21 15:47:59] [INFO ] Invariant cache hit.
[2024-05-21 15:47:59] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 15:47:59] [INFO ] Invariant cache hit.
[2024-05-21 15:47:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:48:00] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-05-21 15:48:00] [INFO ] Redundant transitions in 2 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-21 15:48:00] [INFO ] Invariant cache hit.
[2024-05-21 15:48:00] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 3/239 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 1 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 1 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 1 ms to minimize.
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 1 ms to minimize.
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 3 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 1 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 20/165 constraints. Problems are: Problem set: 1 solved, 187 unsolved
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 4 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:48:30] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:48:30] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
SMT process timed out in 30133ms, After SMT, problems are : Problem set: 1 solved, 187 unsolved
Search for dead transitions found 1 dead transitions in 30137ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 239/239 places, 190/191 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 190
Applied a total of 1 rules in 30 ms. Remains 238 /239 variables (removed 1) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 238 cols
[2024-05-21 15:48:30] [INFO ] Computed 65 invariants in 1 ms
[2024-05-21 15:48:30] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 15:48:30] [INFO ] Invariant cache hit.
[2024-05-21 15:48:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:48:32] [INFO ] Implicit Places using invariants and state equation in 1897 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 238/239 places, 190/191 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32904 ms. Remains : 238/239 places, 190/191 transitions.
RANDOM walk for 40000 steps (826 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (180 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1415245 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :0 out of 1
Probabilistic random walk after 1415245 steps, saw 217704 distinct states, run finished after 3001 ms. (steps per millisecond=471 ) properties seen :0
[2024-05-21 15:48:35] [INFO ] Invariant cache hit.
[2024-05-21 15:48:35] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/207 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/231 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 190/421 variables, 231/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 7/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/428 variables, 7/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 238/238 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/207 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/231 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 190/421 variables, 231/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 7/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/428 variables, 7/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/428 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 238/238 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1333ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 77 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 190/190 transitions.
Applied a total of 0 rules in 13 ms. Remains 238 /238 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 238/238 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 190/190 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-21 15:48:36] [INFO ] Invariant cache hit.
[2024-05-21 15:48:36] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-21 15:48:36] [INFO ] Invariant cache hit.
[2024-05-21 15:48:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:48:37] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-21 15:48:37] [INFO ] Redundant transitions in 2 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-21 15:48:37] [INFO ] Invariant cache hit.
[2024-05-21 15:48:37] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 3/238 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 1 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 1 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 3 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 3 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:48:50] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:48:50] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:48:50] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:48:50] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:48:50] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:48:50] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 3 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:48:51] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:48:52] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:48:52] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:48:52] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:48:52] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:48:53] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:48:53] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:48:53] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 25 ms to minimize.
[2024-05-21 15:48:53] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 1 ms to minimize.
[2024-05-21 15:48:53] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:48:53] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 5 ms to minimize.
[2024-05-21 15:48:54] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 4 ms to minimize.
[2024-05-21 15:48:54] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 14 ms to minimize.
[2024-05-21 15:48:54] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:48:54] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 1 ms to minimize.
[2024-05-21 15:48:54] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:48:54] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:48:54] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:48:54] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:48:55] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:48:55] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2024-05-21 15:48:55] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 1 ms to minimize.
[2024-05-21 15:48:55] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:48:55] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2024-05-21 15:48:55] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:48:56] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:48:56] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2024-05-21 15:48:56] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:48:56] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 1 ms to minimize.
[2024-05-21 15:48:56] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 4 ms to minimize.
[2024-05-21 15:48:56] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 1 ms to minimize.
[2024-05-21 15:48:56] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:48:57] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 3 ms to minimize.
[2024-05-21 15:48:57] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:48:57] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:48:57] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 4 ms to minimize.
[2024-05-21 15:48:57] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2024-05-21 15:48:57] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:48:57] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:48:57] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:48:57] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:48:58] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:48:58] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 1 ms to minimize.
[2024-05-21 15:48:58] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 1 ms to minimize.
[2024-05-21 15:48:58] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:48:59] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 2 ms to minimize.
[2024-05-21 15:48:59] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:48:59] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2024-05-21 15:48:59] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:59] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:48:59] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:48:59] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2024-05-21 15:48:59] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2024-05-21 15:49:00] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 1 ms to minimize.
[2024-05-21 15:49:00] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:49:00] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:49:00] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 1 ms to minimize.
[2024-05-21 15:49:00] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:49:00] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:49:01] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 1 ms to minimize.
[2024-05-21 15:49:01] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:49:01] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:49:01] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:49:01] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:49:01] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:49:02] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:49:02] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:49:02] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-05-21 15:49:03] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:49:03] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:49:03] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 1 ms to minimize.
[2024-05-21 15:49:03] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:49:03] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:49:03] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2024-05-21 15:49:04] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:49:04] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 17 ms to minimize.
[2024-05-21 15:49:04] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:49:04] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:49:04] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 1 ms to minimize.
[2024-05-21 15:49:04] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:49:04] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 5 ms to minimize.
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 1 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 1 ms to minimize.
SMT process timed out in 30106ms, After SMT, problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 30108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30676 ms. Remains : 238/238 places, 190/190 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 610 edges and 238 vertex of which 236 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 236 /238 variables (removed 2) and now considering 190/190 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 236 cols
[2024-05-21 15:49:07] [INFO ] Computed 63 invariants in 1 ms
[2024-05-21 15:49:07] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:49:07] [INFO ] [Nat]Absence check using 47 positive place invariants in 8 ms returned sat
[2024-05-21 15:49:07] [INFO ] [Nat]Absence check using 47 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 15:49:07] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 58 places in 299 ms of which 3 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 5 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 57 places in 669 ms of which 2 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2490 ms
TRAPS : Iteration 1
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
TRAPS : Iteration 2
[2024-05-21 15:49:11] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
TRAPS : Iteration 3
[2024-05-21 15:49:11] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 4 ms to minimize.
[2024-05-21 15:49:11] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:49:11] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:49:12] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:49:12] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:49:12] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:49:12] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:49:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1440 ms
TRAPS : Iteration 4
[2024-05-21 15:49:12] [INFO ] After 5321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 15:49:13] [INFO ] After 5588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 5673 ms.
[2024-05-21 15:49:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-05-21 15:49:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 238 places, 190 transitions and 716 arcs took 6 ms.
[2024-05-21 15:49:13] [INFO ] Flatten gal took : 108 ms
Total runtime 182433 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-13

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 238
TRANSITIONS: 190
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3517
MODEL NAME: /home/mcc/execution/416/model
238 places, 190 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716306557579

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="BusinessProcesses-PT-13"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-13, 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 r047-tajo-171620398500551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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