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-171649612300238.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-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612300238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.7K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 8.2K Apr 13 07:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 07:49 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 42K 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-6-ReachabilityCardinality-2024-00
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-01
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-02
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-03
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-04
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-05
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-06
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-07
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-08
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-09
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-11
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-12
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-13
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-14
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717225664196

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:07:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:07:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:07:45] [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:07:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 07:07:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 567 ms
[2024-06-01 07:07:46] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 07:07:46] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2024-06-01 07:07:46] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 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 40008 steps (8 resets) in 993 ms. (40 steps per ms) remains 12/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 413 ms. (96 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 855 ms. (46 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
// Phase 1: matrix 17 rows 15 cols
[2024-06-01 07:07:47] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 07:07:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-11 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-01 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-02 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-04 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-06 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-07 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-08 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-09 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-12 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-13 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-14 is UNSAT
Problem LamportFastMutEx-COL-6-ReachabilityCardinality-2024-15 is UNSAT
After SMT solving in domain Real declared 15/32 variables, and 2 constraints, problems are : Problem set: 12 solved, 0 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 07:07:47] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:07:47] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 0 steps (0 resets) in 4 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 )
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-08 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Domain [pid(7), pid(7)] 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:07:47] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 27 ms.
[2024-06-01 07:07:47] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
RANDOM walk for 40000 steps (8 resets) in 609 ms. (65 steps per ms) remains 1/3 properties
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
[2024-06-01 07:07:48] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-06-01 07:07:48] [INFO ] Computed 50 invariants in 12 ms
[2024-06-01 07:07:48] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/150 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 264/414 variables, 150/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 72/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/440 variables, 26/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/150 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 264/414 variables, 150/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 72/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/440 variables, 26/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 10 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 12/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/440 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1427 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 1812ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 54 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 176 transition count 348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 65 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 170/176 places, 348/354 transitions.
RANDOM walk for 40000 steps (8 resets) in 609 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1215063 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :0 out of 1
Probabilistic random walk after 1215063 steps, saw 397067 distinct states, run finished after 3005 ms. (steps per millisecond=404 ) properties seen :0
[2024-06-01 07:07:53] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2024-06-01 07:07:53] [INFO ] Computed 50 invariants in 6 ms
[2024-06-01 07:07:53] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/144 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/402 variables, 144/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 72/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/428 variables, 26/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/428 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 170/170 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/144 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/402 variables, 144/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 72/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/428 variables, 26/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 3 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/428 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 170/170 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 54 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 348/348 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 170/170 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 348/348 transitions.
Applied a total of 0 rules in 22 ms. Remains 170 /170 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-06-01 07:07:54] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-06-01 07:07:54] [INFO ] Invariant cache hit.
[2024-06-01 07:07:54] [INFO ] Implicit Places using invariants in 167 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 177 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/170 places, 348/348 transitions.
Applied a total of 0 rules in 11 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 212 ms. Remains : 164/170 places, 348/348 transitions.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1294082 steps, run timeout after 3001 ms. (steps per millisecond=431 ) properties seen :0 out of 1
Probabilistic random walk after 1294082 steps, saw 421981 distinct states, run finished after 3001 ms. (steps per millisecond=431 ) properties seen :0
[2024-06-01 07:07:57] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2024-06-01 07:07:58] [INFO ] Computed 44 invariants in 5 ms
[2024-06-01 07:07:58] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/138 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/396 variables, 138/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 36/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/422 variables, 26/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/422 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 244 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/138 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/396 variables, 138/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 36/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/422 variables, 26/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 10/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/422 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 54 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 164/164 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-06-01 07:07:59] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-06-01 07:07:59] [INFO ] Invariant cache hit.
[2024-06-01 07:07:59] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 07:07:59] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-06-01 07:07:59] [INFO ] Invariant cache hit.
[2024-06-01 07:07:59] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 07:07:59] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-01 07:07:59] [INFO ] Redundant transitions in 20 ms returned []
Running 342 sub problems to find dead transitions.
[2024-06-01 07:07:59] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-06-01 07:07:59] [INFO ] Invariant cache hit.
[2024-06-01 07:07:59] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 7 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 3 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 20/64 constraints. Problems are: Problem set: 9 solved, 333 unsolved
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 11 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 20/84 constraints. Problems are: Problem set: 17 solved, 325 unsolved
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/104 constraints. Problems are: Problem set: 27 solved, 315 unsolved
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD193 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/124 constraints. Problems are: Problem set: 31 solved, 311 unsolved
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 15 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/144 constraints. Problems are: Problem set: 33 solved, 309 unsolved
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/164 constraints. Problems are: Problem set: 35 solved, 307 unsolved
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 20/184 constraints. Problems are: Problem set: 35 solved, 307 unsolved
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 20/204 constraints. Problems are: Problem set: 36 solved, 306 unsolved
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 20/224 constraints. Problems are: Problem set: 36 solved, 306 unsolved
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 20/244 constraints. Problems are: Problem set: 36 solved, 306 unsolved
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 4 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 3 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 20/264 constraints. Problems are: Problem set: 36 solved, 306 unsolved
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 4 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
SMT process timed out in 30187ms, After SMT, problems are : Problem set: 36 solved, 306 unsolved
Search for dead transitions found 36 dead transitions in 30191ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/164 places, 312/348 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-01 07:08:29] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30578 ms. Remains : 164/164 places, 312/348 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1293329 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :0 out of 1
Probabilistic random walk after 1293329 steps, saw 421840 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
[2024-06-01 07:08:32] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
// Phase 1: matrix 234 rows 164 cols
[2024-06-01 07:08:32] [INFO ] Computed 44 invariants in 3 ms
[2024-06-01 07:08:32] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/138 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 234/372 variables, 138/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/398 variables, 26/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/138 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 234/372 variables, 138/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/398 variables, 26/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 9/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/398 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1113ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 54 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 164/164 places, 312/312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 312/312 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-01 07:08:34] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
[2024-06-01 07:08:34] [INFO ] Invariant cache hit.
[2024-06-01 07:08:34] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 07:08:34] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
[2024-06-01 07:08:34] [INFO ] Invariant cache hit.
[2024-06-01 07:08:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-01 07:08:34] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-01 07:08:34] [INFO ] Redundant transitions in 5 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-01 07:08:34] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
[2024-06-01 07:08:34] [INFO ] Invariant cache hit.
[2024-06-01 07:08:34] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 4 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 164/398 variables, and 264 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 0/164 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 220/220 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 134/142 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 6/164 variables, 36/178 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 86/264 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 6 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 164/398 variables, and 464 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 0/164 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/306 constraints, Known Traps: 420/420 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60528 ms. Remains : 164/164 places, 312/312 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 164 transition count 234
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 158 transition count 258
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 158 transition count 252
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 152 transition count 252
Applied a total of 102 rules in 21 ms. Remains 152 /164 variables (removed 12) and now considering 252/312 (removed 60) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 252 rows 152 cols
[2024-06-01 07:09:34] [INFO ] Computed 44 invariants in 4 ms
[2024-06-01 07:09:34] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:09:34] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2024-06-01 07:09:34] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 267 ms
TRAPS : Iteration 1
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
TRAPS : Iteration 2
[2024-06-01 07:09:35] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:09:35] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 710 ms.
[2024-06-01 07:09:35] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-01 07:09:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 164 places, 312 transitions and 1476 arcs took 6 ms.
[2024-06-01 07:09:35] [INFO ] Flatten gal took : 35 ms
Total runtime 110013 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-6-ReachabilityCardinality-2024-10

BK_STOP 1717225775604

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/2704/inv_0_
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-6"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-COL-6, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612300238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;