Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m008-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2023-09
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2023-11
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-14
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717224116430

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:41:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:41:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:41:58] [INFO ] Load time of PNML (sax parser for PT used): 932 ms
[2024-06-01 06:41:58] [INFO ] Transformed 754 places.
[2024-06-01 06:41:59] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:41:59] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1292 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 92 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (255 resets) in 1732 ms. (23 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (52 resets) in 506 ms. (78 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (57 resets) in 699 ms. (57 steps per ms) remains 4/5 properties
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (50 resets) in 427 ms. (93 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (46 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
[2024-06-01 06:42:00] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-06-01 06:42:00] [INFO ] Computed 10 invariants in 36 ms
[2024-06-01 06:42:00] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 136/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3552/3706 variables, 154/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3706 variables, 140/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3706 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 301/4007 variables, 124/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4007 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4007 variables, 163/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4007 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/4009 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4009 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 593 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2397 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 136/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3552/3706 variables, 154/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3706 variables, 140/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3706 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 301/4007 variables, 124/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4007 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4007 variables, 163/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4007 variables, 3/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:42:06] [INFO ] Deduced a trap composed of 16 places in 964 ms of which 16 ms to minimize.
[2024-06-01 06:42:06] [INFO ] Deduced a trap composed of 68 places in 495 ms of which 2 ms to minimize.
[2024-06-01 06:42:07] [INFO ] Deduced a trap composed of 22 places in 506 ms of which 2 ms to minimize.
[2024-06-01 06:42:07] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2024-06-01 06:42:08] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 1 ms to minimize.
SMT process timed out in 7703ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 270 transition count 3872
Applied a total of 17 rules in 565 ms. Remains 270 /280 variables (removed 10) and now considering 3872/3904 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 270/280 places, 3872/3904 transitions.
RANDOM walk for 40000 steps (9 resets) in 749 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 84869 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 4
Probabilistic random walk after 84869 steps, saw 58749 distinct states, run finished after 3005 ms. (steps per millisecond=28 ) properties seen :0
[2024-06-01 06:42:12] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-06-01 06:42:12] [INFO ] Computed 8 invariants in 22 ms
[2024-06-01 06:42:12] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 133/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3528/3679 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 120/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 291/3970 variables, 119/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3970 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3970 variables, 163/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3970 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3970 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3970/3970 variables, and 561 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 133/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3528/3679 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 120/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 291/3970 variables, 119/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3970 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3970 variables, 163/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3970 variables, 3/564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:42:16] [INFO ] Deduced a trap composed of 17 places in 516 ms of which 3 ms to minimize.
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 28 places in 451 ms of which 2 ms to minimize.
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 67 places in 419 ms of which 16 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 26 places in 513 ms of which 2 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 28 places in 430 ms of which 1 ms to minimize.
[2024-06-01 06:42:19] [INFO ] Deduced a trap composed of 48 places in 442 ms of which 2 ms to minimize.
[2024-06-01 06:42:19] [INFO ] Deduced a trap composed of 16 places in 427 ms of which 2 ms to minimize.
[2024-06-01 06:42:19] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 16 places in 364 ms of which 1 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 1 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 20 places in 329 ms of which 1 ms to minimize.
[2024-06-01 06:42:21] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 3 ms to minimize.
[2024-06-01 06:42:21] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 1 ms to minimize.
Problem BugTracking-PT-q8m008-ReachabilityCardinality-2024-10 is UNSAT
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/3970 variables, 13/577 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3970 variables, 0/577 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3970 variables, 0/577 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3970/3970 variables, and 577 constraints, problems are : Problem set: 1 solved, 3 unsolved in 8259 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 9917ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 964 ms.
Support contains 17 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 80 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 270/270 places, 3872/3872 transitions.
RANDOM walk for 40006 steps (8 resets) in 310 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (9 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 92818 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 3
Probabilistic random walk after 92818 steps, saw 64251 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
[2024-06-01 06:42:27] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-06-01 06:42:27] [INFO ] Invariant cache hit.
[2024-06-01 06:42:27] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 133/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3527/3677 variables, 150/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3677 variables, 119/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3677 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 293/3970 variables, 120/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3970 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3970 variables, 164/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3970 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3970 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3970/3970 variables, and 561 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1533 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 133/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3527/3677 variables, 150/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3677 variables, 119/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:42:29] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3677 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3677 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 293/3970 variables, 120/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3970 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3970 variables, 164/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3970 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:42:31] [INFO ] Deduced a trap composed of 7 places in 410 ms of which 1 ms to minimize.
[2024-06-01 06:42:31] [INFO ] Deduced a trap composed of 26 places in 298 ms of which 1 ms to minimize.
[2024-06-01 06:42:31] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2024-06-01 06:42:32] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2024-06-01 06:42:32] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3970 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3970 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3970 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3970/3970 variables, and 569 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4515 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 6158ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4114 ms.
Support contains 17 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 55 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 51 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-06-01 06:42:37] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-06-01 06:42:37] [INFO ] Invariant cache hit.
[2024-06-01 06:42:38] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-06-01 06:42:38] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-06-01 06:42:38] [INFO ] Invariant cache hit.
[2024-06-01 06:42:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:42:39] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
[2024-06-01 06:42:40] [INFO ] Redundant transitions in 262 ms returned []
Running 3871 sub problems to find dead transitions.
[2024-06-01 06:42:40] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-06-01 06:42:40] [INFO ] Invariant cache hit.
[2024-06-01 06:42:40] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3871 unsolved
[2024-06-01 06:43:48] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3970 variables, and 9 constraints, problems are : Problem set: 8 solved, 3863 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3871/2668 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 8 solved, 3863 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 3863 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 3863 unsolved
[2024-06-01 06:44:16] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2064 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2068 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
[2024-06-01 06:44:16] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2089 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2095 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
[2024-06-01 06:44:16] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
[2024-06-01 06:44:16] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
[2024-06-01 06:44:17] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2201 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2218 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2237 is UNSAT
Problem TDEAD2238 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2240 is UNSAT
Problem TDEAD2241 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2243 is UNSAT
Problem TDEAD2244 is UNSAT
Problem TDEAD2245 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2467 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2472 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2689 is UNSAT
Problem TDEAD2690 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
Problem TDEAD2693 is UNSAT
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
Problem TDEAD2946 is UNSAT
Problem TDEAD2947 is UNSAT
Problem TDEAD2948 is UNSAT
Problem TDEAD2949 is UNSAT
Problem TDEAD2950 is UNSAT
Problem TDEAD2951 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2953 is UNSAT
Problem TDEAD2954 is UNSAT
Problem TDEAD2955 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD2957 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD2960 is UNSAT
Problem TDEAD2961 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD2963 is UNSAT
Problem TDEAD2964 is UNSAT
Problem TDEAD2965 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2967 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD2969 is UNSAT
Problem TDEAD2970 is UNSAT
Problem TDEAD2971 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD2973 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2979 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2981 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2987 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD2991 is UNSAT
Problem TDEAD2992 is UNSAT
Problem TDEAD2993 is UNSAT
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3017 is UNSAT
Problem TDEAD3018 is UNSAT
Problem TDEAD3019 is UNSAT
Problem TDEAD3020 is UNSAT
Problem TDEAD3021 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
Problem TDEAD3025 is UNSAT
Problem TDEAD3026 is UNSAT
Problem TDEAD3027 is UNSAT
Problem TDEAD3028 is UNSAT
Problem TDEAD3029 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3041 is UNSAT
Problem TDEAD3042 is UNSAT
Problem TDEAD3043 is UNSAT
Problem TDEAD3044 is UNSAT
Problem TDEAD3045 is UNSAT
Problem TDEAD3046 is UNSAT
Problem TDEAD3047 is UNSAT
Problem TDEAD3048 is UNSAT
Problem TDEAD3049 is UNSAT
Problem TDEAD3050 is UNSAT
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3053 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
Problem TDEAD3057 is UNSAT
Problem TDEAD3058 is UNSAT
Problem TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3074 is UNSAT
Problem TDEAD3075 is UNSAT
Problem TDEAD3076 is UNSAT
Problem TDEAD3077 is UNSAT
Problem TDEAD3078 is UNSAT
Problem TDEAD3079 is UNSAT
Problem TDEAD3080 is UNSAT
Problem TDEAD3081 is UNSAT
Problem TDEAD3082 is UNSAT
Problem TDEAD3083 is UNSAT
Problem TDEAD3084 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3086 is UNSAT
Problem TDEAD3092 is UNSAT
Problem TDEAD3093 is UNSAT
Problem TDEAD3094 is UNSAT
Problem TDEAD3095 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3109 is UNSAT
Problem TDEAD3110 is UNSAT
Problem TDEAD3111 is UNSAT
Problem TDEAD3112 is UNSAT
Problem TDEAD3113 is UNSAT
Problem TDEAD3114 is UNSAT
Problem TDEAD3115 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3119 is UNSAT
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
Problem TDEAD3120 is UNSAT
Problem TDEAD3121 is UNSAT
Problem TDEAD3122 is UNSAT
Problem TDEAD3123 is UNSAT
Problem TDEAD3124 is UNSAT
Problem TDEAD3129 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3131 is UNSAT
Problem TDEAD3133 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3135 is UNSAT
Problem TDEAD3136 is UNSAT
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 3 ms to minimize.
Problem TDEAD3137 is UNSAT
Problem TDEAD3138 is UNSAT
Problem TDEAD3139 is UNSAT
Problem TDEAD3140 is UNSAT
Problem TDEAD3141 is UNSAT
Problem TDEAD3142 is UNSAT
Problem TDEAD3143 is UNSAT
Problem TDEAD3144 is UNSAT
Problem TDEAD3145 is UNSAT
Problem TDEAD3146 is UNSAT
Problem TDEAD3147 is UNSAT
Problem TDEAD3148 is UNSAT
Problem TDEAD3149 is UNSAT
Problem TDEAD3150 is UNSAT
Problem TDEAD3151 is UNSAT
Problem TDEAD3152 is UNSAT
Problem TDEAD3153 is UNSAT
Problem TDEAD3154 is UNSAT
Problem TDEAD3155 is UNSAT
Problem TDEAD3156 is UNSAT
Problem TDEAD3157 is UNSAT
Problem TDEAD3158 is UNSAT
Problem TDEAD3159 is UNSAT
Problem TDEAD3160 is UNSAT
Problem TDEAD3161 is UNSAT
[2024-06-01 06:44:27] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
Problem TDEAD3816 is UNSAT
[2024-06-01 06:44:28] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
Problem TDEAD3831 is UNSAT
Problem TDEAD3832 is UNSAT
Problem TDEAD3843 is UNSAT
Problem TDEAD3844 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3857 is UNSAT
Problem TDEAD3868 is UNSAT
Problem TDEAD3869 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1975 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 12/21 constraints. Problems are: Problem set: 989 solved, 2882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/3970 variables, and 21 constraints, problems are : Problem set: 989 solved, 2882 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2668 constraints, Known Traps: 13/13 constraints]
After SMT, in 109578ms problems are : Problem set: 989 solved, 2882 unsolved
Search for dead transitions found 989 dead transitions in 109690ms
Found 989 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 989 transitions
Dead transitions reduction (with SMT) removed 989 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 270/270 places, 2883/3872 transitions.
Graph (complete) has 3506 edges and 270 vertex of which 255 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Reduce places removed 40 places and 1205 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 215 transition count 1678
Reduce places removed 24 places and 414 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 65 place count 191 transition count 1264
Reduce places removed 13 places and 177 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 78 place count 178 transition count 1087
Reduce places removed 9 places and 74 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 87 place count 169 transition count 1013
Reduce places removed 4 places and 82 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 91 place count 165 transition count 931
Reduce places removed 1 places and 15 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 164 transition count 916
Reduce places removed 0 places and 9 transitions.
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 112 place count 144 transition count 781
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 2 places and 30 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 134 place count 142 transition count 751
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 143 place count 133 transition count 670
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 6 with 9 rules applied. Total rules applied 152 place count 133 transition count 670
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 152 rules in 50 ms. Remains 133 /270 variables (removed 137) and now considering 670/2883 (removed 2213) transitions.
[2024-06-01 06:44:29] [INFO ] Flow matrix only has 587 transitions (discarded 83 similar events)
// Phase 1: matrix 587 rows 133 cols
[2024-06-01 06:44:29] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 06:44:30] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 06:44:30] [INFO ] Flow matrix only has 587 transitions (discarded 83 similar events)
[2024-06-01 06:44:30] [INFO ] Invariant cache hit.
[2024-06-01 06:44:30] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-01 06:44:30] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 133/270 places, 670/3872 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 113040 ms. Remains : 133/270 places, 670/3872 transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40012 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 224163 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 2
Probabilistic random walk after 224163 steps, saw 155171 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 06:44:33] [INFO ] Flow matrix only has 587 transitions (discarded 83 similar events)
// Phase 1: matrix 587 rows 124 cols
[2024-06-01 06:44:33] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 06:44:33] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 285/309 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 372/681 variables, 81/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 44/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 30/711 variables, 19/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/711 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/711 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/711 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/711 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 711/711 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 285/309 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 372/681 variables, 81/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 44/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/711 variables, 19/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/711 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/711 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:44:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/711 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/711 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/711 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 711/711 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 829ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 155 ms.
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 670/670 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 123 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 661
Applied a total of 2 rules in 11 ms. Remains 123 /124 variables (removed 1) and now considering 661/670 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 123/124 places, 661/670 transitions.
RANDOM walk for 40003 steps (9 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 265529 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 265529 steps, saw 183804 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 06:44:37] [INFO ] Flow matrix only has 576 transitions (discarded 85 similar events)
// Phase 1: matrix 576 rows 123 cols
[2024-06-01 06:44:37] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 06:44:37] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 276/300 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 369/669 variables, 80/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 30/699 variables, 19/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/699 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/699 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/699 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/699 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 699/699 variables, and 208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 276/300 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 369/669 variables, 80/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 30/699 variables, 19/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/699 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/699 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 699/699 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 792ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 763 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 661/661 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 661/661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 123/123 places, 661/661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 661/661 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 661/661 (removed 0) transitions.
[2024-06-01 06:44:39] [INFO ] Flow matrix only has 576 transitions (discarded 85 similar events)
[2024-06-01 06:44:39] [INFO ] Invariant cache hit.
[2024-06-01 06:44:39] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 06:44:39] [INFO ] Flow matrix only has 576 transitions (discarded 85 similar events)
[2024-06-01 06:44:39] [INFO ] Invariant cache hit.
[2024-06-01 06:44:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-06-01 06:44:39] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-06-01 06:44:39] [INFO ] Redundant transitions in 5 ms returned []
Running 660 sub problems to find dead transitions.
[2024-06-01 06:44:39] [INFO ] Flow matrix only has 576 transitions (discarded 85 similar events)
[2024-06-01 06:44:39] [INFO ] Invariant cache hit.
[2024-06-01 06:44:39] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-06-01 06:44:42] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 656 unsolved
At refinement iteration 3 (OVERLAPS) 576/699 variables, 123/131 constraints. Problems are: Problem set: 4 solved, 656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 78/209 constraints. Problems are: Problem set: 4 solved, 656 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 0/209 constraints. Problems are: Problem set: 4 solved, 656 unsolved
[2024-06-01 06:44:55] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 6 (OVERLAPS) 0/699 variables, 1/210 constraints. Problems are: Problem set: 69 solved, 591 unsolved
[2024-06-01 06:45:05] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/699 variables, 1/211 constraints. Problems are: Problem set: 105 solved, 555 unsolved
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
Problem TDEAD338 is UNSAT
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 699/699 variables, and 214 constraints, problems are : Problem set: 115 solved, 545 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 115 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 6/6 constraints. Problems are: Problem set: 115 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 4/10 constraints. Problems are: Problem set: 115 solved, 545 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 115 solved, 545 unsolved
At refinement iteration 3 (OVERLAPS) 3/123 variables, 1/11 constraints. Problems are: Problem set: 115 solved, 545 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 2/13 constraints. Problems are: Problem set: 115 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 115 solved, 545 unsolved
At refinement iteration 6 (OVERLAPS) 576/699 variables, 123/136 constraints. Problems are: Problem set: 115 solved, 545 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/699 variables, 78/214 constraints. Problems are: Problem set: 115 solved, 545 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD653 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/699 variables, 545/759 constraints. Problems are: Problem set: 146 solved, 514 unsolved
[2024-06-01 06:45:21] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/699 variables, 2/761 constraints. Problems are: Problem set: 146 solved, 514 unsolved
[2024-06-01 06:45:33] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-06-01 06:45:33] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
Problem TDEAD545 is UNSAT
[2024-06-01 06:45:39] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/699 variables, 3/764 constraints. Problems are: Problem set: 147 solved, 513 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/699 variables, and 764 constraints, problems are : Problem set: 147 solved, 513 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 545/660 constraints, Known Traps: 11/11 constraints]
After SMT, in 61488ms problems are : Problem set: 147 solved, 513 unsolved
Search for dead transitions found 147 dead transitions in 61498ms
Found 147 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 147 transitions
Dead transitions reduction (with SMT) removed 147 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/123 places, 514/661 transitions.
Graph (complete) has 781 edges and 123 vertex of which 120 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 13 places and 120 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 107 transition count 394
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 106 transition count 385
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 105 transition count 377
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 104 transition count 372
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 22 place count 99 transition count 327
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 99 transition count 327
Applied a total of 27 rules in 17 ms. Remains 99 /123 variables (removed 24) and now considering 327/514 (removed 187) transitions.
[2024-06-01 06:45:41] [INFO ] Flow matrix only has 305 transitions (discarded 22 similar events)
// Phase 1: matrix 305 rows 99 cols
[2024-06-01 06:45:41] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 06:45:41] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 06:45:41] [INFO ] Flow matrix only has 305 transitions (discarded 22 similar events)
[2024-06-01 06:45:41] [INFO ] Invariant cache hit.
[2024-06-01 06:45:41] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 06:45:41] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/123 places, 327/661 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62400 ms. Remains : 99/123 places, 327/661 transitions.
RANDOM walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 336207 steps, run timeout after 3005 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 336207 steps, saw 232725 distinct states, run finished after 3018 ms. (steps per millisecond=111 ) properties seen :0
[2024-06-01 06:45:44] [INFO ] Flow matrix only has 305 transitions (discarded 22 similar events)
[2024-06-01 06:45:44] [INFO ] Invariant cache hit.
[2024-06-01 06:45:44] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 158/179 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 196/375 variables, 58/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 29/404 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/404 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/179 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 196/375 variables, 58/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 29/404 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 8 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/404 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 174 constraints, problems are : Problem set: 0 solved, 2 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 137 ms.
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 327/327 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 99/99 places, 327/327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 327/327 transitions.
Applied a total of 0 rules in 8 ms. Remains 99 /99 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2024-06-01 06:45:45] [INFO ] Flow matrix only has 305 transitions (discarded 22 similar events)
[2024-06-01 06:45:45] [INFO ] Invariant cache hit.
[2024-06-01 06:45:45] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 06:45:45] [INFO ] Flow matrix only has 305 transitions (discarded 22 similar events)
[2024-06-01 06:45:45] [INFO ] Invariant cache hit.
[2024-06-01 06:45:45] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 06:45:45] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-06-01 06:45:45] [INFO ] Redundant transitions in 0 ms returned []
Running 326 sub problems to find dead transitions.
[2024-06-01 06:45:45] [INFO ] Flow matrix only has 305 transitions (discarded 22 similar events)
[2024-06-01 06:45:45] [INFO ] Invariant cache hit.
[2024-06-01 06:45:45] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 2 (OVERLAPS) 305/404 variables, 99/106 constraints. Problems are: Problem set: 3 solved, 323 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 60/166 constraints. Problems are: Problem set: 3 solved, 323 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 323 unsolved
At refinement iteration 5 (OVERLAPS) 0/404 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 166 constraints, problems are : Problem set: 3 solved, 323 unsolved in 5155 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 305/404 variables, 99/106 constraints. Problems are: Problem set: 3 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 60/166 constraints. Problems are: Problem set: 3 solved, 323 unsolved
Problem TDEAD161 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 323/489 constraints. Problems are: Problem set: 5 solved, 321 unsolved
[2024-06-01 06:45:54] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:45:54] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:45:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:45:57] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:45:57] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 5/494 constraints. Problems are: Problem set: 5 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/494 constraints. Problems are: Problem set: 5 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/494 constraints. Problems are: Problem set: 5 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 494 constraints, problems are : Problem set: 5 solved, 321 unsolved in 20711 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 323/326 constraints, Known Traps: 5/5 constraints]
After SMT, in 26122ms problems are : Problem set: 5 solved, 321 unsolved
Search for dead transitions found 5 dead transitions in 26125ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/99 places, 322/327 transitions.
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 313
Applied a total of 1 rules in 18 ms. Remains 98 /99 variables (removed 1) and now considering 313/322 (removed 9) transitions.
[2024-06-01 06:46:12] [INFO ] Flow matrix only has 292 transitions (discarded 21 similar events)
// Phase 1: matrix 292 rows 98 cols
[2024-06-01 06:46:12] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 06:46:12] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 06:46:12] [INFO ] Flow matrix only has 292 transitions (discarded 21 similar events)
[2024-06-01 06:46:12] [INFO ] Invariant cache hit.
[2024-06-01 06:46:12] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-01 06:46:12] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/99 places, 313/327 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26848 ms. Remains : 98/99 places, 313/327 transitions.
RANDOM walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 209755 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 209755 steps, saw 145195 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-06-01 06:46:15] [INFO ] Flow matrix only has 292 transitions (discarded 21 similar events)
[2024-06-01 06:46:15] [INFO ] Invariant cache hit.
[2024-06-01 06:46:15] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 154/175 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 186/361 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 31/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 29/390 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/390 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 164 constraints, problems are : Problem set: 0 solved, 2 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 154/175 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 186/361 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 31/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:46:15] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 29/390 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 518ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 313/313 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 313/313 transitions.
Applied a total of 0 rules in 17 ms. Remains 98 /98 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-01 06:46:16] [INFO ] Flow matrix only has 292 transitions (discarded 21 similar events)
[2024-06-01 06:46:16] [INFO ] Invariant cache hit.
[2024-06-01 06:46:16] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 06:46:16] [INFO ] Flow matrix only has 292 transitions (discarded 21 similar events)
[2024-06-01 06:46:16] [INFO ] Invariant cache hit.
[2024-06-01 06:46:16] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-01 06:46:16] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-06-01 06:46:16] [INFO ] Redundant transitions in 1 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-01 06:46:16] [INFO ] Flow matrix only has 292 transitions (discarded 21 similar events)
[2024-06-01 06:46:16] [INFO ] Invariant cache hit.
[2024-06-01 06:46:16] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 2 (OVERLAPS) 292/390 variables, 98/105 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 59/164 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/164 constraints. Problems are: Problem set: 32 solved, 280 unsolved
[2024-06-01 06:46:21] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/390 variables, 1/165 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/165 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 0/390 variables, 0/165 constraints. Problems are: Problem set: 32 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 165 constraints, problems are : Problem set: 32 solved, 280 unsolved in 8433 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 32 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 292/390 variables, 98/106 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 59/165 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 280/445 constraints. Problems are: Problem set: 32 solved, 280 unsolved
[2024-06-01 06:46:27] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:46:27] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:46:28] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:46:29] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 4/449 constraints. Problems are: Problem set: 32 solved, 280 unsolved
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:46:32] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 3/452 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/452 constraints. Problems are: Problem set: 32 solved, 280 unsolved
[2024-06-01 06:46:39] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:46:42] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:46:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/390 variables, 7/459 constraints. Problems are: Problem set: 32 solved, 280 unsolved
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 1/460 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/460 constraints. Problems are: Problem set: 32 solved, 280 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/460 constraints. Problems are: Problem set: 32 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 460 constraints, problems are : Problem set: 32 solved, 280 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 280/312 constraints, Known Traps: 16/16 constraints]
After SMT, in 38691ms problems are : Problem set: 32 solved, 280 unsolved
Search for dead transitions found 32 dead transitions in 38695ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 98/98 places, 281/313 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2024-06-01 06:46:55] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 39138 ms. Remains : 98/98 places, 281/313 transitions.
RANDOM walk for 40006 steps (8 resets) in 126 ms. (315 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 223925 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 2
Probabilistic random walk after 223925 steps, saw 155004 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 06:46:58] [INFO ] Flow matrix only has 260 transitions (discarded 21 similar events)
// Phase 1: matrix 260 rows 98 cols
[2024-06-01 06:46:58] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 06:46:58] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 146/167 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 159/326 variables, 54/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 28/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/358 variables, 23/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 146/167 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 159/326 variables, 54/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 28/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 32/358 variables, 23/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/358 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 281/281 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 281/281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 281/281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 281/281 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2024-06-01 06:46:59] [INFO ] Flow matrix only has 260 transitions (discarded 21 similar events)
[2024-06-01 06:46:59] [INFO ] Invariant cache hit.
[2024-06-01 06:46:59] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 06:46:59] [INFO ] Flow matrix only has 260 transitions (discarded 21 similar events)
[2024-06-01 06:46:59] [INFO ] Invariant cache hit.
[2024-06-01 06:46:59] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 06:46:59] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-06-01 06:46:59] [INFO ] Redundant transitions in 0 ms returned []
Running 280 sub problems to find dead transitions.
[2024-06-01 06:46:59] [INFO ] Flow matrix only has 260 transitions (discarded 21 similar events)
[2024-06-01 06:46:59] [INFO ] Invariant cache hit.
[2024-06-01 06:46:59] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 260/358 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 0/358 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 160 constraints, problems are : Problem set: 0 solved, 280 unsolved in 5169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 260/358 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 280/440 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-06-01 06:47:07] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:47:07] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 0/358 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 442 constraints, problems are : Problem set: 0 solved, 280 unsolved in 12577 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 2/2 constraints]
After SMT, in 18047ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 18051ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18344 ms. Remains : 98/98 places, 281/281 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 417 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 94 transition count 259
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 36 place count 81 transition count 197
Iterating global reduction 1 with 13 rules applied. Total rules applied 49 place count 81 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 81 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 80 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 80 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 79 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 79 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 79 transition count 191
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 63 place count 75 transition count 187
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 71 transition count 206
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 71 transition count 201
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 81 place count 66 transition count 201
Applied a total of 81 rules in 33 ms. Remains 66 /98 variables (removed 32) and now considering 201/281 (removed 80) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 201 rows 66 cols
[2024-06-01 06:47:17] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 06:47:17] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-01 06:47:17] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 06:47:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-01 06:47:17] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 06:47:17] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 06:47:17] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 322 ms.
[2024-06-01 06:47:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-01 06:47:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 281 transitions and 1336 arcs took 10 ms.
[2024-06-01 06:47:18] [INFO ] Flatten gal took : 91 ms
Total runtime 320257 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 : BugTracking-PT-q8m008-ReachabilityCardinality-2023-09
Could not compute solution for formula : BugTracking-PT-q8m008-ReachabilityCardinality-2023-11

BK_STOP 1717224438426

--------------------
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 BugTracking-PT-q8m008-ReachabilityCardinality-2023-09
rfs formula type EF
rfs formula formula --invariant=/tmp/984/inv_0_
rfs formula name BugTracking-PT-q8m008-ReachabilityCardinality-2023-11
rfs formula type EF
rfs formula formula --invariant=/tmp/984/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m008"
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 BugTracking-PT-q8m008, 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 r472-tajo-171620399400406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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