Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r504-tall-171649612300231.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is LamportFastMutEx-COL-5, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612300231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 7.6K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 13 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 41K 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 LamportFastMutEx-COL-5-ReachabilityFireability-2024-00
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-01
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-02
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-03
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-04
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-05
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-06
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-07
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-08
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-09
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-10
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-11
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-12
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-13
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-14
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717225325105

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:02:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:02:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:02:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 07:02:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 07:02:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 692 ms
[2024-06-01 07:02:07] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:02:07] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-06-01 07:02:07] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 10440 steps (1 resets) in 65 ms. (158 steps per ms) remains 0/1 properties
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 07:02:07] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:02:07] [INFO ] Flatten gal took : 9 ms
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Domain [pid(6), pid(6)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 07:02:07] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 28 ms.
[2024-06-01 07:02:07] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2000 ms. (19 steps per ms) remains 3/12 properties
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 860 ms. (46 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 507 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 408 ms. (97 steps per ms) remains 3/3 properties
[2024-06-01 07:02:08] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2024-06-01 07:02:08] [INFO ] Computed 37 invariants in 13 ms
[2024-06-01 07:02:08] [INFO ] State equation strengthened by 55 read => feed constraints.
Problem LamportFastMutEx-COL-5-ReachabilityFireability-2024-13 is UNSAT
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 25/137 variables, 25/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/337 variables, 137/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 55/229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 229 constraints, problems are : Problem set: 1 solved, 2 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 30/137 variables, 30/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 12 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 9/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:02:10] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:02:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 2/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 200/337 variables, 137/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 55/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 2/242 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/242 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/242 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 242 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1510 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 2158ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 676 ms.
Support contains 107 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 14 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 137/137 places, 260/260 transitions.
RANDOM walk for 40000 steps (8 resets) in 330 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 479 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 624 ms. (64 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 779653 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 2
Probabilistic random walk after 779653 steps, saw 213957 distinct states, run finished after 3005 ms. (steps per millisecond=259 ) properties seen :0
[2024-06-01 07:02:14] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-06-01 07:02:14] [INFO ] Invariant cache hit.
[2024-06-01 07:02:14] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 30/137 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 200/337 variables, 137/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 55/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 233 constraints, problems are : Problem set: 0 solved, 2 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/137 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 200/337 variables, 137/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 55/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/337 variables, 5/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/337 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 251 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2243 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 20/20 constraints]
After SMT, in 2794ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 916 ms.
Support contains 107 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 137/137 places, 260/260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-06-01 07:02:18] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-06-01 07:02:18] [INFO ] Invariant cache hit.
[2024-06-01 07:02:18] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 07:02:18] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-06-01 07:02:18] [INFO ] Invariant cache hit.
[2024-06-01 07:02:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 07:02:18] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-06-01 07:02:18] [INFO ] Redundant transitions in 12 ms returned []
Running 255 sub problems to find dead transitions.
[2024-06-01 07:02:18] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-06-01 07:02:18] [INFO ] Invariant cache hit.
[2024-06-01 07:02:18] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 20/57 constraints. Problems are: Problem set: 8 solved, 247 unsolved
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/77 constraints. Problems are: Problem set: 29 solved, 226 unsolved
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/97 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/117 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/137 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 16/153 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/153 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 200/337 variables, 137/290 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 55/345 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/345 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/337 variables, 2/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/337 variables, 0/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 347 constraints, problems are : Problem set: 30 solved, 225 unsolved in 21080 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 30 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 62/69 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/69 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/137 variables, 30/99 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 56/155 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 16/171 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 3/174 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 10/184 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 20/204 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/204 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 200/337 variables, 137/341 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 55/396 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 225/621 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 9/630 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 19/649 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:06] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:06] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:03:06] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:03:06] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 8/657 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 657 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 225/255 constraints, Known Traps: 203/203 constraints]
After SMT, in 51210ms problems are : Problem set: 30 solved, 225 unsolved
Search for dead transitions found 30 dead transitions in 51215ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 137/137 places, 230/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-06-01 07:03:10] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51438 ms. Remains : 137/137 places, 230/260 transitions.
RANDOM walk for 40000 steps (8 resets) in 309 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 531 ms. (75 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 855042 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :0 out of 2
Probabilistic random walk after 855042 steps, saw 231961 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
[2024-06-01 07:03:13] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 137 cols
[2024-06-01 07:03:13] [INFO ] Computed 37 invariants in 3 ms
[2024-06-01 07:03:13] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 30/137 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 180/317 variables, 137/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 50/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/137 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 180/317 variables, 137/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 50/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 4 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/317 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 250 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2240 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 24/24 constraints]
After SMT, in 2778ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 365 ms.
Support contains 107 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 137/137 places, 230/230 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-06-01 07:03:16] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2024-06-01 07:03:16] [INFO ] Invariant cache hit.
[2024-06-01 07:03:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 07:03:16] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2024-06-01 07:03:16] [INFO ] Invariant cache hit.
[2024-06-01 07:03:16] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 07:03:16] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-06-01 07:03:16] [INFO ] Redundant transitions in 3 ms returned []
Running 225 sub problems to find dead transitions.
[2024-06-01 07:03:16] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2024-06-01 07:03:16] [INFO ] Invariant cache hit.
[2024-06-01 07:03:16] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 5/137 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 17/221 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 5/230 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:41] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:03:41] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:41] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:41] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/137 variables, 15/245 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:42] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2024-06-01 07:03:42] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:42] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:42] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:03:42] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/137 variables, 7/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/137 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/137 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 22 (OVERLAPS) 180/317 variables, 137/390 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/317 variables, 50/440 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/317 variables, and 440 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 216/216 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/137 variables, 30/130 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 123/253 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 180/317 variables, 137/414 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 50/464 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 225/689 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 7/696 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 8/704 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 9/713 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 713 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 264/264 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60281 ms. Remains : 137/137 places, 230/230 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 137 transition count 180
Applied a total of 50 rules in 12 ms. Remains 137 /137 variables (removed 0) and now considering 180/230 (removed 50) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 180 rows 137 cols
[2024-06-01 07:04:16] [INFO ] Computed 37 invariants in 4 ms
[2024-06-01 07:04:17] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-06-01 07:04:17] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:04:17] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 07:04:17] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 07:04:17] [INFO ] After 651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 07:04:18] [INFO ] After 1033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1155 ms.
[2024-06-01 07:04:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-06-01 07:04:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 137 places, 230 transitions and 1000 arcs took 4 ms.
[2024-06-01 07:04:18] [INFO ] Flatten gal took : 32 ms
Total runtime 131865 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : LamportFastMutEx-COL-5-ReachabilityFireability-2024-07
Could not compute solution for formula : LamportFastMutEx-COL-5-ReachabilityFireability-2024-11

BK_STOP 1717225458408

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-5"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-COL-5, 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 r504-tall-171649612300231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 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 ;